source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Functional%20database%20model | The functional database model is used to support analytics applications such as financial planning and performance management. The functional database model, or the functional model for short, is different from but complementary to the relational model. The functional model is also distinct from other similarly named concepts, including the DAPLEX functional database model and functional language databases.
The functional model is part of the online analytical processing (OLAP) category since it comprises multidimensional hierarchical consolidation. But it goes beyond OLAP by requiring a spreadsheet-like cell orientation, where cells can be input or calculated as functions of other cells. Also as in spreadsheets, it supports interactive calculations where the values of all dependent cells are automatically up to date whenever the value of a cell is changed.
Overview
Analytics, especially forward looking or prospective analytics requires interactive modeling, "what if", and experimentation of the kind that most business analysts do with spreadsheets. This interaction with the data is enabled by the spreadsheet’s cell orientation and its ability to let users define cells calculated as a function of other cells.
The relational database model has no such concepts and is thus very limited in the business performance modeling and interactivity it can support. Accordingly, relational-based analytics is almost exclusively restricted to historical data, which is static. This misses most of the strategic benefits of analytics, which come from interactively constructing views of the future.
The functional model is based on multidimensional arrays, or "cubes", of cells that, as in a spreadsheet, can be either externally input, or calculated in terms of other cells. Such cubes are constructed using dimensions which correspond to hierarchically organized sets of real entities such as products, geographies, time, etc. A cube can be seen as a function over the cartesian product of the dimensions. I.e., it assigns a value to each cell, which is identified by an n-tuple of dimension elements; thus the name "functional". The model retains the flexibility and potential for interactivity of spreadsheets, as well as the multidimensional hierarchical consolidations of relational-based OLAP tools. At the same time, the functional model overcomes the limitations of both the relational database model and classical spreadsheets.
Products that implement the principles of the functional model to varying degrees have been in existence for some time, including products such as Essbase, TM1, Alea, Microsoft Analysis Services, etc.
Analytics context
The management system of an enterprise generally consists of a series of interconnected control loops. Each loop starts by developing a plan, the plan is then executed, and the results are reviewed and compared against the plan. Based on those results, and a new assessment of what the future holds, a new plan is developed and |
https://en.wikipedia.org/wiki/Networks%20in%20labor%20economics | Networks in labor economics refers to the effect social networks have on jobseekers obtaining employment. Research suggests that around half of the employed workforce found their jobs through social contacts. It is believed that social networks not only contribute to the efficiency of job searching but can also explain, at least partly, wage differences and other inequalities in the workforce. Various models are used to quantify this effect, all having their own strengths and weaknesses. Models generally have to simplify the complex nature of social networks.
The model of Calvo-Armegnol and Jackson
In some economic models, the role of social networks in job searching often use exogenous job networks. Using this framework, Calvo-Armegnol and Jackson were able to point out some network related labor market issues.
The model
In their basic model, in which they attempt to formalize the transmission of job information among individuals, the agents can be either employed with some non-zero, or unemployed with zero wages. The agents can get information about a job, and when they do so, they can decide whether to keep that information for themselves or pass it to their contacts. In the other phase, employed agents can lose their job with a given probability.
Implications
Important indication of their model is that if someone who is employed has the information about a job, she will pass it to her unemployed acquaintances who will then become employed. Therefore, there is a positive correlation between labor outcomes of an individual and her contacts. On the other hand, it can also give an explanation for long term unemployment. If someone's acquaintances are unemployed as well, she has less chance to hear of some job opportunity. They also conclude that different initial wage and employment can cause different drop-outs rates from the labor market, thus, it can explain the existence of wage inequalities across social groups. Calvo-Armengol and Jackson prove that position in the network, and structure of the network affect the probability of being unemployed as well.
Referral based job search
The effectiveness of job searching with personal contacts is the consequence not only the individuals’ but the employers’ behavior as well. They often choose to hire acquaintances of their current employees instead of using a bigger pool of applicants. It is due to the information asymmetry as they hardly know anything about the productivity of the applicant, and revealing it would be rather time-consuming and expensive. However, employees might be aware both their contacts unobserved characteristics and the specific expectations of employers so they can enhance this imbalance. Another benefit for the firm is that due to the personal bond, present employees are motivated to choose a candidate who will perform well, since after the recommendation, their reputation is also at stake.
Dustman, Glitz and Schönberg showed that using personal connections in job search |
https://en.wikipedia.org/wiki/List%20of%20number-one%20singles%20of%202013%20%28Slovenia%29 | List of the Slovenian number-one singles of 2013 compiled by SloTop50, is the official chart provider of Slovenia. SloTop50 publishes weekly charts once a week, every Sunday. Chart contain data generated by the SloTop50 system according to any song played during the period starting the previous Monday morning at time 00:00:00 and ending Sunday night at 23:59:59.
Charts
Number-one singles by week
Weekly charted #1 songs and highest charted counting among domestic songs only
Number-one singles by month
Monthly charted #1 songs and highest charted counting among domestic songs only
Number-one singles by year-end
The most played singles on 61 different Slovenian radio stations for year 2013.
References
Number-one hits
Slovenia
Lists of number-one songs in Slovenia |
https://en.wikipedia.org/wiki/Appland | Appland is a cloud computing company headquartered in Gothenburg, Sweden, that develops white label app store solutions for mobile operators, mobile devices, online communities, smart TVs, connected vehicles and internet of things.
In 2015, the company won "2015 Red Herring Top Europe Award" and a spot in "33-listan", an annual list of the 33 most promising Swedish startups awarded by Ny Teknik and Affärsvärlden.
References
Software companies of Sweden
Companies based in Gothenburg |
https://en.wikipedia.org/wiki/Reelside | Reelside is a 2015 Canadian documentary television series about the creative process of Canadian filmmakers that premiered on The Movie Network on June 4, 2015.
Reelside's first season features Sarah Gadon, Caitlin Cronenberg, George A. Romero, Seth Rogen, Evan Goldberg, Matthew Bass, Vincenzo Natali, Michael Hogan, Graeme Manson, Don McKellar, Bruce McDonald, Matthew Hannam, Stephen Amell, David Hayter, and Lloyd Kaufman. Reelside is produced by Fifth Ground Entertainment.
Reelside marks the directorial debut of actress/model Sarah Gadon with her episode featuring her own creative relationship with photographer and frequent collaborator, Caitlin Cronenberg.
Accolades
Reelside has been nominated for two 2016 Canadian Screen Awards including Best Biography or Arts Documentary Program or Series and Best Direction in a Documentary or Factual Series for "Superheroes".
References
External links
Crave original programming
Canadian motion picture television series
Documentary television series about films
2015 Canadian television series debuts
2010s Canadian documentary television series |
https://en.wikipedia.org/wiki/European%20Institute%20for%20Advanced%20Studies%20in%20Management | The European Institute for Advanced Studies in Management (EIASM) is an international institute, network and society for organization and management studies located in Brussels, Belgium.
History
The European Institute for Advanced Studies in Management (EIASM) was established in 1971 with support from the Ford Foundation.
Among the first members of the institute and faculty were scientists like Harry Igor Ansoff, Alain Bensoussan, Göran Bergendahl, Charles Berthet, Edward Bowman, Klaus Brockhoff, John Child, Alain Cotta, Richard Cyert, Alan Dale, Gordon B. Davis, Harry Davis, Susan Douglas, Salah E. Elmaghraby, Gary Eppen, Eugene F. Fama, Claude Faucheux, Jay Galbraith, Robert Graves, Geert Hofstede, Anthony G. Hopwood, Gerald Hurst, Alex Jacquemin, James Leontiades, Edmond Marques, Lars-Gunnar Mattsson, Dušan Mramor, Philippe A. Naert, Bertil Näslund, Pierre Nepomiatschy, Andrew Pettigrew, Bernard Piganiol, Richard Roll, Maurice Saias, Hein Schreuder, Bruno Solnik, Bengt Stymne, Howard Thomas, Stuart R. Timperley, Raymond Trémolières, Richard Van Horn, Leopold Vansina, Lambert Vanthienen, Birgitta Wadell and Stanley Zionts.
Institutions
The Institute has developed into one of the most prestigious economics science networks with approximately 44 364 researchers worldwide (as of December 2008). In 1995 the EIASM Academic Council was established as a support on which more than 90 universities, colleges and institutes from 25 European countries are involved.
President of EIASM is Paul Coughlan (Trinity College); Vice-Presidents are Pierre Batteau (University of Aix-Marseille), Christer Karlsson (Copenhagen Business School and Borge Obel (Aarhus School of Business). Scientific Director's Joan Enric Ricart- ( University of Navarra (IESE)).
From 1973 to 1988 completed more than 800 doctoral studies at EIASM. In 1988, the Graduate School EDEN (EIASM's Doctoral Education Network) was established. In EDEN 1988-2008 3,278 graduate students enrolled and involved more than 250 scientists from around the world.
References
External links
EIASM Website
Pan-European scientific societies |
https://en.wikipedia.org/wiki/Structural%20holes | Structural holes is a concept from social network research, originally developed by Ronald Stuart Burt. A structural hole is understood as a gap between two individuals who have complementary sources to information. The study of structural holes spans the fields of sociology, economics, and computer science. Burt introduced this concept in an attempt to explain the origin of differences in social capital. Burt’s theory suggests that individuals hold certain positional advantages/disadvantages from how they are embedded in neighborhoods or other social structures.
The concept
Most social structures tend to be characterized by dense clusters of strong connections, also known as network closure. The theory relies on a fundamental idea that the homogeneity of information, new ideas, and behavior is generally higher within any group of people as compared to that in between two groups of people. An individual who acts as a mediator between two or more closely connected groups of people could gain important comparative advantages. In particular, the position of a bridge between distinct groups allows him or her to transfer or gatekeep valuable information from one group to another. In addition, the individual can combine all the ideas he or she receives from different sources and come up with the most innovative idea among all. At the same time, a broker also occupies a precarious position, as ties with disparate groups can be fragile and time consuming to maintain.
If we compare two nodes, node A is more likely to get novel information than node B, even though they have the same number of links. This is so because nodes connected to B are also highly connected between each other. Therefore, any information that any of them could get from B, it could easily get from other nodes as well. Furthermore, the information, which B gets from different connections, is likely to be overlapping, so connections involving node B are said to be redundant. On contrary, the position of node A makes it serve as a bridge or a ‘broker’ between three different clusters. Thus, node A is likely to receive some non-redundant information from its contacts. The term ‘structural holes’ is used for the separation between non-redundant contacts. As a result of the hole between two contacts, they provide network benefits to the third party (to node A).
Measures
Bridge counts
Bridge count is a simple and intuitive measure of structural holes in a network. Bridge is defined as a relation between two individuals if there is no indirect connection between them through mutual contacts.
Effective size
Burt's formula
Burt introduced the measure of a network’s redundancy. He aims to estimate to what extent contact j is redundant with other contacts of node i. Redundancy is understood as an investment of time and energy in a relationship with another node q, with whom node j is strongly connected.
Where piq is proportion of i’s energy invested in relationship with q,
And mjq is c |
https://en.wikipedia.org/wiki/Deadly%20Invasion%3A%20The%20Killer%20Bee%20Nightmare | Deadly Invasion: The Killer Bee Nightmare is a 1995 American made-for-television natural horror film starring Robert Hays and Nancy Stafford. It originally aired on the Fox Network on March 7, 1995.
Plot
The film opens in rural Texas. A police officer sees a car parked outside an abandoned farmhouse and stops to investigate. A hole has been ripped into one side of the house. He climbs inside and sees some bodies lying on the floor. He tries to wake them up before realizing they are dead. He is then attacked and killed by a swarm of bees.
The film then cuts to Blossom Meadow, California. The Ingram family has just moved there from Boston. Through a series of events, a huge swarm of killer bees invades the town and the family must work together to survive. Eventually, the father manages to pacify the bees using smoke while the rest of the family escape to the barn using an old tunnel. The next day, the family cleans the dead bees out of the house after an exterminator comes to finish them off.
Cast
Robert Hays as Chad Ingram
Nancy Stafford as Karen Ingram
Ryan Phillippe as Tom Redman
Gina Philips as Tracy Ingram
Gregory Gordon as Kevin Ingram
Whitney Danielle Porter as Lucy Ingram
Dennis Christopher as Pruitt Taylor Beauchamp
Danielle von Zerneck as Linda
References
1995 television films
1995 films
1995 horror films
American natural horror films
American horror television films
Films about bees
Films set in California
Fox network original films
1990s American films |
https://en.wikipedia.org/wiki/Global%20production%20network | Global Production Networks (GPN) is a concept in developmental literature which refers to "the nexus of interconnected functions, operations and transactions through which a specific product or service is produced, distributed and consumed."
Global Production Networks
A global production network is one whose interconnected nodes and links extend spatially across national boundaries and, in so doing, integrates parts of disparate national and subnational territories". GPN frameworks combines the insights from the global value chain analysis, actor–network theory and literature on Varieties of Capitalism. GPN provides a relational framework that aims to encompass all the relevant actors in the production systems. GPN framework provides analytical platform that relates sub-national regional development with clustering dynamics.
Historical development of concept
In 1990s the concept of value chain gained its credit among economists and business scholars. (Its prominent developer Michael Porter). The concept combined sequenced and interconnected activities in the process of value creation. Value chain concept focused on business activities, but not on the corporate power and institutional context. In 1994 Garry Gereffi, together with Miguel Korzeniewicz introduced the concept of Global Commodity Chains (GCC):
The concept was developed further by a number of authors that emphasized importance of chain governance in different commodities (e.g. automobiles, textile, electronics etc.)
At the beginning of 2000s a group of authors Jeffrey Henderson, Peter Dicken, Martin Hess, Neil Coe and Henry Wai-Chung Yeung, introduced GPN framework, that builds on the development of previous approaches to international production processes. At the same time it expands beyond the linearity of GCC approach to incorporate all kinds of network configuration. Adopting clear network perspective allows to embrace the complexity of multidimensional layers of production moving beyond the "linear progression of the product or service"
Insights from the analysis of production networks
Analysis of the global production networks relies on the use of the input-output tables that links firms through the transactions involved in the product creation. Commodity chain literature considers firms as the nodes in a number of chains that transform inputs into outputs through a series of interconnected stages of production, later linked to distribution and consumption activities. Andersen and Christensen define five major types of connective nodes in supply networks: Local integrator, Export base, Import base, International spanner and Global integrator Hobday et al. argue that the core capability of the firms stem from their ability to manage network of components and subsystem suppliers.
To capture both vertical and horizontal links across the sequence of production process, Lazzarini introduced the concept of Netchain: "a set of networks horizontal ties between firms within a p |
https://en.wikipedia.org/wiki/Office%20of%20Personnel%20Management%20data%20breach | The Office of Personnel Management data breach was a 2015 data breach targeting Standard Form 86 (SF-86) U.S. government security clearance records retained by the United States Office of Personnel Management (OPM). One of the largest breaches of government data in U.S. history, the attack was carried out by an advanced persistent threat based in China, widely believed to be the Jiangsu State Security Department, a subsidiary of China's Ministry of State Security spy agency.
In June 2015, OPM announced that it had been the target of a data breach targeting personnel records. Approximately 22.1 million records were affected, including records related to government employees, other people who had undergone background checks, and their friends and family. One of the largest breaches of government data in U.S. history, information that was obtained and exfiltrated in the breach included personally identifiable information such as Social Security numbers, as well as names, dates and places of birth, and addresses. State-sponsored hackers working on behalf of the Chinese government carried out the attack.
The data breach consisted of two separate, but linked, attacks. It is unclear when the first attack occurred but the second attack happened on May 7, 2014, when attackers posed as an employee of KeyPoint Government Solutions, a subcontracting company. The first attack was discovered March 20, 2014, but the second attack was not discovered until April 15, 2015. In the aftermath of the event, Katherine Archuleta, the director of OPM, and the CIO, Donna Seymour, resigned.
Discovery
The first breach, named "X1" by the Department of Homeland Security (DHS), was discovered March 20, 2014 when a third party notified DHS of data exfiltration from OPM's network.
With regards to the second breach, named "X2", the New York Times had reported that the infiltration was discovered using United States Computer Emergency Readiness Team (US-CERT)'s
Einstein intrusion-detection program. However, the Wall Street Journal, Wired, Ars Technica, and Fortune later reported that it was unclear how the breach was discovered. They reported that it may have been a product demonstration of CyFIR, a commercial forensic product from a Manassas, Virginia security company CyTech Services that uncovered the infiltration. These reports were subsequently discussed by CyTech Services in a press release issued by the company on June 15, 2015 to clarify contradictions made by OPM spokesman Sam Schumach in a later edit of the Fortune article. However, it was not CyTech Services that uncovered the infiltration; rather, it was detected by OPM personnel using a software product of vendor Cylance. Ultimately, the conclusive House of Representatives' Majority Staff Report on the OPM breach discovered no evidence suggesting that CyTech Services knew of Cylance's involvement or had prior knowledge of an existing breach at the time of its product demonstration, leading to the finding that bo |
https://en.wikipedia.org/wiki/Karelasyon | () is a Philippine television drama anthology broadcast by GMA Network. Hosted by Carla Abellana, it premiered on April 11, 2015 on the network's Sabado Star Power line up replacing GMA Tales of Horror. The show concluded on May 13, 2017 with a total of 108 episodes. It was replaced by Tadhana in its timeslot.
The series is streaming online on YouTube.
Episodes
Ratings
According to AGB Nielsen Philippines' Mega Manila household television ratings, the pilot episode of earned a 16.5% rating. While the final episode scored a 5.2% rating in Nationwide Urban Television Audience Measurement People in television homes.
Accolades
References
External links
2015 Philippine television series debuts
2017 Philippine television series endings
Filipino-language television shows
GMA Network original programming
GMA Integrated News and Public Affairs shows
Philippine anthology television series
Television shows set in the Philippines |
https://en.wikipedia.org/wiki/Evolution%20of%20a%20random%20network | Evolution of a random network is a dynamical process, usually leading to emergence of giant component accompanied with striking consequences on the network topology. To quantify this process, there is a need of inspection on how the size of the largest connected cluster within the network, , varies with the average degree . Networks change their topology as they evolve, undergoing phase transitions. Phase transitions are generally known from physics, where it occurs as matter changes state according to its thermal energy level, or when ferromagnetic properties emerge in some materials as they are cooling down. Such phase transitions take place in matter because it is a network of particles, and as such, rules of network phase transition directly apply to it. Phase transitions in networks happen as links are added to a network, meaning that having N nodes, in each time increment, a link is placed between a randomly chosen pair of them. The transformation from a set of disconnected nodes to a fully connected network is called the evolution of a network.
If we begin with a network having N totally disconnected nodes (number of links is zero), and start adding links between randomly selected pairs of nodes, the evolution of the network begins. For some time we will just create pairs of nodes. After a while some of these pairs will connect, forming little trees. As we continue adding more links to the network, there comes a point when a giant component emerges in the network as some of these isolated trees connect to each other. This is called the critical point. In our natural example, this point corresponds to temperatures where materials change their state. Further adding nodes to the system, the giant component becomes even larger, as more and more nodes get a link to another node which is already part of the giant component. The other special moment in this transition is when the network becomes fully connected, that is, when all nodes belong to the one giant component, which is effectively the network itself at that point.
Conditions for emergence of a giant component
In the Erdős–Rényi model, the average degree of a graph with n vertices and N edges is given by .
The condition for the emergence of a giant component is:
.
Thus, one link is sufficient for its emergence of the giant component.
If expressing the condition in terms of , one obtains:
(1)
Where is the number of nodes, is the probability of clustering.
Therefore, the larger a network, the smaller is sufficient for the giant component.
Regimes of evolution of a random network
Three topological regimes with its unique characteristics can be distinguished in network science: subcritical, supercritical and connected regimes.
Subcritical regime
The subcritical phase is characterised by small isolated clusters, as the number of links is
much less than the |
https://en.wikipedia.org/wiki/Million%20Dollar%20Listing%20San%20Francisco | Million Dollar Listing San Francisco is an American reality television series on Bravo that premiered on July 8, 2015.
The show was greenlit by the network in July and the production commenced in October 2014. The series is developed as the fourth installment of the Million Dollar Listing franchise, following Million Dollar Listing Los Angeles, New York and Miami.
The series chronicles the personal and professional lives of three high-profile real estate agents as they try to outsell each other, listing one of the most expensive and prestigious properties around the San Francisco Bay Area.
On April 27, 2016, the series was cancelled after one season.
Realtors
Justin Fichelson, one of the Bay Area's top luxury brokers at Fichelson Real Estate Group.
Andrew Greenwell, CEO and principal at Venture Sotheby's International Realty, specializing in ultra-luxury real estate in the San Francisco area. He is a graduate of Florida State University and was named one of Realtor Magazine's "Top 30 Realtors in America Under 30". Prior to starting his own company in September 2014, he worked as CEO and team leader of Keller Williams Tri-Valley Realty managing more than 150 agents.
Roh Habibi, an agent for Coldwell Banker Previews International. In 2014, he placed in the top 6%, ranking #255 out of 4,100 realtors in the San Francisco Association served as the chairman of their Young Professional Network. He is also a member of The Financial Planning Association's Chapters in San Francisco, East Bay, and Silicon Valley.
Episodes
Broadcast
The series premiered in Australia on August 17, 2015, on Arena.
References
External links
2010s American reality television series
2015 American television series debuts
2015 American television series endings
English-language television shows
Bravo (American TV network) original programming
Reality television spin-offs
Television shows set in San Francisco
Television series by World of Wonder (company)
Television in the San Francisco Bay Area
Property buying television shows
American television spin-offs |
https://en.wikipedia.org/wiki/Low-degree%20saturation | In a scale-free network the degree distribution follows a power law function. In some empirical examples this power-law fits the degree distribution well only in the high degree region, however for small degree nodes the empirical degree-distribution deviates from it. See for example the network of scientific citations. This deviation of the observed degree-distribution from the theoretical prediction at the low-degree region is often referred as low-degree saturation.
Typically the empirical degree-distribution deviates downwards from the power-law function fitted on higher order nodes, which means low-degree nodes are less frequent in real data than what is predicted by the Barabási–Albert model.
Theoretical foundation
One of the key assumptions of the BA model is preferential attachment. It states, the probability of acquiring a new link from a new entrant node is proportional to the degree of each node. In other words, every new entrant favors to connect to higher-degree nodes. Formally:
Where is the probability of acquiring a link by a node with degree .
With a slight modification of this rule low-degree saturation can be predicted easily, by adding a term called initial attractiveness (). This was first introduced by Dorogovtsev, Mendes and Samukhin in 2000.
With this modified attachment rule a low-degree node (with low ) has a higher probability to acquire new links compared to the original set-up. Thus it is more attractive. Therefore, this handicap makes less likely the existence of small degree-nodes as it is observed in real data.
More formally this modifies the degree distribution as:
As a side effect it also increases the exponent relative to the original BA model.
It is called initial attractiveness because in the BA framework every node grows in degree by time. And as goes large the significance of this fixed additive term diminishes.
Significance
All the distinctive features of scale-free networks are due to the existence of extremely high degree nodes, often referred as hubs. The existence of these hubs are predicted by the power-law distribution of the degrees. However low-degree saturation is a deviation from this theoretical degree distribution, since it characterize the low end of the degree distribution, it does not deny the existence of hubs. Therefore, a scale-free network with low-degree saturation can produce all the following characteristics: small-world characteristic, robustness, low attack tolerance, spreading behavior.
If it is modeled via the BA model augmented by the initial attractiveness, then this solution reduces the size of hubs because it affects the exponent of the degree distribution positively relative to the original BA model.
See also
Initial attractiveness
References
Network theory |
https://en.wikipedia.org/wiki/Label%20propagation%20algorithm | Label propagation is a semi-supervised machine learning algorithm that assigns labels to previously unlabeled data points. At the start of the algorithm, a (generally small) subset of the data points have labels (or classifications). These labels are propagated to the unlabeled points throughout the course of the algorithm.
Within complex networks, real networks tend to have community structure. Label propagation is an algorithm for finding communities. In comparison with other algorithms label propagation has advantages in its running time and amount of a priori information needed about the network structure (no parameter is required to be known beforehand). The disadvantage is that it produces no unique solution, but an aggregate of many solutions.
Functioning of the algorithm
At initial condition, the nodes carry a label that denotes the community they belong to. Membership in a community changes based on the labels that the neighboring nodes possess. This change is subject to the maximum number of labels within one degree of the nodes. Every node is initialized with a unique label, then the labels diffuse through the network. Consequently, densely connected groups reach a common label quickly. When many such dense (consensus) groups are created throughout the network, they continue to expand outwards until it is impossible to do so.
The process has 5 steps:
1. Initialize the labels at all nodes in the network. For a given node x, Cx (0) = x.
2. Set t = 1.
3. Arrange the nodes in the network in a random order and set it to X.
4. For each x ∈ X chosen in that specific order, let Cx(t) = f(Cxi1(t), ...,Cxim(t),Cxi(m+1) (t − 1), ...,Cxik (t − 1)). Here returns the label occurring with the highest frequency among neighbours. Select a label at random if there are multiple highest frequency labels.
5. If every node has a label that the maximum number of their neighbours have, then stop the algorithm. Else, set t = t + 1 and go to (3).
Multiple community structure
In contrast with other algorithms label propagation can result in various community structures from the same initial condition. The range of solutions can be narrowed if some nodes are given preliminary labels while others are held unlabelled. Consequently, unlabelled nodes will be more likely to adapt to the labelled ones. For a more accurate finding of communities, Jaccard’s index is used to aggregate multiple community structures, containing all important information.
References
External links
Python implementation of label propagation algorithm.
Machine learning algorithms
Networks |
https://en.wikipedia.org/wiki/Xulvi-Brunet%E2%80%93Sokolov%20algorithm | Xulvi-Brunet and Sokolov's algorithm generates networks with chosen degree correlations. This method is based on link rewiring, in which the desired degree is governed by parameter ρ. By varying this single parameter it is possible to generate networks from random (when ρ = 0) to perfectly assortative or disassortative (when ρ = 1). This algorithm allows to keep network's degree distribution unchanged when changing the value of ρ.
Assortative model
In assortative networks, well-connected nodes are likely to be connected to other highly connected nodes. Social networks are examples of assortative networks. This means that an assortative network has the property that almost all nodes with the same degree are linked only between themselves.
The Xulvi-Brunet–Sokolov algorithm for this type of networks is the following.
In a given network, two links connecting four different nodes are chosen randomly. These nodes are ordered by their degrees. Then, with probability ρ, the links are randomly rewired in such a way that one link connects the two nodes with the smaller degrees and the other connects the two nodes with the larger degrees. If one or both of these links already existed in the network, the step is discarded and is repeated again. Thus, there will be no self-connected nodes or multiple links connecting the same two nodes. Different degrees of assortativity of a network can be achieved by changing the parameter ρ.
Assortative networks are characterized by highly connected groups of nodes with similar degree. As assortativity grows, the average path length and clustering coefficient increase.
Disassortative model
In disassortative networks, highly connected nodes tend to connect to less-well-connected nodes with larger probability than in uncorrelated networks. Examples of such networks include biological networks.
The Xulvi-Brunet and Sokolov's algorithm for this type of networks is similar to the one for assortative networks with one minor change. As before, two links of four nodes are randomly chosen and the nodes are ordered with respect to their degrees. However, in this case, the links are rewired (with probability p) such that one link connects the highest connected node with the node with the lowest degree and the other link connects the two remaining nodes randomly with probability 1 − ρ. Similarly, if the new links already existed, the previous step is repeated. This algorithm does not change the degree of nodes and thus the degree distribution of the network.
References
Network theory
Algorithms |
https://en.wikipedia.org/wiki/Initial%20attractiveness | The initial attractiveness is a possible extension of the Barabási–Albert model (preferential attachment model). The Barabási–Albert model generates scale-free networks where the degree distribution can be described by a pure power law. However, the degree distribution of most real life networks cannot be described by a power law solely. The most common discrepancies regarding the degree distribution found in real networks are the high degree cut-off (or structural cut-off) and the low degree cut-off. The inclusion of initial attractiveness in the Barabási–Albert model addresses the low-degree cut-off phenomenon.
Definition
The Barabási–Albert model defines the following linear preferential attachment rule: . This would imply that the probability that a new node will attach to a node that has a zero degree is zero – . The preferential attachment function of the Barabási–Albert model can be modified as follows: as proposed by Dorogovtsev-Mendes-Samukhin. The constant denotes the initial attractiveness of the node. From this the preferential attachment rule with initial attractiveness comes as:
Based on this attachment rule it can be inferred that: . This means that even isolated nodes with have a chance to obtain connections with the newly arriving nodes.
Consequences
The presence of initial attractiveness results in two important consequences one is the small degree cut-off (or small degree saturation). The other on is the increased degree exponent of the degree distribution.
Small degree cut-off/saturation
The small degree saturation is an empirical regularity – the number of nodes with low degree is smaller than it would be expected if a power law would describe the degree distribution. The reason why this appears is the following: initial attractiveness increases the probability that the node obtains connection with an arriving node. This increased attachment probability becomes marginal as the node obtains more connections – it does not effect the right tail of the distribution. The degree distribution of a model with initial attractiveness can be described by the following: .
Examples
There are numerous real life networks when the degree distribution shows some kind of small degree cut-off. The following list offers some examples:
Scientific collaboration network
Co-stardom network
Citation network
Higher degree exponent
Importantly, in case of the Barabási–Albert model the exponent of the degree distribution, here denoted by , has a value of 3. In case of the Barabási–Albert model with initial attractiveness the degree exponent is simply . Here denotes the initial number of links in the network. As is higher than 3 it follows that the network is in the random network regime and as the number of initial nodes is higher it converges to the scale-free regime. The same holds for the value of the initial attractiveness as is higher the more the network is into the random network regime. This means that the number of |
https://en.wikipedia.org/wiki/Igraph | igraph is a library collection for creating and manipulating graphs and analyzing networks. It is written in C and also exists as Python and R packages. There exists moreover an interface for Mathematica. The software is widely used in academic research in network science and related fields. The publication that introduces the software has 5623 citations as of according to Google Scholar.
igraph was originally developed by Gábor Csárdi and Tamás Nepusz. It is written in the C programming language in order to achieve good performance and it is freely available under GNU General Public License Version 2.
Basic properties
The three most important properties of igraph that shaped its development are as follows:
igraph is capable of handling large networks efficiently
it can be productively used with a high-level programming language
interactive and non-interactive usage are both supported
Characteristics
The software is open source, source code can be downloaded from the project's GitHub page. There are several open source software packages that use igraph functions. As an example, R packages tnet, igraphtosonia and cccd depend on igraph R package.
Users can use igraph on many operating systems. The C library and R and Python packages need the respective software, otherwise igraph is portable. The C library of igraph is well documented as well as the R package and the Python package
Functions
igraph can be used to generate graphs, compute centrality measures and path length based properties as well as graph components and graph motifs. It also can be used for degree-preserving randomization. igraph can read and write Pajek and GraphML files, as well as simple edge lists. The library contains several layout tools as well.
References
External links
Free software
2006 software
Cross-platform free software
Free software programmed in C
Free software programmed in C++ |
https://en.wikipedia.org/wiki/TBN%20Salsa | TBN Salsa is an American Christian-based digital broadcast television network owned by the Trinity Broadcasting Network. The network offers a mix of religious and family-oriented programming aimed at English-speaking Hispanic Americans (serving as a complement to the Spanish-language Enlace, which TBN distributes in the United States).
The network is available as a 24-hour-a-day service distributed primarily on cable and satellite providers in select markets. It is the only U.S.-based TBN network that is not available for livestreaming on TBN's website and mobile app.
History
On April 24, 2015, the Trinity Broadcasting Network announced that it would launch TBN Salsa, described as a "faith-and-family network" geared toward English-speaking second- and third-generation Hispanics, as well as non-Hispanic viewers interested in the Latin American culture and faith community. The network was co-founded by TBN president Matthew Crouch and Laurie Crouch, with Samuel Rodriguez (president of the National Hispanic Christian Leadership Conference) serving as a key advisor in the network's development. The network initially debuted on the 38 stations owned directly by the Trinity Broadcasting Network and through its subsidiary Community Educational Television (including markets with large Hispanic and Latino populations such as Los Angeles, New York City, Chicago, Miami, Atlanta, Dallas-Fort Worth, Philadelphia, Phoenix, Denver, Indianapolis, Nashville and Houston).
Due to technical limitations with its stations' existing digital compression equipment, TBN opted to launch TBN Salsa on the subchannel previously occupied by Smile of a Child TV, collapsing that network (which is aimed at children 2 to 12 years of age) into a single subchannel with sister network JUCE TV (which targets teenagers and young adults 13 to 30 years of age) under a timeshare arrangement, with a reduced schedule of Smile programming airing daily from 6:00 a.m. to 3:00 p.m. Eastern Time on the third subchannel occupied by JUCE (Smile of a Child and JUCE continue to maintain 24-hour-day schedules, with programs not seen on the subchannel available on their respective streams on TBN's website, mobile and digital media players, and select cable and satellite providers).
TBN Salsa formally launched at 7:08 p.m. Eastern Time on June 1, 2015, with a 60-second promo reel previewing the network. This was followed by the network's inaugural program: a special live broadcast of TBN flagship program Praise the Lord from the network's Dream Center studio in Los Angeles' Echo Park neighborhood (hosted by Matthew and Laurie Crouch, and Samuel Rodriguez), with additional location segments conducted from Miami, Seattle and New York City.
On May 1, 2019, TBN removed Salsa from the DT5 feed of its O&O broadcast stations, replacing it with a placeholder standard definition feed of the main TBN signal. This was, in turn, replaced by a 24-hour feed of JUCE TV until the network folded in January 2020, b |
https://en.wikipedia.org/wiki/Outline%20of%20MySQL | The following outline is provided as an overview of and topical guide to MySQL:
MySQL ("My Structured Query Language") – world's second most widely used relational database management system (RDBMS) and most widely used open-source RDBMS. It is named after co-founder Michael Widenius's daughter, My.
What type of thing is MySQL?
MySQL can be described as all the following:
Software – any set of machine-readable instructions that directs a computer's processor to perform specific operations.
Applications software – set of computer programs designed to permit the user to perform a group of coordinated functions, tasks, or activities. Application software cannot run on itself but is dependent on system software (an operating system) to execute.
Database management system (DBMS) – computer software application that interact with the user, other applications, and the database itself to capture and analyze data.
Relational database management system (RDBMS) – database management system (DBMS) based on the relational model, in which all data is represented in terms of tuples (ordered set of attribute values), grouped into relations. Most relational databases use the SQL data definition and query language.
Open-source software – computer software with its source code made available with a license in which the copyright holder provides the rights to study, change, and distribute the software to anyone and for any purpose.
Solution stack component – one of the pieces of a solution stack, which is a set of software subsystems or components needed to create a complete platform such that no additional software is needed to support applications. Applications are said to "run on" or "run on top of" the resulting platform. Some definitions of a platform overlap with what is known as system software.
AMP-stack component – MySQL is the "M" component of Apache-MySQL-Perl/PHP/Python solution stacks (which, by the way, are available across all computer platforms). AMP software bundles are used to run dynamic Web sites or servers.
It supports php, perl,c,c++,java etc.
Component of LAMP – Linux version of AMP
Component of WAMP – Windows version of AMP
Ownership and copyrights
Owners
Original owner: MySQL AB – former software company that was founded in 1995. It was acquired by Sun Microsystems in 2008; Sun was in turn acquired by Oracle Corporation in 2010.
Current owner: Oracle Corporation – multinational computer technology corporation headquartered in Redwood City, California, United States. The company specializes in developing and marketing computer hardware systems and enterprise software products – particularly its own brands of database management systems.
License
GNU General Public License – most widely used free software license, which guarantees end users (individuals, organizations, companies) the freedoms to use, study, share (copy), and modify the software. Software that allows these rights is called free software and, if the software |
https://en.wikipedia.org/wiki/Lancichinetti%E2%80%93Fortunato%E2%80%93Radicchi%20benchmark | Lancichinetti–Fortunato–Radicchi benchmark is an algorithm that generates benchmark networks (artificial networks that resemble real-world networks). They have a priori known communities and are used to compare different community detection methods. The advantage of the benchmark over other methods is that it accounts for the heterogeneity in the distributions of node degrees and of community sizes.
The algorithm
The node degrees and the community sizes are distributed according to a power law, with different exponents. The benchmark assumes that both the degree and the community size have power law distributions with different exponents, and , respectively. is the number of nodes and the average degree is . There is a mixing parameter , which is the average fraction of neighboring nodes of a node that do not belong to any community that the benchmark node belongs to. This parameter controls the fraction of edges that are between communities. Thus, it reflects the amount of noise in the network. At the extremes, when all links are within community links, if all links are between nodes belonging to different communities.
One can generate the benchmark network using the following steps.
Step 1: Generate a network with nodes following a power law distribution with exponent and choose extremes of the distribution and to get desired average degree is .
Step 2: fraction of links of every node is with nodes of the same community, while fraction is with the other nodes.
Step 3: Generate community sizes from a power law distribution with exponent . The sum of all sizes must be equal to . The minimal and maximal community sizes and must satisfy the definition of community so that every non-isolated node is in at least in one community:
Step 4: Initially, no nodes are assigned to communities. Then, each node is randomly assigned to a community. As long as the number of neighboring nodes within the community does not exceed the community size a new node is added to the community, otherwise stays out. In the following iterations the “homeless” node is randomly assigned to some community. If that community is complete, i.e. the size is exhausted, a randomly selected node of that community must be unlinked. Stop the iteration when all the communities are complete and all the nodes belong to at least one community.
Step 5: Implement rewiring of nodes keeping the same node degrees but only affecting the fraction of internal and external links such that the number of links outside the community for each node is approximately equal to the mixing parameter .
Testing
Consider a partition into communities that do not overlap. The communities of randomly chosen nodes in each iteration follow a distribution that represents the probability that a randomly picked node is from the community . Consider a partition of the same network that was predicted by some community finding algorithm and has distribution. The benchmark partition has distrib |
https://en.wikipedia.org/wiki/Zachary%27s%20karate%20club | Zachary's karate club is a social network of a university karate club, described in the paper "An Information Flow Model for Conflict and Fission in Small Groups" by Wayne W. Zachary. The network became a popular example of community structure in networks after its use by Michelle Girvan and Mark Newman in 2002.
Network description
A social network of a karate club was studied by Wayne W. Zachary for a period of three years from 1970 to 1972. The network captures 34 members of a karate club, documenting links between pairs of members who interacted outside the club. During the study a conflict arose between the administrator "John A" and instructor "Mr. Hi" (pseudonyms), which led to the split of the club into two. Half of the members formed a new club around Mr. Hi; members from the other part found a new instructor or gave up karate. Based on collected data Zachary correctly assigned all but one member of the club to the groups they actually joined after the split.
Zachary's methodology
Before the split each side tried to recruit adherents of the other party. Thus, communication flow had a special importance and the initial group would likely split at the "borders" of the network.
Zachary used the maximum flow – minimum cut Ford–Fulkerson algorithm from “source” Mr. Hi to “sink” John A: the cut closest to Mr. Hi that cuts saturated edges divides the network into the two factions. Zachary correctly predicted each member's decision except member #9, who went with Mr. Hi instead of John A.
Data set
The standard 78-edge network data set for Zachary's karate club is publicly available on the internet. The data can be summarized as list of integer pairs. Each integer represents one karate club member and a pair indicates the two members interacted. The data set is summarized below and also in the adjoining image. Node 1 stands for the instructor, node 34 for the club administrator / president.
[2 1]
[3 1] [3 2]
[4 1] [4 2] [4 3]
[5 1]
[6 1]
[7 1] [7 5] [7 6]
[8 1] [8 2] [8 3] [8 4]
[9 1] [9 3]
[10 3]
[11 1] [11 5] [11 6]
[12 1]
[13 1] [13 4]
[14 1] [14 2] [14 3] [14 4]
[17 6] [17 7]
[18 1] [18 2]
[20 1] [20 2]
[22 1] [22 2]
[26 24] [26 25]
[28 3] [28 24] [28 25]
[29 3]
[30 24] [30 27]
[31 2] [31 9]
[32 1] [32 25] [32 26] [32 29]
[33 3] [33 9] [33 15] [33 16] [33 19] [33 21] [33 23] [33 24] [33 30] [33 31] [33 32]
[34 9] [34 10] [34 14] [34 15] [34 16] [34 19] [34 20] [34 21] [34 23] [34 24] [34 27] [34 28] [34 29] [34 30] [34 31] [34 32] [34 33]
Although this version of the network is considered standard, the connection between nodes 34 and 23 is ambiguously reported in Zachary's original paper. A 77-edge version, which omits this edge, is also publicly available.
Zachary Karate Club Club
Zachary Karate Club Club is a honorific group that awards membership in the group, along with a traveling trophy, to a scientist who is the first to use Zachary's Karate Club as an example at a conference on networks. The first |
https://en.wikipedia.org/wiki/Outlit | Outlit is an online social networking and digital media virtual marketplace founded in 2014 in Arlington, Virginia. Registered users can publish stories and earn from views by other users. Outlit offers bloggers and publishers three sources of revenue for their content: a share of digital advertising revenue, on-demand digital payments, and subscriptions. The service launched in 2014 as an "iTunes of News," with over 40 newspapers and magazines in the United States. Outlit announced an expansion in 2019 to become a social information marketplace enabling anyone to publish and earn from other users. Content on Outlit comes in the form of short posts with longer content able to be monetized through ads, direct digital micropayments, or subscriptions.
History
The company's CEO and co-founder is Lucien Zeigler, a media consultant and economist. Zeigler has said that Outlit was founded in response to declining revenues for publishers and the prevalence of advertising in news media, as well as the "inefficiency of the subscription business model" for readers.
Outlit is backed by an undisclosed angel investment secured in March 2015.
References
Digital media organizations
American companies established in 2014
Online marketplaces of the United States
2014 establishments in Virginia |
https://en.wikipedia.org/wiki/Creative%20technology%20%28disambiguation%29 | Creative technology may refer to:
Creative technology
Creative Technology Limited, the computer hardware manufacturer.
Citroën's advertising slogan. |
https://en.wikipedia.org/wiki/Clearnet%20%28networking%29 | Clearnet is a term that typically refers to the publicly accessible Internet. Sometimes "clearnet" is used as a synonym for "surface web"—excluding both the darknet and the deep web. The World Wide Web is one of the most popular distributed services on the Internet, and the surface web is composed of the web pages and databases that are indexed by traditional search engines.
"Clearnet" can be seen as the opposite of the term "darknet", which typically describes the services built on Tor or other anonymity networks, the connection to which is encrypted and anonymized. Because the darknet is not publicly accessible, it is part of the deep web. The deep web, which is not indexed, is still publicly accessible. It includes web portals to databases that require text searches, and interactive web sites that require more user input than simply clicking hyperlinks.
Characteristics
Without the use of anonymity services like Tor, browsing the clearnet is typically not anonymous; most websites routinely identify users by their IP address as well as other data transmitted by the client.
References
Internet terminology
Dark web |
https://en.wikipedia.org/wiki/Tedi%20Medi%20Family | Tedi Medi Family is an Indian sitcom television series, which premiered on 8 June 2015 and is broadcast on BIG Magic. The series is adaptation of Warner Bros.' The Middle.
Reliance Broadcast Network had acquired the adaptation rights of the series. The series is produced by Mautik Tulip of Bodhi Tree Productions. The series is about a working-class family. The series is produced as a single-camera comedy and follows the daily commotion of raising a family, in the middle of life.
Cast
Iqbal Azad as Vivek Khurana
Ami Trivedi as Anjali Khurana
Sushant Mohindru as Shanky Khurana
Saloni Daini as Suhani Khurana
Dharmik Joisar as Veer Khurana
Manav Soneji as Vicky
Varun Badola as Vivek's friend
Shefali Rana as Badi Massi
References
External links
The Middle (TV series)
2015 Indian television series debuts
2015 Indian television series endings
Indian television series based on American television series
Hindi-language television shows
Indian television sitcoms
Big Magic original programming |
https://en.wikipedia.org/wiki/Milo%20Poulson | Milo Poulson is an alternative cartoonist known for the exploration of gay themes in his comics. His work was included in Gay Comix.
References
External links
Comic Book Database
Guide to the Lesbian, Gay, Bisexual, Transgender (LGBT) Collection at the Smithsonian Institution National Museum of American History Archives Center
Alternative cartoonists
Living people
LGBT comics creators
Underground cartoonists
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Computer%20display%20technology | Computer display technology encompasses:
Computer monitor hardware technologies, such as CRT and LCD
Audio and video interfaces and connectors |
https://en.wikipedia.org/wiki/Vodafone%20Idea | Vodafone Idea or Vi (stylised as V!) is an Indian mobile network operator with its headquarters based in Mumbai and Gandhinagar. It is an all-India integrated GSM operator offering 2G, 4G, LTE Advanced, VoLTE, 5G and VoWiFi service. As of 30 June 2023, Vi has a subscriber base of 221.4 million, making it third largest mobile telecommunications network in India and 11th largest mobile telecommunications network in the world. 'Vodafone Idea Limited' was created on 31 August 2018 by the merger of Vodafone India and Idea Cellular. In 2020, the two separate brands Vodafone and Idea rebranded as Vi.
History
In March 2017, it was announced that Idea Cellular and Vodafone India would merge. The merger got approval from the Department of Telecommunications in July 2018. On 30 August 2018, National Company Law Tribunal gave the final nod to the Vodafone-Idea merger It was completed on 31 August 2018, and the new entity was named Vodafone Idea Limited. Under the terms of the deal, the Vodafone Group held a 45.2% stake in the combined entity, the Aditya Birla Group held 26% and the remaining shares were to be held by the public.
Vi lost a significant number of gross and active subscribers in the month of August 2020.
Until 7 September 2020, Vodafone Idea Limited operated two separate brands: Vodafone and Idea who both operated pre-paid and post-paid GSM service.
On 3 February 2023, the Government of India ordered the company to convert its interest dues worth 161.33 billion Indian Rupees ($1.96 billion) to equity at the rate of 10 rupees per share face value (well over then market value ~8.5), thus making the government the single biggest shareholder in the company.
Network
Spectrum frequency holding summary
Vi owns spectrum in 900 MHz, 1800 MHz, 2100 MHz, 2300 MHz, 2500 MHz, 3500 MHz and 26 GHz bands across the country.
This table contains Vi (Vodafone & Idea) radio frequency details because they had integrated their networks with each other and using one anchor network for both brands in all respective telecom circles. For example, Idea has started 4G services in Delhi and Kolkata telecom circle from May 2018 where the Vodafone is anchor network vice versa Vodafone has Started 4G services in Madhya Pradesh & Chhattisgarh, Bihar & Jharkhand, Andhra Pradesh & Telangana, Himachal Pradesh and Jammu and Kashmir telecom Circle's where Idea is Anchor network.
Network consolidation
By March 2019, Vi announced its network consolidation across major circles, easing network issues faced by consumers and also enhancing its 4G coverage. Announcements of Network Consolidation were made as below:
Enhanced Unified (2G, 3G, and 4G) coverage details
Enhanced LTE (4G) coverage details
Vi Movies & TV
As of September 2023, Vi Movies & TV app is currently available for Vi subscribers on Android (above Android 5.1) and iOS devices (10.0 and above versions).
See also
Vodafone
Aditya Birla Group
Telecommunications in India
List of telecom companies in India
L |
https://en.wikipedia.org/wiki/LRRC3B | LRRC3B is a gene frequently epigenetically inactivated in several epithelial malignancies and inhibits cell growth and replication. Data suggest that the LRRC3B gene could be involved in the process of carcinogenesis as a tumor suppressor gene.
References
Genes |
https://en.wikipedia.org/wiki/Yves%20Pigneur | Yves Pigneur (born 1954) is a Belgian computer scientist, and Professor of Management Information Systems at the University of Lausanne since 1984, known for his work on the business model canvas with Alexander Osterwalder.
He is considered a "mastermind" among business strategics, his canvas have been used by numerous companies such as P&G, Amazon, Lockheed Martin and Tesla.
Biography
Pigneur obtained his PhD in Information Systems in 1984 at the Université de Namur under François Bodart.
Pigneur had started his academic career as Assistant Professor at the Université de Namur in 1977. After his graduation he was appointed Professor of Management Information Systems at the University of Lausanne in 1984. He was at Visiting professor at the National University of Singapore in 2012, at the HEC Montréal in 2013, at the Georgia State University, and the University of British Columbia.
Pigneur authored and co-authored a series of books and articles since the 1980s, and became globally known as co-author with Alexander Osterwalder of the 2010 book Business Model Generation. Pigneur and Osterwalder are considered one of the world’s 50 most influential management thinkers.
They placed 15th on The Thinkers50 Ranking 2015 and 7th in 2017, a list drawn up every two years and described by The Financial Times as the “Oscars of management thinking.” They also received one of the 11 Distinguished Achievement Awards (in the “Strategy” category) in 2015.
Selected publications
François Bodart, Yves Pigneur. Conception assistée des applications informatiques, Volume 1. Masson, 1983.
Osterwalder, Alexander, and Yves Pigneur. Business Model Generation: A Handbook For Visionaries, Game Changers, And Challengers. Wiley, 2010.
Articles, a selection:
Bodart, F., Hennebert, A. M., Leheureux, J. M., & Pigneur, Y. (1985). "Computer-aided specification, evaluation, and monitoring of information systems." In Proceedings of the 1985 International Conference on Information Systems (pp. 27–44).
Osterwalder, Alexander, and Yves Pigneur. "An eBusiness model ontology for modeling eBusiness." BLED 2002 Proceedings (2002): 2.
Dubosson‐Torbay, Magali, Alexander Osterwalder, and Yves Pigneur. "E‐business model design, classification, and measurements." Thunderbird International Business Review 44.1 (2002): 5-23.
Osterwalder, Alexander, Yves Pigneur, and Christopher L. Tucci. "Clarifying business models: Origins, present, and future of the concept." Communications of the association for Information Systems 16.1 (2005): 1.
References
External links
Yves Pigneur at hec.unil.ch
1954 births
Living people
Belgian business theorists
Belgian computer scientists
Université de Namur alumni
Academic staff of the Université de Namur
Academic staff of the University of Lausanne
Information systems researchers |
https://en.wikipedia.org/wiki/Fresh%20Memory%20%28software%29 | Fresh Memory is a spaced repetition flashcard application, similar to SuperMemo.
The study algorithm is based on the SM2 algorithm, created for SuperMemo in the late 1980s.
The presented cards may include text and images. The cards are stored in an XML-based format, called dictionary files.
The cards may have multiple "sides", called fields. The user defines what fields and in which order are used in the cards. The application automatically generates cards for different directions, e.g. from English language to French and in reversed order.
The primary purpose of the application is to learn and repeat foreign words. But other areas can be studied as well, for example, country's capitals, flags, mathematical formulas, etc. The study material is stored as collections of flashcards. The application has two studying modes: classic random browsing of flashcards and Spaced repetition.
Fresh Memory is released as a free open-source software under GPL 3 license with full functionality.
See also
Anki (software)
List of flashcard software
References
External links
SM2 Algorithm
Fresh Memory algorithm used in Fresh Memory
Spaced repetition software
Educational software that uses Qt
Free educational software |
https://en.wikipedia.org/wiki/Silver%20Circle%20%28film%29 | Silver Circle is a 2013 American computer-animated thriller film. Set in a dystopian future, it follows a group called the Rebels, who have vowed to take down the Federal Reserve.
Silver Circle was given a limited release in the United States on March 22, 2013. The film drew criticism for its libertarian slant and for the quality of its animation.
Reception
On Rotten Tomatoes, the film has an approval rating of 0% based on 6 reviews. On Metacritic, the film has a score of 21 out of 100 based on 6 critics, indicating "generally unfavorable reviews."
References
External links
2013 films
Animated thriller films
2010s thriller films
2013 computer-animated films
American thriller films
2010s American animated films
American independent films
American political thriller films
American dystopian films
2013 directorial debut films
2010s English-language films |
https://en.wikipedia.org/wiki/Addis%20Ababa%E2%80%93Djibouti%20Railway | The Addis Ababa–Djibouti Railway (; , , ) is a standard gauge international railway that serves as the backbone of the new Ethiopian National Railway Network. The railway was inaugurated by Prime Minister Hailemariam Desalegn on January 1, 2018. It provides landlocked Ethiopia with access to the sea, linking Ethiopia's capital of Addis Ababa with Djibouti and its Port of Doraleh. More than 95% of Ethiopia's trade passes through Djibouti, accounting for 70% of the activity at the Port of Djibouti.
The total railway capacity is 24.9 million tonnes of freight annually, with 6 million tonnes annually expected in 2023. These plans are accompanied by construction works at the Port of Doraleh to expand the annual cargo handling capacity from 6 to 14 million tonnes, with the aim of reaching 10 million tonnes of cargo by 2022.
In 2019 the railway transported 84 073 passengers and generated US$1.2 million in revenue from that service, less than in 2018. In 2019 the railway generated US$40 million in both passenger and cargo revenue, far below the operating cost of US$70 million. During the first half of 2020, the railway transported 0.7 million tonnes of freight.
Railway
Operator
The railway line is jointly owned by both the Djiboutian and Ethiopian governments. In Ethiopia, the state-owned Ethiopian Railway Corporation represents the owner of the railway.
The Ethio-Djibouti Standard Gauge Rail Transport S.C., a bi-national public company headquartered in Addis Ababa, was formed in 2017 to operate the railway. It is owned by the governments of Ethiopia (75% share) and Djibouti (25% share). Ethiopia holds the CEO post, represented through the Ethiopian Minister of Transport. The company currently occupies an administrative role, but it will take over railway operations at the beginning of 2024.
Through 2023, all operations on the new railway will be undertaken jointly by the China Railway Group Limited (CREC) and the China Civil Engineering Construction Corporation (CCECC). During this time, the companies will train local employees so that they can take over railway operations at the conclusion of the initial operation period. The Ethiopian Railway Corporation has also established the African Railway Academy in Bishoftu to graduate rail engineers.
Route
The Addis Ababa–Djibouti Railway runs roughly parallel to the old metre-gauge Ethio–Djibouti Railway for most of its length. However, the standard-gauge railway is built on a new, straighter right-of-way that allows for much higher speeds. New stations have been built outside city centres, and most of the old railway stations have been decommissioned. There are 68 viaducts and bridges, comprising 3% of the railway's total length. There are no tunnels.
The total length of the railway line is , of which run between the two terminal stations at Sebeta and the Port of Doraleh. The remaining five kilometers are for shunting operations. A total of of the railway line is in Ethiopia, while a total of |
https://en.wikipedia.org/wiki/Bible%20Conference%20Movement | The Bible Conference Movement was an interdenominational network of Protestant gatherings that began in the last decades of the nineteenth century and played an integral role in the rise of fundamentalism and the success of evangelicalism in the twentieth century. Audiences flocked to hear well known religious personalities and Bible teachers speak on popular theological currents, missionary themes, end-times speculation, and renewal. Bible conferences combined elements of earlier Christian revivalism, efforts for social reform, and recreation.
Early Formation
According to historian Mark Sidwell, Bible Conferences may have tapped into the historical impulse for the Pietist “ecclesiola in Ecclesia” or “little church within the church.” Antecedents also included the frontier Camp Meetings of the Second Great Awakening and Keswick Convention meetings. There were elements that resembled the Chautauqua Movement and Bible Conferences were part of the legacy of evangelicalism's “Benevolent Empire” which was embodied in social reform efforts including the Temperance Movement and abolitionism. Bible Conferences were also intertwined with the rise and formation of Protestant fundamentalism in the last decades of the 19th century.
It is generally agreed that the formative Bible Conferences were the Niagara Bible Conference, first held in 1883 and organized by George Needham, D. L. Moody’s Northfield Bible Conference in Massachusetts, and a series of Bible and Prophecy Conferences that were organized between 1878 and 1914 with the support of a veritable “who’s who” of fundamentalist leaders including James Brookes, A. J. Gordon, and Arthur Tappan Pierson, to name a few.
Expansion in the Twentieth Century
Especially after the Scopes Trial in 1925, as fundamentalists lost control at the denominational level, Bible conferences served as an important link in a growing and successful fundamentalist network that included influential personalities, “parachurch” organizations such as Youth for Christ, and the growing Bible College Movement. The number of Bible Conferences grew immensely after 1900 but was in decline by the 1950s. Significant twentieth century Bible Conferences were held in Sandy Cove in New Jersey, along Schroon Lake and in Ebenezer in New York as well as Montrose, Pennsylvania. Midwest conferences were held in Northeast Indiana along the shore of Winona Lake, in cities such as Chicago, and in the rural areas of Iowa [Cedar Falls and Okoboji]. On the west coast, Bible Conferences were held at Mount Herman, California. Popular speakers sometimes made their way from one conference venue to another as they traveled the Bible Conference “circuit.”
Significance and legacy
The Bible Conference Movement contributed to the rise of Premillennialism, which led to a strong emphasis on the End Times. Gatherings that focused exclusively on eschatology were often called Prophecy Conferences. Bible Conferences also helped to popularize the Scofield Referen |
https://en.wikipedia.org/wiki/Dorit%20S.%20Hochbaum | Dorit S. Hochbaum is a professor of industrial engineering and operations research at the University of California, Berkeley. She is known for her work on approximation algorithms, particularly for facility location, covering and packing problems, and scheduling, and on flow and cut algorithms, Markov random fields, image segmentation and clustering.
Education and career
Hochbaum earned her doctorate in 1979 from the Wharton School of the University of Pennsylvania, under the supervision of Marshall Lee Fisher. She was on the faculty of Carnegie Mellon University before moving to Berkeley in 1981. In 2011 she became the Epstein Family Professor of Industrial and Systems Engineering at the University of Southern California, but has since returned to Berkeley.
Recognition
In 2004, Hochbaum was awarded an honorary doctorate of sciences by the University of Copenhagen, recognizing her pioneering and inspiring contributions to mathematical optimization. Hochbaum was awarded the title of INFORMS fellow in fall 2005 for the extent of her contributions to operations research, management science and algorithm design. She is the winner of the 2011 INFORMS Computing Society prize for best paper dealing with the Operations Research/Computer Science interface. In 2014, she was selected as a fellow of the Society for Industrial and Applied Mathematics "for contributions to the design and analysis of approximation algorithms, flow problems, and their innovative use in applications, and in solving NP-hard problems."
References
External links
Home page
Year of birth missing (living people)
Living people
20th-century American mathematicians
21st-century American mathematicians
American women mathematicians
American operations researchers
UC Berkeley College of Engineering faculty
Fellows of the Society for Industrial and Applied Mathematics
Fellows of the Institute for Operations Research and the Management Sciences
20th-century women mathematicians
21st-century women mathematicians
20th-century American women
21st-century American women |
https://en.wikipedia.org/wiki/List%20of%20Thoroughbred%20Racing%20on%20CBS%20commentators |
Race callers
Chic Anderson (1968-1978) - Starting in 1969, Anderson's Derby calls would not only be heard by Churchill patrons but also on the CBS Television Network, where he assumed Jack Drees' role on the network's coverage of all three Triple Crown races, as well as other thoroughbred events. Anderson would eventually gain a level of fame as a national race caller exceeded only by that of Clem McCarthy and Ted Husing. Because of his TV experience and knowledge of horses, CBS adopted him as a full-fledged member of their sportscasting team for big races, providing jockey interviews and insights as well as the race calls.
Marshall Cassidy (1979-1985) - Cassidy was the most prominent announcer in racing in the early to mid-1980s, not only for his on-track work but also as a sportscaster calling races for WCBS radio, CBS television, ABC television, NBC television and ESPN television. He was best known for his accuracy, precise diction and upbeat delivery, especially early in his career when calling a close race as the horses ran down the stretch.
Fred Capossela (1954-1960) - From 1950 to 1960, Capossela was the "Voice of the Triple Crown" on CBS Radio and Television.
Jack Drees (1963-1968) - In 1960, he was hired by CBS to call St. Louis Cardinals football games. In 1967/68 he called Super Bowl I and II for the CBS Radio Network. In addition to NFL games, Drees also called college football, golf, and horse races for CBS.
Bryan Field (1948-1966) - He is credited as the one of the first people to apply the term "Triple Crown" to the Kentucky Derby, Preakness Stakes, and Belmont Stakes. Field announced races for CBS television, CBS radio, and Mutual Broadcasting System. As a broadcaster he was noted for his "Irish-British-New York accent". He also went by the name Thomas Bryan George during his early radio career.
Hosts
Mel Allen (1953-1954; 1956) - Shortly after graduating, Allen took a train to New York City for a week's vacation. While on that week's vacation, he auditioned for a staff announcer's position at the CBS Radio Network. CBS executives already knew of Allen; the network's top sportscaster, Ted Husing, had heard many of his Crimson Tide broadcasts. He was hired at $45 a week. He often did non-sports announcing such as for big band remotes, or "emceeing" game shows such as Truth or Consequences, serving as an understudy for both sportscaster Husing and newscaster Bob Trout. In his first year at CBS, he announced the crash of the Hindenburg when the station cut away from singer Kate Smith's show. He first became a national celebrity when he ad libbed for a half-hour during the rain-delayed Vanderbilt Cup from an airplane. In 1939, he was the announcer for the Warner Brothers & Vitaphone film musical short-subject, On the Air, with Leith Stevens and the Saturday Night Swing Club. Stephen Borelli, in his biography How About That?! (a favorite expression of Allen's after an outstanding play by the home team), states that it was at CBS's |
https://en.wikipedia.org/wiki/Thoroughbred%20Racing%20on%20CBS | Thoroughbred Racing on CBS is the de facto title for a series of horse races events whose broadcasts are produced by CBS Sports, the sports division of the CBS television network in the United States.
History
CBS first televised horse racing in 1948 with their broadcast of the Belmont Stakes. CBS would broadcast the Belmont Stakes the following year before losing the rights to NBC for the next three years. CBS would resume broadcasting the Belmont Stakes in 1953 and continue to televise it through 1985.
A year after their inaugural telecast of the Belmont Stakes, CBS broadcast the Preakness Stakes, which they would continue to do so through 1976. In 1977, ABC was awarded the contract to televise the Preakness.
Finally, CBS broadcast the Kentucky Derby from 1952 to 1974. The 1952 Kentucky Derby was the first to be broadcast on network television; Louisville had previously not been connected to network lines.
Notable moments
1973 Preakness Stakes – The time of the race was controversial. When the race ended, the official time for Secretariat was listed on the infield teletimer as 1:55. However, multiple clockers disagreed. The track's electronic timer had malfunctioned because of damage caused by members of the crowd crossing the track to reach the infield. The Pimlico Race Course clocker, E.T. McLean Jr., announced a hand time of 1:. However, two veteran Daily Racing Form clockers claimed the time was 1:, which would have broken the track record of 1:54 by Cañonero II in 1971. Tapes of Secretariat and Cañonero II were played side by side by CBS, and Secretariat got to the finish line first on tape, though this was not a reliable method of timing a horse race at the time. The Maryland Jockey Club, which managed the Pimlico racetrack and is responsible for maintaining Preakness records, reviewed the tapes of the 1973 race and the 1971 race, which held the record at the time, and found Secretariat had finished ahead of Cañonero II. However, the Jockey Club discarded both the electronic and Daily Racing Form times and recognized 1: as the official time, slower than Cañonero's. But Daily Racing Form, for the first time in history, printed its own clocking of 1:53 next to the official time in the chart of the race. Then, on June 19, 2012, a special meeting of the Maryland Racing Commission was convened at Laurel Park at the request of Penny Chenery, Secretariat's owner, who hired companies to conduct a forensic review of the videotapes of the race, and Thomas Chuckas, the president of the Maryland Jockey Club. After over two hours of testimony, the commission unanimously voted to change the time of Secretariat's win from 1:54 to 1:53, establishing a new stakes record. The Daily Racing Form then announced that it would honor the commission's ruling with regard to the running time.
1973 Belmont Stakes – Secretariat became the ninth Triple Crown winner in history, and the first in 25 years since Citation. CBS Television announcer Chic Anderson descri |
https://en.wikipedia.org/wiki/Oil%20discharge%20monitoring%20equipment | Oil discharge monitoring equipment (ODME) is based on a measurement of oil content in the ballast and slop water, to measure conformance with regulations. The apparatus is equipped with a GPS, data recording functionality, an oil content meter and a flow meter. By use of data interpretation, a computing unit will be able to allow the discharge to continue or it will stop it using a valve outside the deck.
Operating principle
A sample point on the discharge line allows for the analyzer to determine the oil content of the ballast now and slop water in PPM. The analyzer is self-maintaining by periodical cleansings with fresh water, and therefore requires a minimum of active maintenance from the crew. The results of the analyzer are sent to a computer, which determines whether the oil content values are to result in overboard discharge or not. The valves that direct the ballast water either over board or to slop tank are controlled by the integrated computer, and a GPS signal further automates the process by including special areas and completes the required input for the Oil Record Book.
All oil tankers with a gross tonnage of larger than 150 must have efficient Oil Discharge Monitoring Equipment on board.
The oily discharge is sent out to sea through a pump. The oily mixture has to pass through a series of sensors to determine whether it is acceptable to be sent to the discharge pipe.
Based on regulations, the following values must be recorded by the system:
Date and time of the discharge
Location of the ship
Oil content of the discharge in ppm
Total quantity discharged
Discharge rate
All records of Oil Detection Monitoring Equipment must be stored on board ships for no less than 3 years.
Oil Discharge Monitoring systems today consist of a computing unit that is installed in the cargo control room. The computer unit control and receives data from other ODME components.
ODME systems also have an analyzing unit that contains the Oil content meter, a fresh water valve for cleaning purposes, and a pressure transmitter that monitors the sample flow through the measuring cell.
See also
Marpol 73/78
Marpol Annex I
Oily water separators
Oily water separator (marine)
Oil Content Meter
Magic Pipe
IMO
Port Reception Facilities
References
Waste treatment technology
Ocean pollution |
https://en.wikipedia.org/wiki/OS%20X%20El%20Capitan | OS X El Capitan ( ) () is the twelfth major release of macOS (named OS X at the time of El Capitan's release), Apple Inc.'s desktop and server operating system for Macintosh. It focuses mainly on performance, stability, and security. Following the California location-based naming scheme introduced with OS X Mavericks, El Capitan was named after a rock formation in Yosemite National Park. El Capitan is the final version to be released under the name OS X. OS X El Capitan received far better reviews than Yosemite.
The first beta of OS X El Capitan was released to developers shortly following the WWDC keynote on June 8, 2015. The first public beta was made available on July 9, 2015. There were multiple betas released after the keynote. OS X El Capitan was released to end users on September 30, 2015, as a free upgrade through the Mac App Store.
OS X El Capitan is the final version of OS X to Aluminum Macs and Xserve, as its successor, macOS Sierra drops support for the mid 2007 and final models.
System requirements
All the Macs supporting OS X Yosemite support OS X El Capitan, although not all of its features will work on older models. For example, Apple notes that the newly available Metal API is available on "all Macs since 2012".
These computers can run El Capitan, provided they have at least 2 GB of RAM, with an exception:
iMac (Mid 2007 or later)
MacBook (Aluminum, Late 2008 or later)
MacBook Air (Late 2008 or later)
MacBook Pro (Mid 2007 or later)
Mac Mini (Early 2009 or later)
Mac Pro (Early 2008 or later)
Xserve (Early 2009)
Of these computers, the following models were equipped with 1 GB RAM as the standard option on the base model when they were shipped originally. They can only run OS X El Capitan if they have at least 2 GB of RAM.
iMac (Mid 2007 - Early 2008)
Mac Mini (Early 2009)
The following computers support features such as Handoff, Instant Hotspot, AirDrop between Mac computers and iOS devices, as well as the new Metal API:
iMac (Late 2012 or later)
MacBook (Early 2015 or later)
MacBook Air (Mid 2012 or later)
MacBook Pro (Mid 2012 or later)
Mac Mini (Late 2012 or later)
Mac Pro (Late 2013)
The upgrade varies in size depending upon which Apple Mac computer it is being installed on; in most scenarios, it will require about 6 GB of disk space.
Features
OS X El Capitan includes features to improve the security, performance, design and usability of OS X. Compared to OS X Yosemite, Apple says that opening PDFs is four times faster, app switching and viewing messages in Mail is twice as fast and launching apps is 40% faster. The maximum amount of memory that could be allocated to the graphics processor has been increased from 1024 MB to 1536 MB on Macs with an Intel HD 4000 GPU. OS X El Capitan supports Metal, Apple's graphics API introduced in iOS 8 to speed up performance in games and professional applications. Apple's typeface San Francisco replaces Helvetica Neue as the system typeface. OS X El Capitan also adopts LibreSSL in |
https://en.wikipedia.org/wiki/Linudden%20Nature%20Reserve | Linudden Nature Reserve () is a nature reserve in Södermanland County in Sweden. It is part of the EU-wide Natura 2000-network.
The purpose of the nature reserve is to preserve an area of mixed broadleaf forest dominated by birch, aspen, linden and common hazel. The flora contains species such as unspotted lungwort, Viola mirabilis, common toothwort and giant bellflower. The nature reserve also has a rich bird-life, rich in Old World warblers but the nature reserve also serves as a habitat for species such as nightingale, Eurasian wryneck and different kinds of woodpeckers. Sörmlandsleden passes through the nature reserve.
References
Nature reserves in Sweden
Tourist attractions in Södermanland County
Geography of Södermanland County
Protected areas established in 1947
1947 establishments in Sweden
Natura 2000 in Sweden |
https://en.wikipedia.org/wiki/Stora%20B%C3%B6tet%20Nature%20Reserve | Stora Bötet Nature Reserve () is a nature reserve in Södermanland County in Sweden. It is part of the EU-wide Natura 2000-network.
The nature reserve serves to protect one of the largest bogs in the Södermanland County. The bog has a sparse vegetation, consisting mainly of Scots pine, Marsh Labrador tea and bog bilberry. The bog has a rich bird-life, with the black grouse using the area for their annual mating ritual. Different species of waders and ducks can also be found in the nature reserve, as well as owls in certain years. Sörmlandsleden passes through the nature reserve.
References
Nature reserves in Sweden
Tourist attractions in Södermanland County
Geography of Södermanland County
Protected areas established in 1997
1997 establishments in Sweden
Natura 2000 in Sweden |
https://en.wikipedia.org/wiki/Strandstuviken%20Nature%20Reserve | Strandstuviken Nature Reserve () is a nature reserve in Södermanland County in Sweden. It is part of the EU-wide Natura 2000-network.
The nature reserve lies along a stretch the Baltic Sea coast and is one of the most important stop-over areas for migratory birds. It consists of several narrow spits, shallow bays and beach meadows, as well as a variation of forest types further inland. Sörmlandsleden passes through the reserve.
Bird-life
Strandstuviken Nature Reserve is first and foremost an important area for resting migratory birds, and is well known by local ornithologists; in the northern part of the nature reserve there is an observation tower for the convenience of bird-watchers. The bird-fauna of the area is among the best documented in the entire county. Among the birds that use the nature reserve as a stop-over are tufted duck, common pochard, greater scaup, common goldeneye, northern pintail, Eurasian wigeon, mute swan, whooper swan, goosander and smew, as well as almost all types of waders found in Sweden. In addition, certain species use the area as a breeding ground: such species include raven, little ringed plover and grey heron.
Flora
The nature reserve also provides a habitat for some unusual plants. Sesleria caerulea and Gentianella uliginosa are examples of plants that thrive in this landscape, which is of a type that is becoming less and less common.
References
Nature reserves in Sweden
Tourist attractions in Södermanland County
Geography of Södermanland County
Protected areas established in 1989
1989 establishments in Sweden
Natura 2000 in Sweden |
https://en.wikipedia.org/wiki/Overclocked%20%28album%29 | Overclocked is the first widely available studio album by American blues rock musician and computer scientist Jim Allchin. It was released on September 13, 2011 by Sandy Key Music. The title of the album and first track is a reference to overclocking – deliberately increasing the clock speed of a CPU past the rated amount – resulting in a faster system while generating increased heat often requiring additional cooling.
Reception
Overclocked received widespread positive comments and ratings by reviewers.
Track listing
Personnel
Musicians
Jim Allchin – guitar, vocals, arrangements
Chris Leighton and Ben Smith – drums, percussion
Garey Shelton – bass
Ty Ballie and David Gross – keyboard
Guest musicians
Keely Whitney – vocals on "One for the Money" and "Perfect Game"
Martin Ros, Mycle Wastman, Keely Whitney – background vocals
Colin Pulkrabek – trombone
Josh Gailey – trumpet
Scott Macpherson – tenor sax
New York Brass - horns
Additional personnel
Glenn Lorbecki – production assistance, engineering, mixing
Eric Oz – production assistance, engineering, mixing
James Nixon – engineering
Glenn Lorbecki – rhythm guitar
Ed Brooks - mastering, RFI, Seattle
Susan Doupe – photography
References
2011 albums
Jim Allchin albums |
https://en.wikipedia.org/wiki/Desmond%20G.%20Higgins | Desmond Gerard Higgins is a Professor of Bioinformatics at University College Dublin, widely known for CLUSTAL, a series of computer programs for performing multiple sequence alignment. According to Nature, Higgins' papers describing CLUSTAL are among the top ten most highly cited scientific papers of all time.
Education
Higgins was educated at Trinity College, Dublin where he was awarded a PhD in 1988 for research on numerical taxonomy of Pterygote insects.
Research
Research in the Higgins laboratory focuses on developing new bioinformatics and statistical tools for evolutionary biology. The CLUSTAL program for multiple sequence alignment has been developed in the Higgins lab and the T-Coffee software was initially developed in the lab with by Cedric Notredame. Multivariate statistics are used to analyse microarray data sets and molecular evolution such as the evolution of promoters, introns and non-coding RNA.
Awards and honours
Higgins was elected a Fellow of the International Society for Computational Biology (ISCB) in 2015. He was awarded the Kimura Motoo Award in 2016 for his contributions to the advancement of evolutionary biology and molecular phylogeny. In 2018, Higgins received the Benjamin Franklin Award for open access in the life sciences. In March 2023, Higgins was awarded the Lennart Philipson Award in recognition of his major contributions towards enabling bioinformatics technologies based on multiple sequence alignment.
References
Irish bioinformaticians
Living people
Fellows of the International Society for Computational Biology
1959 births
Academics of University College Dublin
20th-century Irish mathematicians
21st-century Irish mathematicians
20th-century Irish biologists
21st-century Irish biologists |
https://en.wikipedia.org/wiki/Illinois%20High-Speed%20Rail | Illinois High Speed Rail refers to a set of planned high speed rail lines connecting Chicago Union Station (aka the Chicago Hub Network) to various parts of the state and beyond. Two lines already offer increased speeds.
The Michigan Line, which hosts the Blue Water and Wolverine services, has a long section in Indiana and Michigan owned by Amtrak. Since Amtrak has priority on this track (and another section in Michigan) and converted it to using positive train control, they have increased speeds over those sections to .
The Lincoln Service between Chicago and St. Louis has been upgraded and has trains running at (faster than the prior limit). Service at speeds of 110 mph and higher was slated to begin in 2019. On 3 May 2023, officials with Amtrak and the Illinois Department of Transportation have cleared the railroad company to set new maximum speeds for their trains through select corridors in Illinois, with some trains now allowed to reach speeds of 110 miles per hour.
There has also been some talk of service from Chicago O'Hare International Airport to Rockford railway station. Studies began in 2015 to look into the construction and contracting on the project.
In 2022, Amtrak received $3,000,000 in federal funds to support the final design of improvements to the concourse level of Chicago Union Station. Amtrak, Illinois Department of Transportation, Metra, Chicago Department of Transportation, and Cook County will provide a 50% match. The same year, Amtrak submitted an application for $251 million in federal funding aimed at supporting several goals considered necessary by advocates for high-speed rail in the midwest. The Chicago DOT, Cook County, Illinois DOT, Michigan DOT and Metra are funding partners in the program.
References
External links
IDOT Illinois High Speed Rail
High-speed railway lines in the United States
Proposed railway lines in Illinois
Rail transportation in Illinois |
https://en.wikipedia.org/wiki/Apple%20Music%201 | Apple Music 1, previously branded as Beats 1, is a 24/7 music radio station owned and operated by Apple Inc. It is accessible through iTunes or the Apple Music app on a computer, smartphone or tablet, smart speaker (such as the Apple HomePod), and through the Apple Music web browser app.
Apple Music 1 airs a mix of pop, rap and indie music. Prime-time presenters include Zane Lowe, Ebro Darden and Matt Wilkinson.
Apple Music Hits airs a mixed Hot adult contemporary/Adult hits format, offering a full catalog of the biggest songs from the '80s, '90s, and 2000s.
Apple Music Country offers a mix of country songs old and new.
Apple Music Radio is streamed at 64kbit/s and 256kbit/s, utilising HTTP Live Streaming protocol and the HE-AAC audio codec, powered by StreamS Live Encoder.
History
Apple bought audio equipment maker Beats Electronics in 2014, which included the ownership of Beats' former music service Beats Music, and made Beats Music CEO Ian Rogers responsible for the iTunes Radio service. Business Insider later reported that Apple was planning to merge the two services. Apple also hired Zane Lowe as a music curator.
The day of Beats 1's launch, The Guardian revealed that they had been given pre-recorded examples of Beats 1 programming, and said it "suggests an eclectic mix of programming to fill the 24-hours-a-day of broadcasting."
On September 29, 2015, Zane Lowe said he wasn't sure that Apple Music needed Beats 1, but said "I hope that there's a place for it, however I really doubt it."
In December 2015, rumors spread that Apple would expand on the Beats 1 brand and give it sister stations, after Apple registered trademarks for four additional Beats stations.
In September 2016, Apple refreshed the Apple Music interface with the release of iTunes 12.5 and iOS 10. Beats 1 reportedly became harder to get to, due to the clunky interface of iOS 10's Music app.
In March 2017, Apple claimed that Beats 1 was "the biggest radio station in the world" and beat all other music stations in concurrent listeners.
In March 2020, Beats 1 transitioned to remote broadcasting from the respective homes of the radio hosts in light of the coronavirus outbreak.
In May 2020, London headline host Julie Adenuga announced she was leaving Beats 1 after her years on the station since its inception.
On August 18, 2020, Apple announced the rebranding of Beats 1 to Apple Music 1 and the launch of two new radio stations, Apple Music Hits and Apple Music Country, featuring exclusive original shows from the world's top music hosts and artists.
Reception
Reception for the Apple-run station has been mixed. Quartz analyzed the track list of songs that were aired on Beats 1 in its second week. "Though Beats 1 is an eclectic mix of genres, some listeners have complained that it plays too much hip-hop." However, they did note that "there is a reasonable amount of diversity..."
Mashable complained of "dynamic-range compression, which squashes the volume range of audi |
https://en.wikipedia.org/wiki/68th%20Primetime%20Emmy%20Awards | The 68th Primetime Emmy Awards honored the best in US prime time television programming from June 1, 2015 until May 31, 2016, as chosen by the Academy of Television Arts & Sciences. The ceremony was held on Sunday, September 18, 2016 at the Microsoft Theater in Downtown Los Angeles, California, and was broadcast in the U.S. by ABC. The ceremony was hosted by Jimmy Kimmel. It was preceded by the 68th Primetime Creative Arts Emmy Awards, which took place over two nights, September 10 and 11, at the Microsoft Theater.
The nominations were announced by Anthony Anderson and Lauren Graham on July 14, 2016. The crime anthology limited series The People v. O. J. Simpson: American Crime Story was the most nominated program at the ceremony with 13, and 22 overall, although Game of Thrones received the most overall nominations that year with 23 as the most nominated drama series.
With five awards, The People v. O. J. Simpson: American Crime Story won the most awards of the night, while the fantasy drama series Game of Thrones won three, including Outstanding Drama Series and surpassed Frasier (37) as the fictional television program with the most Primetime Emmy Awards with 38 wins in six seasons. The Game of Thrones win was also the second time a Sixth season of any show, had won the Outstanding Drama award, after fellow HBO show, The Sopranos Sixth season had won it, in 2007.
Additionally, the political satire series Veep won Outstanding Comedy Series for the second time in a row, while its producer and lead star Julia Louis-Dreyfus established a new record of wins for Outstanding Lead Actress in a Comedy Series; it was her fifth consecutive win for the series, sixth overall in the category and her seventh overall win as an actor.
For the first time, none of the nominees for Outstanding Supporting Actress in a Drama Series were from the four major American broadcasting TV networks. In addition, Ben Mendelsohn became the first actor to win Outstanding Supporting Actor in a Drama Series for a series from a streaming service network; he won for Bloodline from Netflix.
This is the first and, as of 2020, the only ceremony where no network received more than one nomination in the Drama Series category. That feat occurred for the first in the Comedy Series category in 2023.
Winners and nominees
Winners are listed first, highlighted in boldface, and indicated with a double dagger (‡). For simplicity, producers who received nominations for program awards have been omitted.
Programs
Acting
Lead performances
Supporting performances
Directing
Writing
Most major nominations
Most major awards
Notes
Presenters and performers
The awards were presented by the following:
Presenters
Performers
In Memoriam
Very early on in the show, Jeffrey Tambor paid tribute to Garry Shandling. Later, before introducing the segment, Henry Winkler paid tribute to producer, actor and director Garry Marshall. Singer-songwriter Tori Kelly sang "Hallelujah" as photos were sho |
https://en.wikipedia.org/wiki/Vikram%20Adve | Vikram Adve (born 28 June 1966) is the Donald B. Gillies professor in the Department of Computer Science and a Professor in Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign.
Academia
In 2020, Vikram Adve became a co-founder and co-director of the Center for Digital Agriculture and leads AIFARMS, a $20M National Artificial Intelligence Research Institute funded by NIFA and NSF at University of Illinois at Urbana-Champaign.
Vikram Adve, along with Chris Lattner, designed and developed the LLVM compiler infrastructure project in 2001. Vikram Adve and Chris Lattner received the 2012 ACM Software System Award for the LLVM software system.
Vikram Adve's research interests include compilers and programming languages, and edge computing, approximate computing, software security, system reliability, and parallel programming. His group open-sourced the HPVM compiler infrastructure for various Central processing unit and Graphics processing unit architectures, Field-programmable gate array and domain-specific accelerators.
Vikram Adve served as interim head of University of Illinois Department of Computer Science from 2017 to 2019.
Prior to joining the faculty at University of Illinois Urbana-Champaign, he was a research scientist at Rice University from 1993 to 1999. He got his PhD degree from University of Wisconsin-Madison in 1993.
See also
Chris Lattner
Mary K. Vernon
References
University of Illinois Urbana-Champaign faculty
IIT Bombay alumni
Living people
1966 births |
https://en.wikipedia.org/wiki/Steven%20J.%20Miller | Steven Joel Miller is a mathematician who specializes in analytic number theory and has also worked in applied fields such as sabermetrics and linear programming. He is a co-author, with Ramin Takloo-Bighash, of An Invitation to Modern Number Theory (Princeton University Press, 2006), with Midge Cozzens of The Mathematics of Encryption: An Elementary Introduction (AMS Mathematical World series 29, Providence, RI, 2013), and with Stephan Ramon Garcia of ``100 Years of Math Milestones: The Pi Mu Epsilon Centennial Collection (American Mathematical Society, 2019). He also edited Theory and Applications of Benford's Law (Princeton University Press, 2015) and wrote The Mathematics of Optimization: How to do things faster (AMS Pure and Applied Undergraduate Texts Volume: 30; 2017) and ``The Probability Lifesaver: All the Tools You Need to Understand Chance (Princeton University Press, 2017). He has written over 100 papers in topics including accounting, Benford's law, computer science, economics, marketing, mathematics, physics, probability, sabermetrics, and statistics, available on the arXiv and his homepage.
Academic career
Miller earned his B.S. in mathematics and physics at Yale University and completed his graduate studies in mathematics at Princeton University in 2002. His Ph.D. thesis, titled "1 and 2 Level Densities for Families of Elliptic Curves: Evidence for the Underlying Group Symmetries," was written under the direction of Peter Sarnak and Henryk Iwaniec. He is currently a professor of mathematics at Williams College, where he has served as the Director of the Williams SMALL REU Program and is currently the faculty president of the Williams Phi Beta Kappa chapter. He's also a faculty fellow at the Erdos Institute.
He was included in the 2019 class of fellows of the American Mathematical Society "for contributions to number theory and service to the mathematical community, particularly in support of mentoring undergraduate research".
Books
Miller has published six books.
100 Years of Math Milestones: The Pi Mu Epsilon Centennial Collection (with Stephan Ramon Garcia): https://bookstore.ams.org/mbk-121
Benford's Law: Theory and Applications (editor): https://press.princeton.edu/books/hardcover/9780691147611/benfords-law
An Invitation to Modern Number Theory (with Ramin Takloo-Bighash): https://press.princeton.edu/books/hardcover/9780691120607/an-invitation-to-modern-number-theory
The Mathematics of Encryption: An Elementary Introduction (with Margaret Cozzens): https://bookstore.ams.org/mawrld-29
Mathematics of Optimization: How to do Things Faster: https://bookstore.ams.org/amstext-30/
The Probability Lifesaver: All the Tools You Need to Understand Chance: https://press.princeton.edu/books/hardcover/9780691149547/the-probability-lifesaver
Controversies
In the aftermath of the 2020 United States presidential election Miller performed a statistical analysis of the integrity of mail in voting in Pennsylvania. The data underlying |
https://en.wikipedia.org/wiki/Baruch%20Barzel | Baruch Barzel (March 19, 1976) is an Israeli physicist and applied mathematician at Bar-Ilan University,
a member of the Gonda Multidisciplinary Brain Research Center and of the Bar-Ilan Data Science Institute. His main research areas are statistical physics, complex systems, nonlinear dynamics and network science.
In 2013 he introduced the concept of universality in the dynamics of complex networks, showing that complex systems from different domains condense into discrete forms, or universality classes, of dynamic behavior. In the following years, Barzel and colleagues developed a theoretical framework to predict the observed behavior of complex networked systems: their patterns of information flow; the timescales of their signal propagation; their resilience against failures and disruptions and their recoverability.
During the COVID-19 Pandemic Barzel's lab published the alternating quarantine strategy to mitigate the spread of SARS-CoV-2 alongside continuous socioeconomic activity. The strategy was implemented by several agencies in Israel and around the world.
Academic career
Barzel completed his Ph.D. in physics at the Hebrew University of Jerusalem, Israel
as a Hoffman Fellow.
He then pursued his postdoctoral training at the Center for Complex Network Research at Northeastern University
and at the Channing Division of Network Medicine, Harvard Medical School. Barzel is a recipient of the Racah prize (2007) and the Krill prize of the Wolf Foundation (2019). Barzel is also an active public lecturer on science and on Judaism, and presents a weekly corner on Jewish thought on Israeli Public Broadcasting Corporation
.
Dr. Barzel's research focuses on the dynamic behavior of complex networks, uncovering universal principles that govern the dynamics of diverse systems, such as disease spreading, gene regulatory networks, protein interactions or population dynamics.
Selected publications
J. Gao, B. Barzel and A.-L. Barabási, "Universal resilience patterns in complex networks", Nature 530, 307 (2016)
U. Harush and B. Barzel, "Dynamic patterns of information flow in complex networks", Nature Communications 8, 2181 (2017)
C. Hens, U. Harush, S. Haber, R. Cohen and B. Barzel, "Spatiotemporal signal propagation in complex networks", Nature Physics (2019)
D. Meidan, N. Schulmann, R. Cohen, S. Haber, E. Yaniv, R. Sarid and B. Barzel, Alternating quarantine for sustainable epidemic mitigation. Nature Communications 12, 220 (2021).
H. Sanhedrai, J. Gao, A. Bashan, M. Schwartz, S. Havlin and B. Barzel, Reviving a failed network through microscopic interventions. Nature Physics 18, 338 (2022).
C. Meena, C. Hens, S. Acharyya, S. Haber, S. Boccaletti and B. Barzel, Emergent stability in complex network dynamics. Nature Physics (2023).
Public lectures and media coverage
Universal resilience patterns in complex networks in Ynet (Hebrew)
Bar-Ilan Nitzotzot meeting 2015 (Hebrew) "Connecting the world in six steps"
Interview on Channel 20, 2019 (Hebrew)
|
https://en.wikipedia.org/wiki/DWLD | DWLD (88.7 FM), broadcasting as 88.7 DCG FM, is a radio station owned and operated by DCG Radio-TV Network. The station's studio is located in Batangas City, and its transmitter is located at Mt. Banoy, Talumpok Silangan, Batangas City.
History
The station was established in October 2010 as Majic 88.7. At that time, it was operated by BPS Broadcasting Media Services, with studios located at the 3rd Floor, Zen's Building, Ayala Highway, Brgy. Balintawak, Lipa, Batangas. In September 2020, DCG took over the station's operations. It rebranded as 88.7 DCG FM and switched to an all-OPM format.
References
Radio stations in Batangas
Radio stations established in 2010 |
https://en.wikipedia.org/wiki/Zemanek | Zemanek is a Czech surname. Notable people with the surname include:
Bohumil Zemánek (1942–1996), Czech sculptor
Heinz Zemanek (1920–2014), Austrian computer pioneer
John Zemanek (1921–2016), American architect
Stan Zemanek (1947–2007), Australian radio broadcaster
Czech-language surnames |
https://en.wikipedia.org/wiki/EIDORS | EIDORS is an open-source software tool box written mainly in MATLAB/GNU Octave designed primarily for image reconstruction from electrical impedance tomography (EIT) data, in a biomedical, industrial or geophysical setting. The name was originally an acronym for Electrical Impedance Tomography and Diffuse Optical Reconstruction Software. While the name reflects the original intention to cover image reconstruction of data from the mathematically similar near infra red diffuse optical imaging, to date there has been little development in that area.
The project was launched in 1999 with a Matlab code for 2D EIT reconstruction which had its origin in the PhD thesis of Marko Vauhkonen and the work of his supervisor Jari Kaipio at the University of Kuopio. While Kuopio also developed a three dimensional EIT code this was not released as open-source. Instead the three dimensional version of EIDORS was developed from work done at UMIST (now University of Manchester) by Nick Polydorides and William Lionheart.
Methods and models
The forward models in EIDORS use the finite element method and this requires mesh generation for sometimes irregular objects (such as human bodies), and the meshing needs to reflect the electrodes used to drive and measure current in EIT. For this purpose an interface was developed to the Netgen Mesh Generator.
History
As the project grew there was a desire to incorporate forward modelling and reconstruction code from a variety of groups and Andy Adler and Lionheart developed a more extensible software system. The most recent version is 3.10, released in Dec, 2019.
The EIDORS project also includes a repository of EIT data distributed under open-source licenses.
Applications
EIDORS has been extensively used in biomedical applications of EIT, including lung imaging, measuring cardiac output. It has been used for investigation of imaging electrical activity in the brain, and monitoring conductivity changes during radio-frequency ablation. Outside medical imaging the toolbox has been used in process tomography, geophysics and materials science.
References
External links
EIDORS website on Sourceforge
Medical imaging
Inverse problems |
https://en.wikipedia.org/wiki/Shri%20Mahaveerji%20railway%20station | Shri Mahaveerji (SMVJ) is a railway station on the West Central railway network at Hindaun Tehsil in India. It comes under the Kota railway division of West Central Railway zone. This is a Grade-C station on the Delhi–Mumbai route. It serves Hindaun city. The station consists of three platforms. The station is about 7 Km away from Shri Mahaveer Ji temple.
Major trains
Indore–New Delhi Intercity Express
Mewar Express
Kota–Hazrat Nizamuddin Jan Shatabdi Express
Agra Fort–Kota Passenger (unreserved)
Hazrat Nizamuddin–Kota SF Special Fare Special
Sawai Madhopur Mathura Passenger (unreserved)
Mathura Sawai Madhopur Passenger (unreserved)
Avadh Express
Meerut City–Mandasor Link Express
Parasnath SF Express
Firozpur Janta Express
Mathura Ratlam Passenger (unreserved)
Haldighati Passenger
Kota Agra Yamuna Bridge Passenger (unreserved)
Golden Temple Mail
Jaipur Bayana Fast Passenger (unreserved)
See also
Hindaun
Hindaun City railway station
Gangapur City railway station
References
Railway stations in Karauli district
Kota railway division |
https://en.wikipedia.org/wiki/Danny%20Zappin | Danny Zappin (born 1975) is an American businessman. He is the co-founder of Maker Studios, and the founder, president and CEO of Zealot Networks.
Early life and education
Zappin was born in Columbus, Ohio. His mother ran a Christian heavy-metal record label. His brother is hip hop artist John Reuben. He spent a few quarters at Ohio State University before moving to Florida. In the mid-1990s, he moved to New York, and then to Los Angeles to pursue a career as an actor. He had a small role in the 1999 Spike Lee film Summer of Sam. In 2001, Zappin was convicted of felony drug possession for smuggling Ecstasy. He was sentenced to two years in prison, and released to home confinement in 2004.
Career
Internet videos
Zappin began creating videos for the Internet in the early 2000s, while working for CrapTV, an early online video streaming website. In mid-2005, he began uploading videos to the then new website YouTube under the name Danny Diamond. Along with several other YouTube content creators, he began signing up online talent to create a digital studio for YouTube.
Maker Studios
In 2009, Zappin co-founded the YouTube multichannel network and online video producer Maker Studios, serving as its CEO until his resignation in April 2013. Founded in Venice, California, Maker was one of the first content providers on YouTube to reach 1 million views. By the end of 2012, Maker was one of the top five networks on YouTube, with over 2 billion views per month, according to comScore. The idea behind Maker was to create a new type of studio model, a collaborative, creator-friendly multichannel network helping to boost views and better monetize online short-form content. Zappin is considered to be one of the first to recognize the platform's potential for new types of content and talent.
Zappin's legal history came up in the midst of a 2012 dispute between Maker Studios and YouTube celebrity Ray William Johnson over the terms of a new contract.
In June 2013, two months after his resignation, Zappin sued Maker Studios' partners and investors, alleging there was a conspiracy to oust him from the board. Along with three other former Maker executives, he sued Maker for a second time in April 2014, to block a shareholder vote on the acquisition of the company by the Walt Disney Company, shortly after the studio agreed to purchase Maker in a deal worth up to $950 million. The lawsuit was rejected by a California judge and the sale went through. Zappin earned $25 million in the sale.
On October 17, 2013, Zappin announced that he had acquired digital entertainment news website NewMediaRockstars, intending to broaden its coverage of new media.
Zealot Networks
In the summer of 2014, Zappin raised $25 million from former and current Maker employees, talent and executives, along with his own money, to form Zealot Networks. In an August 2014 press release, Zappin announced the launch of his new digital media company, "a digital-first media company and growth accelera |
https://en.wikipedia.org/wiki/Sierra%20del%20Cuera | Sierra del Cuera is an integrated network of protected areas in Asturias, Spain.
The landscape stretches over an area which affects five municipalities of the region: Cabrales, Llanes, Peñamellera Alta, Peñamellera Baja and Ribadedeva. It could be defined as a coastal ridge about 40 kilometers long that begins at the Sella River and is spreading near the sea into the Deva River. The protected landscape is excluded from the western part of the mountain, that is, the surface between the Bedón River and the Sella River.
Protected areas of Asturias |
https://en.wikipedia.org/wiki/Terry%20A.%20Davis | Terrence Andrew Davis (December 15, 1969 – August 11, 2018) was an American programmer who created and designed TempleOS, a public domain operating system. Its development was an extremely complex, time-consuming and unusual undertaking for one person.
As a teenager, Davis learned assembly language on a Commodore 64. He later earned a master's degree in electrical engineering from Arizona State University and worked for several years at Ticketmaster as a programmer for VAX machines. In 1996, he began experiencing regular manic episodes, one of which led him to hospitalization. Initially diagnosed with bipolar disorder, he was later declared to have schizophrenia. He subsequently collected disability payments and resided in Las Vegas with his parents until 2017.
Davis grew up as a Catholic and was an atheist for some of his adult life. After experiencing a self-described "revelation", he proclaimed that he had been in direct communication with God and that God had commanded him to build a successor to the Second Temple. He then committed a decade to creating an operating system modeled after the DOS-based interfaces of his youth. In 2013, Davis announced that he had completed the project, now called "TempleOS". The operating system was generally regarded as a hobby system, not suitable for general use, but Davis received sympathy and support for bringing the project to fruition.
During his final years, Davis amassed an online following and regularly posted video blogs to social media. Although he remained lucid when discussing computer-related subjects, his communication skills were significantly affected by his schizophrenia. He was controversial for his regular use of slurs, which he explained was his way of combating factors of psychological warfare. After 2017, he struggled with periods of homelessness and incarceration. In 2018, he was struck by a train and died at the age of 48.
Early life and career
Terrence Andrew Davis was born in West Allis, Wisconsin, later moving to Washington, Michigan, California and Arizona. He was the seventh of eight children, and his father was an industrial engineer. As a child, Davis used an Apple II at his elementary school, and as a teenager, learned assembly language on a Commodore 64. He earned a master's degree in electrical engineering from Arizona State University in 1994 and worked for several years at Ticketmaster as a programmer for VAX machines. On the subject of his certifications, he wrote in 2011: "Everybody knows electrical is higher in the engineering pecking order than CS because it requires real math ;-) I'm a rocket scientist, though, not a very good one".
Onset of illness and spiritual awakening
Davis grew up Catholic, but was an atheist for some of his adult life before experiencing what he called a "revelation from God". Starting in 1996, Davis was admitted to a psychiatric ward approximately every six months due to reoccurring manic episodes. In March, he had begun experiencing reg |
https://en.wikipedia.org/wiki/Human%20Resource%20Machine | Human Resource Machine is a visual programming-based puzzle video game developed by Tomorrow Corporation. The game was released for Microsoft Windows, OS X and Wii U in 2015, being additionally released for Linux in March 2016, for iOS in June 2016, for Android in December 2016 and for the Nintendo Switch in March 2017. Human Resource Machine uses the concept of a corporate office worker assigned to perform tasks that involve moving objects between an inbox, an outbox, and to and from storage areas as a metaphor for assembly language concepts. The player works through some forty puzzles in constructing a program to complete a specific task.
A sequel, 7 Billion Humans, was released on August 23, 2018.
Gameplay
The game includes approximately 40 programming puzzles, each considered one "year" of the player's avatar tenure in a corporate structure. In each puzzle, the player creates a list of instructions from rudimentary commands to control the movements of their avatar on an overhead view of an office; the office includes two conveyor belts, one an inbox that sends in either an integer or a single alphabetic character represented as a small box, the other an outbox to receive these. The office floor typically also includes a number of marked number spaces that can hold one box each. For each puzzle, the player is told of a specific task, such as adding two numbers as they come in on the inbox, or sorting a zero-terminated string of characters, delivering these results in the proper order to the outbox.
The player uses simple commands to create a list of instructions to perform the given task. Such commands include picking up the first item at the inbox, placing the item the avatar is currently carrying at the outbox, copying the carried item to a marked square, performing addition or subtraction of the carried item with the item at the marked square, and making decisions based on the value of the carried item such as if it is zero or negative. As such, these mimic the elements of assembly language: the simple instructions equivalent to opcodes, the ability of the avatar to hold an item mirroring a processor register, and the spaces on the office floor representing main memory. Later, the player gains the ability to use the concept of memory addresses, in which they can direct instructions to operate on a specific floor space that is labeled with the number of a different floor space. The visual approach to the language also allows the player to place simple handdrawn notes as labels in both the list of instructions or to label floor spaces for clarity. The loops and jump commands are also marked with arrows to help the player identify the logic flow. Once they have created the program, they can run it through, increasing the speed for longer programs, or pause and move step by step for debugging purposes. If the outbox received any boxes it is not expected for that program, the program will immediately terminate and the player will need to fig |
https://en.wikipedia.org/wiki/Herradura%20%28Ancestral%20Puebloans%29 | Herradura (Spanish: "horseshoe") are architectural features associated with the Ancestral Puebloan road network. They feature three-foot-tall curved masonry walls in the shape of a "D", "C", or horseshoe, with a diameter of . Herraduras are found on hills and berms near Chacoan roads. Many of them are oriented so the opening faces east. They are thought to have indicated changes in road direction. They are not believed to have been residential, but the presence of broken pottery near them suggests they might have been roadside shrines.
References
Bibliography
Archaeological sites in New Mexico
Chaco Canyon
Chaco Culture National Historical Park
Colorado Plateau
Ancestral Puebloans |
https://en.wikipedia.org/wiki/ECPG | ECPG is the standard, in the PostgreSQL database built-in, client programming interface for embedding SQL in programs written in the C programming language. It provides the option for accessing the PostgreSQL database directly from the C code in the application, using SQL commands.
Usage
The usage can be divided to 2 steps. First, a .pgc file has to be created, which consists of C code with embedded SQL code. In such file SQL code will be inserted directly to the application's C code. The SQL commands have to be inserted into the C code in following way:
// ... C code ...
EXEC SQL <sql-statements>;
// ... C code ...
An example how to connect to a database:
EXEC SQL CONNECT TO databasename[@hostname][:port] [AS connectionname] [USER username];
The embedded SQL part will be processed through ECPG preprocessor where SQL code will be replaced with the calls to the ecpg library (libecpg.a or libecpg.so). The .pcg file will be also preprocessed with ecpg, which converts it to a .c file according to the ANSI standards. Therefore, in the second step, the generated .c file can be directly compiled with a standard C compiler.
Following command will create from the my_c_file_with_embedded_sql_commands.pcg file a my_c_file_with_embedded_sql_commands.c file, which can be processed further as a pure C code.
$ ecpg my_c_file_with_embedded_sql_commands.pcg
There is also source code of the ecpg available in the PostgreSQL Source Code git repository.
Note: While compiling the preprocessed .c code, do not forget to link the ecpg library (libepcg), so that the generated calls can find their linked methods.
Using host variables
An important part when embedding SQL database commands in application's code is the data exchange between application and database. For this purpose, host variables can be used. Host variables can be directly used from the embedded SQL code, so there is no need to generate SQL statements with values from the C code manually as string at the runtime.
Assuming there is a variable named variablename in your C code:
EXEC SQL INSERT INTO tablename VALUES (:variablename);
This can be used in any statement, INSERT statement was chosen just as a simple example for illustration.
The above example shows how to pass a C variable to the SQL, but data can be passed also in the opposite direction: back to the application. The following example shows how to pass value from SQL back to the application's C variable.
EXEC SQL BEGIN DECLARE SECTION;
VARCHAR variablename;
EXEC SQL END DECLARE SECTION;
EXEC SQL SELECT columnname INTO :variablename FROM tablename;
For simplicity, let's assume there is only one row in the table table name. This statement will insert the value of the column columnname into the variable variable. Every command that supports the INTO clause can be used in this way, for example the FETCH command.
Error handling
For better error handling, ECPG also provides structure called SQL communication area (sqlca). This structu |
https://en.wikipedia.org/wiki/U.2 | U.2 (pronounced 'u-dot-2'), formerly known as SFF-8639, is a computer interface standard for connecting solid-state drives (SSDs) to a computer. It covers the physical connector, electrical characteristics, and communication protocols.
It was developed for the enterprise market and designed to be used with new PCI Express drives along with SAS and SATA drives. It uses up to four PCI Express lanes and two SATA lanes.
History
The Enterprise SSD form factor was developed by the SSD Form Factor Working Group (SFFWG). The specification was released on December 20, 2011, as a mechanism for providing PCI Express connections to SSDs for the enterprise market. Goals included being usable in existing 2.5" and 3.5" mechanical enclosures, to be hot swappable and to allow legacy SAS and SATA drives to be mixed using the same connector family.
In June 2015, the SFFWG announced that the connector was being renamed to U.2.
Connector
The U.2 connector is mechanically identical to the SATA Express device plug, but provides four PCI Express lanes through a different usage of available pins.
U.2 devices may be connected to an M.2 port using an adapter.
Availability
In November 2015, Intel introduced the 750 series SSD which is available in both PCI Express and U.2 variants.
Since then, U.2 has achieved a high level of support from the major storage vendors and storage appliance suppliers.
U.2 compared with M.2
U.2 allows hot-swap, whereas M.2 does not.
U.2 can use 3.3V or 12V for power, while M.2 only supports 3.3V.
As implemented
While the U.2 standard does not imply a form factor of the device that uses it, in practice U.2 is used only on 2.5" SSDs. 2.5" drives are physically larger than M.2 drives and thus typically have larger capacities.
See also
EDSFF – U.2 successor
M.2
U.3 (SFF-TA-1001)
References
Computer buses
Computer connectors
Serial ATA
Peripheral Component Interconnect
SCSI
Computer storage buses
SATA Express |
https://en.wikipedia.org/wiki/9%20Algorithms%20That%20Changed%20the%20Future | 9 Algorithms that Changed the Future is a 2012 book by John MacCormick on algorithms. The book seeks to explain commonly encountered computer algorithms to a layman audience.
Summary
The chapters in the book each cover an algorithm.
Search engine indexing
PageRank
Public-key cryptography
Forward error correction
Pattern recognition
Data compression
Database
Digital signature
Response
One reviewer said the book is written in a clear and simple style.
A reviewer for New York Journal of Books suggested that this book would be a good complement to an introductory college-level computer science course.
Another reviewer called the book "a valuable addition to the popular computing literature".
2020 edition
The book has been re-released by Princeton University Press in 2020.
References
External links
short video of the author talking about the book
2012 non-fiction books
Computer books
Princeton University Press books |
https://en.wikipedia.org/wiki/Radio%20Tamaulipas | Radio Tamaulipas is the state radio network of Tamaulipas, originating from studios in the capital of Ciudad Victoria and airing on seven FM and three AM transmitters in the state.
Transmitters
Former transmitters
Two further transmitters no longer have valid permits:
References
Radio stations in Ciudad Victoria
Radio stations in Ciudad Mante
Radio stations in Nuevo Laredo
Public radio in Mexico
Radio stations in Matamoros, Tamaulipas
Radio stations in Tampico |
https://en.wikipedia.org/wiki/Dangal%20%28TV%20channel%29 | Dangal TV is a Free-to-air Hindi language general entertainment channel owned by Enterr10 Television Network. It was launched on 2009 as a Bhojpuri language movie channel but it was being converted into hindi entertainment channel. Its programming consists of family dramas, fantasy, and crime shows.
History
Dangal TV was launched as a Bhojpuri Movie Channel in 2009 for India. In 2015, it was converted into a Hindi General Entertainment channel by acquiring and aired most of the Hindi Television shows from the former defunct Entertainment channel Imagine TV and alongside with television channels like DD National, Star Plus, Sony Entertainment Television, Zee TV, Colors TV and Sahara One.
In 2017, Dangal TV makes an entry in original content called Crime Alert (first one hour television show based on the real life crimes in india), Bahurani (first original reality show) and Shivarjun: Ek Ichhadhari Ki Dastaan (first original soap opera) etc. After making an entry to original space. Dangal TV had become the most watched Hindi language entertainment channel by beating paid television channels.
In 2021, Dangal TV makes its dealership with Viacom 18 by streaming their entire shows to their OTT app Voot. And on the same year, they stopped airing acquired shows till October and starts airing only Original based content shows as it was converted into an Original Entertainment channel as their acquired shows had been moved to the newly launched entertainment channel Dangal 2.
Reception
Dangal TV had gained response from hindi speaking viewers by acquiring television shows from hindi television channels and alongside with original shows like Crime Alert, Aye Mere Humsafar, Pyar Ki Luka Chuppi, Ranju Ki Betiyaan, Prem Bandhan.
Programming
Current broadcasts
Formerly broadcasts
Acquired series
Original programming
Anthology series
Children/teen series
Comedy series
Drama series
Mythological series
Reality/Non-Scripted programming
References
External links
Official website
Hindi-language television channels in India
Hindi-language television stations
Television stations in New Delhi |
https://en.wikipedia.org/wiki/Kill%20Chain | Kill Chain may refer to:
Kill chain, a military concept about structured attacks, and later cyber attacks
"Kill Chain", an episode of the television series NCIS
Kill Chain (film), a 2019 film starring Nicolas Cage
Kill Chain: The Cyber War on America's Elections (2020), a documentary film with Harri Hursti
Kill Chain: Drones and the Rise of High-Tech Assassins, a 2015 book by Andrew Cockburn |
https://en.wikipedia.org/wiki/Sony%20Cyber-shot%20DSC-RX100%20IV | The Sony Cyber-shot DSC-RX100 IV is a digital premium compact camera announced by Sony on June 10, 2015 as the fourth entry in the Sony Cyber-shot DSC-RX100 series. It is one of a pair of cameras launched together by Sony that use their new stacked CMOS sensor. The other camera is the Sony Cyber-shot DSC-RX10 II, a model providing a larger lens and greater zoom, but less compact body.
Compared to its predecessors, the RX100 IV also has a faster electronic shutter and increased read-out speed for video, which will also result in a reduction in rolling shutter effect and allow high speed video to be captured.
The camera was succeeded by the RX100 V, which improved upon some of the issues such as buffer and heating that the RX100 IV suffered from particularly in recording video.
See also
Sony Cyber-shot DSC-RX100 series
List of large sensor fixed-lens cameras
References
RX100 IV
Cameras introduced in 2015 |
https://en.wikipedia.org/wiki/Sony%20Cyber-shot%20DSC-RX10%20II | The Sony Cyber-shot DSC-RX10 II is a DSLR-styled digital bridge camera announced by Sony on June 10, 2015. Its main improvement over its predecessor, the 2013 Sony Cyber-shot DSC-RX10, is its 2160p 4K video recording ability, as well as added high-framerate with 1080p doubled to 120fps (real-time and retained audio), and high speed video at 240fps, 480fps, and 960fps.
While filming at up to 1080p and up to 60fps, 17-Megapixel still images can be captured. The "dual video recording" mode allows recording into two separate files with different resolution, where one is more "lightweight" than the other.
See also
Sony Cyber-shot DSC-RX100 series
List of large sensor fixed-lens cameras
List of bridge cameras
Notes
References
http://www.dpreview.com/products/sony/compacts/sony_dscrx10ii/specifications
RX10 II
Bridge digital cameras
Point-and-shoot cameras
Cameras introduced in 2015 |
https://en.wikipedia.org/wiki/Xbox%20Underground | Xbox Underground was an international hacker group responsible for gaining unauthorized access to the computer network of Microsoft and its development partners, including Activision, Epic Games, and Valve, in order to obtain sensitive information relating to Xbox One and Xbox Live.
Microsoft
Microsoft's computer network was compromised repeatedly by the Xbox Underground between 2011 and 2013. According to a 65-page indictment, the hackers spent "hundreds of hours" searching through Microsoft's network copying log-in credentials, source code, technical specifications and other data. This culminated in the perpetrators carrying out a physical theft, by using stolen credentials to enter "a secure building" at Microsoft's Redmond headquarters and exiting with publicly unreleased prototypes of the Xbox One codenamed "Durango". Group members say they were driven by a strong curiosity about Microsoft's then-unreleased Xbox One console and associated software.
Beginning in or about January 2011, Microsoft was the victim of incidents of unauthorized access to its computer networks, including GDNP's protected computer network, which resulted in the theft of log-in credentials, trade secrets and intellectual property relating to its Xbox gaming system. p. 4
In or about September 2013, Alcala and Pokora brokered a physical theft, committed by A.S. and E.A., of multiple Xbox Development Kits (XDKs) from a secure building on Microsoft's Redmond, Washington campus. Using stolen access credentials to a Microsoft building, A.S. and E.A. entered the building and stole three non-public versions of the Xbox One console... p. 31
Apache helicopter simulator software
The group is also accused of breaching the computer network of Zombie Studios, through which they obtained Apache helicopter simulator software developed for the United States military. David Pokora was quoted as saying: "Have you been listening to the [expletive] that I've done this past month? I have [expletive] to the U.S. military. I have [expletive] to the Australian Department of Defense ... I have every single big company – Intel, AMD, Nvidia – any game company you could name, Google, Microsoft, Disney, Warner Bros., everything."
Members
Four members of the group have pleaded guilty to charges. David Pokora, the first foreign hacker ever to be sentenced on United States soil, received an 18-month prison term on April 23, 2014, and was released in July 2015. Holly (formerly Nathan) LeRoux and Sanad Odeh Nesheiwat were sentenced on June 11 and received 24 months and 18 months respectively; Austin Alcala was due for sentencing in July, though, he went on to cooperate with the FBI in resolving another criminal case involving the illegal trade of FIFA coins.
Dylan Wheeler (referred to in the indictment as D.W), currently out of reach of the United States, lived in Australia at the time and was charged with a varying degree of charges. He was not convicted, having fled from Australia to Dubai and ev |
https://en.wikipedia.org/wiki/Lars%20Arge | Lars Allan Arge (8 October 1967 – 23 December 2020) was a Danish computer scientist, the head of the Center for Massive Data Algorithmics (MADALGO) at Aarhus University, where he was also a professor of computer science. His research involved the study of algorithms and data structures for handling massive data, especially in graph algorithms and computational geometry.
Education and career
Arge earned his Ph.D. in 1996 from Aarhus University, under the supervision of Erik Meineche Schmidt. He next did a postdoc at Duke University until 1998. He then became a professor at Duke University before returning to Aarhus as a professor in 2004. He continued to hold an adjunct professorship at Duke.
Awards and honors
Arge was a member of the Royal Danish Academy of Sciences and Letters; he was elected to the presidium of the academy in 2015, and became secretary-general of the academy in 2016. In 2012, he was elected as a Fellow of the Association for Computing Machinery "for contributions to massive data algorithmics", becoming only the second ACM Fellow in Denmark. He also belonged to the .
In 2015 he became a Knight First Class in the Order of the Dannebrog.
References
External links
Google scholar profile
1967 births
2020 deaths
Danish computer scientists
Aarhus University alumni
Academic staff of Aarhus University
Duke University faculty
Fellows of the Association for Computing Machinery
Researchers in geometric algorithms
Knights First Class of the Order of the Dannebrog |
https://en.wikipedia.org/wiki/Kathleen%20Fisher | Kathleen Shanahan Fisher is an American computer scientist who specializes in programming languages and their implementation.
Professor Fisher is Chair of Computer Science at Tufts University and one of the authors of the PADS data description language and the Moby experimental concurrent programming language. She is a past Chair of the ACM Special Interest Group in Programming Languages (SIGPLAN) and has chaired three of their major conferences, ICFP in 2004, OOPSLA in 2011, and PLDI in 2019. She co-founded SIGPLAN’s Programming Language Mentoring Workshop (PLMW) Series in an effort to increase the number of women and underrepresented minorities in computer science and was Co-Chair of the Computing Research Association's Committee on the Status of Women for three years. In 2010 she was elected as a Fellow of the Association for Computing Machinery "for contributions to programming language design, theory, and practice, and for service to the computing community." She is also a member of the Board of Trustees of Harvey Mudd College.
Early life and education
Fisher was born in 1969 in San Marino, California. Her father was an investment professional and her mother was a homemaker. She graduated from San Marino High School before attending Stanford University. In her freshman year she decided to take a computer science course to learn how to use the IBM PS/2 Model 60 computer her dad had bought her. Interested in the material she took another class and came across the Halting Problem. She found the proof behind it simple yet elegant and the experience marked a turning point in her interest in computer science. She graduated Stanford with distinction in 1991 with a B.Sc in Math and Computational Science and stayed on at Stanford for her graduate studies. In 1996 she graduated with a Ph.D in Computer Science under the supervision of Dr. John C. Mitchell. Her thesis was entitled Type Systems for Object-Oriented Languages.
Career
Early career
After graduation Fisher started working at AT&T Labs Research. In April 2002 she was promoted to Principal Member of Technical Staff. From July 2008 to March 2011, she was also a Consulting Professor in Computer Science at Stanford.
DARPA
In 2011 she left AT&T Labs to become a Program Manager at DARPA. At DARPA she founded and ran the High-Assurance Cyber Military Systems (HACMS) and the Probabilistic Programming for Advancing Machine Learning (PPAML) programs. The HACMS program focused on leveraging Formal Methods to secure military vehicles from hacking. The program utilized a red team of hackers which attempted to break into a quadcopter with full knowledge of the system using any method besides a physical connection. Initially, the red team was able to quickly compromise the quadcopter, but by the end of the program they were not able to break into the quadcopter at all. This program was a huge success and has since been transitioned to more complex vehicles such as Boeing’s Unmanned Little Bird. Fi |
https://en.wikipedia.org/wiki/CG%20artist | CG artists (also known as computer graphics artists) create 2D and 3D art, usually for cinema, advertising or animation movies. A CG artist's work usually revolves around finding balance between artistic sensibilities and technical limitations while working within a development team.
In a game development context, CG artists work closely with game directors, art directors, animators, game designers and level designers. CG artists (typically, technical artists) will also work with game programmers to ensure that the 3D models and assets created by the art team function as desired inside a game engine.
CG artists are typically skilled at creating both 2D and 3D digital art, and often specialize in one or more subsets of content creation such as: hard surface modeling, organic modelling, concept art painting, architectural rendering, animation, and/or visual effects. If the CG artist is a technical artist, they will usually also have programming skills such as shader and script writing, character rigging, and/or skill in languages such as Python, MEL, C++, or C#.
CG artists often begin their career with a degree from an animation school, an arts discipline, or in computer science.
References
Computer occupations
Product development
Video game design
Video game development |
https://en.wikipedia.org/wiki/SQLf | SQLf is a SQL extended with fuzzy set theory application for expressing flexible (fuzzy) queries to traditional (or ″Regular″) Relational Databases. Among the known extensions proposed to SQL, at the present time, this is the most complete, because it allows the use of diverse fuzzy elements in all the constructions of the language SQL.
SQLf is the only known proposal of flexible query system allowing linguistic quantification over set of rows in queries, achieved through the extension of SQL nesting and partitioning structures with fuzzy quantifiers. It also allows the use of quantifiers to qualify the quantity of search criteria satisfied by single rows. Several mechanisms are proposed for query evaluation, the most important being the one based on the derivation principle. This consists in deriving classic queries that produce, given a threshold t, a t-cut of the result of the fuzzy query, so that the additional processing cost of using a fuzzy language is diminished.
Basic block
The fundamental querying structure of SQLf is the multi-relational block. The conception of this structure is based on the three basic operations of the relational algebra: projection, cartesian product and selection, and the application of fuzzy sets’ concepts. The result of a SQLf query is a fuzzy set of rows that is a fuzzy relation instead of a regular relation.
A basic block in SQLf consists of a SELECT clause, a FROM clause and an optional WHERE clause. The semantic of this query structure is:
The SELECT clause corresponds to the projection. It specifies the relations’ attributes (or attribute expressions) that will be selected. The resulting table is a fuzzy set and it is given in decreasing ordered of satisfaction degree.
The SELECT clause specifies also a calibration that is intended to restrict the set of rows retrieved. There are two kinds of calibrations: quantitative and qualitative. In quantitative calibration the user specifies the number of results to be retrieved, so that the query will retrieve the rows with highest membership degrees up to the number of required answers. In qualitative calibration the user specifies a minim level of satisfaction that must have any retrieved row.
The FROM clause corresponds to the Cartesian Product. The consult is made on the Cartesian Product of the relations that are specified in this clause.
The WHERE clause corresponds to the selection. It specifies the condition for which the satisfaction degree will be calculated. Rows that do not satisfy at all the condition are rejected. This condition is a fuzzy predicate that may involve any attribute of the relations.
The following is an example of a SELECT query that returns a list of hotels that are cheap. The query retrieves all rows from the Hotels table that satisfice the fuzzy predicate cheap defined by the fuzzy set μ=(, , 25, 30). The result is sorted in descending order by the membership degree of the query.
SELECT name, address
FROM Hotels
WHERE p |
https://en.wikipedia.org/wiki/The%20Powerpuff%20Girls%20%282016%20TV%20series%29 | The Powerpuff Girls is an American animated superhero action television series developed by Nick Jennings and Bob Boyle. It is a reboot of the Cartoon Network series of the same name created by Craig McCracken. It follows Blossom, Bubbles, and Buttercup, a trio of superpowered girls living in the city of Townsville who are frequently called upon by the townsfolk to protect its residents from evil. The girls were created in a lab by the scientist Professor Utonium, who sought to create the perfect little girls by using sugar, spice, and everything nice along with the accidental addition of the ingredient Chemical X, the source of the girls' superpowers.
It was first announced on June 16, 2014. A year later, it was announced that it would feature new voice actors for the main characters. The series premiered on April 4, 2016, in the United States and Canada, April 21, 2016, in Italy, and April 23, 2016, in Germany. The series ended on June 16, 2019, lasting for three years.
Plot
The Powerpuff Girls features Blossom, Bubbles and Buttercup, three superheroes whose purpose is to reduce crime while living a normal childhood.
Voice cast
Amanda Leighton as Blossom
Kristen Li as Bubbles
Natalie Palamides as Buttercup
Episodes
Production
Cartoon Network announced on June 16, 2014, that they had rebooted The Powerpuff Girls in a new series, which was to be produced by Cartoon Network Studios. In their 2015 upfront on February 19, the network announced that Nick Jennings, who was an art director on SpongeBob SquarePants and Adventure Time, would be its executive producer. Bob Boyle, who previously has produced Clarence, has created Jetix's Yin Yang Yo! and Nick Jr.'s Wow! Wow! Wubbzy! and also former producer and art director of Butch Hartman's animated series The Fairly OddParents and Danny Phantom, would also produce. Meanwhile, Craig McCracken, the creator of the original series, would not work on the series. McCracken has stated on Twitter that the executives at Cartoon Network had considered bringing him back to do the reboot, but his contract with Disney Television Animation prevented him from doing so.
Amanda Leighton, Kristen Li, and Natalie Palamides were announced as the new voice actors of the main characters, playing Blossom, Bubbles, and Buttercup, respectively, replacing the original voice actors Cathy Cavadini, Tara Strong, and E. G. Daily. However, Tom Kenny reprises his roles as the Mayor and narrator, while Tom Kane reprises his roles as Professor Utonium and Him. Meanwhile, Roger L. Jackson reprises as Mojo Jojo and Jennifer Hale reprises as Ms. Keane, but not as Princess Morbucks. In April 2016, Jennings revealed that the producers had considered bringing back the original voice actors for the new series, but decided that recasting the roles would infuse new energy.
After the network revealed multiple promotional images from the new series in June 2015, writers from news sites described the visual look as similar to the |
https://en.wikipedia.org/wiki/Facebook%20Instant%20Articles | Facebook Instant Articles is a feature from social networking company Facebook for use with collaborating news and content publishers, that the publisher can choose to use for articles they select. When a publisher selects an article for Instant Articles, people browsing Facebook in its mobile app can see the entire article within Facebook's app, with formatting very similar to that on the publisher's website.
History
Prior to launch
Facebook initially approached selected publishers with the idea of Instant Articles, so as to get early feedback that would allow Facebook to build a product that meets publisher needs.
According to a BuzzFeed spokesperson, BuzzFeed VP of Product Chris Johansen told Facebook that they needed seven things in order to participate in the program, including compatibility with comScore, Google Analytics, and BuzzFeed tracking tools, preservation of key aspects of the look, feel, and functionality of the website, and monetization. In January, Facebook returned for talks, saying they had implemented all of the requests.
Launch (May–June 2015)
Instant Articles launched officially on May 12, 2015. Launch partners included Woven Digital, BuzzFeed, The New York Times, National Geographic, The Atlantic, NBC News, The Guardian, BBC News, Bild, and Spiegel Online. Facebook also created an Instant Articles landing page to showcase Instant Articles in reverse chronological order. It was initially available only on Facebook's iPhone app.
Despite the huge amount of initial media attention paid to Instant Articles, no Instant Articles were published for three weeks following May 13, as noted in Business Insider. The Wall Street Journal noted that the pace of publication of Instant Articles was expected to rise significantly in June. On June 9, an Instant Article from The Guardian was published.
Monetization, greater compatibility with other tools, and global rollout (March–April 2016)
In late March 2016, Facebook announced that native ads and video ads would soon be allowed in Instant Articles.
In April 2016, Facebook Instant Articles became usable along with Medium and other publishing tools.
At the 2016 Facebook F8 conference, Facebook announced that Facebook Instant Articles would now be available to all publishers.
Features
Analytics
At launch time, Facebook announced that Instant Articles would be compatible with comScore, Google Analytics, and Omniture, as well as many publishers' internal tracking tools. In addition, Facebook would offer publishers its own rich analytics on user behavior on Instant Articles.
Formatting
Facebook promised to preserve the look and feel of articles from the publisher's website when showing them as Instant Articles, but making them more minimalistic and also better suited to the user's device.
Advertising
Facebook allows ads to appear inside Instant Articles. Publishers can keep 100% of the revenue if they sell the ads, and Facebook gets its standard 30% cut if it sells the ads.
With the |
https://en.wikipedia.org/wiki/Dancing%20with%20the%20Stars%20%28Australian%20season%2015%29 | The fifteenth season of the Australian Dancing with the Stars premiered on the Seven Network on 19 July 2015. It was the only season to be hosted by Shane Bourne, following the decision of former host Daniel MacPherson to not return. Edwina Bartholomew returned as co-host. Kym Johnson, Todd McKenney, and Helen Richey returned as judges,. while Adam Garcia did not return due to his wife's pregnancy. Bruno Tonioli appeared as a guest judge during the first three weeks of the competition.
On 7 September 2015, television and radio presenter Emma Freedman and Aric Yegudkin were announced as the winners, while Olympic diver Matthew Mitcham and Masha Belash finished in second place, and cook Ash Pollard and Jarryd Byrne finished in third.
Couples
This season featured eleven celebrities. The entire cast was leaked on 19 June 2015.
Scoring chart
The highest score each week is indicated in with a dagger (), while the lowest score each week is indicated in with a double-dagger ().
Color key:
Notes
Weekly scores
Unless indicated otherwise, individual judges scores in the charts below (given in parentheses) are listed in this order from left to right: Todd McKenney, Helen Richey, Kym Johnson.
Week 1
Individual judges scores in the charts below (given in parentheses) are listed in this order from left to right: Todd McKenney, Helen Richey, Kym Johnson, Bruno Tonioli.
Couples are listed in the order they performed.
Week 2
Individual judges scores in the charts below (given in parentheses) are listed in this order from left to right: Todd McKenney, Helen Richey, Kym Johnson, Bruno Tonioli.
Couples are listed in the order they performed.
Week 3
Individual judges scores in the charts below (given in parentheses) are listed in this order from left to right: Todd McKenney, Helen Richey, Kym Johnson, Bruno Tonioli.
Giselle Peacock performed with Tim Robards after Camille Webb became injured during rehearsal.
Couples are listed in the order they performed.
Week 4
Couples are listed in the order they performed.
Week 5
Couples are listed in the order they performed.
For each dance-off, the couple with the highest remaining score (the first team listed) picked the opponent against whom they wanted to dance; the chosen opponent was allowed to pick the dance style (from cha-cha-cha, foxtrot and salsa). The winner of each dance-off earned three points. The winning immunity couple were Emma & Aric, who didn’t have to participate in the dance-off.
Week 6
Couples are listed in the order they performed.
Week 7
Couples are listed in the order they performed.
Week 8: Grand Final
Night 1
Couples are listed in the order they performed.
Night 2
Couples are listed in the order they performed.
Dance chart
The celebrities and professional partners danced one of these routines for each corresponding week:
Week 1: One unlearned dance
Week 2: One unlearned dance
Week 3: One unlearned dance
Week 4: One unlearned dance
Week 5: One unlearned dance & dance-off
Week 6 |
https://en.wikipedia.org/wiki/Meteorological%20Service%20Singapore | Meteorological Service Singapore (MSS) is the national meteorological service of Singapore. It is responsible for gathering and recording weather data across the country, issuing weather forecasts, and performing research into Singapore's weather and climate. It is a division of the National Environment Agency, a statutory board under the Ministry of Sustainability and the Environment.
History
Formal record-keeping of weather data in Singapore began in 1869 with the efforts of the Medical Department of the Straits Settlements, whose initial purpose was to investigate a possible link between the spread of diseases and the local weather. A weather station was set up in Outram that year to measure monthly rainfall, marking the beginning of the "climate station" used to compile climatological data for Singapore. The responsibility for collecting weather data was assigned to a new Meteorological Branch under the Malayan Survey Department in 1927. This became the Malayan Meteorological Service (MMS) in 1929, and gained new responsibilities for providing meteorological services (including forecasts and climate research) for the whole of British Malaya. The new MMS was to be headquartered in Fullerton Building. A new "full-scale" weather station was erected at Mount Faber that year and was given the additional task of documenting temperature data, beginning Singapore's official temperature records. In 1934, the climate station and MMS headquarters were moved to Kallang Airport so they could convey more accurate weather information to aircraft.
The MMS functioned as usual during World War II and the Japanese occupation of Singapore in 1942–45. However, the Japanese destroyed the MMS's records and equipment prior to surrendering in 1945; full service was restored only in 1947. Consequently, Singapore's climate records are missing temperature data from 1942–47. With the resumption of full service, the MMS became an independent agency from the Malayan Survey Department. A weather radar with a range of was set up at Kallang Airport in 1948, and an upper-air observatory was formed in 1953 to study the vertical profile of the atmosphere by releasing weather balloons.
With Singapore's independence from Malaysia in 1965, the observation network in Singapore seceded from the MMS and became Meteorological Service Singapore (MSS), administered by the Deputy Prime Minister's Office. A year later, Singapore (represented by MSS) joined the World Meteorological Organization (WMO). In 1968, administration of MSS was moved to the Ministry of Communications. In 1971, the MSS headquarters and climate station were moved to Paya Lebar Airport, and began receiving satellite imagery the following year. The opening of Changi Airport in 1981 saw the MSS headquarters and climate station relocated there, as well as an upgrade to the weather radar. The move coincided with a "multimillion-dollar computerisation programme" meant to ease the workload on meteorologists.
In 1993, th |
https://en.wikipedia.org/wiki/Mark%20Galassi | Mark Galassi is a physicist, computer scientist, and contributor to the free and open-source software movement. He was born in Manhattan, grew up in France and Italy, and lives in Santa Fe, New Mexico.
Education
Galassi studied at the Liceo Classico Giuseppe Parini, graduating in 1983.
He completed his BA in physics at Reed College in 1986. He has credited various aspects of the college for launching his career, including learning to write software from fellow student Keith Packard and others who taught informal classes in the Reed College Paideia classes.
He then completed his Ph.D. in physics in 1992 at the Institute for Theoretical Physics at Stony Brook under Martin Roček.
Work and research
Galassi works in the Space Science and Applications group at the Los Alamos National Laboratory as a research scientist.
In Los Alamos he has worked in:
Gamma-ray bursts: High Energy Transient Explorer and HETE-2 satellites, the Raptor telescope suite, the Swift satellite.
Muon tomography: Cosmic-ray muon tomography to detect high-Z materials.
Nuclear nonproliferation: Scientific methods to address the spread of nuclear materials and weapons.
Machine learning: The Genie feature extraction system.
In the 1980s he also worked for Tektronix on the 11000 series oscilloscope, Cygnus Solutions (now part of Red Hat) working on Guile and eCos.
Free/open-source contributions
Galassi has been involved in the free and open-source software movement since 1984 He designed the GNU Scientific Library together with James Theiler. He was also an early contributor to GNOME, and designed and led development of the Dominion world simulation game.
He has served on the board of directors of the Software Freedom Conservancy from its inception until the present time. He also was chair of the board until 2022.
Educational initiatives
Galassi has been training students since the 1980s, teaching them in research methods, with emphasis on using only free/open-source software tools.
After decades of developing this pipeline, in 2019, he conceived of and co-founded the Institute for Computing in Research, a non-profit which trains high school students to do research, deeply rooted in free/open-source software. The Institute, founded in Santa Fe, New Mexico in 2019, offers a research internship modeled after the Los Alamos internship program. It has since spread to Portland, Oregon in 2021 and to Austin, Texas in 2022.
In 2021 Galassi was awarded the inaugural Los Alamos medal for community relations and the Santa Fe New Mexican "Ten Who Made a Difference" award, both for the creation of the student pipeline that culminates in the Institute for Computing in Research.
References
External links
Personal page
Google scholar page
1965 births
Living people
GNU people
Linux people
Reed College alumni
Stony Brook University alumni
Free software programmers
Los Alamos National Laboratory personnel |
https://en.wikipedia.org/wiki/Scientific%20Data%20%28journal%29 | Scientific Data is a peer-reviewed open access scientific journal published by Nature Research since 2014. It focuses on descriptions of data sets relevant to the natural sciences, medicine, engineering and social sciences, which are provided as machine-readable data, complemented with a human oriented narrative. The journal was not the first to publish data papers, but is one of a few journals whose content consists primarily of data papers. The journal is abstracted and indexed by Index Medicus/MEDLINE/PubMed.
References
External links
Nature Research academic journals
Creative Commons Attribution-licensed journals
Academic journals established in 2014
Multidisciplinary scientific journals
English-language journals
Continuous journals |
https://en.wikipedia.org/wiki/Duqu%202.0 | Duqu 2.0 is a version of malware reported in 2015 to have infected computers in hotels of Austria and Switzerland that were sites of the international negotiations with Iran over its nuclear program and economic sanctions. The malware, which infected Kaspersky Lab for months without their knowledge, is believed to be the work of Unit 8200. The New York Times alleges this breach of Kaspersky in 2014 is what allowed Israel to notify the US of Russian hackers using Kaspersky software to retrieve sensitive data.
Kaspersky discovered the malware, and Symantec confirmed those findings. The malware is a variant of Duqu, and Duqu is a variant of Stuxnet. The software is "linked to Israel", according to The Guardian. The software used three zero-day exploits, and would have required funding and organization consistent with a government intelligence agency.
According to Kaspersky, "the philosophy and way of thinking of the “Duqu 2.0” group is a generation ahead of anything seen in the advanced persistent threats world."
See also
Negotiations on Iran nuclear deal framework
Unit 8200
References
Windows malware
Exploit-based worms
2015 in computing
Hacking in the 2010s |
https://en.wikipedia.org/wiki/Cabaret%20%282019%20film%29 | Cabaret is a 2019 Indian romantic drama thriller dance film directed by Kaustav Narayan Niyogi, produced by Pooja Bhatt and Bhushan Kumar under the banner of Fisheye Network private limited. Principal photography of the film began around 9 June 2015. Originally scheduled for a 2016 release, alleged copyright violations led to delays before its eventual release on 9 January 2019. It was released on the ZEE5 on 9 January 2019.
Plot summary
Cast
Richa Chadda as Rajeshsri / Roza
Gulshan Devaiah as Gaurav
S. Sreesanth as Chetta Don aka Nand Shah
Gulshan Grover as Salim
Vipin Sharma as Police Inspector
Akshay Anand as Victor (Roza's manager)
Sharad Kapoor as Vikram Batwal (Ex-IB Officer)
Manoj Pahwa as Newspaper owner
Jyothi Rana as Meera (Roza's friend)
Rajat Kaul as Nawaab
Sujata Sanghamitra as Neena (Gaurav's boss)
Rahul Roy as Actor in 'Paani Paani' song
Soundtrack
The soundtrack of the film is composed by Kaustav Narayan Niyogi and Munish Makhija except for the song "Phir Teri Bahon Mein", which is composed by Tony Kakkar. The soundtrack consists of 6 songs. The background music is composed by Bapi Tutul.
References
External links
Indian dance films
Films shot in Mumbai
2019 films
T-Series (company) films
ZEE5 original films
2010s biographical films
2019 direct-to-video films
2010s Hindi-language films |
https://en.wikipedia.org/wiki/Lorimar%20Sports%20Network | The Lorimar Sports Network, or LSN, was an American ad hoc television network providing syndicated college football and basketball. It was based at Lorimar's original headquarters in Culver City, California, with an additional office in Dallas, Texas. It was in operation from 1983 until 1986.
History
Beginning
It began in 1983 as a new sports broadcasting division of Lorimar Productions, adopting the branding Sports Productions, Incorporated, or SPI. It was then renamed the Lorimar Sports Network in Summer 1984.
Sports programming
Under both banners, the Lorimar Sports Network had a history of bringing major events in men's college basketball and football. It acquired Southeastern Conference (SEC) basketball from the TVS Television Network in 1983. It also acquired rights to the Big Ten, Metro, and WAC. The SEC on SPI/Lorimar ran from January 1984 until the end of the 1985-1986 season.
LSN also broadcast the Freedom Bowl in 1985, along with the Holiday and Bluebonnet Bowls at the end of the 1985-86 football season, as well as Pacific-10 Conference football during those years.
Demise
The Lorimar Sports Network dissolved over time when they lost broadcast rights to all the conferences they had rights for, especially after the end of the 1985-1986 sports season. Rights to Metro Conference basketball were the first to be lost by LSN as Raycom Sports won rights to the Metro in 1985, and then the Big Ten conference in 1986, two years after Raycom won rights to basketball games from the Big 8 (now Big 12) conference; both the Big 8 and Big Ten were acquired by Raycom in 1986. The 1986 SEC, Big Ten and Pacific-10 Conference men's basketball tournaments (except the championships) were LSN's last sports broadcast because Raycom won syndication rights to the Pac-10 starting with the 1986-87 season. As for SEC Basketball, Raycom's Atlantic Coast Conference broadcast partner, Jefferson-Pilot Teleproductions (later Jefferson Pilot Sports, Lincoln Financial Sports, now part of Raycom Sports) won those rights beginning with the 1986-87 basketball season, added SEC football in 1992, and those rights remained with that company (which became Lincoln Financial Sports in 2006, and became part of Raycom Sports on January 1, 2008) until the end of the 2008-2009 season. The Freedom and Bluebonnet Bowls, however, ended up with the Mizlou Television Network for the 1986, 1987, and 1988 installments.
In February 1986, Lorimar completed a merger with Telepictures, to form Lorimar-Telepictures. After the Lorimar Sports Network was dissolved in summer 1986, the Lorimar studio itself, including its extensive library of produced and/or distributed programming, was bought out in its entirety by the Burbank, California-based Warner Bros. studio in 1988. Telepictures, on the other hand, once again became a separate production and syndication company under Time Warner ownership.
Notable on-air personalities
This is a partial list.
Tom Hammond, play-by-play commentator (SE |
https://en.wikipedia.org/wiki/South%20East%20LHIN | The South East LHIN was one of fourteen Local Health Integration Networks (LHINs) in the Canadian province of Ontario. In 2021, the legacy functions of LHINs were assigned to Ontario Health and the name South East Local Health Integration Network changed to Home and Community Care Support Services South East.
The South East Local Health Integration Network was a community-based, non-profit organization funded by the Government of Ontario through the Ministry of Health and Long-Term Care.
Services
South East LHIN planned, funded and coordinated the following operational public health care services to a population of approximately for 497,000 people in 2013 (3.7 per cent of the population of Ontario):
Hospitals - Public General Hospital:
Kingston General Hospital
Hotel Dieu Hospital (Kingston, Ontario)
Providence Continuing Care Centre (PCCC)
Lennox and Addington County General Hospital
Brockville General Hospital
Perth and Smiths Falls Hospital
Quinte Healthcare: Belleville, Prince Edward County, Trenton, North Hastings hospitals
Long-Term Care Homes
South East LHIN Home and Community Care
Community Support Service Agencies
Mental Health and Addiction Agencies
Community Health Centres (CHCs)
Geographic area
South East LHIN provided services for:
cities of:
Kingston
Belleville
Brockville
towns of:
Smiths Falls
Prescott
areas of:
Hastings
Prince Edward
Lennox and Addington
Frontenac
Leeds and Grenville Counties,
parts of Lanark and Northumberland Counties
Budget
The South East LHIN had an annual budget of 1,051,759,886
References
Health regions of Ontario |
https://en.wikipedia.org/wiki/Abmisha | Abmisha is a genus of crickets in tribe Gryllini; species are recorded from East Africa.
Taxonomy
The Orthoptera Species File database lists the following species:
Abmisha coiblemmoides Gorochov, 2001
Abmisha illex Otte, 1987 - type species (locality Shimba Hills, Kenya)
Abmisha sigi Otte, 1987
References
Gryllinae
Orthoptera genera
Taxa named by Dan Otte |
https://en.wikipedia.org/wiki/Zassenhaus%20algorithm | In mathematics, the Zassenhaus algorithm
is a method to calculate a basis for the intersection and sum of two subspaces of a vector space.
It is named after Hans Zassenhaus, but no publication of this algorithm by him is known. It is used in computer algebra systems.
Algorithm
Input
Let be a vector space and , two finite-dimensional subspaces of with the following spanning sets:
and
Finally, let be linearly independent vectors so that and can be written as
and
Output
The algorithm computes the base of the sum and a base of the intersection .
Algorithm
The algorithm creates the following block matrix of size :
Using elementary row operations, this matrix is transformed to the row echelon form. Then, it has the following shape:
Here, stands for arbitrary numbers, and the vectors
for every and for every are nonzero.
Then with
is a basis of
and with
is a basis of .
Proof of correctness
First, we define to be the projection to the first component.
Let
Then and
.
Also, is the kernel of , the projection restricted to .
Therefore, .
The Zassenhaus algorithm calculates a basis of . In the first columns of this matrix, there is a basis of .
The rows of the form (with ) are obviously in . Because the matrix is in row echelon form, they are also linearly independent.
All rows which are different from zero ( and ) are a basis of , so there are such s. Therefore, the s form a basis of .
Example
Consider the two subspaces and of the vector space .
Using the standard basis, we create the following matrix of dimension :
Using elementary row operations, we transform this matrix into the following matrix:
(Some entries have been replaced by "" because they are irrelevant to the result.)
Therefore
is a basis of , and
is a basis of .
See also
Gröbner basis
References
External links
Algorithms
Linear algebra |
https://en.wikipedia.org/wiki/Larry%20S.%20Davis | Larry S. Davis (born 1949) is an American computer scientist and professor emeritus at the University of Maryland, College Park. He currently works as a Senior Principal Scientist at Amazon. Davis is best known for his research in the field of computer vision.
Education
Davis received his Bachelor of Arts degree from Colgate University in 1970. He received his MS and PhD from the University of Maryland in 1974 and 1976, respectively.
Career
From 1977 to 1981, he was an assistant professor in the Department of Computer Science at the University of Texas, Austin. He then took a position as a professor at the University of Maryland in 1981. From 1985 to 1994, he was the director of the University of Maryland Institute for Advanced Computer Studies. He served as chair of the Department of Computer Science from 1999 to 2012 and was director of the Center for Automation Research (CfAR).
Currently, Davis is a Senior Principal Scientist at Amazon.
Davis is a fellow of the International Association for Pattern Recognition (IAPR), the Institute of Electrical and Electronics Engineers (IEEE) and the Association for Computing Machinery (ACM). His research has been cited nearly 61,000 times.
References
University of Maryland, College Park faculty
Living people
1949 births
Colgate University alumni
University of Texas at Austin faculty
Fellow Members of the IEEE
Fellows of the Association for Computing Machinery
Fellows of the International Association for Pattern Recognition |
https://en.wikipedia.org/wiki/Linda%20Petzold | Linda Ruth Petzold (born 1954) is a professor of computer science and mechanical engineering at the University of California, Santa Barbara, where she is also listed as affiliated faculty in the department of mathematics. Her research concerns differential algebraic equations and the computer simulation of large real-world social and biological networks.
Education
Petzold did both her undergraduate and graduate studies at the University of Illinois at Urbana–Champaign, earning a bachelor's degree in mathematics and computer science in 1974 and a doctorate in computer science in 1978 under the supervision of C. William Gear.
Recognition
Petzold was the first winner of the J. H. Wilkinson Prize for Numerical Software, for her work on DASSL, a system for the numerical solution of differential algebraic equations. In 2011 she won the SIAM/ACM Prize in Computational Science and Engineering.
She was elected a member of the National Academy of Engineering in 2004 "for advances in the numerical solution of differential/algebraic equations and their incorporation into widely distributed software." She became a Fellow of the Society for Industrial and Applied Mathematics in 2009 and of the Association for Computing Machinery in 2013; She is also a fellow of the American Society of Mechanical Engineers and of the American Association for the Advancement of Science. She was elected to the National Academy of Sciences in 2021.
In January 2015 she was given an honorary doctorate by Uppsala University.
References
Further reading
External links
Google scholar profile
1954 births
Living people
American computer scientists
American mechanical engineers
20th-century American mathematicians
21st-century American mathematicians
American women computer scientists
American women mathematicians
University of Illinois Urbana-Champaign alumni
University of California, Santa Barbara faculty
Fellows of the American Association for the Advancement of Science
Fellows of the American Society of Mechanical Engineers
Fellows of the Association for Computing Machinery
Fellows of the Society for Industrial and Applied Mathematics
Members of the United States National Academy of Engineering
Members of the United States National Academy of Sciences
20th-century women mathematicians
21st-century women mathematicians
20th-century American women
21st-century American women |
https://en.wikipedia.org/wiki/Cherri%20M.%20Pancake | Cherri M. Pancake is an ethnographer and computer scientist who works as a professor of electrical engineering and computer science and Intel Faculty Fellow at Oregon State University, and as the director of the Northwest Alliance for Computational Science & Engineering. She is known for her pioneering work on usability engineering for high performance computing. In 2018 she was elected for a two-year term as president of the Association for Computing Machinery.
Education
Pancake earned a bachelor's degree in environmental design from Cornell University, and then studied anthropology at Louisiana State University. After working for the Peace Corps in Peru, she spent ten years in Guatemala studying the Maya peoples; for over six of these years she was curator of the Ixchel Museum of Indigenous Textiles and Clothing. However, the political unrest in Guatemala in the early 1980s caused her to return to the US, where she became a graduate student in engineering at Auburn University, the first woman in the program. She received a PhD in Computer Engineering in 1986.
Career and research
For 10 years, Pancake split her time between her university appointment (first at Auburn, then at Oregon State) and an appointment as visiting scientist at the Cornell Theory Center. She performed the first usability studies of software tools for high performance computing, and found methods of improving the usability of these tools based on her knowledge of color perception, response time, short-term memory, and programming errors.
For over two decades, Pancake has been active with the ACM/IEEE SC (Supercomputing) Conference, serving as general chair of SC99 and in numerous other positions. She founded the Parallel Tools Consortium in 1993 and led several software standards efforts. In 2011, she founded SIGHPC and served as its chair until 2016, when she was elected Vice-President of the Association for Computing Machinery and then President in 2018. Working with Intel Corporation leaders, she established the ACM SIGHPC/Intel Computational & Data Science Fellowships to increase diversity in the computing field.
Awards and honors
Pancake was elected a Fellow of the Association for Computing Machinery in 2001 "for leadership contributions to usability to high performance computing tools", and became a Fellow of the Institute of Electrical and Electronics Engineers in 2003. She was honored as one of the Oregon Women of Achievement in 2006.
References
Year of birth missing (living people)
Living people
American ethnographers
American computer scientists
American women computer scientists
Cornell University College of Human Ecology alumni
Auburn University alumni
Oregon State University faculty
Fellows of the Association for Computing Machinery
Fellow Members of the IEEE
Presidents of the Association for Computing Machinery
American women anthropologists
American women academics
21st-century American women |
https://en.wikipedia.org/wiki/Doom%2B5 | Doom+5 () is a 2015 Hong Kong television series produced by Hong Kong Television Network. The first episode premiered on 15 June 2015.
Synopsis
On 5:40 a.m. January 23, 2017, a hacker hacked into the Hong Kong government's supercomputers and pirated a confidential document. The report is from NASA, stating that a large solar flare will completely destroy the Earth on 11:45 p.m. on that same date. The report is leaked to 137 Hong Kong residents' email addresses. The Hong Kong government then held the 137 people hostage, and release each person as they deem sane, perhaps to prevent the news from being spread amongst the community and cause chaos. Five of those released are shown how they will live their final hours before the end of the world.
Cast
SAR Government
Sunny Chan as Chief Executive
as Chief Secretary
as Financial Secretary
as Secretary for Justice
Episode 1: Commitment
Philip Keung as Law Dai-wai
Rachel Lam as Chan Kam-tai
as Kam Fa
Adrian Wong as Mang Mang
Jacky Yeung as Cheng Sai-cheong
as Boss
Episode 2: Resurrection
as Lee Yat-choi
as young Lee Yat-choi
Peter Lai as Lee Tung-shing
as Cheung Ka-yan
as young Cheung Ka-yan
Wu Kwing-lung as Sam
as doctor
Episode 3: Monica
as Yau Mei-ling
as young Yau Mei-ling
as Monica Lam
Vivian Lee as young Monica Lam
Kathy Yuen as Ceci
as Kwan Chung
as young Kwan Chung
Episode 4: Betrayal
as George Leung
as To Tung
as Siu Yin-tsz
as Fiona
as Fong Wai-yee
Tammy Ho as Sa Sa
as Yip Kai-fat
Candy Chu as pregnant woman
Episode 5: Guardian
Gregory Wong as Cheung Tsz-lok
Yetta Tse as Wong Ning
as Sai Kai
Casper Chan as Makeup store clerk
Production
Filming started on 16 January 2014.
Release
A 7-minute preview was released on HKTV's YouTube channel on 8 June 2015.
Song list
"Come Back to Me" (Episode 4)
References
External links
Official website
Hong Kong Television Network original programming
2015 Hong Kong television series debuts
2010s Hong Kong television series |
https://en.wikipedia.org/wiki/European%20Union%20Centre%20in%20Taiwan | The European Union (EU) Centre in Taiwan (EUTW; ) is part of a global network of European Union Centres of Excellence and a university alliance in Taiwan. Following the launch of EU Centres of Excellence in the US and Canada in 1998, there are now 37 Centres located in Australia, Canada, Hong Kong, Japan, Macao, New Zealand, Russia, South Korea, Taiwan and the United States.
The Taiwan Centre, the first in Eastern Asia, opened in 2009, funded by European Commission. It is a partnership between the European Commission, National Taiwan University (NTU), National Chengchi University (NCCU), National Dong Hwa University (NDHU), National Chung Hsing University (NCHU), National Sun Yat-sen University (NSYSU), Fu Jen Catholic University (FJU), and Tamkang University (TKU). Its aim is to promote knowledge of the European Union and its policies. It organises speaker events, discussions and exhibitions; publishes books, papers and teaching materials; and sends staff to visit schools and colleges in Taiwan.
History
Since 1998, the European Union (EU) began establishing European Union Centres (variations in name) at prestigious universities in developed countries around the world. As of 2016, there are 32 such centres around the world, such as United States, Canada, Japan, Korea, Australia, Russia, New Zealand, Taiwan, and Singapore.
In 2008, the European Union Centre in Taiwan (EUTW) consortium consists of seven most comprehensive/internationalization Taiwanese universities, the National Taiwan University (NTU) signed the Grand Agreement with the European Commission. In 2009, the EUTW university alliance was founded.
Members
See also
List of universities in Taiwan
University alliances in Taiwan
University System of Taiwan
Taiwan Comprehensive University System
University System of Taipei
National University System of Taiwan
ELECT
National Taiwan University System (NTU Triangle)
Public Ivy
References
External links
European Union Centre in Taiwan
University systems in Taiwan
2009 establishments in Taiwan
Educational institutions established in 2009 |
https://en.wikipedia.org/wiki/Uplike | Uplike was an online photo sharing and social networking service based in France that let users share inspirations with the public. The app was created by Emmanuel Francoise. The service allowed users to share inspirations privately and publicly. The app was used by millions of people in 160+ countries worldwide. The app was compared to Pinterest. The Uplike secure cloud is where the bookmarks are saved, which can be also added as secret.
Uplike was available for iOS and Android.
In 2015, The Next Web called Uplike the "French startup with the highest growth".
In 2017, Uplike announced that it would refocus on its chatbot creation platform activity under the Botnation brand.
Awards
European Startup of The Year 2013 at Luxembourg ICT Awards .
Fastest growing tech by The Next Web.
References
Imageboards
Multilingual websites
French social networking websites |
https://en.wikipedia.org/wiki/Hetman%20Partition%20Recovery | Hetman Partition Recovery is a shareware program for recovery of deleted data from hard drive partitions and other storage media. The utility supports both functioning disks and damaged logical partitions and recovers data from both reformatted disks and disks which have had their file system changed from FAT to NTFS or vice versa.
In addition to working on existing partitions the tool can also find deleted logical drives, displaying them to the user for further search and recovery of deleted files as well as correcting errors in logical partition design.
Hetman Partition Recovery supports reading of regular, zipped, and encrypted files, from disks formatted under NTFS and/or FAT file systems.
Features
The utility supports FAT12/16/32, NTFS, and NTFS5 file systems and ensures recovery of basic file formats such as from Microsoft Office documents, spreadsheets and presentations (.docx/.doc, .xlsx/.xls and .pptx/.ppt respectively) and OpenDocument documents, spreadsheets and presentations (.odt, .ods, and .odp respectively, as well as .odg). The utility can also recover vector and raster digital images such as those in .jpg, .png, .psd, and .tiff formats as well as audio and video files in a variety of common and popular formats including .3gp, .aac, .asf, .avi, .flac, .flv, .m2ts, .m4v, .mkv, .mov, .mp3, .mp4, .mpeg, .mts, .ogg, .swf, .vob, .wav, .webm, .wma, and .wmv.
The utility can also recover digital archives such as those in the .7z, .arj, .cab, .gz, .img, .iso, .rar, and .zip formats, regardless of size or degree of compression.
System requirements
Processor with a clock speed of 1000 MHz;
RAM 512 MB;
OS Microsoft Windows NT, Windows 98, Windows 2000, Windows XP, Windows Server 2003, Windows Server 2008, Windows Vista, Windows Seven, Windows 7, Windows 8;
Free disk space 42.9 MB.
References
External links
SoftwareInformer - Hetman Partition Recovery
FileCritic - Hetman Partition Recovery 3.2 review
Shareware |
https://en.wikipedia.org/wiki/Brachmia%20tepidata | Brachmia tepidata is a moth in the family Gelechiidae. It was described by Edward Meyrick in 1922. It is found in Shanghai, China.
The wingspan is about 18 mm. The forewings are ochreous brown, the costa and dorsum suffused with dark brown. The stigmata is dark brown, the plical rather beyond the first discal. There is a rather narrow suffused dark fuscous terminal fascia, with the extreme terminal edge whitish. The hindwings are grey.
References
Moths described in 1922
Brachmia
Taxa named by Edward Meyrick
Moths of Asia |
https://en.wikipedia.org/wiki/Hot%20Shots%20%28American%20TV%20series%29 | Hot Shots is an American shooting sport TV series produced by Creative Fuel Media for the NBC Sports Network, which follows well known shooting personalities both on and off the range, including Jerry Miculek, Clint Upchurch, KC Eusebio and Max Michel.
See also
Top Shot, an American shooting sport television show debuted on The History Channel
3-Gun Nation
References
NBCSN shows
American sports television series
Shooting sports on television |
https://en.wikipedia.org/wiki/Necula | Necula is a Romanian surname. Notable people with the name include:
Cătălin Necula (born 1969), a Romanian footballer
George Necula, a Romanian computer scientist
Iulia Necula (born 1986), a Romanian table tennis player
Răducanu Necula (born 1946), a Romanian footballer
Veronica Necula (born 1967), a Romanian rower
See also
Tricentra necula, a species of moth
Romanian-language surnames |
https://en.wikipedia.org/wiki/Jurassic%20Park%20Builder | Jurassic Park Builder was a 2012 construction and management simulation video game developed and published by Ludia for iOS and Android operating systems, as well as Facebook. The game, based on the Jurassic Park series, allows the player to build a theme park featuring extinct animals. Ludia ended the game's support as of March 30, 2020.
In 2015, Ludia released a sequel to the game titled Jurassic World: The Game, to coincide with the release of the film Jurassic World.
Gameplay
Jurassic Park Builder is a freemium game consisting of two-dimensional landscape renderings and three-dimensional creatures. The player's objective is to build and maintain a Jurassic Park theme park. The player begins the game with a basic home base, while expansion of the park is done by clearing land. To create dinosaurs, the player must clear away trees and rocks to locate prehistoric mosquitos, which are trapped in amber and contain dinosaur DNA. In a laboratory, the player then attempts to unlock the DNA from the mosquito. If the player is successful, then a dinosaur egg is created. Amber is sometimes discovered when the player clears land for park expansion.
Basic mission objectives are given to the player by characters from the first two films: Alan Grant, John Hammond, Ian Malcolm, and Kelly Curtis. Dr. Henry Wu, a park scientist, also appears in the game, which features no characters from the film Jurassic Park III. Mission objectives include constructing roads and feeding creatures in the park. Completing missions ultimately gives the player the ability to create new buildings and conduct research for cloning new dinosaurs. Buildings include hotels and theme park attractions, including tour vehicles that travel along a path determined by the player.
Revenue is earned through the buildings and dinosaurs that are located in the park. Revenue is collected in regular intervals, and the player can earn more money by feeding the dinosaurs to level them up. Although the dinosaurs do not require food to survive, feeding the animals will level them up, resulting in higher profits for the player. Carnivorous and herbivorous creatures require their own supply of food, which must be managed by the player to avoid running out. The player can choose to pay real money to purchase in-game currency, as well as supplies such as dinosaur food. Various aspects of the game take time to progress, including the hatching of dinosaur eggs, the clearing of forest land, and shipments of food from the mainland. The player can pay real currency to speed up these parts of the game.
In a minigame titled "Red Zone", the player must tap on a specific dinosaur to prevent it from escaping its enclosure. In addition to breakouts, the player is occasionally given the option to respond to other emergencies such as storms. Responding to emergencies earns the player additional in-game currency.
Aside from Jurassic Park on Isla Nublar, the game features two additional parks that the player can |
https://en.wikipedia.org/wiki/Local%20case-control%20sampling | In machine learning, local case-control sampling is an algorithm used to reduce the complexity of training a logistic regression classifier. The algorithm reduces the training complexity by selecting a small subsample of the original dataset for training. It assumes the availability of a (unreliable) pilot estimation of the parameters. It then performs a single pass over the entire dataset using the pilot estimation to identify the most "surprising" samples. In practice, the pilot may come from prior knowledge or training using a subsample of the dataset. The algorithm is most effective when the underlying dataset is imbalanced. It exploits the structures of conditional imbalanced datasets more efficiently than alternative methods, such as case control sampling and weighted case control sampling.
Imbalanced datasets
In classification, a dataset is a set of N data points , where is a feature vector, is a label. Intuitively, a dataset is imbalanced when certain important statistical patterns are rare. The lack of observations of certain patterns does not always imply their irrelevance. For example, in medical studies of rare diseases, the small number of infected patients (cases) conveys the most valuable information for diagnosis and treatments.
Formally, an imbalanced dataset exhibits one or more of the following properties:
Marginal Imbalance. A dataset is marginally imbalanced if one class is rare compared to the other class. In other words, .
Conditional Imbalance. A dataset is conditionally imbalanced when it is easy to predict the correct labels in most cases. For example, if , the dataset is conditionally imbalanced if and .
Algorithm outline
In logistic regression, given the model , the prediction is made according to . The local-case control sampling algorithm assumes the availability of a pilot model . Given the pilot model, the algorithm performs a single pass over the entire dataset to select the subset of samples to include in training the logistic regression model. For a sample , define the acceptance probability as . The algorithm proceeds as follows:
Generate independent for .
Fit a logistic regression model to the subsample , obtaining the unadjusted estimates .
The output model is , where and .
The algorithm can be understood as selecting samples that surprises the pilot model. Intuitively these samples are closer to the decision boundary of the classifier and is thus more informative.
Obtaining the pilot model
In practice, for cases where a pilot model is naturally available, the algorithm can be applied directly to reduce the complexity of training. In cases where a natural pilot is nonexistent, an estimate using a subsample selected through another sampling technique can be used instead. In the original paper describing the algorithm, the authors propose to use weighted case-control sampling with half the assigned sampling budget. For example, if the objective is to use a subsample with size , first esti |
https://en.wikipedia.org/wiki/Nefesh%20%28group%29 | , literally meaning in Hebrew "Soul", is a networking organization for Torah-observant mental health professionals internationally.
Nefesh was founded in 1992, to bring Orthodox Jewish professionals and rabbis together to address mental health issues that in a professional and communal environment. There are over 750 members worldwide. Notable member and rabbinic advisers include Rabbi Dovid Cohen, Rabbi Dr. Abraham Twerski, and Rabbi Tzvi Hersh Weinreb.
The main office is located in Brooklyn and the current president is Rabbi Simcha Feuerman. There are additional chapters in Australia, Beverly Hills, Israel, Canada, United Kingdom and South America.
There are national and international conferences held on an annual basis since 2001. In the past, these conferences have taken place in New York, Miami, Baltimore, Norfolk, and Israel. In addition, international workshops dealing with contemporary issues have taken place in many of these locations. These conferences and workshops are approved for continuing education by the State Board Office of New York.
Membership
Nefesh-International is an interdisciplinary organization of Orthodox Jewish mental health professionals providing leadership and interdisciplinary education in the field of personal, family, and community mental health. The members are Torah-observant psychologists, social workers, psychiatrists, marriage and family therapists, professional counselors, psychiatric nurses, chemical dependency counselors, psychotherapists, guidance and pastoral counselors, and graduate students. Affiliates include Orthodox Rabbis, Jewish educators, attorneys, and allied professionals. Nefesh International is funded primarily funded through program revenue.
Issues addressed
In the Orthodox Jewish community a stigma exists towards mental health. This issue can create a situation where individuals and families are not addressing mental health conditions. Orthodox Jewish mental health professionals encounter other challenges as the community is closed and insular and it difficult to attain anonymous, yet culturally attuned, care. For example, it is not seen as appropriate for men and women to shake hands with someone of the opposite gender, and an uninformed therapist might not be aware of these and other sensitivities. Nonetheless, in these closed communities issues exist which are parallel to those found in the contemporary world at large — gender, family, and community related issues. The group stays abreast of the latest research while transferring the findings to their specialized communities.
The group has reached out to Orthodox Jewish caregivers both psychologists and others in related fields to discuss shared concerns, issues and solutions that are acceptable in their religious communities.
References
External links
Psychology organizations based in the United States
Jewish medical ethics
Mental health organizations in New York (state) |
https://en.wikipedia.org/wiki/Juliana%20Freire | Juliana Freire de Lima e Silva is a Brazilian computer scientist who works as a professor of computer science and engineering at the New York University. She is known for her research in information visualization, data provenance, and computerized assistance for scientific reproducibility.
Education and career
Freire did her undergraduate studies at the Federal University of Ceará in Brazil, and earned her doctorate from Stony Brook University. Prior to joining NYU-Poly in 2011, she was a researcher at Bell Laboratories, and a faculty member at the Oregon Health & Science University and the University of Utah.
Freire was the program co-chair of the WWW2010 conference.
Research
Freire's research projects include the VisTrails scientific workflow management system, and the DeepPeep search engine for web database content.
Recognition
In 2014, Freire was elected as a Fellow of the Association for Computing Machinery "for contributions to provenance management research and technology, and computational reproducibility."
She was named to the 2021 class of Fellows of the American Association for the Advancement of Science.
References
External links
Home page
Google scholar profile
Year of birth missing (living people)
Living people
American computer scientists
Brazilian computer scientists
Brazilian women computer scientists
Information visualization experts
Stony Brook University alumni
Oregon Health & Science University faculty
University of Utah faculty
New York University faculty
Fellows of the Association for Computing Machinery
Fellows of the American Association for the Advancement of Science
Computer graphics researchers
Scientists at Bell Labs
Federal University of Ceará alumni |
https://en.wikipedia.org/wiki/Taxus%20%C3%97%20media | Taxus × media, sometimes known simply as Taxus media, is a conifer (more specifically, a yew) created by the hybridization of English yew Taxus baccata and Japanese yew Taxus cuspidata. This hybridization is thought to have been performed by the Massachusetts-based horticulturalist T.D. Hatfield in the early 1900s. Taxonomy and common naming
Taxus × media is available in a large number of shrubby, often wide-spreading, cultivars under a variety of names.
Description
Like most yew species, T. × media prefers well-drained and well-watered soils, but has some degree of drought tolerance and in fact may die in conditions of excessive precipitation if the soil beneath the plant is not sufficiently well-drained.Taxus × media is among the smallest extant species in the genus Taxus and (depending upon cultivar) may not even grow to the size of what one would consider a typical tree. Immature shrubs are very small and achieve (over the time span of ten to twenty years) heights of at most and diameters of at most , depending on the cultivar. Furthermore, T. × media is known to grow rather slowly and is not injured by frequent pruning, making this hybrid very desirable as a hedge in low-maintenance landscaping and also a good candidate for bonsai.
ToxicityTaxus × media also shares with its fellow yew trees a high level of taxine in its branches, needles, and seeds. Taxine is toxic to the mammalian heart.
Varieties (cultivars)
Taxus × media var. hicksii (also known by the common name Hicks's yew or alternately, Hicks yew) is a common cultivar of this hybrid, and is the tallest and thinnest variety of T. × media, limiting itself to a diameter, despite the fact it can achieve a height of close to .
Another commonly-planted cultivar of T. × media is the broader-spreading densiformis version, which can reach a diameter exceeding 10 feet; nonetheless, this cultivar does not grow much past in height.
Another cultivar of T. × media is the Kelseyi version (known as the Kelsey yew''), with a height of at maturity, and a spread of . It is a dense multi-stemmed evergreen shrub with a low canopy about 1 foot from the ground.
References
media
Medicinal plants
Plant nothospecies
Trees of humid continental climate
Ornamental trees
Least concern plants
Plants used in bonsai |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.