source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Conservation%20Geoportal | The Conservation Geoportal was an online geoportal, intended to provide a comprehensive listing of geographic information systems (GIS) datasets and web map service relevant to biodiversity conservation. It is currently defunct. The site, its contents and functionality were free for anyone to use and contribute to. The Conservation Geoportal was launched on June 28, 2006 at the joint Society for Conservation Biology and Society for Conservation GIS Conference in San Jose, California, USA. As of October 2007, it included metadata for over 3,667 GIS records.
History
The Conservation Geoportal was conceived when representatives from a group of conservation-minded organizations met at the National Geographic Society in March 2005 to define a vision for a World Conservation Base Map. Initially the focus on developing an inventory or catalog of datasets and maps in the form of a metadata database was to be mined to develop the Conservation Base Map and Atlas.
Overview
The Conservation Geoportal constitutes a collaborative effort by and for the conservation community to facilitate the discovery and publishing of GIS data and maps, to support conservation decision-making and education. It does not actually store maps and data, but rather the descriptions and links to those data resources. These descriptions are known as metadata. It was intended to provide an efficient point of access for people interested in a full range of conservation-related GIS data. Capabilities of the Conservation Geoportal included:
Search for data and maps by keyword, category, geography, or time period
Save search queries for future use
Use the built-in Map Viewer to display, manipulate, and combine live map services
Map viewer supports OpenGIS standards (WMS, WFS, WCS) and ArcIMS services
Create, save, and email custom maps using data from various web map service
Publish metadata for maps and data so others can find them
Featured Map section
Content in designated thematic data channels
Share information with other geoportal
Status
Sponsored by The Nature Conservancy, National Geographic Society and UNEP-World Conservation Monitoring Centre
~2,000 visitors per month at its peak
~3,667 metadata records & 515 registered users
Data channels
The Conservation Geoportal included Data Channels and Sub-channels to organize and facilitate access to metadata describing data and maps in a given topic or theme. Channels provided quick access (2 clicks to content) to key data resources that experts consider important to the larger user community. Channels were managed by organizations and experts (channel stewards) knowledgeable about that theme, including:
Conservation areas: Conservation areas can include existing legally protected areas, as well as areas of ecological or cultural significance identified through assessment and planning efforts. They represent areas where conservation activities are currently taking place or where one or more organizations intend |
https://en.wikipedia.org/wiki/Secret%20Truths | "Secret Truths" is the two-part premiere episode of the American teen drama series South of Nowhere. It premiered on November 4, 2005 on Noggin's teen-targeted programming block, The N. It was written by series creator Thomas W. Lynch and directed by Donna Deitch. The episode introduces three siblings—Spencer, Glen and Clay Carlin—who start at a new school after their family moves from a small town in Ohio to Los Angeles.
Lynch conceived South of Nowhere from the idea of a teenager's coming out after hearing that his friend's son had come out to his parents. Lynch pitched the premise to Noggin LLC and was commissioned to write the pilot. After the casting process was complete, the episode was filmed in October 2004, but when the show was picked up for a full season, Lynch decided to recast many of the characters and the pilot was shot again in July 2005 with the new cast. The premiere of the episode was promoted with branded MetroCards that were handed out to teenagers in Manhattan. Generally, critics reviewed the pilot positively, particularly commending its treatment of current social issues; however, some critics found the show's introduction of these issues to be forced and inauthentic.
Plot
After their mother Paula (Maeve Quinlan) takes on a new job, the Carlin family moves from a small town in Ohio to Los Angeles, California. The three Carlin siblings start at King High School, where they each try to fit in. Glen (Chris Hunter), a talented basketball player, tries out for the school basketball team, upsetting the star player Aiden Dennison (Matt Cohen) and his cheerleader girlfriend Madison Duarte (Valery Ortiz). Tensions between Glen and Aiden escalate into a locker room fight over Aiden's ex-girlfriend Ashley Davies (Mandy Musgrave), and Glen takes the spotlight in his first game, leaving Aiden on the bench. Glen's sister Spencer (Gabrielle Christian) joins the cheerleading squad but ends up doing little more than take orders from Madison. She befriends the rebellious Ashley, but when Ashley indicates her interest in girls, Spencer starts to avoid her, only to admit later that she enjoyed their time spent together. That night, though, she dreams of being taunted by the cheerleaders and called gay, although she denies it. Glen and Spencer's adopted African American brother Clay (Danso Gordon) is smart but naïve, and he finds himself facing the racial tensions of LA that he never experienced in Ohio. After Clay strikes up a conversation with a girl named Chelsea Lewis (Aasha Davis), he is beaten up by her ex-boyfriend Dallas (Marcus Brown) when Clay tries to defend her. He then earns the respect of Sean Miller (Austen Parros), who is cynical about the way African Americans are treated in society, and when they go driving they are pulled over by the police for "driving while black".
At a school dance, Sean persuades Dallas to make peace with Clay while Clay dances with Chelsea. Spencer convinces Ashley to come despite her disdain for scho |
https://en.wikipedia.org/wiki/Bag-of-words%20model%20in%20computer%20vision | In computer vision, the bag-of-words model (BoW model) sometimes called bag-of-visual-words model can be applied to image classification or retrieval, by treating image features as words. In document classification, a bag of words is a sparse vector of occurrence counts of words; that is, a sparse histogram over the vocabulary. In computer vision, a bag of visual words is a vector of occurrence counts of a vocabulary of local image features.
Image representation based on the BoW model
To represent an image using the BoW model, an image can be treated as a document. Similarly, "words" in images need to be defined too. To achieve this, it usually includes following three steps: feature detection, feature description, and codebook generation.
A definition of the BoW model can be the "histogram representation based on independent features". Content based image indexing and retrieval (CBIR) appears to be the early adopter of this image representation technique.
Feature representation
After feature detection, each image is abstracted by several local patches. Feature representation methods deal with how to represent the patches as numerical vectors. These vectors are called feature descriptors. A good descriptor should have the ability to handle intensity, rotation, scale and affine variations to some extent. One of the most famous descriptors is Scale-invariant feature transform (SIFT). SIFT converts each patch to 128-dimensional vector. After this step, each image is a collection of vectors of the same dimension (128 for SIFT), where the order of different vectors is of no importance.
Codebook generation
The final step for the BoW model is to convert vector-represented patches to "codewords" (analogous to words in text documents), which also produces a "codebook" (analogy to a word dictionary). A codeword can be considered as a representative of several similar patches. One simple method is performing k-means clustering over all the vectors. Codewords are then defined as the centers of the learned clusters. The number of the clusters is the codebook size (analogous to the size of the word dictionary).
Thus, each patch in an image is mapped to a certain codeword through the clustering process and the image can be represented by the histogram of the codewords.
Learning and recognition based on the BoW model
Computer vision researchers have developed several learning methods to leverage the BoW model for image related tasks, such as object categorization. These methods can roughly be divided into two categories, unsupervised and supervised models. For multiple label categorization problem, the confusion matrix can be used as an evaluation metric.
Unsupervised models
Here are some notations for this section. Suppose the size of codebook is .
: each patch is a V-dimensional vector that has a single component equal to one and all other components equal to zero (For k-means clustering setting, the single component equal one indicates the |
https://en.wikipedia.org/wiki/Valencia%20Metro | Valencia Metro may refer to:
Metrovalencia, the rapid transit network for the city of Valencia, Spain and its metropolitan area
Valencia Metro (Venezuela), the light metro system serving the city of Valencia, Carabobo, Venezuela |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201920 | A list of films produced in France in 1920:
See also
1920 in France
References
External links
French films of 1920 at the Internet Movie Database
French films of 1920 at Cinema-francais.fr
1920
Lists of 1920 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201921 | A list of films produced in France in 1921:
See also
1921 in France
References
External links
French films of 1921 at the Internet Movie Database
French films of 1921 at Cinema-francais.fr
1921
Lists of 1921 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201924 | A list of films produced in France in 1924:
See also
1924 in France
References
External links
French films of 1924 at the Internet Movie Database
French films of 1924 at Cinema-francais.fr
1924
Lists of 1924 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201925 | A list of films produced in France in 1925:
See also
1925 in France
References
External links
French films of 1925 at the Internet Movie Database
French films of 1925 at Cinema-francais.fr
1925
Lists of 1925 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201932 | A list of films produced in France in 1932:
A-L
M-Z
See also
1932 in France
References
External links
French films of 1932 at the Internet Movie Database
French films of 1932 at Cinema-francais.fr
1932
Films
Lists of 1932 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201933 | A list of films produced in France in 1933:
A-L
M-Z
See also
1933 in France
References
External links
French films of 1933 at the Internet Movie Database
French films of 1933 at Cinema-francais.fr
1933
Films
Lists of 1933 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201934 | A list of films released in France in 1934:
A-L
M-Z
See also
1934 in France
Notes
External links
French films of 1934 at the Internet Movie Database
French films of 1934 at Cinema-francais.fr
1934
Films
Lists of 1934 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201935 | A list of films produced in France in 1935:
A-L
M-Z
See also
1935 in France
References
External links
French films of 1935 at the Internet Movie Database
French films of 1935 at Cinema-francais.fr
1935
Films
Lists of 1935 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201936 | A list of films produced in France in 1936:
A-L
M-Z
See also
1936 in France
References
External links
French films of 1936 at the Internet Movie Database
French films of 1936 at Cinema-francais.fr
1936
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201937 | A list of films produced in France in 1937:
A-L
M-Z
See also
1937 in France
External links
French films of 1937 at the Internet Movie Database
French films of 1937 at Cinema-francais.fr
1937
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201938 | A list of films produced in France in 1938:
A-L
M-Z
See also
1938 in France
References
External links
French films of 1938 at the Internet Movie Database
French films of 1938 at Cinema-francais.fr
1938
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201939 | A list of films produced in France in 1939:
A-L
M-Z
See also
1939 in France
References
External links
French films of 1939 at the Internet Movie Database
French films of 1939 at Cinema-francais.fr
1939
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201940 | A list of films produced in France in 1940:
A-L
M-Z
See also
1940 in France
References
External links
French films of 1940 at the Internet Movie Database
French films of 1940 at Cinema-francais.fr
1940
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201941 | A list of films produced in France in 1941:
See also
1941 in France
References
External links
French films of 1941 at the Internet Movie Database
French films of 1941 at Cinema-francais.fr
1941
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201942 | A list of films produced in France in 1942.
See also
1942 in France
References
External links
French films of 1942 at the Internet Movie Database
French films of 1942 at Cinema-francais.fr
1942
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201943 | A list of films produced in Occupied France in 1943.
See also
1943 in France
References
External links
French films of 1943 at the Internet Movie Database
French films of 1943 at Cinema-francais.fr
1943
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201945 | A list of films produced in France in 1945.
See also
1945 in France
References
External links
French films of 1945 at the Internet Movie Database
French films of 1945 at Cinema-francais.fr
1945
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201946 | A list of films produced in France in 1946.
A-L
M-Z
See also
1946 in France
References
External links
French films of 1946 at the Internet Movie Database
French films of 1946 at Cinema-francais.fr
1946
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201947 | A list of films produced in France in 1947.
A-L
M-Z
See also
1947 in France
References
External links
French films of 1947 at the Internet Movie Database
French films of 1947 at Cinema-francais.fr
1947
Films
Lists of 1947 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201948 | A list of films produced in France in 1948.
A-L
M-Z
See also
1948 in France
External links
French films of 1948 at the Internet Movie Database
French films of 1948 at Cinema-francais.fr
1948
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201949 | A list of films produced in France in 1949.
A-L
M-Z
See also
1949 in France
References
External links
French films of 1949 at the Internet Movie Database
French films of 1949 at Cinema-francais.fr
1949
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201950 | A list of films produced in France in 1950.
A-L
M-Z
See also
1950 in France
References
External links
French films of 1950 at the Internet Movie Database
French films of 1950 at Cinema-francais.fr
1950
Films
French |
https://en.wikipedia.org/wiki/LOOK%20algorithm | LOOK is a hard disk scheduling algorithm used to determine the order in which new disk read and write requests are processed.
Description
The LOOK algorithm, similar to the SCAN algorithm, honors requests on both sweep directions of the disk head, however, it additionally "looks" ahead to see if there are any requests pending in the direction of head movement. If no requests are pending in the direction of head movement, then the disk head traversal will be reversed to the opposite direction and requests on the other direction can be served. In LOOK scheduling, the arm goes only as far as final requests in each direction and then reverses direction without going all the way to the end. Consider an example, Given a disk with 200 cylinders (0-199), suppose we have 8 pending requests: 98, 183, 37, 122, 14, 124, 65, 67 and that the read/write head is currently at cylinder 53. In order to complete these requests, the arm will move in the increasing order first and then will move in decreasing order after reaching the end. So, the order in which it will execute is 65, 67, 98, 122, 124, 183, 37, 14.
LOOK avoids the starvation problem of shortest seek time first (SSTF). This is because LOOK is biased against the area recently traversed, and favors tracks clustered at the outermost and innermost edges of the platter. LOOK is also biased towards more recently arriving jobs (on average).
Variants
C-LOOK
One variant of LOOK is circular LOOK (C-LOOK). It is an effort to remove the bias in LOOK for track clusters at the edges of the platter. C-LOOK basically only scans in one direction. Either you sweep from the inside out, or the outside in. When you reach the end, you just swing the head all the way back to the beginning. This actually takes advantage of the fact that many drives can move the read/write head at high speeds if it's moving across a large number of tracks (e.g. the seek time from the last track to track 0 is smaller than one would expect and usually considerably less than the time it would take to seek there one track at a time). The huge jump from one end request to the other is not considered as a head movement as the cylinders are treated as a circular list.
N-LOOK and F-LOOK
N and F LOOK were designed to offset LOOK’s bias towards recent jobs. Both algorithms partition the request queue into smaller sub queues and process the sub queues in order (oldest first). N-LOOK is so-called because the request queue is divided into N sub queues. F-LOOK is a simplification where there are only 2 queues, but they are used in a double-buffered fashion. While F-LOOK is processing one queue, all new requests go into the other one. To explain these algorithms we’re going to use the example of a disk with 200 tracks, and the read/write head starts at track 100. The request queue, in order, contains requests for tracks: 55, 58, 18, 90, 160, 38, we assume that the request queue is split into two, with the oldest one containing the requests for tracks: 5 |
https://en.wikipedia.org/wiki/Index%20map | An index map is a finding aid for a set of maps covering regions of interest along with a name or number of the relevant map sheet. It provides geospatial data on either a sheet of paper or a computer display, like a gazetteer, with the location (such as a call number) represented within a grid overlaying the map's surface.
Geospatial data is often preferred to political borders, which often change. Information is searchable by coordinates, rather than the metadata for a particular country and region that can be entered into a catalog. In various institutions, maps are cataloged individually or as sets, resulting in various levels of specificity.
References
Index (publishing)
Map types |
https://en.wikipedia.org/wiki/American%20Society%20for%20Church%20Growth | The American Society for Church Growth (ASCG) is an international organization which provides a professional network for those individuals or organizations associated with the Church Growth Movement. The society was founded in 1986 by Donald McGavran and C. Peter Wagner, and is currently led by president James Cho. The organization changed its name to the Great Commission Research Network in 2009.
Profile
The ASCG defines church growth as follows:
Church growth is that careful discipline which investigates the nature, the function, and the health of Christian churches, as they relate to the effective implementation of the Lord's Great Commission to make disciples of all peoples (Matthew 28:19-20). It is a spiritual conviction, yet it is practical, combining the eternal principles of God's Word with the practical insights of social and behavioral sciences.
In 1991 the ASCG began publishing the Journal of the American Society for Church Growth (JASCG) annually, and in 1997 this became thrice yearly. This Journal has recently been renamed to the Great Commission Research Journal and is published by Biola University twice yearly. The journal is currently edited by Alan McMahan. The society also hosts an annual conference.
Past Presidents
Past presidents include:
C. Peter Wagner (founding president)
George Hunter III
Kent R. Hunter
Elmer Towns
Eddie Gibbs
Bill Sullivan
Carl F. George
Flavil Yeakley, Jr.
John Vaughan
Gary L. McIntosh
R. Daniel Reeves
Ray Ellis
Charles VanEngen
Charles Arn
Alan McMahan
Bob Whitesel
Steve Wilkes
Mike Morris
References
External links
Evangelical parachurch organizations |
https://en.wikipedia.org/wiki/Damon%20Amendolara | Damon Lawrence Amendolara (born June 21, 1979) is the morning host (6–10am ET) on the CBS Sports Radio Network, heard across North America. He was promoted to that time slot in March 2017. He previously worked as the evening host for WBZ-FM in Boston. He also acted as the sideline reporter for Major League Soccer telecast of the New England Revolution. He is a contributor to the NFL Network, MLB Network, NFL Films, SportsNet New York and WFAN radio in New York. The new CBS Sports Radio Network launched on January 2, 2013 with Amendolara as the overnight host, and is syndicated across CBS Sports Radio over 150 radio stations in the U.S. and Canada.
D.A. was named the 9th best national sports radio show in 2018, the 13th best national sports radio show in 2017 and the 17th best in 2016, according to Barrett Sports Media. On October 5, 2018 the Boise, Idaho City Council declared "Damon Amendolara Day," based on the popularity of the show on affiliate KTIK and part of a three-day show celebration. He was part of Comcast's Pre Game Live and Post Game Live, alongside Mike Felger, Ty Law and Troy Brown. He was also a guest host for Sports Tonight on CSNNE, and a regular panelist shows like Sports Sunday, and The Baseball Show. Amendolara was hired for the launch of the Sports Hub in Boston in August 2009 as the evening host, 6–11 pm.
Before Boston, Amendolara hosted nights in Miami on Sportsradio 560 WQAM starting in '08. On Friday, August 7, 2009, The Miami Herald announced that Amendolara was leaving Miami to host a show on a new FM sports station in Boston, which later was revealed as WBZ-FM.
From 2003–2008, D.A. worked in Kansas City at 610 Sports, hosting the morning drive show. He was hired as the evening anchor for KCSP at the launch of the station in September 2003. In August 2004, Amendolara became the host of the morning show at 610 Sports. There he also anchored the station's Chiefs programming, including the Chiefs players shows. On Monday, December 17, 2007, The Kansas City Star reported that D.A. had left 610 Sports.
From 2001–2003, he worked at the ESPN Radio affiliate in Fort Myers, FL where he hosted The D.A. Show, and was the play-by-play announcer for the Fort Myers Miracle (Minnesota Twins minor league team). Also while at ESPN, he hosted the SportsCenter updates in the afternoon, and hosted the pregame/postgame shows for the Florida Firecats of the Arena Football League.
Charities
D.A. has devoted much of the show to raising money for local charities with a focus on children, with "The D.A. Show Cares." He has coached and helped sponsor the Spartans, a youth soccer team in the Miramar (FL) Police Athletic League (whose last-place finish became a popular and humorous topic on the show). The effort has reached out to organizations such as The Boys & Girls Club of Kansas City, The Bridge Home, Children's Mercy Hospital and The KCMO Little League. He has raised close to $10,000 since starting it in 2006. He is an honorary board mem |
https://en.wikipedia.org/wiki/IBM%201401%20Symbolic%20Programming%20System | The IBM 1401 Symbolic Programming System (SPS) was an assembler that was developed by Gary Mokotoff, IBM Applied Programming Department, for the IBM 1401 computer, the first of the IBM 1400 series. One source indicates that "This programming system was announced by IBM with the machine."
SPS-1 could run on a low-end machine with 1.4K memory, SPS-2 required at least 4K memory.
SPS-1 punched one card for each input instruction in its first pass and this deck had to be read during pass 2. At the University of Chicago and many other locations, SPS-1 was replaced by assemblers taking advantage of the commonly available 4K memory configuration to pack the output of pass one into several instructions per card. Other assemblers were written which placed the pass one output into memory for small programs.
As the 1400 series matured additional assemblers, programming languages and report generators became available, replacing SPS in most sites.
See also
Autocoder
FARGO (programming language)
References
External links
IBM 1401 Symbolic Programming Systems: SPS-1 and SPS-2, C20-1480-0
"1401s I have known" by Tom Van Vleck includes a description of an operating environment including 1401 SPS machines.
Assembly languages
1401 Symbolic Programming System |
https://en.wikipedia.org/wiki/RX%20meter | An RX meter is used to measure the separate resistive and reactive components of reactive parallel Z network.
The two variable frequency oscillators track each other at frequencies 100 kHz apart. The output of a 0.5-250 MHz oscillator, F1, is fed into a bridge. When the impedance network to be measured is connected one arm across the bridge, the equivalent parallel resistance and reactance (capacitive or inductive) unbalances the bridge and the resulting voltage is fed to the mixer. The output of the 0.6-250.1 MHz oscillator F2, tracking 100 kHz above F1, is also fed to the mixer. This results in a 100 kHz difference frequency proportional in level to the bridge unbalance. The difference frequency signal is amplified by a filter amplifier combination and is applied to a null meter. When the bridge resistive and reactive controls are nulled, their respective dials accurately indicate the parallel impedance components of the network under test.
The best-known RX Meter was the RX250-A, developed in the early 1950s by Boonton Radio Corporation. After acquiring BRC, Hewlett-Packard continued to sell versions of the meter (both the original and the improved 250B) into the late 1960s.
References
Electrical engineering
Impedance measurements |
https://en.wikipedia.org/wiki/Machine%20Check%20Architecture | In computing, Machine Check Architecture (MCA) is an Intel and AMD mechanism in which the CPU reports hardware errors to the operating system.
Intel's P6 and Pentium 4 family processors, AMD's K7 and K8 family processors, as well as the Itanium architecture implement a machine check architecture that provides a mechanism for detecting and reporting hardware (machine) errors, such as: system bus errors, ECC errors, parity errors, cache errors, and translation lookaside buffer errors. It consists of a set of model-specific registers (MSRs) that are used to set up machine checking and additional banks of MSRs used for recording errors that are detected.
See also
Machine-check exception (MCE)
High availability (HA)
Reliability, availability and serviceability (RAS)
Windows Hardware Error Architecture (WHEA)
References
External links
Microsoft's article on Itanium's MCA
Linux x86 daemon for processing of machine checks
Computer architecture
X86 architecture
fa:معماری چک ماشین |
https://en.wikipedia.org/wiki/Alexey%20Lyapunov | Alexey Andreyevich Lyapunov (; 8 October 1911 – 23 June 1973) was a Soviet mathematician and an early pioneer of computer science. One of the founders of Soviet cybernetics, Lyapunov was member of the Academy of Sciences of the Soviet Union and a specialist in the fields of real function theory, mathematical problems of cybernetics, set theory, programming theory, mathematical linguistics, and mathematical biology.
Biography
Composer Sergei Lyapunov, mathematician Aleksandr Lyapunov, and philologist Boris Lyapunov were his close relatives.
In 1928, Lyapunov enrolled at Moscow State University to study mathematics, and in 1932 he became a student of Nikolai Luzin. Under his mentorship, Lyapunov began his research in descriptive set theory. He became world-wide known for his theorem on the range of an atomless vector-measure in finite dimensions, now called the Lyapunov Convexity Theorem.
From 1934 until the early 1950s, Lyapunov was on the staff of the Steklov Institute of Mathematics. When Mstislav Keldysh organized the Department of Applied Mathematics (now the M.V. Keldysh Institute of Applied Mathematics) he suggested Lyapunov to lead its work on programming.
In 1954 A.A. Lyapunov was invited by Anatoly Kitov (scientific director of the Computing Center No. 1 of the USSR Ministry of Defense) to this computing center as head of the laboratory. A.A. Lyapunov worked at this military computing center until 1960.
In 1961, Lyapunov moved to the Institute of Mathematics of the Siberian Division of the Academy of Sciences of the Soviet Union (now the Sobolev Institute of Mathematics), where he founded the department of cybernetics. At Novosibirsk State University, he founded the Department of Theoretical Cybernetics and the Laboratory of Cybernetics at the Institute of Hydrodynamics of the Siberian Division of the Academy of Sciences of the Soviet Union (now the Lavrentiev Institute of Hydrodynamics) which he led until the end of his life.
In 1964, Lyapunov was elected a member of the Academy of Sciences of the Soviet Union and joined the Division of Mathematics.
He was awarded the Order of the Red Star in 1944, Order of the Badge of Honour in 1953, two Orders of the Red Banner of Labour (1956 and 1967), and Order of Lenin in 1971. In 1996, he was awarded the IEEE Computer Society's Computer Pioneer Award.
References
Biography of Lyapunov
Lyapunov's contributions to cybernetics
Lyapunov's 90th birthday
Lyapunov at IPM RAS
External links
A. A. Lyapunov (on his 60th birthday)
S. Kutateladze "Lyapunov's convexity theorem, zonoids, and bang-bang"
1911 births
1973 deaths
20th-century Russian mathematicians
Mathematicians from Moscow
Academic staff of Novosibirsk State University
Academic staff of Tver State University
Corresponding Members of the USSR Academy of Sciences
Moscow State University alumni
Communist Party of the Soviet Union members
Recipients of the Order of the Badge of Honour
Recipients of the Order of Lenin
Recipients of |
https://en.wikipedia.org/wiki/Total%20Intelligence%20Solutions | Total Intelligence Solutions, LLC, (TIS) is a risk management and consulting company headquartered in Arlington, Virginia. The company delivers threat and vulnerability assessments, data acquisition capabilities, physical and information security services, training, and high-level consulting to Fortune 500 companies, and to U.S. and foreign governments.
TIS owned and operated the Terrorism Research Center, Incorporated (TRC) from 2007 to 2010. The TRC delivered training and research support relating to counterterrorism and asymmetric warfare/conflict to the private sector, and U.S. and foreign government customers.
TIS was owned by The Prince Group, a private company led by Erik Prince. Erik Prince also owned numerous other investment and business interests to include Academi (formerly known as Blackwater). Cofer Black was formerly the chairman of TIS. The TIS website now forwards to a site operated by OODA Group LLC.
References
External links
http://www.totalintel.com/index.php
Total Intelligence Solutions at SourceWatch
Dana Hedgpeth, "Blackwater's Owner Has Spies for Hire", Washington Post, Nov. 3, 2007, p.A01.
http://www.ooda.com
Security companies of the United States
Risk management companies |
https://en.wikipedia.org/wiki/S-Lang | The S-Lang programming library is a software library for Unix, Windows, VMS, OS/2, and Mac OS X. It provides routines for embedding an interpreter for the S-Lang scripting language, and components to facilitate the creation of text-based applications. The latter class of functions include routines for constructing and manipulating keymaps, an interactive line-editing facility, and both low- and high-level screen/terminal management functions. It is distributed under the terms of the GNU General Public License.
Brief history
The S-Lang programming library was started in 1992 by John E. Davis, considering that functions he wrote for a text editor might be useful in other programs. The earliest version of the library contained input/output routines for interacting with computer terminals and an implementation of a simple stack-based interpreter with a PostScript-like syntax that he developed for use in a scientific plotting program. The JED text editor was the first program to both embed the interpreter and use the terminal I/O components of the library.
Interpreter
The interpreter makes up most of the S-Lang library, and is also where most of the development takes place. Although the original syntax supported by the interpreter resembled PostScript, the syntax has evolved to be much more C-like, with additional support for object-oriented style constructs. As a reflection of Davis's background in physics and professional interest in scientific computing, the language natively supports many vectorized array-based operations similar to MATLAB and IDL.
Until version 2.0, the interpreter was not a standalone program. Instead, Davis advocated embedding it into applications to make them extensible. Using the interpreter meant either embedding it in a C program, or using it in the context of another application (e.g., the JED editor). The S-Lang shell, slsh, was a demonstration program capable of little more than running scripts. Version 2.0, released in 2005, made slsh interactive, and it has evolved into an application in its own right, with a number of external modules for use by it. As such, it has become the S-Lang interpreter.
Screen management
In the mid-1990s while porting the sc spreadsheet to the S-Lang library, Davis developed the library's screen management facility. This component was designed to optimize screen output (by minimizing the number of characters sent to the terminal), and provide a simple way to support a variety of terminals through an extra layer of abstraction between the application code and the terminal. The slrn newsreader was the first application to make full use of this interface. Since then, a number of other programs (e.g., Mutt) have taken advantage of this feature of the library, and it has become arguably the most used aspect of the library, as this component is considered to be an alternative to curses. Since version 2.0, the screen management routines have had transparent support for UTF-8.
Example |
https://en.wikipedia.org/wiki/Kernelization | In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which inputs to the algorithm are replaced by a smaller input, called a "kernel". The result of solving the problem on the kernel should either be the same as on the original input, or it should be easy to transform the output on the kernel to the desired output for the original problem.
Kernelization is often achieved by applying a set of reduction rules that cut away parts of the instance that are easy to handle. In parameterized complexity theory, it is often possible to prove that a kernel with guaranteed bounds on the size of a kernel (as a function of some parameter associated to the problem) can be found in polynomial time. When this is possible, it results in a fixed-parameter tractable algorithm whose running time is the sum of the (polynomial time) kernelization step and the (non-polynomial but bounded by the parameter) time to solve the kernel. Indeed, every problem that can be solved by a fixed-parameter tractable algorithm can be solved by a kernelization algorithm of this type. This is also true for approximate kernelization.
Example: vertex cover
A standard example for a kernelization algorithm is the kernelization of the vertex cover problem by S. Buss.
In this problem, the input is an undirected graph together with a number . The output is a set of at most vertices that includes an endpoint of every edge in the graph, if such a set exists, or a failure exception if no such set exists. This problem is NP-hard. However, the following reduction rules may be used to kernelize it:
If and is a vertex of degree greater than , remove from the graph and decrease by one. Every vertex cover of size must contain since otherwise too many of its neighbors would have to be picked to cover the incident edges. Thus, an optimal vertex cover for the original graph may be formed from a cover of the reduced problem by adding back to the cover.
If is an isolated vertex, remove it. An isolated vertex cannot cover any edges, so in this case cannot be part of any minimal cover.
If more than edges remain in the graph, and neither of the previous two rules can be applied, then the graph cannot contain a vertex cover of size . For, after eliminating all vertices of degree greater than , each remaining vertex can only cover at most edges and a set of vertices could only cover at most edges. In this case, the instance may be replaced by an instance with two vertices, one edge, and , which also has no solution.
An algorithm that applies these rules repeatedly until no more reductions can be made necessarily terminates with a kernel that has at most edges and (because each edge has at most two endpoints and there are no isolated vertices) at most vertices. This kernelization may be implemented in linear time. Once the kernel has been constructed, the vertex cover problem may be solved by a brute |
https://en.wikipedia.org/wiki/ASP.NET%20Dynamic%20Data | ASP.NET Dynamic Data is a Ruby on Rails-inspired web application scaffolding framework from Microsoft, shipped as an extension to ASP.NET, that can be used to build data-driven web applications. It exposes tables in a database by encoding it in the URI of the ASP.NET web service, and the data in the table is automatically rendered to HTML. The process of rendering can be controlled using custom design templates. Internally, it discovers the database schema by using the database metadata.
ASP.NET Dynamic Data was originally shipped as part of the "ASP.NET 3.5 Extensions" package in 2007, and was incorporated into the .NET Framework 3.5 Service Pack 1, which was released August 11, 2008.
References
Further reading
External links
ASP.NET Dynamic Data Introduction
ASP.NET Extensions Preview
Dynamic Data |
https://en.wikipedia.org/wiki/File%20select | In HTML, a file-select control is a component of a web form with which a user can select a local file. When the form is submitted (perhaps together with other form data), the file is uploaded to the web server. There, when the file arrives, some action usually takes place, such as saving the file on the web server. However, the particular action that takes place is determined by the server-side script to which the form is submitted.
Code example
Here is a code example of a web form with a file-select control. It is the input element with type="file" that creates the file-select control.
<form action="form-handler.php" method="post" enctype="multipart/form-data">
<div>
<input id="myfile" name="myfile" type="file">
<input value="Upload ►" type="submit">
</div>
</form>
Rendering
When it comes to the rendering on the screen of a file-select control, there is some variation among web browsers. Typically, on a Windows-based platform, user agents will render a file-select control as a text field, together with a "Browse" button. When the "Browse" button is pressed, a file dialog opens, with which actual file selection on one's platform can take place. After selection, the filename of the selected file is displayed in the text field. Alternatively, instead of using the "Browse" button, the filename can be entered directly in the text field.
Some browsers, notably Firefox, no longer allow a filename to be typed directly in. This is a security measure - it is possible to trick the user into uploading confidential information.
Functionality
The mechanism for form-based file upload was originally proposed in RFC 1867 (published November 1995), as an extension to HTML 2.0 (RFC 1866), after its publication. Form-based file upload then was incorporated in HTML 3.2, which explicitly refers to RFC 1867 for further information on form-based file upload.
HTML 4.01 does not, in itself, describe how the file-select control is supposed to work, but it does list RFC 2388 and RFC 1867 as references.
Multiple file selection
The intention in RFC 1867 is that a single file-select control should allow selection of multiple files. This intention seems reflected in HTML 4.01, which, for the file-select control- type, states
This control type allows the user to select files so that their contents may be submitted with a form. The INPUT element is used to create a file select control.
It has been noted that the plural "files" in the above quote is an indication that, in HTML 4.01, a single-file select-control still was supposed to handle selection of multiple files and not just a single file.
This situation is being clarified in HTML5 by adding a "multiple" attribute when the file input should accept multiple files. The current draft specifies the new behavior to be: Unless the multiple attribute is set, there must be no more than one file in the list of selected files.
Accept attribute
RFC 1867 also introduced the accept attribute for the input element. This woul |
https://en.wikipedia.org/wiki/Naval%20Computer%20and%20Telecommunications%20Station%20Naples%2C%20Italy | The Naval Computer and Telecommunications Station Naples (NCTS Naples) provides voice, video and data services to the U.S. Navy joint, allied and coalition customers. It has two manned sites: C4I at Capodichino and SATCOM at Lago Patria. NCTS Naples has approximately 20 Officers, 325 Enlisted personnel, and 40 civilians.
NCTS Naples History
1963 to 1968
In 1963, Naval Communication Unit was established on the Joint Force Command Naples (AFSOUTH) post in Bagnoli. Most of the unit's resources came from the communications department of Naval Support Activity, Naples. In May 1968, its mission was expanded to include fleet support for units in the Mediterranean Sea and the command was renamed Naval Communications Station, Italy (NAVCOMMSTA).
1974 to 1976
In July 1974, the continuing expansion was marked by the installation of the Naval Communication Processing and Routing System (NAVCOMPARS) and sophisticated satellite systems.
On April 1, 1976, NAVCOMMSTA was redesignated as Naval Communication Area Master Station, Mediterranean (NAVCAMS MED) and became one of four in the world. With the name change NAVCAMS MED received an expanded mission, including oversight of all tactical naval communication systems and circuitry within the Mediterranean communications area.
1990s to Present
In October 1991, NAVCAMS MED was tasked with providing computer support and services to local commands with the expanded mission it became Naval Computer Telecommunications Area Master Station, Mediterranean (NCTAMS MED). NCTAMS also began to provide operational direction to NAVCOMSTA Sicily and NAVCOMMU London.
In October 1993, NAVCOMSTA Spain was placed under the operational direction of NCTAMS MED becoming NCTAMS MED Detachment Rota Spain.
NCTAMS MED began consolidation efforts in the Naples area by moving to the new state-of-the-art Command, Control, Communications, Computers, and Intelligence (C4I) facility located in the Capt John E Myers Building at Capodichino, the move was completed in 10 months. Following the completion of this move, NCTAMS assumed responsibility of Indian Ocean communications services. With this new operational responsibility came a new title NCTAMS EURCENT reflecting the European and Central (Indian Ocean and Southwest Asia) area of operation.
October 6, 2005 NCTAMS EURCENT as a part of Navy-wide consolidation was designated Naval Computer Telecommunications Station, Naples (NAVCOMTELSTA NAPLES IT).
Today, NCTS Naples is vital part of US and Joint communications providing services to several local commands including United States Sixth Fleet, United States Naval Forces Europe and many other non-local commands. NCTS will become TNOSC (Theatre Network Operations Service Center) responsible for network management and directly providing Internet Protocol services through OCONUS Navy Enterprise-Network (ONE-NET). It also provides legacy circuits and messaging capabilities.
References
External links
Official Web Site
Computer and Telecommun |
https://en.wikipedia.org/wiki/BARS | BARS may refer to:
BARS (Russia), a Russian military reserve force
BARS (tropospheric scatter network), a Warsaw Pact tropospheric scatter communications network in Eastern Europe
BARS apparatus, a high-pressure apparatus for growing/processing minerals
B.A.R.S. The Barry Adrian Reese Story, an album by hip-hop artist Cassidy
Balanced Automatics Recoil System, a small-arms recoil reduction system developed by Peter Andreevich Tkachev
Behaviorally anchored rating scales, used to report performance in psychology research on behaviorism
British American Railway Services, a train owner and operator in the United Kingdom
Buenos Aires Rojo Sangre, a film festival
Bars may refer to:
Bars, Dordogne, commune of the Dordogne département in France
Bars, Gers, a commune of the Gers département in France
Bars-class submarine (1915) built for the Imperial Russian Navy
Bars county, a former Kingdom of Hungary county in present-day Slovakia
Bars radar, a family of Russian (former USSR) airborne radars
Bars Soviet submarine; see Akula-class submarine
bars, plural of bar
ceb:Bars
de:Bars
es:Bars
fr:Bars
it:Bars
nl:Bars
pl:Bars
scn:Bars |
https://en.wikipedia.org/wiki/European%20Referendum%20Campaign | The European Referendum Campaign (ERC) was an independent, Europe-wide, cross party network of NGOs and individuals which intended to bring together campaigners to fight for democratic development within the European Union. Its sole objective was to gain as many referendums on the 2007 EU Lisbon Treaty in as many EU member states as possible. The ERC was supported by the NGO Mehr Demokratie, and by Democracy International, a split-off of Mehr Demokratie, whose people also created the European Citizens' Initiative. The ERC cooperated with the European political party EUDemocrats – Alliance for a Europe of Democracies, as inspired and presided by Jens-Peter Bonde.
History
The European Referendum Campaign began in 2002 and focused on reaching referendums on the European Constitution. The ERC lobbied the Convention on the Future of Europe to produce something that would be understood by the people, and, regardless of the outcome of the convention, put the product to an EU-wide referendum.
By 2003 the campaign began to gather momentum, the ERC joined forces with Referendum04, Vote 2004 and Trust the People, as well as other campaigns fighting for referendums across Europe. In the Netherlands, It was the local ERC team who lobbied for a referendum there. The law to pass the referendum was drafted by a member of the ERC team, Niesco Dubbelboer, who was a Dutch MP at the time. It ceased the effort in 2004. By the end, the campaign was supported by 293 organisations from across Europe as well as 97 members of the Convention on the Future of Europe who drew up the original EU Constitution (draft).
The ERC continued to fight for referendums on the new EU Lisbon Treaty. The ERC stated that the new treaty is the same as the previous European Constitution and that the treaty contains fundamental changes to the framework of the EU. Therefore, the consent of citizens is needed in order to legitimise treaty. The ERC did not hold a position on the treaty itself and whether or not it should be enforced. The ERC campaigned only against the undemocratic ratification process.
The Lisbon Treaty came into effect on 1 December 2009.
Criticism
Some believed that the Lisbon Treaty is different from the constitution and therefore it does not require a referendum. However, later on, the fact that the texts are identical was confirmed, next to other politicians in Europe, by Valéry Giscard d’Estaing, who presided over the EU Convention:
”The Treaty of Lisbon is the same as the rejected constitution. Only the format has been changed to avoid referendums".–Valéry Giscard d’Estaing, former French President and President of the Constitutional Convention in several European newspapers, 27 October 2007
Further, it was also believed that holding a vote on the treaty would be detrimental to the progress of the European Union.
It has been argued that the treaty is far too complex for ordinary people to vote on. That they do not have the expertise necessary to make a decision o |
https://en.wikipedia.org/wiki/World%20Association%20of%20Young%20Scientists | The World Association of Young Scientists (WAYS; formerly the World Academy of Young Scientists) is a global network of young scientists established in 2004, in partnership with UNESCO and ICSU. It provides a Web 2.0 platform for scientific exchange, thereby linking individuals and existing networks with a regional or disciplinary focus.
History
At the World Conference on Science in Budapest in 1999, the International Forum of Young Scientists identified a need to promote the involvement of younger generation of scientists in the dialogue between government authorities, parliaments, educational institutions and to develop national science policies taking into consideration needs, opportunities and perspectives of young researchers. To that end, a World Academy of Young Scientists was proposed, to serve as a resource and network for young scientists and to harness their energy and expertise. This idea was further developed with the support of UNESCO and ICSU, culminating in the first General Assembly of WAYS in Marrakech in 2004.
The 1st World Academy of Young Scientists General Assembly, jointly organized by UNESCO in cooperation with ISESCO, the Third World Academy of Sciences (TWAS), the Ministry of National Education, Higher Education, Executive Training and Scientific Research, Morocco and the Morocco UNESCO National Commission, was held in Marrakech from 11 to 13 December 2004. 150 young researchers from 87 countries attended the meeting. In the framework of the WAYS's 1st General Conference, a Round Table on "Science contributing to the dialogue among civilization: the young scientists perspective" was also organized. On that occasion, it was strongly recognized that dialogue is a constituent element present in science and particularly highlighted the requirements of communication and mutual understanding for science cooperation.
In 2005, WAYS held a meeting in Budapest as a satellite to the World Science Forum.
At the Third World Science Forum in 2007, WAYS was renamed as the World Association of Young Scientists, to reflect its development as a network of scientists as opposed to an academy.
Activities
WAYS fosters communication among young scientists through its web portal, and leverages activities by linking up projects that can benefit from the energy and attention of young scientists.
Partnerships and Collaborations
See also: Permafrost Young Researchers Network, Eurodoc, The Scholar Ship
External links
WAYS Homepage
Article in Nature on Founding of WAYS
Article on SciDevNet on Founding of WAYS
Program of First WAYS General Conference
World Science Forum
International scientific organizations
Organizations established in 2004
Youth empowerment organizations |
https://en.wikipedia.org/wiki/Ego%20Trip%27s%20Miss%20Rap%20Supreme | Ego Trip's Miss Rap Supreme is an American reality television series that airs on the VH1 cable network. It is a follow-up to 2007's Ego Trip's The (White) Rapper Show.
In Ego Trip's Miss Rap Supreme, contestants compete to win the title of next great female MC.
The show is hosted by MC Serch and female MC Yo-Yo. It premiered on VH1 in April 2008.
Contestants
Notes
*Lionezz was eliminated on Episode 1, but brought back in Episode 2 after Khia was disqualified.
Call-out order
The contestant was named Miss Rap Supreme.
The winning contestant(s) on that week's challenge, making them safe from elimination
The contestant was named "Miss..." for the week (team MVP)
The contestant was eliminated
The contestant was eliminated and later brought back into the competition
The contestant won the challenge but was eliminated
The contestant was disqualified.
The "Miss..." awards
Week 1: "Miss Representation"
Week 2: "Miss Thang"
Week 3: "Miss Maneater"
Week 4: "Miss Lady of the Stage"
Week 5: "Miss Video Venus"
Week 6: "Miss Popularity"
Week 7: "Miss Con-G-nality"
Week 8: "Miss Rap Supreme"
Episode Notes
Khia was disqualified at the beginning of Episode 2 due to her use of a pre-written song ("Respect Me") for her 16-bar song. Lionezz was brought back as a result.
In episode 7, Chiba admitted to Byata And Rece Steele that she uses pre-written songs in the competition, but stays original when told to do so. This caused even more tension with the girls. All the girls became suspicious of Chiba when everyone stumbled on their raps, but Chiba did not.
Although Chiba won the challenge, she was eliminated in episode 7 after being in the bottom two with Byata.
Celebrity guests
Ghostface Killah
Too Short
John Singleton
Soulja Boy Tell 'Em
Just Blaze
WC
Roxanne Shante
will.i.am
Missy Elliott
Charli Baltimore
See also
Ego Trip (magazine)
Ego Trip's The (White) Rapper Show
References
External links
Official Website
Audio interview with ego trip's Brent Rollins and Gabriel Alvarez on public radio program The Sound of Young America
2000s American reality television series
VH1 original programming
2008 American television series debuts
2008 American television series endings
English-language television shows
African-American reality television series |
https://en.wikipedia.org/wiki/Project%20Joshua%20Blue | Joshua Blue is a project under development by IBM that focuses on advancing the artificial intelligence field by designing and programming computers to emulate human mental functions.
Goals
According to researchers at IBM's Thomas J. Watson Research Center, the main goal of Joshua Blue is "to achieve cognitive flexibility that approaches human functioning". In short, IBM is aiming to design Joshua Blue to 'think like a human', mainly in terms of emotional thought; similar IBM projects focusing on logical thought and strategic reasoning include Deep Blue, a logic-based chess-playing computer, and Watson, a question-driven artificial intelligence software program. Currently, the vast majority of computers and computational systems run off of an input-output model; some sort of input is entered in, and some output is given back. Through Project Joshua Blue, IBM hopes to develop computers to the point where they are asking questions and searching for answers themselves, rather than relying on an external input to run or only crunching numbers to give a pre-programmed response once given a task. If they succeed in this task, the artificial intelligence knowledge gained from Project Joshua Blue could potentially be used to create social robots that work and act very much as humans do. These robots could take over tasks too dangerous for humans to engage in, even if such tasks required many different decisions to be made along the way; the technological advancement gained through Joshua Blue's potential success would allow for the robots to think for themselves and work their way through problems just as humans do.
How it will work
A model of Joshua Blue's learning pattern has been created. Similar to how young children learn human traits through interacting with their surroundings, Joshua Blue will acquire knowledge through external stimuli present in its environment. IBM believes that if computers evolve to learn in this way and then comprehend and analyze the knowledge gained using reason, computers could begin to possess a "mind", of sorts, capable of demonstrating complex social behaviors similar to those of humans.
Most likely done as a precaution to avoid theft of their ideas, IBM has not released any significant information regarding how Joshua Blue will physically gather information. Thus far, IBM has revealed that Joshua Blue will be a computer with a network of wires and input nodes that function as a computer nervous system. This nervous system will be used by Joshua Blue to perceive affect or personal emotional feelings. Not only will this network of input nodes help Joshua Blue discover things physically, but it will also allow Joshua Blue to interpret the significance of events. The input nodes, or proprioceptors, will enable Joshua Blue to be aware of things that happen around itself, as well as recognize and attach meaning to the emotional effect produced by interacting with an object in a certain way. In addition, Joshua Blue's pro |
https://en.wikipedia.org/wiki/The%20Cure%20for%20Pain | "The Cure For Pain" is the first single from singer/songwriter Jon Foreman's debut solo EP, Fall. It was released Monday, December 10, 2007 as a free download on popular networking site Myspace's homepage.
confirmed it as a single.
Song story
About "The Cure For Pain," Foreman has said, "I wrote this one in Texas on a day off. I was reflecting on the passing of time. I have been playing music in Switchfoot for about ten years. During that period, I have been fighting pain or running away from it in a myriad of ways. And yet the pain is a constant. I have had some amazing moments singing gravity away but the water keeps on falling.
I began to think of the suffering I see around me, I think of the pain of a grandmother dying of cancer. Of a friend killed by a train. I think of the pain of death, of failure, of rejection, the pain of a father losing his only son. And I came to the conclusion that I cannot run from pain any longer."
In Pop Culture
This song appeared on the 17th episode of Season 4 of the TV show Grey's Anatomy.
References
External links
Jon Foreman Official Website
Jon Foreman on Myspace
Song Lyrics
Song Story
Download Song
2007 singles
Songs written by Jon Foreman
2007 songs |
https://en.wikipedia.org/wiki/Osama%20Al-Zain | Osama Al-Zain () is a Palestinian filmmaker and writer. He received his undergraduate degree in Computer Engineering from the University of Jordan. After winning the Moris Sheer Award for short videos at The International Competition for Students Artist sponsored by Savannah College of Art and Design, he moved to the USA to pursue his graduate studies in film and video. He finished his Master's degree of Arts in Film and Video from the American University, in Washington DC.
Osama Al-Zain has worked on documentaries about social and political issues. His credits include writing, producing, and directing shorts, documentaries, and public service announcements.
Transparency, a 2002 award-winning documentary , which he produced and directed, was screened in more than 16 cities in the US, Europe and the Middle East.
In 2005 Al-Zain released Palestine Post 9/11, a feature-length documentary which he produced and directed about the events of 9/11 from a Palestinian perspective.
The Dean العميدة-هيلين توماس , a 2014 two-part documentary mini series Osama Al-Zain produced and directed about the life and career of the late journalist Helen Thomas.
In 2017 Al-Zain released Gamal Abd El-Nasser Revisited جمال عبد الناصر - زيارة جديدة , a seven-part biographical documentary series he produced and directed about the life and political journey of the Arab leader Gamal Abd El-Nasser Gamal Abdel Nasser
Osama Al-Zain lives in the States where he works as film producer/director. He's currently the CEO of IG-Creative-Group based in Washington DC.
External links
Palestine Post 911 at Cinema Guild
Palestine Post 911 review by Dr. Marwan Asmar on Countercurrents.org
Transparency at Zahra Pictures
FEMINIST RESPONSES TO VEILING: FOUR BOOKS AND TWO FILMS
Osama Al-Zain Oral Memoir Transcript-Baylor University Digital Collection.
Osama Al-Zain Oral Memoir Audio Recording-Baylor University Digital Collection.
Osama Al-Zain- 30 Notable alumni of University of Jordan
Osama Al-Zain at "Dreams of a Nation", Columbia University.
Living people
American University School of Communication alumni
Palestinian film directors
University of Jordan alumni
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Outline%20of%20object%20recognition | Object recognition – technology in the field of computer vision for finding and identifying objects in an image or video sequence. Humans recognize a multitude of objects in images with little effort, despite the fact that the image of the objects may vary somewhat in different view points, in many different sizes and scales or even when they are translated or rotated. Objects can even be recognized when they are partially obstructed from view. This task is still a challenge for computer vision systems. Many approaches to the task have been implemented over multiple decades.
Approaches based on CAD-like object models
Edge detection
Primal sketch
Marr, Mohan and Nevatia
Lowe
Olivier Faugeras
Recognition by parts
Generalized cylinders (Thomas Binford)
Geons (Irving Biederman)
Dickinson, Forsyth and Ponce
Appearance-based methods
Use example images (called templates or exemplars) of the objects to perform recognition
Objects look different under varying conditions:
Changes in lighting or color
Changes in viewing direction
Changes in size/shape
A single exemplar is unlikely to succeed reliably. However, it is impossible to represent all appearances of an object.
Edge matching
Uses edge detection techniques, such as the Canny edge detection, to find edges.
Changes in lighting and color usually don't have much effect on image edges
Strategy:
Detect edges in template and image
Compare edges images to find the template
Must consider range of possible template positions
Measurements:
Good – count the number of overlapping edges. Not robust to changes in shape
Better – count the number of template edge pixels with some distance of an edge in the search image
Best – determine probability distribution of distance to nearest edge in search image (if template at correct position). Estimate likelihood of each template position generating image
Divide-and-Conquer search
Strategy:
Consider all positions as a set (a cell in the space of positions)
Determine lower bound on score at best position in cell
If bound is too large, prune cell
If bound is not too large, divide cell into subcells and try each subcell recursively
Process stops when cell is “small enough”
Unlike multi-resolution search, this technique is guaranteed to find all matches that meet the criterion (assuming that the lower bound is accurate)
Finding the Bound:
To find the lower bound on the best score, look at score for the template position represented by the center of the cell
Subtract maximum change from the “center” position for any other position in cell (occurs at cell corners)
Complexities arise from determining bounds on distance
Greyscale matching
Edges are (mostly) robust to illumination changes, however they throw away a lot of information
Must compute pixel distance as a function of both pixel position and pixel intensity
Can be applied to color also
Gradient matching
Another way to be robust to illumination changes without t |
https://en.wikipedia.org/wiki/LightningPaint | LightningPaint was a monochrome, black + white bitmap graphics editor for the Apple Macintosh series of personal computers. Written in Lightspeed C, the program was similar to MacPaint, but distributed as shareware long after Apple stopped bundling MacPaint with new computers.
References
External links
LightningPaint page at an archive of old Mac graphic software
Classic Mac OS software
Macintosh-only software
Macintosh graphics software
Raster graphics editors
Discontinued software
1991 software |
https://en.wikipedia.org/wiki/Biositemap | A Biositemap is a way for a biomedical research institution of organisation to show how biological information is distributed throughout their Information Technology systems and networks. This information may be shared with other organisations and researchers.
The Biositemap enables web browsers, crawlers and robots to easily access and process the information to use in other systems, media and computational formats. Biositemaps protocols provide clues for the Biositemap web harvesters, allowing them to find resources and content across the whole interlink of the Biositemap system. This means that human or machine users can access any relevant information on any topic across all organisations throughout the Biositemap system and bring it to their own systems for assimilation or analysis.
File framework
The information is normally stored in a biositemap.rdf or biositemap.xml file which contains lists of information about the data, software, tools material and services provided or held by that organisation. Information is presented in metafields and can be created online through sites such as the biositemaps online editor.
The information is a blend of sitemaps and RSS feeds and is created using the Information Model (IM) and Biomedical Resource Ontology (BRO). The IM is responsible for defining the data held in the metafields and the BRO controls the terminology of the data held in the resource_type field. The BRO is critical in aiding the interactivity of both the other organisations and third parties to search and refine those searches.
Data formats
The Biositemaps Protocol allows scientists, engineers, centers and institutions engaged in modeling, software tool development and analysis of biomedical and informatics data to broadcast and disseminate to the world the information about their latest computational biology resources (data, software tools and web services). The biositemap concept is based on ideas from Efficient, Automated Web Resource Harvesting and
Crawler-friendly Web Servers, and it integrates the features of sitemaps and RSS feeds into a decentralized mechanism for computational biologists and bio-informaticians to openly broadcast and retrieve meta-data about biomedical resources.
These site, institution, or investigator specific biositemap descriptions are published in RDF format online and are searched, parsed, monitored and interpreted by web search engines, web applications specific to biositemaps and ontologies, and other applications interested in discovering updated or novel resources for bioinformatics and biomedical research investigations. The biositemap mechanism separates the providers of biomedical resources (investigators or institutions) from the consumers of resource content (researchers, clinicians, news media, funding agencies, educational and research initiatives).
A Biositemap is an RDF file that lists the biomedical and bioinformatics resources for a specific research group or consortium. It allows |
https://en.wikipedia.org/wiki/Part-based%20models | Part-based models refers to a broad class of detection algorithms used on images, in which various parts of the image are used separately in order to determine if and where an object of interest exists. Amongst these methods a very popular one is the constellation model which refers to those schemes which seek to detect a small number of features and their relative positions to then determine whether or not the object of interest is present.
These models build on the original idea of Fischler and Elschlager of using the relative position of a few template matches and evolve in complexity in the work of Perona and others. These models will be covered in the constellation models section. To get a better idea of what is meant by constellation model an example may be more illustrative. Say we are trying to detect faces. A constellation model would use smaller part detectors, for instance mouth, nose and eye detectors and make a judgment about whether an image has a face based on the relative positions in which the components fire.
Non-constellation models
Many overlapping ideas are included under the title part-based models even after having excluded those models of the constellation variety. The uniting thread is the use of small parts to build up to an algorithm that can detect/recognize an item (face, car, etc.)
Early efforts, such as those by Yuille, Hallinan and Cohen sought to detect facial features and fit deformable templates to them. These templates were mathematically defined outlines which sought to capture the position and shape of the feature. Yuille, Hallinan and Cohen's algorithm does have trouble finding the global minimum fit for a given model and so templates did occasionally become mismatched.
Later efforts such as those by Poggio and Brunelli focus on building specific detectors for each feature. They use successive detectors to estimate scale, position, etc. and narrow the search field to be used by the next detector. As such it is a part-based model, however, they seek more to recognize specific faces rather than to detect the presence of a face. They do so by using each detector to build a 35 element vector of characteristics of a given face. These characteristic can then be compared to recognize specific faces, however cut-offs can also be used to detect whether a face is present at all.
Cootes, Lanitis and Taylor build on this work in constructing a 100 element representation of the primary features of a face. The model is more detailed and robust however, given the additional complexity (100 elements compared to 35) this might be expected. The model essentially computes deviations from a mean face in terms of shape, orientation and gray level. The model is matched by the minimization of an error function. These three classes of algorithms naturally fall within the scope of template matching
Of the non-constellation perhaps the most successful is that of Leibe and Schiele. Their algorithm finds template |
https://en.wikipedia.org/wiki/Television%20in%20Denmark | Television in Denmark was established in the 1950s and was run by a monopoly with only one channel available until the 1980s.
Danish programming
Universal Channel
Bates Motel
The Border
Burn Notice
Chicago Fire
Chicago Hope
Chicago Med
Cold Case
Common Law
Doc Martin
Entourage
Eureka
For Life
Frankie Drake Mysteries
The Good Doctor
The Good Wife
HawthoRNe
House
iZombie
Law & Order: Criminal Intent
Law & Order: UK
Monk
Numb3rs
NYPD Blue
Parenthood
Person of Interest
Royal Pains
Sea Patrol
Shattered
Ugly Betty
V
Whiskey Cavalier
Kanal 9
The A-Team
Cheers
Frasier
Magnum, P.I.
Miami Vice
M*A*S*H
MacGyver
Nash Bridges
Walker, Texas Ranger
The Shield
Six Feet Under
The Sopranos
Spartacus: Gods of the Arena
Spartacus: Blood and Sand
Spartacus: Vengeance
Spartacus: War of the Damned
Star Trek: Deep Space Nine
Steven Seagal: Lawman
Water Rats
The Wire
History
The first television broadcasts in Denmark started on 2 October 1951. These were carried out by the national radio broadcaster Statsradiofonien and consisted of a one-hour broadcast three times per week. The broadcasts were initially limited to a few hundred homes in the capital area.
Daily broadcasts started in 1954. With the opening of the Gladsaxe transmitter, most of Zealand could watch television. The entire country was covered in 1960 when the transmitter on Bornholm opened. Statsradiofonien was renamed Danmarks Radio (DR) in 1959.
The first news programme, TV-Avisen, started in 1965. Colour television started test transmissions in 1967, with colour television becoming the norm in filming and broadcasting from 1970 on.
In 1983, DR started trials with the regional television station TV Syd. Local television started in many parts of the country, challenging the DR monopoly. The monopoly on national television ended on 1 October 1988, when TV 2 started. TV 2 was located in Odense on Funen and received funding from both advertising and the television license. Eight regional stations were established within TV 2, one of which was TV Syd. Interrupting programmes for commercials was illegal (and still is, as of 2012), so commercials were broadcast between the programmes.
The first private satellite channel broadcasting in the Scandinavian languages had started in 1987 and was known as TV3. A separate Danish version started in 1990. TV3 was broadcasting from the United Kingdom and could therefore avoid the Danish advertising laws. TV3 launched a sister channel known as 3+ in 1996, by merging its two former channels TV6 and ZTV.
DR launched a satellite channel on 30 August 1996. It was known as DR2, and the first channel changed its name to DR1 accordingly.
The local television stations weren't allowed to network, which meant that two stations couldn't show one programme at the same time. In 1997, the rules were relaxed, allowing the stations to simulcast a programme at the same time. This gave birth to the TV Danmark network.
TV 2 sta |
https://en.wikipedia.org/wiki/Harris%20affine%20region%20detector | In the fields of computer vision and image analysis, the Harris affine region detector belongs to the category of feature detection. Feature detection is a preprocessing step of several algorithms that rely on identifying characteristic points or interest points so to make correspondences between images, recognize textures, categorize objects or build panoramas.
Overview
The Harris affine detector can identify similar regions between images that are related through affine transformations and have different illuminations. These affine-invariant detectors should be capable of identifying similar regions in images taken from different viewpoints that are related by a simple geometric transformation: scaling, rotation and shearing. These detected regions have been called both invariant and covariant. On one hand, the regions are detected invariant of the image transformation but the regions covariantly change with image transformation. Do not dwell too much on these two naming conventions; the important thing to understand is that the design of these interest points will make them compatible across images taken from several viewpoints. Other detectors that are affine-invariant include Hessian affine region detector, Maximally stable extremal regions, Kadir–Brady saliency detector, edge-based regions (EBR) and intensity-extrema-based regions (IBR).
Mikolajczyk and Schmid (2002) first described the Harris affine detector as it is used today in An Affine Invariant Interest Point Detector. Earlier works in this direction include use of affine shape adaptation by Lindeberg and Garding for computing affine invariant image descriptors and in this way reducing the influence of perspective image deformations, the use affine adapted feature points for wide baseline matching by Baumberg and the first use of scale invariant feature points by Lindeberg; for an overview of the theoretical background. The Harris affine detector relies on the combination of corner points detected through Harris corner detection, multi-scale analysis through Gaussian scale space and affine normalization using an iterative affine shape adaptation algorithm. The recursive and iterative algorithm follows an iterative approach to detecting these regions:
Identify initial region points using scale-invariant Harris–Laplace detector.
For each initial point, normalize the region to be affine invariant using affine shape adaptation.
Iteratively estimate the affine region: selection of proper integration scale, differentiation scale and spatially localize interest points..
Update the affine region using these scales and spatial localizations.
Repeat step 3 if the stopping criterion is not met.
Algorithm description
Harris–Laplace detector (initial region points)
The Harris affine detector relies heavily on both the Harris measure and a Gaussian scale space representation. Therefore, a brief examination of both follow. For a more exhaustive derivations see corner detection and Gauss |
https://en.wikipedia.org/wiki/Hessian%20affine%20region%20detector | The Hessian affine region detector is a feature detector used in the fields of computer vision and image analysis. Like other feature detectors, the Hessian affine detector is typically used as a preprocessing step to algorithms that rely on identifiable, characteristic interest points.
The Hessian affine detector is part of the subclass of feature detectors known as affine-invariant detectors: Harris affine region detector, Hessian affine regions, maximally stable extremal regions, Kadir–Brady saliency detector, edge-based regions (EBR) and intensity-extrema-based (IBR) regions.
Algorithm description
The Hessian affine detector algorithm is almost identical to the Harris affine region detector. In fact, both algorithms were derived by Krystian Mikolajczyk and Cordelia Schmid in 2002,
based on earlier work in,
see also for a more general overview.
How does the Hessian affine differ?
The Harris affine detector relies on interest points detected at multiple scales using the Harris corner measure on the second-moment matrix. The Hessian affine also uses a multiple scale iterative algorithm to spatially localize and select scale and affine invariant points. However, at each individual scale, the Hessian affine detector chooses interest points based on the Hessian matrix at that point:
where is second partial derivative in the direction and is the mixed partial second derivative in the and directions. It's important to note that the derivatives are computed in the current iteration scale and thus are derivatives of an image smoothed by a Gaussian kernel: . As discussed in the Harris affine region detector article, the derivatives must be scaled appropriately by a factor related to the Gaussian kernel: .
At each scale, interest points are those points that simultaneously are local extrema of both the determinant and trace of the Hessian matrix. The trace of Hessian matrix is identical to the Laplacian of Gaussians (LoG):
As discussed in Mikolajczyk et al.(2005), by choosing points that maximize the determinant of the Hessian, this measure penalizes longer structures that have small second derivatives (signal changes) in a single direction. This type of measure is very similar to the measures used in the blob detection schemes proposed by Lindeberg (1998), where either the Laplacian or the determinant of the Hessian were used in blob detection methods with automatic scale selection.
Like the Harris affine algorithm, these interest points based on the Hessian matrix are also spatially localized using an iterative search based on the Laplacian of Gaussians. Predictably, these interest points are called Hessian–Laplace interest points. Furthermore, using these initially detected points, the Hessian affine detector uses an iterative shape adaptation algorithm to compute the local affine transformation for each interest point. The implementation of this algorithm is almost identical to that of the Harris affine detector; however, the |
https://en.wikipedia.org/wiki/MLB%2008%3A%20The%20Show | MLB 08: The Show is a baseball simulation video game developed by San Diego Studio published by Sony Computer Entertainment for the PlayStation 2, PlayStation 3, and PlayStation Portable systems. It is the longest-running officially licensed Major League Baseball game series on the PlayStation systems. MLB 08: The Show is the third edition of the MLB: The Show series of video games. The game was announced for all three PlayStation consoles on December 11, 2007, and released on March 4, 2008 in North America. Ryan Howard, all-star first baseman for the Philadelphia Phillies, is featured as the game's cover athlete.
The game is a baseball simulation in which, depending on the gameplay mode, the player controls one or all of the players on a Major League Baseball team or some select Minor League Baseball teams. Depending on the gameplay mode, the player may control a team for a single game, season, or franchise, and can also create a player and control his career.
Gameplay
Gameplay is similar to the other versions of MLB: The Show, as well as most baseball simulation video games. Some new features were introduced in various gameplay modes. The player may take control of one of 30 Major League Baseball teams in any game mode (excluding Road to the Show) and use that team in gameplay. The game has variable game modes in which a player takes control of a team for a single game, one season, or a franchise (multiple seasons). The player may control the team's batting, pitching, and fielding while playing the game. Many new general features have been introduced to the game as improvements to the previous edition, MLB 07: The Show. One of the major updates to the game is the "Batter/Pitcher Analysis" feature. This feature allows players to check the "match up" between the current batter and pitcher. Information such as strike/ball ratio, pitch types, pitch frequency, pitch location and the last 25 pitches thrown by the current pitcher. For pitchers, stats such as batters "hot zones", balls taken, strikeout pitch location, and stats when facing that particular pitcher.
Another main update to the game is the "Progressive Batting Performance". This feature tracks the batting stats of all players in season and franchise modes, and for your created player in Road to the Show mode. Progressive Batting Performance tracks trends in the player's batting statistics, and then gives a rating compared to the average performance of that player each month. If the player is doing better, the player will perform stats will increase, while if the player's stats are getting worse, they will fall into a "hitting slump", a prolonged period of time in which the player has trouble batting.
Fielding was also improved from previous versions, with better AI making less mistakes in the field, AI calculations on whether the runner will reach base before a throw gets there, and improved fielding mechanics. A "Rob Home Run Indicator" was also added. This feature indicated if a bal |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201951 | A list of films produced in France in 1951.
A-L
M-Z
See also
1951 in France
References
External links
French films of 1951 at the Internet Movie Database
French films of 1951 at Cinema-francais.fr
1951
Films
French |
https://en.wikipedia.org/wiki/Preservation%20survey | Preservation survey (also known as condition survey, conservation needs survey or preservation assessment) is the process of collecting and analyzing data about the physical condition of library materials.
Preservation surveys are used by libraries to determine the condition of their collections and identify necessary actions for preserving, conserving or repairing materials. They are most often conducted at research and university libraries.
Preservation surveys are often the first step when planning and implementing a preservation program in a library. By collecting data and compiling statistics about a collection’s condition, library staff can determine environmental threats and preservation needs. It is also possible to use the resulting data to predict future deterioration.
Since preservation needs usually well exceed an institution’s resources, the data acquired in an assessment can aid libraries in establishing priorities in regard to deteriorating materials. As Ross Harvey wrote in his Preservation in Libraries, the data from surveys can "be used to plan how best to deploy available resources."
History
The need for surveying library materials was born of the increasing awareness of the problem of brittle books. William Barrow’s Deterioration of Book Stock: Problems and Remedies from 1959 alerted the library world to the alarmingly short shelf life of books composed of acidic paper. While major libraries had estimated high percentages of acidic books, it wasn’t until 1979 that an empirical study was conducted on a library collection to determine its condition. This study, at Stanford University’s Green Library, was a benchmark in the field and established the methodology for conducting preservation surveys in research libraries.
Yale University conducted a large-scale assessment of its library materials in 1985 that is also considered a landmark in the field. Yale’s survey sounded the warning bell for research libraries worldwide, discovering that 86% of the more than 36,500 books in the sample were either brittle or composed of paper with an acidic pH.
Conducting a Survey
Many preservation surveys are conducted by collecting data on a random sample of items. University librarians may consult with the institution’s statistics department to design a reliable sampling plan. A random sample may be derived by the randomization of call numbers, by the creation of a sampling frame that assigns a unique number to each item in the target population or by generating random numbers and locating volumes by counting on the shelf.
A pilot survey of a small sample population may be run prior to the actual survey in order to address any problems with the sampling plan or the survey questions. The pilot survey may reveal unclear or ambiguous wording, superfluous questions, or existing conditions that have not been addressed.
After the pilot survey, the library may hold a workshop to train surveyors to properly collect data and handle ma |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201953 | A list of films produced in France in 1953.
A–Z
See also
1953 in France
External links
French films of 1953 at the Internet Movie Database
French films of 1953 at Cinema-francais.fr
1953
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201955 | A list of films produced in France in 1955.
See also
1955 in France
1955 in French television
Notes
External links
French films of 1955 at the Internet Movie Database
French films of 1955 at Cinema-francais.fr
1955
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201956 | A list of films produced in France in 1956.
See also
1956 in France
1956 in French television
References
External links
French films of 1956 at the Internet Movie Database
French films of 1956 at Cinema-francais.fr
1956
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201957 | A list of films produced in France in 1957.
See also
1957 in France
1957 in French television
References
External links
French films of 1957 at the Internet Movie Database
French films of 1957 at Cinema-francais.fr
1957
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201958 | A list of films produced in France in 1958.
See also
1958 in France
1958 in French television
External links
French films of 1958 at the Internet Movie Database
French films of 1958 at Cinema-francais.fr
1958
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201959 | A list of films produced in France in 1959.
See also
1959 in France
1959 in French television
Notes
External links
French films of 1959 at the Internet Movie Database
French films of 1959 at Cinema-francais.fr
1959
Films
Lists of 1959 films by country or language |
https://en.wikipedia.org/wiki/PlayStation%203%20cluster | A PlayStation 3 cluster is a distributed system computer composed primarily of PlayStation 3 video game consoles.
Before and during the console's production lifetime, its powerful IBM Cell CPU attracted interest in using multiple, networked PS3s for affordable high-performance computing.
Deployments
PlayStation 3 clusters have had different configurations. A distributed computing system utilizing PlayStation 3 consoles does not need to meet the strict definition of a computer cluster.
The National Center for Supercomputing Applications had already built a cluster based on the PlayStation 2. Terra Soft Solutions has a version of Yellow Dog Linux for the PlayStation 3, and sells PS3s with it pre-installed, in single units and in 8 and 32 node clusters. RapidMind developed a stream programming package for the PS3.
On January 3, 2007, Dr. Frank Mueller, Associate Professor of Computer Science at North Carolina State University, clustered 8 PS3s. Mueller commented that the 256 MB of system RAM is a limitation for this particular application, and considered attempting to retrofit more RAM. Software includes: Fedora Core 5 Linux ppc64,
MPICH2, OpenMP v2.5, GNU Compiler Collection, and CellSDK 1.1.
In mid-2007, Gaurav Khanna, a professor in the Physics Department of the University of Massachusetts Dartmouth, independently built a message-passing based cluster using 8 PS3s running Fedora Linux. It was built with support from Sony Computer Entertainment as the first PS3 cluster with published scientific results. Named the PS3 Gravity Grid, it performed astrophysical simulations of large supermassive black holes capturing smaller compact objects. Khanna claims performance exceeds that of a 100+ Intel Xeon core based traditional Linux cluster, on his simulations. The PS3 Gravity Grid gathered significant media attention through 2007, 2008, 2009, and 2010. Khanna also created an instructional website on building such clusters.
In May 2008, The Laboratory for Cryptological Algorithms, under the direction of Arjen Lenstra at École Polytechnique Fédérale de Lausanne, built a cluster of 200 consoles which broke a record for the Diffie-Hellman problem on elliptic curves. The cluster operated until 2015.
In November 2010, the Air Force Research Laboratory created a powerful supercomputer, nicknamed the "Condor Cluster", by connecting together 1,760 consoles with 168 GPUs and 84 coordinating servers in a parallel array capable of 500 trillion floating-point operations per second (500 TFLOPS). As built, the Condor Cluster was the 33rd largest supercomputer in the world and was used to analyze high definition satellite imagery while costing only one tenth that of a traditional supercomputer.
Single PS3
Even a single PS3 can significantly accelerate some computations. Marc Stevens, Arjen K. Lenstra, and Benne de Weger have demonstrated an MD5 brute-force attack in a few hours. In November 2007, they said: "Essentially, a single PlayStation 3 performs like a c |
https://en.wikipedia.org/wiki/WHNM | WHNM (1350 AM) is a broadcast radio station licensed to Laconia, New Hampshire, serving the Lakes Region, including Laconia and Franklin. The station's programming is also carried on FM translator W277DJ (103.3). WHNM is owned by Patrick Costa, through license Costa-Eagle Radio Ventures Limited Partnership.
History
WHNM traces its origins to New Hampshire's first broadcast radio station, WKAV, an experimental station run by a local radio club, which went on the air in 1922 but went dark about a decade later after a myriad of financial problems. In 1934, the station was reborn under a new license as WLNH at 1310 kHz on the AM dial, moving to 1340 in 1941 and to the current 1350 frequency in 1954.
The station would change to WKZU in 1983 and WMRS in 1985, before returning to WLNH in 1987 and becoming WEZS in June 1994. As WEZS, the station initially featured a beautiful music/easy listening format, which was eventually modified to smooth jazz. WEZS was a rare AM station to play smooth jazz, along with WCIN in Cincinnati, Ohio.
The station's format changed in March 2008 to "Good Times and Great Oldies", then in December 2012 to full-time news and talk. The programming included syndicated shows hosted by Mark Levin, Tom Sullivan, Dennis Prager, and Dave Ramsey; and hourly news by Fox News Radio.
WEZS began an FM simulcast on translator W277DJ 103.3 in June 2018.
According to North East Radio Watch, in January 2023, the station changed its call letters to WHNM on January 14 and nickname to "The Moose 103.3", with a classic hits format. The changes were associated with the sale of the station and its translator by Gary W. Hammond to Patrick Costa's Costa-Eagle Radio Ventures Limited Partnership. The sale was consummated on January 25, 2023, at a price of $225,000.
References
External links
WHNM website
HNM
Radio stations established in 1934
Laconia, New Hampshire
Belknap County, New Hampshire
Classic hits radio stations in the United States
1934 establishments in New Hampshire |
https://en.wikipedia.org/wiki/3D%20object%20recognition | In computer vision, 3D object recognition involves recognizing and determining 3D information, such as the pose, volume, or shape, of user-chosen 3D objects in a photograph or range scan. Typically, an example of the object to be recognized is presented to a vision system in a controlled environment, and then for an arbitrary input such as a video stream, the system locates the previously presented object. This can be done either off-line, or in real-time. The algorithms for solving this problem are specialized for locating a single pre-identified object, and can be contrasted with algorithms which operate on general classes of objects, such as face recognition systems or 3D generic object recognition. Due to the low cost and ease of acquiring photographs, a significant amount of research has been devoted to 3D object recognition in photographs.
3D single-object recognition in photographs
The method of recognizing a 3D object depends on the properties of an object. For simplicity, many existing algorithms have focused on recognizing rigid objects consisting of a single part, that is, objects whose spatial transformation is a Euclidean motion. Two general approaches have been taken to the problem: pattern recognition approaches use low-level image appearance information to locate an object, while feature-based geometric approaches construct a model for the object to be recognized, and match the model against the photograph.
Pattern recognition approaches
These methods use appearance information gathered from pre-captured or pre-computed projections of an object to match the object in the potentially cluttered scene. However, they do not take the 3D geometric constraints of the object into consideration during matching, and typically also do not handle occlusion as well as feature-based approaches. See [Murase and Nayar 1995] and [Selinger and Nelson 1999].
Feature-based geometric approaches
Feature-based approaches work well for objects which have distinctive features. Thus far, objects which have good edge features or blob features have been successfully recognized; for example detection algorithms, see Harris affine region detector and SIFT, respectively. Due to lack of the appropriate feature detectors, objects without textured, smooth surfaces cannot currently be handled by this approach.
Feature-based object recognizers generally work by pre-capturing a number of fixed views of the object to be recognized, extracting features from these views, and then in the recognition process, matching these features to the scene and enforcing geometric constraints.
As an example of a prototypical system taking this approach, we will present an outline of the method used by [Rothganger et al. 2004], with some detail elided. The method starts by assuming that objects undergo globally rigid transformations. Because smooth surfaces are locally planar, affine invariant features are appropriate for matching: the paper detects ellipse-shape |
https://en.wikipedia.org/wiki/CyberCIEGE | CyberCIEGE is a serious game designed to teach network security concepts. Its development was sponsored by the U.S. Navy, and it is used as a training tool by agencies of the U.S. government, universities and community colleges.
CyberCIEGE covers a broad range of cybersecurity topics. Players purchase and configure computers and network devices to keep demanding users happy (e.g., by providing Internet access) all while protecting assets from a variety of attacks. The game includes a number of different scenarios, some of which focus on basic training and awareness, others on more advanced network security concepts. A "Scenario Development Kit" is available for creating and customizing scenarios.
Network security components include configurable firewalls, VPN gateways, VPN clients, link encryptors and authentication servers. Workstations and servers include access control lists (ACLs) may be configured with operating systems that enforce label-based mandatory access control policies. Players can deploy Public Key Infrastructure (PKI)-based cryptography to protect email, web traffic and VPNs. The game also includes identity management devices such as biometric scanners and card readers to control access to workstations and physical areas.
The CyberCIEGE game engine consumes a “scenario development language” that describes each scenario in terms of users (and their goals), assets (and their values), the initial state of the scenario in terms of pre-existing components, and the conditions and triggers that provide flow to the scenario. The game engine is defined with enough fidelity to host scenarios ranging from e-mail attachment awareness to cyber warfare.
Game play
CyberCIEGE scenarios place the player into situations in which the player must make information assurance decisions. The interactive simulation illustrates potential consequences of player choices in terms of attacks on information assets and disruptions to authorized user access to assets. The game employs hyperbole as a means of engaging students in the scenario, and thus the simulation is not intended to always identify the actual consequences of specific choices. The game confronts the student with problems, conflicts and questions that should be considered when developing and implementing a security policy.
The game is designed as a "construction and management simulation" set in a three-dimensional virtual world. Players build networks and observe virtual users and their thoughts. Each scenario is divided into multiple phases and each phase includes one or more objectives the player must achieve prior to moving on to the next phase. Players view the status of the virtual user’s success in achieving goals (i.e., accessing enterprise assets via computers and networks). Unproductive users express unhappy thoughts, utter comic book style speech bubbles and bang on their keyboards. Players see the consequences of attacks as lost money, pop-up messages, video clips and burn |
https://en.wikipedia.org/wiki/Maximally%20stable%20extremal%20regions | In computer vision, maximally stable extremal regions (MSER) are used as a method of blob detection in images. This technique was proposed by Matas et al. to find correspondences between image elements from two images with different viewpoints. This method of extracting a comprehensive number of corresponding image elements contributes to the wide-baseline matching, and it has led to better stereo matching and object recognition algorithms.
Terms and definitions
Image is a mapping . Extremal regions are well defined on images if:
is totally ordered (total, antisymmetric and transitive binary relations exist).
An adjacency relation is defined. We will denote that two points are adjacent as .
Region is a contiguous (aka connected) subset of . (For each there is a sequence such as .) Note that under this definition the region can contain "holes" (for example, a ring-shaped region is connected, but its internal circle is not the part of ).
(Outer) region boundary , which means the boundary of is the set of pixels adjacent to at least one pixel of but not belonging to . Again, in case of regions with "holes", the region boundary is not obliged to be connected subset of (a ring has inner bound and outer bound which do not intersect).
Extremal region is a region such that either for all (maximum intensity region) or for all (minimum intensity region). As far as is totally ordered, we can reformulate these conditions as for maximum intensity region and for minimum intensity region, respectively. In this form we can use a notion of a threshold intensity value which separates the region and its boundary.
Maximally stable extremal region Let an extremal region such as all points on it have an intensity smaller than . Note for all positive . Extremal region is maximally stable if and only if has a local minimum at . (Here denotes cardinality). is here a parameter of the method.
The equation checks for regions that remain stable over a certain number of thresholds. If a region is not significantly larger than a region , region is taken as a maximally stable region.
The concept more simply can be explained by thresholding. All the pixels below a given threshold are 'black' and all those above or equal are 'white'. Given a source image, if a sequence of thresholded result images is generated where each image corresponds to an increasing threshold t, first a white image would be seen, then 'black' spots corresponding to local intensity minima will appear then grow larger. A maximally stable extremal region is found when size of one of these black areas is the same (or near the same) than in previous image.
These 'black' spots will eventually merge, until the whole image is black. The set of all connected components in the sequence is the set of all extremal regions. In that sense, the concept of MSER is linked to the one of component tree of the image. The component tree indeed provide an easy way for implementing MSER.
E |
https://en.wikipedia.org/wiki/Paul%20Doornbusch | Paul Doornbusch (born 1959, Melbourne) is an Australian composer and musician.
He is the author of a book documenting the first computer music, made with the CSIRAC.
Doornbusch spent several years at RMIT University in Melbourne, and later taught at the New Zealand School of Music. He now lives in the Melbourne area.
Doornbusch is known for researching the origins of computer music in Australia and has written a book on the subject. The book was reviewed by James Harley in Computer Music Journal in Fall 2006. Harley's review recognized Doornbusch as having "dedication", "thoroughness", "determination", and being "admirable". It also called The Music of CSIRAC "an important, crucial addition to the body of references documenting our field."
The biography accompanying his Corrosion CD states that "his compositional concerns involve new forms for music appropriate for contemporary culture.... He works mostly as an algorithmic composer, but occasionally in recent years he has engaged in peripheral areas such as the Place-Hampi project with Jeffrey Shaw. As an algorithmic composer, Doornbusch has identified and examined in detail the mapping stage of the process where structural data becomes musical parameters." Corrosion was reviewed by Richard Barrett in Computer Music Journal in Fall 2006. His review stated that "There are not so many composers at work, even in the 21st century [...] whose commitment to the technical possibilities afforded by contemporary technology is so closely matched by a compulsion to exploit to the full the expressive potential unleashed thereby."
Recordings
Corrosion CD of the works of Paul Doornbusch, 2002 (EMF 043)
The Frog Peak Collaboration Project 1998 (USA)
List of works
Continuity 1W (2007), electronics.
Lorenz (2005), piano.
Continuity3 (2000), percussion and electronics.
Continuity 2 (1999), bass recorder quartet and electronics.
Dialogus (2000), electronics.
ACT 5 (1998), for amplified bassoon and hanging percussion.
G4 (1997), for electronics.
MFPG (1994), for electronics.
Strepidus Somnus (1997), for 4 voices and electronics.
Assifxiation (1997) amplified flute and electronics.
On The Fence (1997) for medium ensemble and electronics.
Structured Luck (1996), for amplified bassoon and electronics.
Iceberg (1995) for electronics.
Preludes (1994) for 4 voices.
M1 (1995) for soloist and electronics.
M2 (1995) for soloist and electronics.
Books
Notes
External links
The Living Composers Project page
Academia home page
CDE Music artist page
Music review
A Chronology of Electronic and Computer Music
CSIRAC Music Project
1959 births
20th-century classical composers
21st-century classical composers
Australian classical composers
Australian male classical composers
Dutch male classical composers
Dutch classical composers
Electroacoustic music composers
Living people
Musicians from Melbourne
20th-century Australian male musicians
20th-century Australian musicians
21st-c |
https://en.wikipedia.org/wiki/Viola%E2%80%93Jones%20object%20detection%20framework | The Viola–Jones object detection framework is a machine learning object detection framework proposed in 2001 by Paul Viola and Michael Jones. It was motivated primarily by the problem of face detection, although it can be adapted to the detection of other object classes.
The algorithm is efficient for its time, able to detect faces in 384 by 288 pixel images at 15 frames per second on a conventional 700 MHz Intel Pentium III. It is also robust, achieving high precision and recall.
While it has lower accuracy than more modern methods such as convolutional neural network, its efficiency and compact size (only around 50k parameters, compared to millions of parameters for typical CNN like DeepFace) means it is still used in cases with limited computational power. For example, in the original paper, they reported that this face detector could run on the Compaq iPAQ at 2 fps (this device has a low power StrongARM without floating point hardware).
Problem description
Face detection is a binary classification problem combined with a localization problem: given a picture, decide whether it contains faces, and construct bounding boxes for the faces.
To make the task more manageable, the Viola–Jones algorithm only detects full view (no occlusion), frontal (no head-turning), upright (no rotation), well-lit, full-sized (occupying most of the frame) faces in fixed-resolution images.
The restrictions are not as severe as they appear, as one can normalize the picture to bring it closer to the requirements for Viola-Jones.
any image can be scaled to a fixed resolution
for a general picture with a face of unknown size and orientation, one can perform blob detection to discover potential faces, then scale and rotate them into the upright, full-sized position.
the brightness of the image can be corrected by white balancing.
the bounding boxes can be found by sliding a window across the entire picture, and marking down every window that contains a face.
This would generally detect the same face multiple times, for which duplication removal methods, such as non-maximal suppression, can be used.
The "frontal" requirement is non-negotiable, as there is no simple transformation on the image that can turn a face from a side view to a frontal view. However, one can train multiple Viola-Jones classifiers, one for each angle: one for frontal view, one for 3/4 view, one for profile view, a few more for the angles in-between them. Then one can at run time execute all these classifiers in parallel to detect faces at different view angles.
The "full-view" requirement is also non-negotiable, and cannot be simply dealt with by training more Viola-Jones classifiers, since there are too many possible ways to occlude a face.
Components of the framework
A full presentation of the algorithm is in.
Consider an image of fixed resolution . Our task is to make a binary decision: whether it is a photo of a standardized face (frontal, well-lit, etc) or not.
Viola–Jones i |
https://en.wikipedia.org/wiki/Sistema%20de%20Radiodifusoras%20Culturales%20Ind%C3%ADgenas | The Sistema de Radiodifusoras Culturales Indígenas (SRCI; ) is a state-owned network of radio stations in Mexico. The radio stations it operates are community radio stations that aim to serve different sectors of the country's indigenous peoples. Pursuant to Article 4 of the Constitution, their mission is to strengthen the multicultural nature of the nation by promoting the use of 31 indigenous languages.
As the stations are owned by the federal government, they hold public concessions.
History
The SRCI began operations in 1979 with the launch of XEZV-AM, "La Voz de la Montaña", in Tlapa de Comonfort, Guerrero. The network was initially managed by the National Indigenist Institute (INI), an agency of the federal government In 2003, the INI was dissolved and replaced by the National Commission for the Development of Indigenous Peoples (CDI), which consequently assumed control over the network. The CDI was in turn replaced by the National Institute of Indigenous Peoples (INPI) in late 2018.
Until 2019, the station was known as the Sistema de Radiodifusoras Culturales Indigenistas (Indigenist Cultural Broadcasting System).
Stations
The SRCI operates 22 primary radio stations, most of which transmit on AM and eight of which are high-power FM stations. It also previously operated four 10-watt FM stations in Yucatán.
The 22 main stations transmit for an average of 12 hours a day, during daylight hours, covering 928 municipalities with high levels of indigenous inhabitants. The stations' potential audience comprises 5 million speakers of indigenous languages and more than 22 million Spanish speakers. They all broadcast an array of programming in both Spanish and the particular native languages spoken in the coverage area.
Four stations are AM-FM migrants: XHCARH, XHPET, XHTUMI, XHNKA. XHCARH and XHPET are required to maintain their AM frequencies because they are the only radio service for certain communities in its AM coverage area. The second and third stations reacquired their AM frequencies under new callsigns.
In 2016 and 2017, the CDI applied for and received FM radio stations that provide simulcast service for XETLA (XHPBSD-FM 95.9), XEGLO (XHGJO-FM 88.3), and XEQIN (XHSQB-FM 95.1).
On February 28, 2020, the INPI relaunched La Voz de los Chontales, which had been shuttered as XENAC in 1989 for political reasons, as XHCPBS-FM.
Defunct stations
Between 1982 and 1989, the SRCI system included a station at Nacajuca, Tabasco, XENAC-AM 1440. That station was shut down in 1989; the station was revived more than 30 years later as XHCPBS-FM.
The CDI also formerly held a trio of permits for low-power FM stations at three communities in Michoacán; these were not renewed.
Programming
The stations' programming is eminently community-focused. Bilingual presenters attend inquiries from listeners, convey community and personal announcements, and promote various government assistance programs in the areas of health, education, human rights, etc. Tr |
https://en.wikipedia.org/wiki/Scott%20Plous | Scott Plous is an American academic social psychologist. He is currently a Professor of Psychology at Wesleyan University and Executive Director of Social Psychology Network.
Early life and education
Scott Plous was born in Milwaukee, Wisconsin. He attended college at the University of Minnesota in Minneapolis, and earned his PhD in social psychology at Stanford University, where he also completed a MacArthur Foundation Postdoctoral Fellowship in International Peace and Cooperation. His doctoral advisor at Stanford was Philip Zimbardo.
Career
After his postdoctoral fellowship, Plous spent two years as a visiting professor in psychology and arms control at the University of Illinois at Urbana–Champaign. He then joined the psychology faculty at Wesleyan University, where he has been a professor since 1990.
Throughout much of his career, he has focused on internationalizing psychology education, cross-cultural exchange, and teaching outside the United States. He has served as a visiting faculty member on two world voyages of Semester at Sea, co-taught in the Harvard University summer school program in Trento, Italy, and taught Social Psychology at Beijing Normal University in China.
Plous has published two books and numerous journal articles on psychology, decision science, and social issues. His primary areas of research include the psychology of prejudice and discrimination, judgment and decision making, international security, and the human use of animals and the environment.
Notable Projects
Social Psychology Network
Plous is best known as the founder and Executive Director of Social Psychology Network, a nonprofit educational organization and a suite of nonprofit websites developed with support from the National Science Foundation, individual and institutional donors, and more than 1,500 members from over 100 countries. Created in 1996, the mission of the Network "is to promote peace, social justice, and sustainable living through public education, research, and the advancement of psychology."
Since the 1990s, the webpages of Social Psychology Network have received more than 385 million visits (as of March, 2023), and the number of people following the Network on social media has grown to more than 1 million worldwide.
Social Psychology MOOC
In 2013, Plous began teaching a free "massive open online course" (MOOC) in Social Psychology. In its first two years, the course became the largest synchronous class ever given, enrolling more than 720,000 students from approximately 200 countries. In 2018, he began teaching a self-paced version of the course that enrolled another 570,000 students as of 2023, or nearly 1.3 million students in all.
As part of the course, students are asked to complete a capstone assignment called the Day of Compassion, in which class members are challenged to live 24 hours as compassionately as possible and analyze the experience using social psychology. On three runs of the course, the best student work was ho |
https://en.wikipedia.org/wiki/KRAL | KRAL is an AM radio station licensed to Rawlins, Wyoming and broadcasting at 1240 kHz. The station simulcasts sister station KIQZ's programming, which was primarily a 90s/2000s/Now AC format. It was developed in the 1950s under the supervision of William D. "Bill" McCraken, a Wyoming radio and television pioneer. The station, as of July 2010, was silent, while its sister FM counterpart remained on air for a short period of time. The radio stations returned to broadcast status in January 2016 under Federal Communications Commission special temporary authority.
History
The station did apply for and was granted a renewal of its license in 2005, however citing technical reasons in July 2010, the station remained silent. The period in which KRAL had, until it fixed its "technical" problems and restored broadcasting expired July 19, 2011. According to FCC documents, the station resumed operations on June 20, 2012. Two days later, the station reported to the FCC that it would go silent due to staffing issues. The FCC approved this request, stating the station had to return to air by June 22, 2013. If the station did not return to air by that date and notified the FCC, the license would have been returned to the FCC. As of March, 2013 KRAL still appeared in the FCC database and remained silent, along with its FM counterpart KIQZ. On June 6, 2013 KRAL returned to the air with a classic rock format and then went silent again two days later.
The station and its sister again requested an STA, or request to go silent in early 2015 as a result of employees "unexpectedly" resigning and the difficulty finding new employees at the remote location.
The station and its sister station KIQZ FM returned to air status in January 2016. Currently the stations are broadcasting a mix of the 90s/2000s/now format programmed by station staff. The stations are broadcasting under Federal Communications Commission special temporary authority while transmission facilities are being reconstructed.
Signal
KRAL's 1,000-watt signal covered western Carbon County and was very weak in Sweetwater County directly to the west. The station was barely audible to the north and east of Rawlins without a good radio or car stereo. KRAL's transmitter was located next to Interstate 80 on the western side of Rawlins. The station has been operating via a special temporary authority at 50 watts from a long wire near the studio.
FCC fines and penalties
Since the station's change of ownership from "Elk Mountain Broadcasting" to current owner "Mount Rushmore Broadcasting", KRAL and its sister station, KIQZ (FM 92.7) have been fined by the FCC many times. Most recent penalties include a $20,000 fine for "failing to maintain the operational readiness of the EAS (Emergency Readiness System) equipment (see FCC Rules/11.35(a)), as well as other equipment issues and violations and failure to maintain a complete public records file."
Sources connected to the FCC say that more and significantly higher fin |
https://en.wikipedia.org/wiki/Thai%20highway%20network | The Thai highway network follows the left-hand traffic rule of the road. The network is the twin responsibility of the Department of Highways (DOH, , Krom Thang Luang), and the Department of Rural Roads (DORR, , Krom Thang Luang Chonnabot), under the oversight of the Transportation ministry of Thailand. Public highways (, thang luang) are also called public roads (, thanon luang), especially when part of urban streets. The network spans over 70,000 kilometers across all regions of Thailand.
Most are single carriageways. Dual carriageways have frequent u-turn lanes and intersections slowing down traffic. Coupled with the increase in the number of vehicles and the demand for a limited-access motorway, the Thai Government issued a Cabinet resolution in 1997 detailing the motorway construction master plan. Some upgraded sections of highway are being turned into a "motorway", while other motorways are not being built from highway sections.
Types of highways
The 1992 Highway Act (), revised as the 2006 Highway Act (), defines the following five highway types:
A special highway () or motorway is a high capacity highway designed for high speed traffic, for which the Department of Highways carries out construction, expansion, upkeep and repairs, and is registered as such. Motorway entrances and exits have controlled access, and controlled by the DOH. Registration of motorways is overseen by the Director General of the DOH.
A national highway () is a primary highway, part of the network connecting regions, provinces, districts, and other important destinations, for which the DOH carries out construction, expansion, upkeep and repairs. Registration of national highways is overseen by the Director General of the DOH.
A rural highway () or rural road is a highway for which the Department of Rural Roads carries out construction, expansion, upkeep and repairs. Registration of rural highways is overseen by the Director General of the DORR.
A local highway () or local route is a highway for which the local administrative organization carries out construction, expansion, upkeep and repairs. Registration of rural highways is overseen by the provincial governor.
A concession highway () is a highway for which a legal government concession has been granted. Registration of concession highways is overseen by the Director General of the DOH.
Highway numbering
The first digit of a highway number indicates the region of Thailand it serves, with the number of digits indicating the highway classification. These regions are:
Northern Thailand.
Northeastern Thailand.
Central and eastern, including the upper south.
Southern Thailand, except the upper south.
A single digit indicates one of four highways connecting Bangkok to outlying regions:
Route 1 (Phahonyothin Road) to northern Thailand
Route 2 (Mittraphap Road) to northeastern Thailand
Route 3 (Sukhumvit Road) to eastern Thailand
Route 4 (Phet Kasem Road) to southern Thailand
Two digits indicate a princi |
https://en.wikipedia.org/wiki/Maging%20Akin%20Ka%20Lamang | (International title: Till You are Mine / ) is a 2008 Philippine television drama romance series broadcast by GMA Network. Based on a 1987 Philippine film of the same title, the series is the sixth instalment of Sine Novela. Directed by Gil Tejada Jr., it stars Nadine Samonte and Polo Ravales. It premiered on January 21, 2008 on the network's Dramarama sa Hapon line up. The series concluded on May 9, 2008 with a total of 78 episodes. It was replaced by Magdusa Ka in its timeslot.
Cast and characters
Lead cast
Nadine Samonte as Elsa Paruel-Abrigo
Polo Ravales as Andy Abrigo
Supporting cast
Isabel Oli as Rosita Monteverde
Carlo Aquino as Ernie Balboa
Mike Tan as Rick Rivera
Jacob Rica as Adrian Monteverde
Alicia Alonzo as Leticia Paruel
Pinky Amador as Carmen Paruel
Dexter Doria as Aida Abrigo
Arci Muñoz as Olivia "Olive" Paruel
Juan Rodrigo as Augusto Monteverde
Ratings
According to AGB Nielsen Philippines' Mega Manila household television ratings, the pilot episode of earned a 21.5% rating. While the final episode scored a 23.4% rating.
Accolades
References
External links
2008 Philippine television series debuts
2008 Philippine television series endings
Filipino-language television shows
GMA Network drama series
Philippine romance television series
Philippine television series based on films
Television shows set in the Philippines |
https://en.wikipedia.org/wiki/Attitude%20Era | The Attitude Era was a period in which the World Wrestling Federation (WWF, now WWE) used the term "WWF Attitude" to describe its programming from November 9, 1997, to May 6, 2002. It began during the Monday Night Wars, a period in which WWF's Monday Night Raw (later Raw Is War) went head-to-head with World Championship Wrestling's (WCW) Monday Nitro in a battle for Nielsen ratings each week from September 4, 1995, to March 26, 2001. In June 1996, Stone Cold Steve Austin became King of the Ring, defeating Jake Roberts in the tournament final. To cap off the victory, Austin delivered his “Austin 3:16" promo, starting the buildup to the Attitude Era. The era was officially initiated on November 9, 1997, at Survivor Series 1997, when a video package aired ending with the first use of the "WWF Attitude" scratch logo; this was immediately before the main event featuring Bret Hart vs. Shawn Michaels, which retrospectively would be known as the Montreal Screwjob due to the match's controversial finish. WWF's programming in this era featured adult-oriented content, which included increased depicted violence, profanity, and sexual content. This era was part of a wider surge in the popularity of professional wrestling in the United States and Canada as television ratings and pay-per-view buy rates for WWF and its rival promotions saw record highs.
The Attitude Era marked the rise of many WWF wrestlers, including Stone Cold Steve Austin, The Rock, Chris Jericho, Triple H, Kane, Mick Foley (in various personas), Kurt Angle, and The Undertaker (who was already a veteran but continued to gain popularity). The Steve Austin-Vince McMahon feud was one of the longest-running and most prominent rivalries of the era. The WWF Women's Championship, which had lain dormant since December 13, 1995, was reactivated on September 15, 1998. While most of the company's female talent, such as Sable, Sunny and Stacy Keibler during this time period were marketed as sex symbols booked in sexually provocative gimmick matches (for example "bra and panty" matches, bikini matches, etc.) in an effort to draw more male viewership, prominent female stars such as Chyna, Lita, and Trish Stratus among others were presented as serious wrestlers. WWF also signed a number of wrestlers who left WCW during this period, including Chris Jericho and the Big Show.
The era also saw the resurgence of tag team wrestling, namely The Hardy Boyz, The Dudley Boyz, and Edge & Christian, who were featured in several destructive, physical and stunt-filled Tables, Ladders and Chairs matches during this era. Distinguished stables were established in this era, such as D-Generation X, Nation of Domination, The Corporation, Ministry of Darkness, Corporate Ministry and The Brood, among others, and developed major rivalries among each other. The Hardcore Championship was established on November 2, 1998, and this chaotic division involved no disqualification, falls count anywhere matches that would start and then |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201960 |
See also
1960 in France
1960 in French television
Notes
External links
French films of 1960 at the Internet Movie Database
French films of 1960 at Cinema-francais.fr
1960
Films
Lists of 1960 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201961 | A list of films produced in France in 1961.
See also
1961 in France
1961 in French television
Notes
External links
French films of 1961 at the Internet Movie Database
French films of 1961 at Cinema-francais.fr
1961
Films
Lists of 1961 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201962 | A list of films produced in France in 1962.
See also
1962 in France
1962 in French television
Notes
External links
French films of 1962 at the Internet Movie Database
French films of 1962 at Cinema-francais.fr
1962
Films
Lists of 1962 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201963 | A list of films produced in France in 1963.
See also
1963 in France
Notes
External links
French films of 1963 at the Internet Movie Database
French films of 1963 at Cinema-francais.fr
1963
Films
Lists of 1963 films by country or language |
https://en.wikipedia.org/wiki/Fibex | The ASAM MCD-2 NET standard (called FIBEX for Field Bus Exchange Format) is an XML-based standardised format used for representing the networks used in automobiles. It is being used by the automotive industry for its ease of data exchange.
It has extensibility required for the various network protocols (like FlexRay, MOST, CAN, TTCAN, LIN and Ethernet) used. It is developed by the ASAM consortium.
External links
Official ASAM website
Overview on Fibex on ASAM site
FIBEX XML format and AUTOSAR development
See also
AUTOSAR
XML
Industry-specific XML-based standards |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201964 | A list of films produced in France in 1964.
See also
1964 in France
Notes
References
External links
French films of 1964 at the Internet Movie Database
French films of 1964 at Cinema-francais.fr
1964
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201965 | A list of films produced in France in 1965.
See also
1965 in France
References
Footnotes
Sources
External links
French films of 1965 at the Internet Movie Database
French films of 1965 at Cinema-francais.fr
1965
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201966 | A list of films produced in France in 1966.
See also
1966 in France
References
Footnotes
Sources
External links
French films of 1966 at the Internet Movie Database
French films of 1966 at Cinema-francais.fr
1966
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201967 | A list of films produced in France in 1967.
The list
See also
1967 in France
References
Footnotes
Sources
External links
French films of 1967 at the Internet Movie Database
French films of 1967 at Cinema-francais.fr
1967
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201968 | This is a list of films produced in France in 1968.
See also
1968 in France
Notes
References
External links
French films of 1968 at the Internet Movie Database
French films of 1968 at Cinema-francais.fr
1968
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201969 | berb
A list of films produced in France in 1969.
See also
1969 in France
1969 in French television
References
External links
French films of 1969 at the Internet Movie Database
French films of 1969 at Cinema-francais.fr
1969
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201970 | A list of films produced in France in 1970.
Notes
External links
French films of 1970 at the Internet Movie Database
French films of 1970 at Cinema-francais.fr
1970
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201971 | This is a list of films produced in France in 1971.
See also
1971 in France
Notes
External links
French films of 1971 at the Internet Movie Database
French films of 1971 at Cinema-francais.fr
1971
Films
Lists of 1971 films by country or language |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201972 | A list of films produced in France in 1972.
See also
1972 in France
Notes
References
External links
French films of 1972 at the Internet Movie Database
French films of 1972 at Cinema-francais.fr
1972
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201973 | A list of films produced in France in 1973.
See also
1973 in France
1973 in French television
Footnotes
References
External links
French films of 1973 at the Internet Movie Database
French films of 1973 at Cinema-francais.fr
1973
Films
French |
https://en.wikipedia.org/wiki/Klaus%20Dittrich | Klaus R. Dittrich (30 December 1950 – 20 November 2007) was a German computer scientist.
Biography
After his high school graduation at Gymnasium Münchberg he studied at University of Karlsruhe where he received his diploma degree (M.Sc.) in Computer Science.
1982 he earned his Ph.D. at Universität Karlsruhe, Institute for Program Structures and Data Organization. He was heading the database department Research Center for Information Technologies at University of Karlsruhe from 1985 to 1989.
Since 1989 he has been a professor of Computer Science at the University of Zurich and head of the Database Technology Research Group.
Klaus R. Dittrich took sabbatical leaves at Stanford University and Hewlett Packard Labs (1996), at Università degli Studi di Milano and at Boeing (2002). 1999 he was guest professor at Aalborg University.
References
1950 births
2007 deaths
German computer scientists |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201974 | A list of films produced in France in 1974.
See also
1974 in France
Notes
References
External links
French films of 1974 at the Internet Movie Database
French films of 1974 at Cinema-francais.fr
1974
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201975 | A list of films produced in France in 1975.
See also
1975 in France
Notes
External links
French films of 1975 at the Internet Movie Database
French films of 1975 at Cinema-francais.fr
1975
Lists of 1975 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201976 | A list of films produced in France in 1976.
See also
1976 in France
1976 in French television
Notes
External links
French films of 1976 at the Internet Movie Database
French films of 1976 at Cinema-francais.fr
1976
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201977 | A list of films produced in France in 1977.
See also
1977 in France
1977 in French television
Notes
External links
French films of 1977 at the Internet Movie Database
French films of 1977 at Cinema-francais.fr
1977
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201978 | A list of films produced in France in 1978.
See also
1978 in France
1978 in French television
References
Footnotes
Sources
External links
French films of 1978 at the Internet Movie Database
French films of 1978 at Cinema-francais.fr
1978
Films
French |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201979 | A list of films produced in France in 1979.
See also
1979 in France
Notes
References
External links
French films of 1979 at the Internet Movie Database
French films of 1979 at Cinema-francais.fr
1979
Films
French |
https://en.wikipedia.org/wiki/ESCOM | The Higher School of Computing (in Spanish: Escuela Superior de Cómputo or ESCOM) is the college specialized in Computer Sciences of the National Polytechnic Institute located in Mexico City, Mexico. Its students pursue the bachelor's degree in computer engineering, artificial intelligence engineering and data science.
The school has a faculty mostly with postgraduate studies, and there is a growing number of teachers with doctoral studies.
History
The school began classes on 27 September 1993 with 5 classrooms provided by the Superior School of Engineering and Architecture (ESIA) Zacatenco, on the third floor, building 10. Two of them worked as classrooms, one as a library, one as administrative area, and the other as school management. Similarly, the Superior School of Engineering and Architecture provided two spaces in the administrative area attached to the building 10, which were used as computer rooms.
From June 30, 2013, to July 4, 2013, the ESCOM participated for first time in the ACM ICPC World Finals. The team consisted of Christian Hernandez, Ethan Jimenez, and Jair Ramirez.
Undergraduate courses
First semester
Computing and Society
Programming I (Structured Programming)
Discrete Mathematics
Calculus I
Vector Analysis
Physics
Second semester
Oral and Written Communication
Programming II (Numerical Analysis)
Differential Equations
Calculus II
Linear Algebra
Electric Circuits
Third semester
Administrative Process
Programming III (Data Structures)
Software Engineering I
Digital Electronics
Probability and Statistics
Analog Electronics
Fourth semester
Economics
Operating Systems I
Databases I
Introduction to Microprocessors and Microcontrollers
Software Engineering II
Digital Communications
Fifth semester
Finance
Operating Systems II
Object Oriented Programming I
Databases II
Computer Networks I
Data Acquisitions
Sixth semester
Project Generation and Evaluation
Visual Programming
Object Oriented Programming II
Artificial Intelligence
Computer Networks II
Compilers
Seventh semester
Operations Research
Systems Development Techniques
Final Work I
Systems Programming I (Cryptography and Network Security I)
Advanced Programming I (Mobile Application Development I)
Developing of Web Applications I
Eighth semester
Administration of Computer Centers
Final Work II
Systems Programming II (Cryptography and Network Security II)
Advanced Programming II (Mobile Application Development II)
References
External links
Official ESCOM website
Instituto Politécnico Nacional |
https://en.wikipedia.org/wiki/List%20of%20French%20films%20of%201980 | A list of films produced in France in 1980.
Notes
External links
1980 in France
1980 in French television
French films of 1980 at the Internet Movie Database
French films of 1980 at Cinema-francais.fr
1980
Films
French |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.