source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Samsung%20Omnia%20Series | The Omnia series is a line of smartphones produced by Samsung Electronics. Omnia devices run either Microsoft's Windows Mobile 6.5, or Windows Phone 7 operating systems, and one Symbian device under the brand was also released.
Samsung Omnia M is a last Omnia phone marketed by Samsung before being superseded by Ativ in Autumn 2012.
List of Omnia devices
Symbian
Omnia HD (i8910)
Windows Mobile 6.5
Omnia I (i900) and Omnia I (i910) (US version) come with Windows Mobile 6.1 Professional
Omnia II (i8000) is the upgrade to the original Omnia. The HSDPA Omnia II gets Windows Mobile 6.1 or 6.5 Professional, TouchWiz 2.0 UI, a 3.7-inch AMOLED display, 5-megapixel camera, AGPS, up to 32 GB memory via microSD, Wi-Fi and launched in December 2009.
Omnia Lite (B7300) gets multimedia features and a simpler user interface. The HSDPA Omnia LITE gets Windows Mobile 6.5 Professional, TouchWiz 2.0 UI, 3-inch WQVGA display, a "3D" multimedia player, 3-megapixel camera, AGPS, Wi-Fi, and up to 32 GB memory via microSD.
Omnia Pro (B7610) offers a hybrid touch/QWERTY keyboard. With separate modes for "Work" and "Home" the HSDPA OmniaPRO gets Windows Mobile 6.5 Professional, a 3.5-inch AMOLED display, a 5-megapixel camera, AGPS, up to 32 GB memory via microSD, and Wi-Fi.
Omnia Pro (B7320)
Omnia Pro (B7330) loses the touch only offering the QWERTY keyboard. With a full QWERTY keyboard, the HSDPA OmniaPRO gets Windows Mobile 6.5 Standard, a 2.62-inch display, a 3.2-megapixel camera, AGPS, up to 32 GB memory via microSD, and Wi-Fi.
Windows Phone
Omnia 7 (released as the Samsung Focus Flash in the United States)
Omnia W is the second Omnia series Windows Phone smartphone from Samsung.
Omnia M
See also
Samsung Focus and Samsung Focus S, Samsung smartphone series that uses Windows Phone and available exclusively in US.
References
External links
Review Samsung Omnia M
Omnia |
https://en.wikipedia.org/wiki/Sniper%21%20%28video%20game%29 | Sniper! is a computer game that appeared on CompuServe. It was an adaptation of the Sniper! board game.
Plot
Sniper! is a strategy war-game. A player starts as a recruit in the Sniper Saloon & Salad Bar, where players can pick up local gossip, brag about wins, and explain defeats. There, players can also challenge other players to a Sniper! game, or play the computerized opponent. A drill instructor waits in the Bootcamp to show you new players how the game is played. The Halls of Fame also display players' best scores. In a game of Patrol two opposing squads, Alpha and Bravo, meet in no-man's land between their front lines. In a game of Infiltrate, the Alpha force must cross from one side of the map to the other, exiting the map at Bravo’s Victory Point area before Bravo can stop Alpha. The player has a small squad of soldiers to command, and plays either the Germans or the Americans, somewhere in western Europe during World War II.
Development
Steve Estvanik converted TSR's Sniper! board-game series into a multi-player, online computer game for CompuServe.
Reception
In the July 1989 edition of Computer Gaming World, Johnny Wilson gave the Sniper! videogame a generally positive review, admiring it both as a social experience as well as a competitive game.
In the January 1993 issue of Compute! (Issue 148), Paul C. Schuytema reviewed the Sniper! computer game, and suggested players pay for the graphical version rather than try to decipher images composed of ASCII characters, which he found "far too cryptic for my tastes." He noted that although "the game's control logistics seem a little obtuse at first, you can enter a modified boot camp where you explore all of the various commands."
References
1989 video games
CompuServe
Computer wargames
Multiplayer online games
Sniper video games
Turn-based strategy video games
Video games about Nazi Germany
Video games based on board games
Video games developed in the United States
Video games set in Europe
World War II video games |
https://en.wikipedia.org/wiki/SIOS%20Technology%20Corp. | SIOS Technology Corp. is a San Mateo, Californiabased company focused on IT operations analytics ITOA, cloud computing, business continuity and disaster recovery for large enterprises. It is based in Tokyo, Japan, and primarily assists large enterprises in adopting open, cloud computing technology.
History
SIOS Technology Inc. was founded in May 1997 in Japan and has led the development of open source software and Web application software. Given its open source software experience, the company pushed for the early adoption of Linux products in Japan. SIOS Technology Inc. provides SAN and SANLess software products that protect applications from downtime and data loss in any combination of physical, virtual, and cloud. In addition to its SteelEye Technology.
SteelEye Technology was founded in December 1999 by Jim Fitzgerald, Sue Ellery and Jim Mason. The company acquired the LifeKeeper high-availability clustering software from NCR Corporation that year, and began targeting the fledgling Linux server community with the product in January 2000.
AT&T’s Bell Labs created the LifeKeeper platform in the mid-1990s for high-availability of AT&T's Star Unix servers that operated the telecom company's phone switching technology. NCR took control of the LifeKeeper portfolio when AT&T spun off the company in 1997.
The business focuses on software products that provide high availability and disaster protection for business critical applications.
In 2003, the company introduced LifeKeeper for Windows 2003. In 2008, the company announced DataKeeper data replication. The company expanded its presence into virtual environments with the introduction of business continuity for VMware in 2007 and Citrix and Microsoft's Hyper-V in 2008.
In 2015, SIOS introduced a machine-learning based IT operations analytics platform for VMware environments.
SIOS iQ was recognized at the 2017 VMworld trade show. SIOS iQ was also named a silver winner in Most Innovative Product, Enterprise Category in Best in Biz Awards, 2016, the only independent business awards program judged by members of the press and industry analysts.
On December 5, 2017, SIOS partnered with VSTECS Holdings Ltd. a technology product and supply chain services platform in the Asia-Pacific (APAC) region. The partnership enables VSTECs to provide comprehensive professional services and SANless high availability clustering software to AWS customers throughout APAC.
See also
Virtual machine
Disaster recovery
IT operations analytics
References
External links
Clustering For Mere Mortals Blog
Google Finance on SIOS
US SIOS Website
SIOS APAC multi-language portal
Linux Clustering Blogs
Software companies based in California
Software companies established in 1997
Software companies of the United States |
https://en.wikipedia.org/wiki/CUBRID | CUBRID ( "cube-rid") is an open-source SQL-based relational database management system (RDBMS) with object extensions developed by CUBRID Corp. for OLTP. The name CUBRID is a combination of the two words cube and bridge, cube standing for a space for data and bridge standing for data bridge.
License policy
CUBRID has a separate license for its server engine and its interfaces. The server engine adopts the Apache License 2.0, which allows distribution, modification, and acquisition of the source code. CUBRID APIs and GUI tools have the Berkeley Software Distribution license in which there is no obligation of opening derivative works. The reason of adopting two separate license systems is to provide complete freedom to Independent software vendors (ISV) to develop and distribute CUBRID-based applications.
Architecture
The feature that distinguishes CUBRID database from other relational database systems is its 3-tier client-server architecture which consists of the database server, the connection broker and the application layer.
Database server
The database server is the component of the CUBRID database management system which is responsible for storage operations and statement execution. A CUBRID database server instance can mount and use a single database, making inter-database queries impossible. However, more than one instance can run on a machine.
Unlike other solutions, the database server does not compile queries itself, but executes queries precompiled in a custom access specification language.
Connection broker
The CUBRID connection broker's main roles are:
management of client application connections
caching and relaying information (e.g. query results)
query syntax analysis, optimization and execution plan generation
Also, a local object pool enables some parts of the execution to be deferred from the database server (e.g. tuple insertion and deletion, DDL statements), thus lowering the database server load.
Since the connection broker is not bound to the same machine as the database server, CUBRID can take advantage of the hardware resources of several machines while processing queries on a single database.
Application layer
Applications can use one of the available APIs to connect to a CUBRID connection broker.
Features
High Availability
CUBRID High Availability provides load-balanced, fault-tolerant and continuous service availability through its shared-nothing clustering, automated fail-over and manual fail-back mechanisms.
CUBRID's 3-tier architecture allows native support for High-Availability with two-level auto failover: the broker failover and server failover.
Broker failover
When connecting to a broker via a client API, users can specify, in the connection URL, a list of alternative hosts where brokers are listening for incoming requests. In case of a hardware, network, operating system or software failure on one of the hosts, the underlying client API automatically fails over to the next host that a user has |
https://en.wikipedia.org/wiki/NBA%20on%20SNI | The NBA on SNI refers to National Basketball Association television coverage on the now defunct television network known as Sports Network Incorporated (later known as the Hughes Television Network). Coverage began in the 1962-63 season (after the NBA's deal with NBC ended) and lasted through the 1963-64 season (when the NBA entered an agreement with ABC).
Overview
1962-63
For , SNI did two games. The first one being the All-Star Game at Los Angeles with Chick Hearn and Bud Blattner on the call. The second game was the sixth and deciding game of the NBA Finals between the Boston Celtics and Los Angeles Lakers with Bob Wolff on the call.
1963-64
For , SNI broadcast a series of Thursday night games starting January 2. The broadcast teams during the regular season were Marty Glickman and Carl Braun for games in the Eastern Division and Bud Blattner and Ed Macauley for games in the Western Division. The Thursday night series was shown on channel 9 in New York; some of the playoff games may not have been carried in New York due to conflicts with Mets telecasts.
They also broadcast the All-Star Game from Boston with Marty Glickman and Bud Blattner sharing play-by-play duties and with Carl Braun and Ed Macauley doing analysis.
SNI broadcast at least four playoff games starting on March 28 with St. Louis at Los Angeles with Jerry Gross on play-by-play and Ed Macauley on color commentary. The other games (all involving Marty Glickman on play-by-play) included:
Cincinnati at Boston on April 9
St. Louis at San Francisco on April 16
Boston at San Francisco on April 24
Carl Braun, Alex Hannum, and Fred Schaus were the respective analysts for the April 9, April 16, and April 24 playoff broadcasts.
References
SNI
1962 American television series debuts
1964 American television series endings
Black-and-white American television shows
Hughes Television Network |
https://en.wikipedia.org/wiki/Singapore%20Government%20Enterprise%20Architecture | The Singapore Government Enterprise Architecture (SGEA) programme was established to support and enable the business strategies, objectives, and a vision of a 'Networked Government'. It adopted a federated architecture approach similar to the United States government. It is a set of blueprints: the Business Architecture (BA), Information Architecture (IA), Solution Architecture (SA) and Technical Architecture (TA) of the Singapore Government. It provides a holistic view of business functions, common data standards, and shared ICT systems and infrastructure. This programme facilitates the identification of opportunities for collaboration among agencies, encouraging greater sharing of data, systems and processes across agencies.
History
The SGEA is an offshoot of the Civil Service Computerization Programme (CSCP), which the Singaporean government launched in the 1980s to turn Singapore's public sector as a world-class exploiter of IT. The initial goal was the improvement of internal operational efficiencies through the automation of traditional work functions in the bureaucracy. Within twenty years, the Internet was integrated into the framework so that IT became a tool for public service delivery. By the year 2000, Singapore launched its own e-government platform.
The SGEA was adopted to drive the e-government initiative. The expectation for its adoption was that it will transform the public sector by optimizing end-to-end business processes and system capabilities so that they are aligned with the Singaporean government's needs, missions, and strategies. This is demonstrated in the way the government adopted frameworks that are customized according to its structure and components as well as the nature of its economy, socio-economic status, infrastructure status, and business status. This is the reason why the SGEA is analogous to a "city plan that details policies and standards for the design of infrastructure technologies, databases, and applications."
Reference Models
The SGEA has four developed reference models:
Business Reference Model (BRM) - The BRM addresses the BA, and describes the Lines of Businesses and Business Functions performed by different government agencies.
Data Reference Model (DRM) - The DRM addresses the IA. It specifies the data definitions for data elements that are commonly used across government.
Solution Reference Model (SRM) - The SRM addresses the SA, and describes the systems and service components that can be shared across government.
Technical Reference Model (TRM) - The TRM is addressed by the Service-wide Technical Architecture (SWTA) established since 2002.
References
Government Enterprise Architecture in Singapore: Issues, Practices and Trends
External links
Government Enterprise Architecture (SGEA)
Singapore government policies |
https://en.wikipedia.org/wiki/Raz-Lee | Raz-Lee Security, Inc. is an international organization that provides data security solutions for IBM's Power i servers.
The company's clients include Fiat, Agfa, Teva Pharmaceuticals, Avnet, AIG, Dun & Bradstreet and the Israel branch of American insurance company American International Group, among others.
History
Founded in 1983, the company was formerly headquartered in Herzliya, Israel. By 1992, 33% of the company's products were being sold in the United States, and from 1994 to 1996 its business there, where it had offices in Nanuet, New York, dramatically increased, though its primary purchasers were still spread through Europe, the Middle East and Africa. As of 2009, the company is headquartered in Nanuet, with a research and development facility in Israel. The company also has offices in Israel and Italy and maintains a Technical Support and US Account Management center in San Francisco.
iSecurity Suite
The company's best known product consists of more than 15 individual products intended to protect and monitor information assets against insider threat and unauthorized external access.
In March 2020, Raz-Lee brought its Interface software to the next level with iSecurity Web, a new product that effectively operates the standard iSecurity GUI in a web browser. The app has been reviewed on browsers such as Chrome, Firefox and Edge, and also operates for desktop computers and tablets.
In August 2020, Raz-Lee released an attack simulator for its iSecurity Anti-Ransomware product, enabling users to test how their systems would react to both known and new ransomware attacks.
References
External links
IT Jungle - Raz-Lee Adds Object-Level Security to i OS Security Suite
Computer security software companies
Software companies based in New York (state)
Software companies of Israel
Software companies of the United States |
https://en.wikipedia.org/wiki/Stan%20Weber | Stan Weber was a quarterback for the Kansas State Wildcats football team from 1980 through 1984. He is the current color analyst for the K-State radio network. Now in his 36th year in the booth (as of the start of the 2022 season), Weber holds the longest tenure for a Kansas State radio broadcaster. In addition to his duties with the Wildcat football broadcasts, Weber also provides color commentary for K-State men's basketball games for both radio and television. He originally hails from Goddard, Kansas and was named Male Athlete of the Year and MVP of the 1980 Kansas Shrine Bowl All-Star Game by the Wichita Eagle.
At Kansas State, Weber served as captain of the 1984 team and led the Wildcats in rushing while earning academic All-America honors from the College Sports Information Directors of America (CoSIDA). Weber also held many of the K-State quarterback rushing records until the Michael Bishop and Ell Roberson eras and was once named Big Eight Player of the Week after rushing for 113 yards against number 1 Nebraska.
Weber, who graduated magna cum laude, received his bachelor's and master's degrees in accountancy from Kansas State and currently serves as Vice President - CFO of Tower Properties in Kansas City, in addition to his broadcast duties.
Weber is married to Nancy Weber, a former Kansas State cheerleader, and has four children: Stanton (a former Kansas State Football player), Landry (a Wide Receiver on the 2021 Kansas State Football team), McKenzi (a former Kansas State Volleyball player), and Brittani (Tyler’s wife).
References
External links
Kansas State Profile
Living people
American football quarterbacks
Kansas State Wildcats football players
People from Goddard, Kansas
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Christmas%20in%20Washington | Christmas in Washington was an annual Christmas television special that originated on NBC and later aired on the TNT network. It ended in 2015 after a 33-year run.
Background
One of two annual holiday specials produced by George Stevens Jr. (the other being the Kennedy Center Honors), the variety show first aired in 1982 on NBC before moving to its most recent home on TNT in 1998. Recorded in Washington, D.C. at the National Building Museum, on the second Sunday of each December before being re-edited for later broadcast, Christmas in Washington is a one-hour concert featuring artists from musical genres. Each guest performs at least one solo, but the prominent marquee performer usually has one or two more songs. The show sometimes had at least one guest from the world of opera. Each of the musical performances are backed by a full orchestra and chorus. The show's finale consisted of a medley performed by all the musical guests before the attendees-of-honor, the President of the United States and the First Lady, make a closing statement followed by the singing of "Hark! The Herald Angels Sing".
Recent events have benefited Children's National Medical Center.
Host and performers
From 2004 to 2008, the show was hosted by Dr. Phil and his wife, Robin. However, since 2009 and for the remainder of its most recent run, the show had a single host. The 2013 edition featured Hugh Jackman as host and The Backstreet Boys as marquee performers, marking the first time in six years that a group has been featured as marquee performers. The show aired live on pay-per-view internationally and in most major cities, after which a re-edited 42-minute version (with commercials in a one-hour slot) aired on network television.
Cancellation
In 2015, shortly after the Stevens' production company sold the rights to their companion program, the Kennedy Center Honors, the special was cancelled after being unable to find a new network or presenting sponsor (TNT had declined to renew the show after the 2014 edition).
Editions
The marquee performer is marked in bold.
References
Source: for Christmas in Washington 2000: https://www.imdb.com/title/tt0271434/
Christmas television specials
1981 establishments in Washington, D.C.
2015 disestablishments in Washington, D.C. |
https://en.wikipedia.org/wiki/Sense%20data | The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore. Sense data are taken to be mind-dependent objects whose existence and properties are known directly to us in perception. These objects are unanalyzed experiences inside the mind, which appear to subsequent more advanced mental operations exactly as they are.
Sense data are often placed in a time and/or causality series, such that they occur after the potential unreliability of our perceptual systems yet before the possibility of error during higher-level conceptual analysis and are thus incorrigible. They are thus distinct from the 'real' objects in the world outside the mind, about whose existence and properties we often can be mistaken.
Talk of sense-data has since been largely replaced by talk of the closely related qualia. The formulation the given is also closely related. None of these terms has a single coherent and widely agreed-upon definition, so their exact relationships are unclear. One of the greatest troubling aspects to 20th century theories of sense data is its unclear rubric nature.
Examples
Bertrand Russell heard the sound of his knuckles rapping his writing table, felt the table's hardness and saw its apparent colour (which he knew 'really' to be the brown of wood) change significantly under shifting lighting conditions.
H. H. Price found that although he was able to doubt the presence of a tomato before him, he was unable to doubt the existence of his red, round and 'somewhat bulgy' sense-datum and his consciousness of this sense-datum.
When we twist a coin it 'appears' to us as elliptical. This elliptical 'appearance' cannot be identical with the coin (for the coin is perfectly round), and is therefore a sense datum, which somehow represents the round coin to us.
Consider a reflection which appears to us in a mirror. There is nothing corresponding to the reflection in the world external to the mind (for our reflection appears to us as the image of a human being apparently located inside a wall, or a wardrobe). The appearance is therefore a mental object, a sense datum.
The nature of sense data
The idea that our perceptions are based on sense data is supported by a number of arguments. The first is popularly known as the argument from illusion. From a subjective experience of perceiving something, it is theoretically impossible to distinguish perceiving something which exists independently of oneself from an hallucination or mirage. Thus, we do not have any direct access to the outside world that would allow us to reliably distinguish it from an illusion that caused identical experiences. Since (the argument claims) we must have direct access to some specific experiential entity in order to have the percepts that we do, and since this entity is not identical to the real object itself, there must be some sort o |
https://en.wikipedia.org/wiki/Synthetic%20data | Synthetic data is information that's artificially generated rather than produced by real-world events. Typically created using algorithms, synthetic data can be deployed to validate mathematical models and to train machine learning models.
Data generated by a computer simulation can be seen as synthetic data. This encompasses most applications of physical modeling, such as music synthesizers or flight simulators. The output of such systems approximates the real thing, but is fully algorithmically generated.
Synthetic data is used in a variety of fields as a filter for information that would otherwise compromise the confidentiality of particular aspects of the data. In many sensitive applications, datasets theoretically exist but cannot be released to the general public; synthetic data sidesteps the privacy issues that arise from using real consumer information without permission or compensation.
Usefulness
Synthetic data is generated to meet specific needs or certain conditions that may not be found in the original, real data. This can be useful when designing any type of system because the synthetic data are used as a simulation or as a theoretical value, situation, etc. This allows us to take into account unexpected results and have a basic solution or remedy, if the results prove to be unsatisfactory. Synthetic data are often generated to represent the authentic data and allows a baseline to be set. Another benefit of synthetic data is to protect the privacy and confidentiality of authentic data. As stated previously, synthetic data is used in testing and creating many different types of systems; below is a quote from the abstract of an article that describes a software that generates synthetic data for testing fraud detection systems that further explains its use and importance. "This enables us to create realistic behavior profiles for users and attackers. The data is used to train the fraud detection system itself, thus creating the necessary adaptation of the system to a specific environment."
History
Scientific modelling of physical systems, which allows to run simulations in which one can estimate/compute/generate datapoints that haven't been observed in actual reality, has a long history that runs concurrent with the history of physics itself. For example, research into synthesis of audio and voice can be traced back to the 1930s and before, driven forward by the developments of e.g. the telephone and audio recording. Digitization gave rise to software synthesizers from the 1970s onwards.
In the context of privacy-preserving statistical analysis, in 1993, the idea of original fully synthetic data was created by Rubin. Rubin originally designed this to synthesize the Decennial Census long form responses for the short form households. He then released samples that did not include any actual long form records - in this he preserved anonymity of the household. Later that year, the idea of original partially synthetic data was create |
https://en.wikipedia.org/wiki/Timeline%20of%20railway%20electrification%20in%20Norway | The Norwegian railway network consists of of electrified railway lines, constituting 62% of the Norwegian National Rail Administration's of line. The first three mainline systems to be electrified were private ore-hauling lines. The Thamshavn Line opened in 1909, and remained in revenue use until 1973, after which it was converted to a heritage railway. It is the world's oldest remaining alternating-current railway and the only narrow gauge railway in the country to have been electrified. It was followed by Norsk Transport's Rjukan and Tinnoset Lines two years later, and Sydvaranger's Kirkenes–Bjørnevatn Line in 1922. The Norwegian State Railways' (NSB) first electrification was parts of the Drammen Line in 1922 and the ore-hauling Ofoten Line, which connects to the Iron Ore Line in Sweden, in 1923. The use of El 1 locomotives on the Drammen Line proved a large cost-saver over steam locomotives, and NSB started electrifying other lines around Oslo; from 1927 to 1930, the remainder of the Drammen Line and the continuation along the Randsfjorden and Sørlandet Lines to Kongsvinger were converted, along with the first section of the Trunk Line. In 1935, the Hardanger Line became the first section of new NSB track to be electrified. From 1936 to 1940, NSB electrified the Østfold Line, as well as more of the Sørland Line and the Bratsberg Line, connecting all electric lines west of Oslo.
During the 1940s, NSB electrified the Sørland Line, although the final section from Egersund to Stavanger was not converted until 1956. In 1957, the Kirkenes–Bjørnevatn Line became the only line to remove the electrification and replace the electric locomotives with diesel power. The 1950s saw the electrification of several regional and commuter lines around Oslo, including the Kongsvinger Line, the Trunk Line and the Dovre Line from Lillestrøm to Hamar, the Vestfold Line and the Eastern Østfold Line. This was largely due to NSB's program to remove all steam locomotives, either by electrification or by dieselization. In the late 1950s and 1960s, several to-be electrified lines were operated with diesel locomotives as an interim solution. The 1960s saw the remaining two steam lines in Southern Norway, the Bergen and Dovre Lines, electrified along with the Gjøvik Line. The Bergen Line was completed in 1964 and the Dovre Line completed in 1970. This finished all the planned electrifications, and the authorities deemed the remaining lines unprofitable to electrify because of low traffic. During the 1990s, a new program was attempted, this time to electrify the entire network, but only the Arendal Line was converted before the program was canceled. However, new lines around Oslo, including the Lieråsen and Oslo Tunnels on the Drammen Line and the Gardermoen and Asker Lines, were electrified at the time they opened. Further plans have been launched, in particular the section of the Nordland Line from Trondheim to Steinkjer, which is part of the Trøndelag Commuter Rail, an |
https://en.wikipedia.org/wiki/Next%20Life | Next Life is an adventure game developed by Czech company Future Games and published by The Adventure Company designed for Microsoft Windows-based computers. The game engine is OGRE.
Premise
The main character Adam Reichl possibly dies in a car accident and wakes up on unknown island in the middle of nowhere. He starts to explore and tries to find out where he is, only to find that there are other people in the island seemingly from different time periods.
Reception
Next Life received mixed to negative reviews from critics. On Metacritic, the game received a score of 56/100 based on 13 reviews, indicating "mixed or average reviews".
References
External links
Official site
Adventure games
Point-and-click adventure games
Video games developed in the Czech Republic
Windows games
Windows-only games
2007 video games
The Adventure Company games
Single-player video games |
https://en.wikipedia.org/wiki/Evolution%20in%20Variable%20Environment | Evolution in Variable Environment (EVE) is a computer program designed to simulate microbial cellular behavior in various environments. The prediction of cellular responses is a rapidly evolving topic in systems biology and computational biology. The goal is to predict the behavior a particular organism in response to a set of environmental stimuli in silico. Such predictions can have a significant impact on preventive medicine, biotechnology, and microbe re-engineering. Computational prediction of behavior has two major components: the integration and simulation of vast biological networks and the creation of external stimuli. Current limitations of the method are: lack of comprehensive experimental data on the various cellular subsystems and inadequate computational algorithms.
Overview
An organism that learns to modulate its behavior and gene expression based on temporal interrelationships between environmental factors possesses a competitive advantage of over other organisms that are unable to make such predictions. For example, learning when nutrients are going to be present in the environment allows the organism to selectively express genes that will take up the food source, thus allowing the organism to harvest energy.
Modeling these type of behaviors of even simple bacteria poses certain challenges. Given the diversity of biological systems, it would appear that the number of behavior responses to an environmental change would be nearly infinite. However, recent studies have shown that biological systems are optimized for a certain environment and will thus respond relatively specific ways to stimuli. This specificity simplifies the computations considerably.
The second challenge is the seemingly random environmental events. Ruling out circadian or temporal cycles, such as daytime versus nighttime or the different seasons, many events in the environment are unpredictable, such as weather patterns, water salinity, and oxygen levels. However, it turns out that certain environmental factors are coupled temporally. For example, an increase in water temperature is frequently correlated with an increase in water salinity. These relationships allow organisms to respond to specific environmental factors in a timely manner and thus increase their biological fitness.
The prediction of cellular responses bears considerable interest to scientists, physicians, and bio-engineers alike. For example, studying how a particular organism responds to external and internal stimuli can yield insights into the mechanisms of evolution. At the same time, such knowledge can also help physicians and health officials understand the infectious cycles of disease-causing bacteria and protists, allowing to them to establish preventive measures. Finally, knowing how bacteria behave under different stimuli may facilitate the development of engineered bacteria that perform certain functions, such as clearing oil spills. These examples are only some of the many applic |
https://en.wikipedia.org/wiki/Eisoo | EISOO Information Technology Corp. is a Chinese cloud computing company that offers synchronization, sharing, data protection (backup, disaster recovery and virtualization management), and managed cloud service. Their stated goal is to provide a solution for business to ensure both system availability and secure content management. EISOO was founded in 2006 and is headquartered in Shanghai, China.
Until 2016, EISOO mainly promoted three product lines: AnyShare, AnyBackup, and EISOO Managed Cloud Service (EMCS).
In 2017, Eisoo added another service called EISOO AI. This service is a trading platform, based on the work of the artificial intelligence AnyRobot.
History
2006.04 EISOO Software Co., Ltd. was founded by Frank He
2007.04 EISOO cooperated with BitDefender Ltd. Provided a full backup utility for BitDefender Total Security 20081
2008.01 EISOO released AnyBackup appliance in China 2.1 2
2008.07 EISOO's backup software SuperBackup, was chosen by Microsoft(China), to be included in Microsoft "Happy Package"[3]
2008.08 EISOO provided disaster recovery solution for IBM servers: IBM System x3610, IBM System x3100 [4]
2009.07 EISOO works with Dell to build Dell PowerBackup Solution
2009.11 Dell, Inc. signed an agreement with EISOO Technology to start their strategic partnership. The partners launched their joint data backup products to provide data protection service for small and medium business [5]
2011 EISOO published a secure document management appliance
2014 EISOO released the first private file cloud in China – AnyShare 3.5 [6]
2015 EISOO promoted the Intelligent Data Management Solutions under the CAM trend
2015 EISOO changed its name from EISOO Software Co. Ltd to EISOO Information Technology Corp. and started to transform its business to cloud computing.[7]
2017 EISOO released AnyRobot Log Management and Analytics for Enterprise
2017 EISOO released international trading service EISOO AI powered by AnyRobot 8
2018 EISOO released EISOO AI with AnyRobot 2.0 and started an international promotion with a budget of $1 000 0009
References
https://www.pcmag.com/article2/0,2817,2174280,00.asp
http://storage.chinabyte.com/445/12697445.shtml
http://www.microsoft.com/China/smb/local/c2b/Offer/Fudai/Product/BackUp/
https://web.archive.org/web/20110707014411/http://server.ccw.com.cn/yjzx/htm2008/20081112_542229.shtml
http://chinese.direct2dell.com/archive/2009/11/05/13148.aspx
http://digi.163.com/14/0324/17/9O4AS0BE001665EV.html
http://www.ccidnet.com/2015/1009/10034438.shtml
Companies based in Shanghai
Software companies of China
Chinese brands |
https://en.wikipedia.org/wiki/Ball%20transfer%20unit | Ball transfer units are omnidirectional load-bearing spherical balls mounted inside a restraining fixture. They are identical in principle to a computer trackball (pointing device). Typically the design involves a single large ball supported by smaller ball bearings.
They are commonly used in an inverted ball up position where objects are quickly moved across an array of units, known as a ball transfer table, a type of conveyor system. This permits manual transfer to and from machines and between different sections of another conveyor system. They are used in airports for luggage delivery, or in industry as part of manufacturing systems. Prior to the invention of the ball transfer unit, first patented by Autoset Production Ltd in 1958, these applications were solved by the use of inverted casters. However, casters recognise a trail, meaning that the wheels had to align before directional change could be achieved.
Ball transfer units can also be used in a non-inverted ball down position as a type of caster, however this use is restricted by load-bearing limitations and the type of floor. Manufacturers have addressed this problem with ball transfer units incorporating recirculating ball principles, however the inverted position is still the most common application and the least problematic.
See also
Mecanum wheel
Omni wheel
References
Bulk material handling |
https://en.wikipedia.org/wiki/Andrew%20Colin | Andrew John Theodore Colin was a British university professor of computer science, born in 1936. He is a co-inventor of the widely used Binary Tree data structure. Professor Colin published 12 textbooks on various aspects of Computer Science, some of which have been translated into other languages.
Andrew Colin lectured at Birkbeck College, University of London from 1957 to 1960, moving in 1960 to the university's Institute of Computer Science. From 1965 to 1970 he was Director of the Computer Science Laboratory at Lancaster University. In 1970 he was appointed Professor in the newly created Department of Computer Science at the University of Strathclyde. He stepped down as head of department in 1983 and started a company working on developing commercial applications based on the Department's research, while continuing to teach. Subsequently, he lectured part-time at the Graduate School of Business. He also sang bass in the choir of St. Mary's Cathedral, Glasgow.
He died on 25 September 2018 at the age of 82.
References
1936 births
2018 deaths
British computer scientists
Academics of Birkbeck, University of London
Academics of Lancaster University
Academics of the University of Strathclyde |
https://en.wikipedia.org/wiki/Night%20of%20the%20Living%20Dead%3A%20Darkest%20Dawn | Night of the Living Dead: Darkest Dawn, also known as Night of the Living Dead: Origins and Night of the Living Dead: Origins 3D, is a 2015 computer-animated horror film directed by Krisztian Majdik and Zebediah De Soto and produced by Simon West. The film is a re-telling of the original Night of the Living Dead in a contemporary setting.
Premise
An animated re-telling of the original Night of the Living Dead film. Set in modern-day New York City rather than 1960s rural Pennsylvania. Centers on a group of desperate survivors fighting to stay alive barricaded in an abandoned apartment building. Confined, cut off from the world, and under constant attack from the undead hordes closing in around them, the six main characters struggle to survive while also confronting their own sense of compassion and humanity.
Cast
Tony Todd as Ben
Danielle Harris as Barbara Todd
Bill Moseley as Johnny Todd
R. Madhavan as Tom Bitner
Joseph Pilato as Harry Cooper
Sydney Tamiia Poitier as Tami
Alona Tal as Helen Cooper
Tom Sizemore as Chief McClellan
Sarah Habel as Judy Rose Larson
Jesse Corti as News Reporter
Anastasia Roark as Susan Donaldson
Cornell Womack as Hunter Deets
Erin Braswell as Judy
Mike Diskint as Tom
Tech N9ne as Zombie
Production
The film had been in production on and off for five years since 2009. According to Tony Todd, the film had two different directors with two different approaches at different points in time. The film features visual effects from The Graphic Film Company, Los Angeles, which relied on the iPi Soft iPi Motion Capture markerless motion capture software. The software’s ability allows the filmmakers to produce very large amounts of moving zombies on screen and also allows the actors to motion capture their performances as if they were acting on a real film set.
Mos Def was originally cast as a voice actor, but after a short time, he was released from the project. Both Todd and Moseley would be reprising their roles as Ben and Johnny, respectively, from the 1990 version of the film. Indian actor R. Madhavan was signed on to play a role in mid 2013.
Release and reception
The film was reported to be complete in May 2014. A theatrical release across the United States of America was planned in the fall of 2014. However this did not happen. The film later premiered at 2015 Comic Con held in San Diego as a part of the Walker Stalker Fan Fest, during July 2015. The film was later released in October 2015 on iTunes and OnDemand stations across the United States.
To date there have been no reviews collected by Rotten Tomatoes.
References
External links
2015 films
2015 computer-animated films
2015 horror films
2015 independent films
American animated horror films
American computer-animated films
American independent films
Films set in New York City
Films set in apartment buildings
2010s English-language films
2010s American films |
https://en.wikipedia.org/wiki/ACROSS%20Project | ACROSS is a Singular Strategic R&D Project led by Treelogic funded by the Spanish Ministry of Industry, Tourism and Trade activities in the field of Robotics and Cognitive Computing over an execution time-frame from 2009 to 2011. ACROSS project involves a number higher than 100 researchers from 13 Spanish entities.
ACROSS project objectives
ACROSS modifies the design of social robotics, blocked in providing predefined services, going further by means of intelligent systems. These systems are able to self-reconfigure and modify their behavior autonomously through the capacity for understanding, learning and software remote access.
In order to provide an open framework for collaboration between universities, research centers and the Administration, ACROSS develops Open Source Services available to everybody.
Three application domains
ACROSS works in three application domains:
Autonomous living: robots are used as technological tools to help handicapped person into daily tasks.
Psycho-Affective Disorders (autism): robots are used to mitigate cognitive disorders.
Marketing: robots are used to interact with humans in a recreational approach.
Consortium
Treelogic
Alimerka
Bizintek
Universitat Politécnica de Catalunya
University of Deusto
European Centre for Soft Computing
Fatronik -
Fundació Hospital Comarcal Sant Antoni Abat
Fundación Pública Andaluza para la Gestión de la Investigación en Salud de Sevilla, "Virgen del Rocío" University Hospitals
m-BOT
Omicron Electronic
Universidad de Extremadura - RoboLab
Verbio Technologies
References
External links
ACROSS SlideShare
Robotics projects
Free software projects
Robotics suites
AI software
2009 in robotics
Research and development in Spain |
https://en.wikipedia.org/wiki/Andrew%20Ng | Andrew Yan-Tak Ng (; born 1976) is a British-American computer scientist and technology entrepreneur focusing on machine learning and artificial intelligence (AI). Ng was a cofounder and head of Google Brain and was the former Chief Scientist at Baidu, building the company's Artificial Intelligence Group into a team of several thousand people.
Ng is an adjunct professor at Stanford University (formerly associate professor and Director of its Stanford AI Lab or SAIL). Ng has also made substantial contributions to the field of online education as the cofounder of both Coursera and DeepLearning.AI. He has spearheaded many efforts to "democratize deep learning" teaching over 2.5 million students through his online courses. He is one of the world's most famous and influential computer scientists being named one of Time magazine's 100 Most Influential People in 2012, and Fast Company Most Creative People in 2014. In 2018, he launched and currently heads the AI Fund, initially a $175-million investment fund for backing artificial intelligence startups. He has founded Landing AI, which provides AI-powered SaaS products.
Biography
Ng was born in the United Kingdom in 1976. His parents Ronald P. Ng and Tisa Ho are both immigrants from Hong Kong. He has at least one brother. Growing up, he spent time in Hong Kong and Singapore.
In 1997, he earned his undergraduate degree with a triple major in computer science, statistics, and economics from Carnegie Mellon University in Pittsburgh, Pennsylvania, graduating at the top of his class. Between 1996 and 1998 he also conducted research on reinforcement learning, model selection, and feature selection at the AT&T Bell Labs.
In 1998 Ng earned his master's degree in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology (MIT) in Cambridge, Massachusetts. At MIT he built the first publicly available, automatically indexed web-search engine for research papers on the web. It was a precursor to CiteSeerX/ResearchIndex, but specialized in machine learning.
In 2002, he received his Doctor of Philosophy (Ph.D.) in Computer Science from the University of California, Berkeley, under the supervision of Michael I. Jordan. His thesis is titled "Shaping and policy search in reinforcement learning" and is well-cited to this day.
He started working as an assistant professor at Stanford University in 2002 and as an associate professor in 2009.
He currently lives in Los Altos Hills, California. In 2014, he married Carol E. Reiley. They have two children: a daughter born in 2019 and a son born in 2021. The MIT Technology Review named Ng and Reiley an "AI power couple".
Career
Academia and teaching
Ng is a professor at Stanford University departments of Computer Science and electrical engineering. He served as the director of the Stanford Artificial Intelligence Laboratory (SAIL), where he taught students and undertook research related to data mining, big data, and machine learning. His |
https://en.wikipedia.org/wiki/Lyn%20Swinburne | Lyn Mary Swinburne (born 6 June 1952) is an Australian women's advocate, inspirational speaker and founder of Breast Cancer Network Australia (BCNA).
Career
Swinburne was diagnosed with breast cancer in 1993 and underwent surgery, radiotherapy, chemotherapy and hormone therapy. After that time, and as a result of her experiences, she became a committed advocate on behalf of women with breast cancer and their families.
In 1996, Swinburne began her work to establish Breast Cancer Network Australia, which was then formally launched in October 1998. BCNA is now the peak national breast cancer ‘consumer' organisation representing nearly 300 member groups and more than 110,000 individuals in all Australian states and territories. BCNA currently has a staff of more than 45 and a vast number of volunteers working for the organisation. Previously, Lyn had been a primary school teacher.
Swinburne is the creator of the Field of Women concept. This major public awareness and fundraising event, began in 1998 with the planting of 10,000 pink silhouettes (representing the number of Australians diagnosed with breast cancer that year) and 2,500 white silhouettes (representing the number who would die) on the lawns in front of Parliament House, Canberra. The Field of Women LIVE event evolved in later years, with major events in Melbourne 2005, Sydney 2007 and Melbourne 2010. This high-profile event involved many thousands of people standing together in pink ponchos in the shape of the Pink Lady silhouette. The Field of Women LIVE event at the MCG in 2010 was awarded the Meetings & Events Australia's Public Event of the Year. The Field of Women concept has now been taken up by various groups around the world and has become an annual event in some countries.
Swinburne established The Beacon magazine in 1996, with its current circulation of 70,000 and then The Inside Story magazine, the latter designed for women with secondary breast cancer. She led the development of the My Journey Kit, designed as a one-stop information shop’ for women recently diagnosed with breast cancer. This kit, has since been taken up and adapted by a range of cancer groups within Australia and internationally.
A passionate advocate for consumer input, Swinburne has represented women with breast cancer, and Australians affected by cancer, on a number of state, national and international committees. In 1998, she was appointed a Director of the National Breast and Ovarian Cancer Centre (NBOCC), a position she held by the appointment of respective Health Ministers until NBOCC was amalgamated with Cancer Australia in July 2011. In 2010, Swinburne was appointed as an Advisory Council member of Cancer Australia, a position she still holds.
Swinburne has been an invited speaker at numerous national and international conferences in New Zealand, Asia, the United States and Europe. In May 2006 she chaired the Third Breast Cancer Global Patient Group Summit, held in Stresa, Italy.
She |
https://en.wikipedia.org/wiki/La%20Sept%20%28album%29 | La Sept is a 1989 promotional album of music for the French TV network La Sept written by Michael Nyman and performed by the Michael Nyman Band. It is Nyman's fourteenth release. Gabrielle Lester makes her debut with the band on this album. After a 13-year hiatus (at least from recording) with the band, she would replace the departing Alexander Balanescu as concertmaster for The Michael Nyman Band during the recording of Facing Goya, and, as of 2008, remains in that position. Musical passages created for La Sept were later re-used for the piece The Final Score which is featured in the album After Extra Time.
Track listing
Ouverture (1:04)
L'Après-Midi (0:47)
Le Soir (0:48)
La Nuit (0:48)La Sept, Suite
Untitled (1:24)
Untitled (0:54)
Untitled (1:21)
Untitled (2:48)
Untitled (1:29)
Untitled (1:25)
Untitled (1:30)
Untitled (2:14)
Untitled (1:31)
Untitled (0:21)
Untitled (2:55)
Personnel
Michael Nyman, composer, piano, conductor
Elisabeth Perry, Fenella Barton, Gabrielle Lester, Iris Juda, Jackie Shave, Jonathan Rees, Lyn Fletcher, Mayumi Seiler, Mike McMeneny*, Richard Ehrlich, violin
Kate Musker, Roger Tapping, viola
Jane Salmen, Tim Hugh, Tony Hinnigan, cello
Lynda Herighten, double bass
Martin Elliott, bass guitar
David Rix, clarinet
John Harle, soprano saxophone
David Roach, alto saxophone
Andrew Findon, Tenor, baritone saxophone
David Stuart, trombone
Richard Watkins, horn
Sylvie Caspar - voice
Producer - David Cunningham, Philippe Truffaut
Engineer - Michael Dutton*
Mixed by, edited by - Jean-Philippe Goude
References
1989 soundtrack albums
Theatre soundtracks
Michael Nyman soundtracks
Promotional albums |
https://en.wikipedia.org/wiki/Utopic%20Software | Utopic Software, formerly Persystent Software, is a privately held computer software company with offices in Tampa, Florida, USA, specializing in automated PC repair, self-healing operating system repair, imaging and secure hard drive wipe.
Utopic Software acquired Persystent Technologies in 2012. Utopic retained the Persystent brand and rebuilt the solution as a cohesive and centralized suite of features.
Utopic Software developed patented technology that restores application and operating system (O/S) files in as little as 45 seconds. The product is called Persystent Suite for Windows-based PCs. The PC repair technology can be automated to perform repair upon each reboot or it can be managed on demand for more flexibility.
References
Notes
Software companies based in Florida
Companies based in Tampa, Florida
Software companies of the United States |
https://en.wikipedia.org/wiki/Natural%20areas%20of%20Qatar | Protected areas of Qatar include:
Al Reem Biosphere Preserve (designated in 2007) is part of the World Network of Biosphere Reserves in the Arab States
Al Shahaniyah Park in Al-Shahaniya
Al Thakira Nature Reserve in Al Thakhira
Al Wabra Wildlife Preservation
Dahl Al Hammam Park, a sinkhole in Doha (entrance to the hole is now closed to the public)
Khor Al Adaid Natural Reserve in Khor Al Adaid
Khor Al Udeid Fish Sanctuary
Mudhlem Cave in Mukaynis
Musfer Sinkhole in Salwa
Ras Abrouq Nature Reserve (also known as Bir Zekreet (Zekreet Beach)) in Ras Abrouq
Ras Ushairij Gazelle Conservation Park
Umm Tais National Park
References
External links
World Database on Protected Areas
Qatar
Qatar geography-related lists |
https://en.wikipedia.org/wiki/Trash%20Candy | Trash Candy is the second album by Boston rock band VAGIANT Boston (now known as Tijuana Sweetheart), released on October 22, 2009.
"No Mercy" and "Trash Candy" were released on the Rock Band Network in 2010. "Trash Candy" also plays over the end credits of Rock Band 3.
Track listing
"Sugar Daddy" – 2:51
"Joellen" – 3:04
"No Mercy" – 2:39
"Take 'em All" – 2:13
"Second Coming" – 3:47
"Punk Jacket Clone" – 1:55
"Sticks & Stones" – 3:07
"Always on My Mind"– 3:02
"Trash Candy" - 2:27
References
2009 albums
Tijuana Sweetheart albums |
https://en.wikipedia.org/wiki/Arcserve | Arcserve is a provider of data protection, replication and recovery solutions for enterprise and mid-market businesses. Arcserve was founded in 1983 as Cheyenne Software. Software vendor CA Technologies, which was then known as Computer Associates, acquired Cheyenne in 1996 and continued to develop and market the Arcserve product under the same brand.
History
Arcserve was first developed as a product used to back up other software programs and to ensure that data in the network could not be lost. The major function of the first release was to automatically copy all of the information in the system so that mishaps such as power failures and equipment malfunctions would not destroy or erase it. During the early nineties, Arcserve became Cheyenne's flagship product with massive growth in sales. Cheyenne brought out an improved version of its core program Arcserve in 1993 and began distribution through Original Equipment Manufacturers (OEMs).
During the mid-nineties, Cheyenne continued to release a series of new Arcserve products tailored specifically for different market segments such as Macintosh and Windows users. Software vendor CA Technologies, which was then known as Computer Associates, acquired Cheyenne in 1996 and continued to develop and market the Arcserve product under the same brand.
In August 2014, Arcserve became an independent company when Marlin Equity Partners acquired the business from CA Technologies. They released their first product and named it Arcserve Unified Data Protection (UDP).
Arcserve provides some of the largest independent software vendor (ISV) developed backup software products in the market, and supports a wide variety of platforms and applications. Arcserve Unified Data Protection (UDP) is offered as fully integrated software, set-and-forget virtual or physical appliances, and the Arcserve(r) Cloud.
On April 26, 2017, Arcserve announced the acquisition of email archiving technology, now named Arcserve UDP Archiving. On July 11, 2017, Arcserve announced the acquisition of Zetta, a cloud-based disaster recovery solutions provider, by which it now offers direct-to-cloud DRaaS and BaaS with Arcserve UDP Cloud Direct.
On March 17, 2021, Arcserve announce that regulatory approval was received for the completion of the merger with StorageCraft.
See also
List of backup software
References
Backup software
Storage software |
https://en.wikipedia.org/wiki/Workspace%20virtualization | Workspace virtualization is a way of distributing applications to client computers using application virtualization; however, it also bundles several applications together into one complete workspace.
Overview
Workspace virtualization is an approach that encapsulates and isolates an entire computing workspace. At a minimum, the workspace consists of everything above the operating system kernel – applications, data, settings, and any non-privileged operating system subsystems required to provide a functional desktop computing environment. By doing this, applications within the workspace can interact with each other, enabling them to do some of the things users are accustomed to and which are missing in application virtualization such as embedding a Microsoft Excel worksheet into a Microsoft Word document. Further, the workspace contains applications settings and user data enabling the user to move to a different operating system or to a different computer and still preserve applications, settings and data in one complete working unit. For deeper workspace virtualization, the virtualization engine implementation virtualizes privileged code modules and full operating system subsystems through a kernel-mode Workspace Virtualization Engine (WVE).
Advantages and disadvantages
Workspace Virtualization vs Application Virtualization
Workspace virtualization enables individual applications to interact with each other and also enables user settings/configuration and user data to stay within the workspace. Application virtualization does not. Application Virtualization shields independent applications from each other better should one of them prove to be hostile (i.e. contains a virus of some sort).
Workspace Virtualization vs Desktop Virtualization
Workspace Virtualization runs directly on the client computer hardware whereas Desktop Virtualization in many cases runs on a remote computer somewhere over a corporate LAN/WAN or over the Internet (called Hosted Desktop Virtualization).
In other cases Desktop Virtualization can be run on the client directly through a virtual machine environment such as VMware Workstation, VirtualBox or Thincast Workstation. Because the applications in a Desktop Virtualization environment run at a different location, on a remote machine or in a local virtual machine, and technology simply offers a way to present the graphics interface locally using technologies such as Remote Desktop. As a result, the graphics system is much slower and access to local data services such as USB or FireWire-connected cameras, scanners, & hard drives is much slower. Workspace virtualization, on the other hand, offers the advantage that the amount of time required to move from one client computer to another is small because applications, settings and data are stored locally on the client. When it comes to system resources, Workspace Virtualization requires fewer resources than Desktop Virtualization because it doesn't contain a complete c |
https://en.wikipedia.org/wiki/CPU%20Sim | CPU Sim is a software development environment for the simulation of simple computers. It was developed by Dale Skrien to help students understand computer architectures. With this application the user is able to simulate new or existing simple CPUs. Users can create new virtual CPUs with custom machine language instructions, which are implemented by a sequence of micro instructions. CPU Sim allows the user to edit and run assembly language programs for the CPU being simulated.
CPU Sim has been programmed using the Java Swing package. This means that it is platform independent (runs on every platform that has a Java virtual machine installed).
Wombat 1 Sample CPU
A sample computer system, the Wombat 1, is provided with CPU Sim. It has the following registers:
pc (program counter);
acc (accumulator);
ir (instruction register);
mar (memory address register);
mdr (memory data register);
status.
The assembly language of the Wombat 1 computer consists of 12 instructions. Each instruction is stored on 16 bits; the first 4 are the opcode and the other 12 are the address field.
Features
CPU Sim has the following features:
allows the creation of a CPU (a virtual one), including the registers, RAM, microinstructions, and machine instructions;
allows the creation, editing, and execution of assembly language programs for the simulated CPU;
allows stepping forward and backward through the execution of assembly language programs.
Example program for the Wombat 1 CPU
This program reads in integers until a negative integer is read. It then outputs the sum of all the positive integers.
Start: read // read n -> acc
jmpn Done // jump to Done if acc < 0.
add sum // add sum to the acc
store sum // store the new sum
jump Start // go back & read in next number
Done: load sum // load the final sum
write // write the final sum
stop // stop
sum: .data 2 0 // 2-byte location where sum is stored
The following modification of the program is also used sometimes:
Start: read // read n -> acc
jmpz Done // jump to Done if nacc is 0.
add sum // add sum to the acc
store sum // store the new sum
jump Start // go back & read in next number
Done: load sum // load the final sum
write // write the final sum
stop // stop
sum: .data 2 0 // 2-byte location where sum is stored
This one can use negative input to subtract, or 0 to break the loop.
See also
Comparison of EDA software
List of free electronics circuit simulators
Computer architecture simulator
References
External links
GitHub Source Repository
CPUSim Youtube Playlist
CPUsimulator Applet
Electronic circuit simulators |
https://en.wikipedia.org/wiki/Mediation%20%28disambiguation%29 | Mediation, in legal practise, is a form of alternative dispute resolution.
Mediation(s) may also refer to:
Cultural mediation, a mechanism of human development
Data mediation, data transformation via a mediating data model
Mediation (Marxist theory and media studies), the reconciliation of two opposing forces within a given society by a mediating object
Mediations, journal of the Marxist Literary Group
Mediation (statistics), a concept in psychometrics
Telecommunications mediation, a process that converts call data to a layout that can be imported by a billing system or other application
Division by two, in arithmetic
See also
Mediativity
Mediatization (media), the influence of mass media on society
Meditation (disambiguation) |
https://en.wikipedia.org/wiki/Poston%20Butte%20High%20School | Poston Butte High School is a high school in San Tan Valley, Arizona in the Florence Unified School District. It opened July 20, 2009.
One-to-one computing
Poston Butte High School does not employ textbooks. Instead, the school's one-to-one computing policy provides a laptop to each student in lieu of textbooks.
The first school to use one-to-one computing in Arizona was Empire High School, which started doing so in 2005. Florence district officials worked with Empire to implement a similar program at Poston Butte in 2009. After successful implementation at Poston Butte, it was expanded to Florence High School in 2010.
First graduating class
The first class graduated from Poston Butte on May 30, 2012. It had 253 students.
References
External links
Schools in Pinal County, Arizona
Public high schools in Arizona
2009 establishments in Arizona |
https://en.wikipedia.org/wiki/Cairo%E2%80%93Cape%20Town%20Highway | The Cairo–Cape Town Highway is Trans-African Highway 4 in the transcontinental road network being developed by the United Nations Economic Commission for Africa (UNECA), the African Development Bank (AfDB), and the African Union. The route has a length of and links Cairo in Egypt to Cape Town in South Africa.
The British Empire had long proposed a road through the Cape to Cairo Red Line of British colonies.
The road was variously known as the Cape to Cairo Road, Pan-African Highway, or, in sub-Saharan Africa, the Great North Road. Like the Cape to Cairo Railway, the road was not completed before the end of British colonal rule.
In the 1980s, a modified version of the plan was revived as part of the Trans-African Highway, a transcontinental road network developed by the United Nations Economic Commission for Africa (UNECA), the African Development Bank (ADB), and the African Union, named the Cairo-Cape Town Highway. While it uses most of the same roads as the original Cape to Cairo Road, it uses different routes in a few places.
History
The original proposal for a North South Red Line route was made in 1874 by Edwin Arnold, then the editor of The Daily Telegraph, which was joint sponsor of the expedition by H.M. Stanley to Africa to discover the course of the Congo River. The proposed route involved a mixture of railway and river transport between Elizabethville, now Lubumbashi in the Belgian Congo and Sennar in the Sudan rather than a completely rail one.
In comparison, the Red Line road would stretch across the continent from south to north, running through the British colonies of the time, such as the Union of South Africa, Southern and Northern Rhodesia and Nyasaland, Kenya, Sudan and Egypt. The road would create cohesion between the British colonies of Africa, it was thought, and give Britain the most important and dominant political and economic influence over the continent, securing its position as a global colonial power. The road would also link some of the most important cities on the continent, including Cape Town, Johannesburg, Pretoria, Harare (then Salisbury), Lusaka (the main street through the centre of Lusaka was part of this route and is how it got its name, Cairo Road), Nairobi, Khartoum and Cairo. One of the main proponents of the route was Cecil John Rhodes, though his preference was for a railway. German East Africa (Tanganyika, now Tanzania) was a gap in the British territories, but Rhodes, in particular, felt that Germany ought to be a natural ally. Shortly before his death he had persuaded the German Kaiser to allow access through his colony for the Cape to Cairo telegraph line (which was built as far north as Ujiji but never completed). In 1918 Tanganyika became British and the gap in territories was filled.
One of the biggest problems was the decline of the Empire and fragmentation of the British colonies. Even though Egypt became independent in 1922, British influence there was strong enough for Cairo to be vie |
https://en.wikipedia.org/wiki/Dental%20software | Computers and software have been used in dental medicine since the 1960s. Since then, computers and information technology have spread progressively in dental practice. According to one study, in 2000, 85.1% of all dentists in the United States were using computers.
Classification
Schleyer and Kirshner categorized dental software as administrative, clinical, and for the Internet. Zimmerman et al. categorized dental software functions for administration and management of patients documentation, electronic archives of the documentation, telecommunication, computer - aided education, computerizing instruments and techniques in the dental office software assisting with clinical decision making.
Patient Records Management Dental Software
Patient records management dental software is used by the dentist to organize the records of the patients in their practice. The computer patients management software is used for collecting, managing, saving, and retrieving medical information for the patients, and for creating reports for the patients. Computers in dentistry were first used to record dental archives as an alternative of paper dental documentation. Later, the term "computer based dental documentation" was replaced with the term electronic patient record (EPR) since the latter better describes the method and the environment in which the patient record is being managed. An official 1991 report of the Institute of Medicine of the National Academies in Washington, USA gave definitions about what functions must implement a computer based system for health documentation.
The American Dental Association (ADA) created specification number 1000 and number 1004 concerning the structure and the content of the electronic health record. The medical data include identification and contact data, date of next visit, number of previous visits, anamnestic, clinical and paraclinical data, applied treatment, and treatment results data. Patient Records Management Dental Software is the most frequently used dental software.
Web-based dental patients records management software has been proposed. The web-based records save the information for the patients
in a central web server instead in the computer in the dental office.
After the introduction of the cloud system, patient records management is further simplified with the collection of patient data remotely prior to the patient visit to the dental practice and the integration of data using API's with the practice management system, this has eliminated the need of manual data entry and reduced billing errors. Commercially these type of systems are also known as paperless software systems.
Dental Treatment Planning Software
The usage of computer technologies for taking clinical decisions for the treatment of dental patients started at the end of the 1970s. The expert systems designed to enhance the treatment process, by providing the dental practitioner with a treatment plan are known as dental expert systems soft |
https://en.wikipedia.org/wiki/Elapsed%20real%20time | In computing, elapsed real time, real time, wall-clock time, wall time, or walltime is the actual time taken from the start of a computer program to the end. In other words, it is the difference between the time at which a task finishes and the time at which the task started.
Wall time is thus different from CPU time, which measures only the time during which the processor is actively working on a certain task or process. The difference between the two can arise from architecture and run-time dependent factors, e.g. programmed delays or waiting for system resources to become available. Consider the example of a mathematical program that reports that it has used "CPU time 0m0.04s, Wall time 6m6.01s". This means that while the program was active for six minutes and one second, during that time the computer's processor spent only 4/100 of a second performing calculations for the program.
Conversely, programs running in parallel on more than one processing unit can spend CPU time many times beyond their elapsed time. Since in concurrent computing the definition of elapsed time is non-trivial, the conceptualization of the elapsed time as measured on a separate, independent wall clock is convenient.
Another definition of "wall time" is the measurement of time via a separate, independent clock as opposed to the local system time (internal), i.e. with regard to the difference between the two.
In simulation
The term wall-clock time has also found widespread adoption in computer simulation, to distinguish between (1) the (often compressed or expanded) simulation time, and (2) the time as it passes for the user of the simulation tool.
References
Computing terminology
Durations |
https://en.wikipedia.org/wiki/Atom%20%28programming%20language%29 | Atom is a domain-specific language (DSL) in Haskell, for designing real-time embedded software.
History
Originally intended as a high-level hardware description language (HDL), Atom was created in early 2007 and released as free and open-source software (FOSS) of April of that year. Inspired by TRS and Bluespec, Atom compiled circuit descriptions, that were based on guarded atomic operations, or conditional term rewriting, into Verilog netlists for simulation and logic synthesis. As a hardware compiler, Atom's main objective is to maximize the number of operations, or rules, that can execute in a given clock cycle without violating the semantics of atomic operation. By employing the properties of conflict-free and sequentially composable rules, Atom reduced maximizing execution concurrency to a feedback arc set optimization of a rule-data dependency graph. This process was similar to James Hoe's original algorithm.
When Atom's author switched careers in late 2007, from logic design to embedded system software engineering, Atom was redesigned from an HDL to a domain-specific language targeting hard real-time computing embedded applications. As a result, Atom's compiler's main objective changed from maximizing rule concurrency to balancing processing load and minimizing worst case timing latency. In September 2008, Atom was presented at the Commercial Users of Functional Programming (CUFP) conference. In April 2009, in its new form, it was released as FOSS.
Overview
Atom is a concurrent programming language intended for embedded applications. Atom features compile time task scheduling and generates code with deterministic execution time and memory use, simplifying worst case execution time analysis for applications that need hard realtime performance. Atom's concurrency model is that of guarded atomic actions, which eliminates the need for, and the problems of using, mutex locks.
By removing runtime task scheduling and mutex locking, two services traditionally served by a real-time operating system (RTOS), Atom can eliminate the need and overhead of an RTOS in embedded applications.
Examples
Limits
To provide guarantees of deterministic execution time and memory consumption, Atom places several restrictions on computing. First, Atom designs are always finite state: all variables are global and declared at compile time and dynamic memory allocation is disallowed. Second, Atom provides no function or looping constructs. Instead, state variable updates are pure combinational logic functions of the current state.
References
External links
Declarative programming languages
Functional languages
Real-time computing
Synchronous programming languages
Statically typed programming languages
Haskell programming language family
Free software programmed in Haskell
Cross-platform free software
Free compilers and interpreters
Programming languages created in 2007
2007 software |
https://en.wikipedia.org/wiki/Genie%20%28programming%20language%29 | Genie is a modern, general-purpose high-level programming language in development since 2008. It was designed as an alternative, simpler and cleaner dialect for the Vala compiler, while preserving the same functionality of the Vala language. Genie uses the same compiler and libraries as Vala; the two can indeed be used alongside each other. The differences are only syntactic.
Genie's syntax is derived from numerous modern languages like Python, Boo, D and Delphi. In the vein of Python, Genie uses indentation rather than explicit block delimiters (like, for example, curly brackets) to delimit blocks.
Like Vala, Genie uses the GObject type system to create classes and interfaces declared in Genie source code, without imposing additional runtime requirements (i.e., unlike Python, Java or C#, it does not require a virtual machine).
Genie allows access to C libraries, especially those based in GObject (like GTK), without using a different application binary interface (ABI). During compilation, the code is first translated to C source and header files, which are then compiled to platform-specific machine code using any available C compiler like GCC, thus allowing cross-platform software development.
Programs developed in Vala and Genie do not depend on the GNOME Desktop Environment, usually requiring only GLib.
Code samples
"Hello World"
This sample explicitly uses four spaces for indentation.
[indent=4]
init
print "Hello, world!"
Objects
With no explicit indentation declaration, the default is tabs.
class Sample
def run()
stdout.printf("Hello, world! \n ")
init
var sample = new Sample()
sample.run()
Criticism
, Genie "for" loops are inclusive, which makes handling of empty lists cumbersome:
However, one can also iterate over lists via the for-in construct. This is easy and straightforward:
References
External links
Using the Genie programming language under Puppy Linux
Puppy Linux: Vala and Genie Programming
API Documentation
search github projects written in genie
2008 software
Cross-platform free software
GTK language bindings
High-level programming languages
Object-oriented programming languages
Programming languages created in 2008
Software using the LGPL license
Statically typed programming languages |
https://en.wikipedia.org/wiki/Timo%20Honkela | Timo Untamo Honkela (August 4, 1962 – May 9, 2020) was a computer scientist at the University of Helsinki, Aalto University School of Science and Aalto University School of Art, Design and Architecture. He holds a PhD from Helsinki University of Technology.
From 2014 until 2018 he held a fixed-term professorship at the University of Helsinki. Before joining the University of Helsinki he worked as a non-tenured professor in two Schools of the Aalto University, The School of Art, Design and Architecture and the School of Science. He has presented his thoughts on his studies and work in the joint blog 375 Humanists.
Timo Honkela conducted research on several areas related to knowledge engineering, cognitive modeling and natural language processing.
Honkela was born in Kalajoki. From 1998 to 2000 he worked as a professor in the Aalto Media Lab. To the media Lab Honkela brought his expertise in Kohonen self-organising map (SOM) and worked closely with artist and designers around the topic.
In 2001 Honkela collaborated with George Legrady to produce an interactive museum installation, Pockets Full of Memories to the Centre Georges Pompidou, National Museum of Modern Art in Paris. The concept, created by Legrady, provided for visitors a possibility to scan their own objects to a database and then organise them by Kohonen Self-Organizing Map algorithm.
In 2017 Honkela published a book in Finnish. The book Rauhankone (English: Peace Machine) presents his idea of designing artificial intelligence and machine learning to serve humanity, in practice to help people to live in peace with each other. He died in Helsinki.
Publications
Timo Honkela, Wlodzislaw Duch, Mark Girolami and Samuel Kaski (editors): Artificial Neural Networks and Machine Learning, Springer, 2011.
Jorma Laaksonen and Timo Honkela (editors): Advances in Self-Organizing Maps, Springer, 2011.
Timo Honkela: Rauhankone. Gaudeamus, 2017.
References
1962 births
2020 deaths
Finnish computer scientists
Artificial intelligence researchers
Natural language processing researchers |
https://en.wikipedia.org/wiki/Lli%C3%A7%C3%A0%20d%27Amunt | Lliçà d'Amunt, or Llissá de Munt, is a municipality in Vallès Oriental, Catalonia, Spain.
References
External links
Government data pages
Municipalities in Vallès Oriental |
https://en.wikipedia.org/wiki/Secureworks | Secureworks Inc. is an American cybersecurity company. The company has approximately 4,000 customers in more than 50 countries, ranging from Fortune 100 companies to mid-sized businesses in a variety of industries.
It became part of Dell Technologies in February 2011 and was later the subject of an IPO to again become a publicly traded company in April 2016. It is still majority-owned by Dell.
History
Secureworks was founded as a privately held company in 1998 by Michael Pearson and Joan Wilbanks. In 2002, Michael R. Cote became President and CEO. In 2005, and again in 2006, the company was named to the Inc. 500 and Inc. 5000 lists 2006 and Deloitte’s Fast 500.
In 2006, Secureworks merged with LURHQ Corporation and the new entity continued under the Secureworks corporate name. LURHQ was founded in 1996 in Myrtle Beach, SC and provided managed security services to large enterprises. With the merger, Secureworks was able to leverage Sherlock, LURHQ's portal, to unify its combined customer base onto a single integrated security management platform.
In 2009, Secureworks acquired the Managed Security Services (MSS) business from VeriSign, Inc. and grew to more than 500 employees worldwide. The acquisition expanded its clients to approximately 2,600 in more than 50 countries, including the United Kingdom, Saudi Arabia, Taiwan, Finland, Spain, Brazil and Mexico. This includes four of the Fortune 10.
In December 2009, Secureworks acquired managed security and consulting firm dns Limited. This acquisition expanded Secureworks' operation to include a UK-based operations center and additional offices in London and Edinburgh.
On January 4, 2011, Dell announced that it would acquire Secureworks to be part of Dell Services. Dell Secureworks officially began operating as a Dell subsidiary on February 7, 2011.
Dell Secureworks expanded into Australia and New Zealand region in 2013. Dell Secureworks opened an operations center in Sydney to meet demands from local Australia businesses, the most in demand services in this area being Penetration Testing, forensic investigations and ongoing monitoring of environments for attacks.
On December 17, 2015, Secureworks filed to go public. Subsequently, on April 22, 2016, announced its IPO, raising $112 million after pricing its IPO at $14 per share. However, the company was expecting the initial price to be between $15.50-$17.50. This was the first tech IPO in the U.S. in 2016. In August 2017, Secureworks rebranded its logo and changed capitalization of the 'W' in its name to lower case.
In an evolution of its long standing business of selling Managed Security Services (MSSP), in April 2019, Secureworks announced the availability of Red Cloak Threat Detection and Response a cloud based, SaaS next-generation SIEM product designed to analyse, detect, investigate and respond to malicious threats across an organizations endpoints, network and cloud environment. As of June 2020, the company reported 40% Annual Recurr |
https://en.wikipedia.org/wiki/Compressed%20suffix%20array | In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data structure that improve on the suffix array. These data structures enable quick search for an arbitrary string with a comparatively small index.
Given a text T of n characters from an alphabet Σ, a compressed suffix array supports searching for arbitrary patterns in T. For an input pattern P of m characters, the search time is typically O(m) or O(m + log(n)). The space used is typically , where is the k-th order empirical entropy of the text T. The time and space to construct a compressed suffix array are normally .
The original presentation of a compressed suffix array solved a long-standing open problem by showing that fast pattern matching was possible using only a linear-space data structure, namely, one proportional to the size of the text T, which takes bits. The conventional suffix array and suffix tree use bits, which is substantially larger. The basis for the data structure is a recursive decomposition using the "neighbor function," which allows a suffix array to be represented by one of half its length. The construction is repeated multiple times until the resulting suffix array uses a linear number of bits. Following work showed that the actual storage space was related to the -order entropy and that the index supports self-indexing. The space bound was further improved achieving the ultimate goal of higher-order entropy; the compression is obtained by partitioning the neighbor function by high-order contexts, and compressing each partition with a wavelet tree. The space usage is extremely competitive in practice with other state-of-the-art compressors, and it also supports fast in-situ pattern matching.
The memory accesses made by compressed suffix arrays and other compressed data structures for pattern matching are typically not localized, and thus these data structures have been notoriously hard to design efficiently for use in external memory. Recent progress using geometric duality takes advantage of the block access provided by disks to speed up the I/O time significantly In addition, potentially practical search performance for a compressed suffix array in external-memory has been demonstrated.
Open source implementations
There are several open source implementations of compressed suffix arrays available (see External Links below). Bowtie and Bowtie2 are open-source compressed suffix array implementations of read alignment for use in bioinformatics. The Succinct Data Structure Library (SDSL) is a library containing a variety of compressed data structures including compressed suffix arrays. FEMTO is an implementation of compressed suffix arrays for external memory. In addition, a variety of implementations, including the original FM-index implementations, are available from the Pizza & Chili Website (see external links).
See also
FM-index
Suffix Array
Reference |
https://en.wikipedia.org/wiki/Weekly%20Toro%20Station | Weekly Toro Station (週刊トロ・ステーション, Shūkan Toro Sutēshon) was a video game developed by Bexide and Sony Computer Entertainment for the PlayStation 3 and PlayStation Portable. It was the replacement for Mainichi Issho and was released on November 11, 2009 through the Japanese PlayStation Store. Some services were terminated on March 28, 2013, and was completely terminated at the end of September 2013.
Game Center (ゲームセンター)
All ten mini games from Mainichi Issho were gathered and available for free in the Game Center (ゲームセンター, Gēmu Sentā). That included the once pay per play games that required a service subscription such as the cosplay license. The Game Center's collectible capsule toys could be purchased with medals (10 medals cost 100 yen, 60 medals were 500 yen). There were all kinds of mini games: solo games, two-player games, online multiplayer games, some of them were even motion sensor controlled.
Mainichi Right Brain Ranking (まいにち右脳ランキング)
Mainichi Right Brain Battle (まいにち右脳バトル)
Mainichi Picture Shiritori (まいにちピクチャーしりとり)
Angel Shooting (天使シューティング)
Koi no Mi no Bori (コイの三のぼり)
Nobi Nobi Snake (のび のび スネーク)
Toro Racer (トロレーサー)
Bowling (ボウリング)
Speed (スピード)
Tennis (テニス)
Platinya Membership (プラチニャ会員)
"Platinya" was a pun at "platinum" and "nya", the latter being the Japanese equivalent to "meow", the cat's scream. Platinya Membership consisted in an 800 yen 30-day subscription that allowed the gamer to get access to exclusive contents such as Toro Station back numbers.
References
External links
Official website
Menu Translations
2009 video games
PlayStation 3 games
PlayStation Portable games
PlayStation Network games
Sony Interactive Entertainment games
Japan-exclusive video games
Video games developed in Japan
Multiplayer and single-player video games |
https://en.wikipedia.org/wiki/Sinohotel | Sinohotel Travel Network is an online hotel reservations and travel planning company in Beijing serving international travelers to China. It is a multilingual site, using English, Chinese, Japanese, and Korean to display the latest information about hotels and destinations around China with operations based in Beijing.
History
The company was created by founder Janet Tang in 1999 under the name Sinohotel.com to use the burgeoning power of search engines to fill a perceived void of hotel information. Sinohotel was one of the first hotel reservation websites in China, offering the hotel information and reservation for overseas market and local market.
Tang, a graduate of Wuhan University, came to Beijing in 1995, found many overseas friends had difficulty to find the suitable hotel in China, then she set up the website with a small operation in Beijing. The website (and industry as a whole) has survived various unforeseen catastrophic events, including the “dot com” meltdown of 2000–2001, as well as the SARS outbreak in 2003, both of which devastated the travel industry.
After 2003, Sinohotel's company size became bigger. In 2005, Sinohotel began to focus on arranging theme and culture tours for small groups, especially those seeking a typical China experience, including not only sightseeing but also exclusive glimpses into the life of local communities and exploration of the cultural heritages of this ancient country. In 2008, the sinohotel was prized as the best travel website aimed at the oversea market in China.
In 2010, as the World Expo 2010 was approaching, Sinohotel.com was recommended again by The Wall Street Journey as an accommodation site in China.
Awards
Sinohotel has won the best travel website aimed overseas market in China 2008.
Activity
In 2005, sinohotel joined WHL sustainable tourism links that financially supported by the IFC and world bank.
In 2008, sinohotel.com promoted the tours for Beijing Olympics, recommended by The Wall Street Journey.
In 2009, sinohotel.com promoted the tours & hotels booking for World Expo 2010 Shanghai.
March 1, 2010, sinohotel.com built the partnership with eLong, Inc.
March 15, 2013, eLong closed the website of sinohotel.com.
Footnotes
External links
Companies based in Beijing
Travel and holiday companies of China |
https://en.wikipedia.org/wiki/Lance%20Fortnow | Lance Jeremy Fortnow (born August 15, 1963) is a computer scientist known for major results in computational complexity and interactive proof systems. He is currently Dean of the College of Computing at the Illinois Institute of Technology.
Biography
Lance Fortnow received a doctorate in applied mathematics from MIT in 1989, supervised by Michael Sipser. Since graduation, he has been on the faculty of the University of Chicago (1989–1999, 2003–2007), Northwestern University (2008–2012) and the Georgia Institute of Technology (2012–2019) as chair of the School of Computer Science.
Fortnow was the founding editor-in-chief of the journal ACM Transactions on Computation Theory in 2009. He was the chair of ACM SIGACT and succeeded by Paul Beame. He was the chair of the IEEE Conference on Computational Complexity from 2000 to 2006. In 2002, he began one of the first blogs devoted to theoretical computer science and has written for it since then. Since 2007, he has had a co-blogger, William Gasarch. In September 2009, Fortnow brought mainstream attention to complexity theory when he published an article surveying the progress made in the P versus NP problem in Communications of the Association for Computing Machinery.
Work
In his many publications, Fortnow has contributed important results to the field of computational complexity. While still a graduate student at MIT, Fortnow showed that there are no perfect zero-knowledge protocols for NP-complete languages unless the polynomial hierarchy collapses. With Michael Sipser, he also demonstrated that relative to a specific oracle there exists a language in co-NP that does not have an interactive protocol.
In November 1989, Fortnow received an email from Noam Nisan showing that co-NP had multiple prover interactive proofs (MIP). With Carsten Lund and Howard Karloff, he used this result to develop an algebraic technique for the construction of interactive proof systems and prove that every language in the polynomial-time hierarchy has an interactive proof system. Their work was hardly two weeks old when Adi Shamir employed it to prove that IP=PSPACE. Quickly following up on this (January 17, 1990, less than two months after receiving Nisan's email) Fortnow, along with László Babai and Carsten Lund, proved that MIP=NEXP. These algebraic techniques were expanded further by Fortnow, Babai, Leonid Levin and Mario Szegedy when they presented a new generic mechanism for checking computations.
Fortnow has continued to publish on a variety of topics in the field of computational complexity including derandomization, sparse languages, and oracle machines. Fortnow has also published on quantum computing, game theory, genome sequencing and economics.
Fortnow's work in economics includes work in game theory, optimal strategies and prediction. With Duke Whang, he has examined the classic game theory problem of the prisoner's dilemma, extending the problem so that the dilemma is posed sequentially an infinite numbe |
https://en.wikipedia.org/wiki/VTech%20PreComputer%202000 | The VTech PreComputer 2000 (also known as the Genius Leader 2000/2000 Plus) is an electronic learning aid manufactured by VTech and released in 1992. It contains a dot matrix LCD, standard size keyboard, 34 activities for teaching in 4 different levels for 1 or 2 players and introductory computer programming with the BASIC programming language. It has an 80,000 word spell checker and a SAT word builder. It can be powered by a battery or AC adapter. It is the successor to the VTech PreComputer 1000 model.
Specifications
The VTech PreComputer 2000 relies upon a Z80B clone as its processing core.
A 1MBit (128Kbyte) ROM contains the Operating system and program data which can be expanded via the cartridge slot.
Output is supplied by a 2 row 20 column dot-matrix LCD panel.
This machine features a rudimentary implementation of BASIC offering truth tables, arrays, input statements and variables, allowing users to create simple text programs. One program may be held in memory at a time.
Features
The VTech PreComputer 2000 offers the following features:
12 educational word activities
4 mathematics activities
4 word-based games
1,000 trivia questions in 4 categories
1,000 word vocabulary available for activities
80,000 word spell checker
BASIC (stylized as PC2000 BASIC)
Calculator
Cartridge slot backward compatibility with the VTech PreComputer 1000
Expansion cartridges
Cartridges for the VTech PreComputer 1000 could be used but the following cartridges were available for the VTech PreComputer 2000: The cartridges could only be inserted with the power off before re-powering and pressing the 'Cartridge' button to activate.
Super Memory Expander (Stock Code: 80-1531) - 32Kbyte memory upgrade for BASIC programs
Famous places and things (Stock Code: 801533) - Marketed for both PreComputer 1000 and 2000
References
External links
20th Century Retro Games entry (Gallery page for VTech models 1000, 1000 jr, 2000, ProScreen and Variety)
PreComputer 2000 |
https://en.wikipedia.org/wiki/Rhaetian%20Railway%20G%204/5 | The Rhaetian Railway G 4/5 was a class of metre gauge 2-8-0 steam locomotives operated by the Rhaetian Railway (RhB), which is the main railway network in the Canton of Graubünden, Switzerland.
The class was named G 4/5 under the Swiss locomotive and railcar classification system. According to that system, G 4/5 denotes a narrow gauge steam locomotive with a total of five axles, four of which are drive axles.
The Rhaetian Railway procured a total of 29 examples of the G 4/5 class between 1904 and 1915. Built as tender locomotives by the Swiss Locomotive and Machine Works (SLM) in Winterthur, the G 4/5s were used mainly on the Albula Railway until that line was electrified in 1919. Two preserved examples of the class are still in service on the Rhaetian Railway network today.
History
As early as 1902, the SLM manufactured two four-coupled saturated steam locomotives for the Imperial Railway Company of Ethiopia. In the same year, trial runs using one of these locomotives were carried out on the Rhaetian Railway. The positive results of these tests led the Board of the Rhaetian Railway to order four largely identical machines, at a price of 61,500 Swiss Francs per unit. These G 4/5 class locomotives arrived in Graubünden between June and August 1904, and were given the operating numbers 101 to 104.
The performance specifications for the G 4/5s stipulated that they be able to haul a trailing load of at a speed of on a gradient of 3.5%, while on level sections a speed of should be reached. Trial runs showed, however, that the machines were powerful enough to move the required load at as fast as on gradients, while on level sections a top speed of could be achieved.
The continuing rise in traffic on the Rhaetian Railway soon required more powerful locomotives. The company therefore decided in 1906 to purchase four further G 4/5s of higher performance than the initial batch. Train loads of were now required to be hauled up gradients of 3.5% at a top speed of . While the new G 4/5s nos 105 and 106 were manufactured in the traditional saturated steam configuration, nos 107 and 108 used superheated steam for the first time on the Rhaetian Railway. The performance of the two new sub-types was similar. With each producing nearly , they were regarded as the world's most powerful narrow gauge locomotives.
As the superheated configuration for the class was now proven, all subsequently ordered G 4/5s were equipped with superheaters. To 1915, a total of 21 further locomotives, in five separate orders, were so obtained. The last locomotive, no 129, also received a preheater. With a total of 29 examples, the G 4/5 also eventually became the largest single class of locomotives on the Rhaetian Railway to this day.
In the meantime, coal shortages during World War I had called into question the further use of steam locomotives. The Rhaetian Railway had therefore decided to electrify all of its lines on the model of the Engadine Railway, ope |
https://en.wikipedia.org/wiki/SuperPascal | SuperPascal is an imperative, concurrent computing programming language developed by Per Brinch Hansen. It was designed as a publication language: a thinking tool to enable the clear and concise expression of concepts in parallel programming. This is in contrast with implementation languages which are often complicated with machine details and historical conventions. It was created to address the need at the time for a parallel publication language. Arguably, few languages today are expressive and concise enough to be used as thinking tools.
History and development
SuperPascal is based on Niklaus Wirth's sequential language Pascal, extending it with features for safe and efficient concurrency. Pascal itself was used heavily as a publication language in the 1970s. It was used to teach structured programming practices and featured in text books, for example, on compilers and programming languages. Hansen had earlier developed the language Concurrent Pascal, one of the earliest concurrent languages for the design of operating systems and real-time control systems.
The requirements of SuperPascal were based on the experience gained by Hansen over three years in developing a set of model parallel programs, which implemented methods for common problems in computer science. This experimentation allowed him to make the following conclusions about the future of scientific parallel computing:
Future parallel computers will be general-purpose, allowing programmers to think in terms of problem-oriented process configurations. This was based on his experience programming networks of transputers, which were general-purpose processors able to be connected in arrays, trees or hypercubes.
Regular problems in computational science require only deterministic parallelism, that is, expecting communication from a particular channel, rather than from several.
Parallel scientific algorithms can be developed in an elegant publication language and tested on a sequential computer. When it is established an algorithm works, it can easily be implemented in a parallel implementation language.
These then led to the following requirements for a parallel publication language:
The language should extend a widely used standard language with deterministic parallelism and message communication. The extensions should be in the spirit of the standard language.
The language should make it possible to program arbitrary configurations of parallel processes connected by communication channels. These configurations may be defined iteratively or recursively and created dynamically.
The language should enable a single-pass compiler to check that parallel processes do not interfere in a time-dependent manner.
Features
The key ideas in the design of SuperPascal was to provide a secure programming, with abstract concepts for parallelism.
Security
SuperPascal is secure in that it should enable its compiler and runtime system to detect as many cases as possible in which the langua |
https://en.wikipedia.org/wiki/The%20Human%20Use%20of%20Human%20Beings | The Human Use of Human Beings is a book by Norbert Wiener, the founding thinker of cybernetics theory and an influential advocate of automation; it was first published in 1950 and revised in 1954. The text argues for the benefits of automation to society; it analyzes the meaning of productive communication and discusses ways for humans and machines to cooperate, with the potential to amplify human power and release people from the repetitive drudgery of manual labor, in favor of more creative pursuits in knowledge work and the arts. The risk that such changes might harm society (through dehumanization or subordination of our species) is explored, and suggestions are offered on how to avoid such risk.
What is cybernetics?
The word cybernetics refers to the theory of message transmission among people and machines. The thesis of the book is that:
society can only be understood through a study of the messages and the communication facilities which belong to it; and that in the future development of these messages and communication facilities, messages between man and machines, between machines and man, and between machine and machine, are destined to play an ever-increasing part. (p. 16)
Communication methods have entered a new realm, involving new technologies. Whether a transmission is between people, or between people and machines, the process is similar in that information is sent by one party and received by another, which can send a response. This is a type of feedback. People, animals, and plants all have the ability to take certain actions in response to their environments; in the same way, machines have feedback systems in order for their performances to be altered or evaluated in accordance with results. In the context of human/machine society, Wiener offers a definition of the message as:
"a sequence of events in time which, though in itself has a certain contingency, strives to hold back nature's tendency toward disorder by adjusting its parts to various purposive ends" (p. 27).
Entropy and negentropy
The physical world has a "tendency toward disorder." Entropy (although a broad concept used in somewhat different ways across disciplines) roughly describes the way that isolated systems naturally become less and less organized with the passage of time; popularly understood as meaning a gradual decline into a state of chaos, the concept more accurately refers to the diffusion of energy toward a state of equilibrium, following the second law of thermodynamics.
Wiener believed that communication of information is essentially negentropic – it resists entropy – because it relies on organizational structures. There are two kinds of possible disorganizational forces, passive and active:"Nature offers resistance to decoding, but it does not show ingenuity in finding new and undecipherable methods for jamming our communication with the outer world" (pp. 35–36).Nature's passive resistance is in contrast to active resistance, like that of a |
https://en.wikipedia.org/wiki/Data%20integrator | Data Integrator can refer to software used to integrate data, or to a person or company who integrates data:
Pervasive Data Integrator, software
SAP BusinessObjects Data Integrator, software
Oracle Data Integrator, software
EDI, EZMID Data Integrator, software
Systems integrator, person or company
See also
Data integration
Enterprise application integration
Comparison of business integration software |
https://en.wikipedia.org/wiki/Hugh%20Ward | Hugh Ward may refer to:
Aodh Buidhe Mac an Bhaird or Hugh Ward (c. 1593–1635), Irish Franciscan friar, poet, historian and hagiographer
Hugh Jeffery Ward, American criminal who stole computer software
Hugh Ward (bacteriologist) (1887–1972), Australian bacteriologist and Olympic rower
Hugh J. Ward (1871–1941), American-born stage actor in Australia
H. J. Ward (Hugh Joseph Ward, 1909–1945), American illustrator
Hugh Ward (footballer) (born 1970), Scottish footballer |
https://en.wikipedia.org/wiki/Typename | "typename" is a keyword in the C++ programming language used when writing templates. It is used for specifying that a dependent name in a template definition or declaration is a type. In the original C++ compilers before the first ISO standard was completed, the typename keyword was not part of the C++ language and Bjarne Stroustrup used the class keyword for template arguments instead. While typename is now the preferred keyword, older source code may still use the class keyword instead (for example see the difference in source code examples between The Design and Evolution of C++ by Bjarne Stroustrup published in 1994 and the source code examples in The C++ Programming Language: Fourth Edition by Bjarne Stroustrup published in 2013).
A synonym for "class" in template parameters
In C++'s generic programming feature known as "templates", typename can be used for introducing a template parameter:
// Define a generic function that returns the greater of its two arguments
template <typename T>
const T& max(const T& x, const T& y)
{
if (y < x)
return x;
return y;
}
An alternative and semantically equivalent keyword in this scenario is "class":
// Define a generic function that returns the greater of its two arguments
template <class T>
const T& max(const T& x, const T& y)
{
if (y < x)
return x;
return y;
}
A method for indicating that a dependent name is a type
Consider this invalid code:
template <typename T>
void foo(const T& t)
{
// declares a pointer to an object of type T::bar
T::bar * p; // error (see text)
}
struct StructWithBarAsType
{
typedef int bar;
};
int main()
{
StructWithBarAsType x;
foo(x);
}
This code looks like it should compile, but it is incorrect because the compiler does not know if T::bar is a type or a value. The reason it doesn't know is that T::bar is a "template-parameter dependent name", or "dependent name" for short, which then could represent anything named "bar" inside a type passed to foo(), which could include typedefs, enums, variables, etc.
To resolve this ambiguity, the C++ Language Standard declares:
A name used in a template declaration or definition and that is dependent on a template-parameter is assumed not to name a type unless the applicable name lookup finds a type name or the name is qualified by the keyword typename. In short, if the compiler can't tell if a dependent name is a value or a type, then it will assume that it is a value.
In our example, where T::bar is the dependent name, that means that rather than declaring a pointer to T::bar named p, the line
T::bar * p;
will instead multiply the "value" T::bar by p (which is nowhere to be found) and throw away the result. The fact that in StructWithBarAsType the dependent bar is in fact a type does not help since foo() could be compiled long before StructWithBarAsType is seen. Furthermore, if there is also a class like:
struct StructWithBarAsValue
{
int bar;
};
then the compiler would be obliged to |
https://en.wikipedia.org/wiki/Normalized%20loop | In computer science, a normalized loop (sometimes called well-behaved loop), is a loop in which the loop variable starts at 0 (or any constant) and gets incremented by one at every iteration until the exit condition is met. Normalized loops are very important for compiler theory, loop dependence analysis as they simplify the data dependence analysis.
Well-behaved loops
A well behaved loop is normally of the form:
for ( i = 0; i < MAX; i++ )
a[i] = b[i] + 5;
Because the increment is unitary and constant, it's very easy to see that, if both a and b are bigger than MAX, this loop will never access memory outside the allocated range.
Non-normalized loops
A non-normalized loop may begin at different indexes, increment by not-unitary amounts and have exit conditions complicated to define. Such loops are hard to optimize, vectorize and even traverse, especially if functions are executed on any part of the loop conditions.
A simple example, where it doesn't start at the beginning and increments by more than one:
// Example 1
for ( i = 7; i < MAX; i+=3 )
a[i] = b[i] + 5;
A more complicated example, with an additional exit condition:
// Example 2
for ( i = 7; i < MAX || i > MIN; i+=3 )
a[i] = b[i] + 5;
Loops can also have non-predictable behavior during compilation time, where the exit condition depends on the contents of the data being modified:
// Example 3
for ( i = 7; i < MAX && a[i]; i+=3 )
a[i] = b[i] + 5;
Or even dynamic calculations by means of function calls:
// Example 4
for ( i = start(); i < max(); i+=increment() )
a[i] = b[i] + 5;
Reverse loops are also very simple, and can be easily normalized:
// Example 5
for ( i = MAX; i > 0; i-- )
a[i] = b[i] + 5;
Converting to a normalized loop
If the non-normalized doesn't have dynamic behaviour, it's normally very easy to transform it to a normalized one. For instance, the first example (Example 1) above can easily be converted to:
// Example 1 -> normalized
for ( i = 0; i < (MAX-7)/3; i++ )
a[i*3+7] = b[i*3+7] + 5;
While the third example can be partially normalized to allow some parallelization, but still lack the ability to know the loop span (how many iterations there will be), making it harder to vectorize by using multi-media hardware.
Starting at 7 is not so much of a problem, as long as the increment is regular, preferably one. When multiple statements inside the loop use the index, some private temporary variables may be created to cope with the different iteration paces.
The reverse loop (Example 5) is also easy to normalize:
// Example 5 -> normalized
for ( i = 0; i < MAX; i++ )
a[MAX-i] = b[MAX-i] + 5;
Note that the access is still backwards. In this case, it makes no sense to leave it backwards (as there is no data dependence), but where dependences exist, caution must be taken to revert the access as well, as it could disrupt the order of assignments.
Impossible conversions
The Example 4 above makes it impossible to predict anything from that loop |
https://en.wikipedia.org/wiki/Certified%20broadcast%20networking%20technologist | Certified Broadcast Networking Technologist (CBNT) is a title granted to an individual that passes the exam requirements of the certification. The certification is regulated by the Society of Broadcast Engineers (SBE) and shows competence in computer network equipment and their specialized applications. The CBNT title is protected by copyright laws. Individuals who use the title without consent from the Society of Broadcast Engineers could face legal action.
The SBE certifications were created to recognize individuals who practice in career fields which are not regulated by state licensing or Professional Engineering programs.
External links
Certified Broadcast Networking Technologist (CBNT) Requirements & Application
SBE Official Website
See also
List of post-nominal letters
Broadcast engineering
Professional titles and certifications |
https://en.wikipedia.org/wiki/GeneReviews | GeneReviews is an online database containing standardized peer-reviewed articles that describe specific heritable diseases. It was established in 1997 as GeneClinics by Roberta A Pagon (University of Washington) with funding from the National Institutes of Health. Its focus is primarily on single-gene disorders, providing current disorder-specific information on diagnosis, management, and genetic counseling. Links to disease-specific and/or general consumer resources are included in each article when available. The database is published on the National Center for Biotechnology Information Bookshelf site. Articles are updated every four to five years or as needed, and revised whenever significant changes in clinically relevant information occur. Articles are searchable by author, title, gene, and name of disease or protein, and are available free of charge.
References
External links
Medical databases |
https://en.wikipedia.org/wiki/Fujitsu%20Computer%20Products%20of%20America | Fujitsu Computer Products of America, Inc. is a subsidiary of Fujitsu Limited, the world's third largest IT products and services provider. FCPA designs, develops, and manufactures innovative computer products for the global marketplace. Current product and service offerings include high-performance hard disk drives, scanners and scanner maintenance, palm vein recognition technology, and 10Gb Ethernet switches and degaussers. FCPA is headquartered in Sunnyvale, California, United States. The company is responsible for design and development, distribution, sales and marketing, finance and administration, and engineering and technical support for the Fujitsu document imaging scanner business and computing and storage products.
The company claims to have a "55 percent market share in the U.S. of the 20-to-49-pages-per-minute, high-performance scanner market."
List of FCPA product groups
ScanSnap scanners
Workgroup scanners
Departmental scanners
Production scanners
Network scanners
Enterprise Hard Drives
Enterprise Networking
Advanced Security Devices
Fujitsu sold its Enterprise Hard Disk Drive business to Toshiba as of October 1st, 2009.
References
External links
Companies based in Sunnyvale, California
Image scanners
Computer hardware companies |
https://en.wikipedia.org/wiki/Doubly%20logarithmic%20tree | In computer science, a doubly logarithmic tree is a tree where each internal node of height 1, the tree layer above the leaves, has two children, and each internal node of height has children. Each child of the root contains leaves. The number of children at a node from each leaf to root is 0,2,2,4,16, 256, 65536, ...
A similar tree called a k-merger is used in Prokop et al.'s cache oblivious Funnelsort to merge elements.
References
Further reading
M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), p. 285-297. 1999. Extended abstract at IEEE, at Citeseer.
Demaine, Erik. Review of the Cache-Oblivious Sorting. Notes for MIT Computer Science 6.897: Advanced Data Structures.
Trees (data structures) |
https://en.wikipedia.org/wiki/David%20Mount | David Mount is a professor at the University of Maryland, College Park department of computer science whose research is in computational geometry.
Biography
Mount received a B.S. in Computer Science at Purdue University in 1977 and received his Ph.D. in Computer Science at Purdue University in 1983 under the advisement of Christoph Hoffmann.
He began teaching at the University of Maryland in 1984 and is Professor in the department of Computer Science there.
As a teacher, he has won the University of Maryland, College of Computer Mathematical and Physical Sciences Dean's Award for Excellence in Teaching in 2005 and 1997 as well as other teaching awards including the Hong Kong Science and Technology, School of Engineering Award for Teaching Excellence Appreciation in 2001.
Research
Mounts's main area of research is computational geometry, which is the branch of algorithms devoted to solving problems of a geometric nature. This field includes problems from classic geometry, like the closest pair of points problem, as well as more recent applied problems, such as computer representation and modeling of curves and surfaces. In particular, Mount has worked on the k-means clustering problem, nearest neighbor search, and point location problem.
Mount has worked on developing practical algorithms for k-means clustering, a problem known to be NP-hard. The most common algorithm used is Lloyd's algorithm, which is heuristic in nature but performs well in practice. He and others later showed how k-d trees could be used to speed up Lloyd's algorithm. They have implemented this algorithm, along with some additional improvements, in the software library Kmeans.
Mount has worked on the nearest neighbor and approximate nearest neighbor search problems. By allowing the algorithm to return an approximate solution to the nearest neighbor query, a significant speedup in space and time complexity can be obtained. One class of approximate algorithms takes as input the error distance, , and forms a data structure that can be stored efficiently (low space complexity) and that returns the -approximate nearest neighbor quickly (low time complexity). In co-authored work with Arya, Netanyahu, R. Silverman and A. Wu, Mount showed that the approximate nearest neighbor problem could be solved efficiently in spaces of low dimension. The data structure described in that paper formed the basis of the ANN open-source library for approximate nearest neighbor searching. In subsequent work, he investigated the computational complexity of approximate nearest neighbor searching. Together with co-authors Arya and Malamatos, he provided efficient space–time tradeoffs for approximate nearest neighbor searching, based on a data structure called the AVD (or approximate Voronoi diagram).
Mount has also worked on point location, which involves preprocessing a planar polygonal subdivision S of size to determine the cell of a subdivision that a query point is in. The paper give |
https://en.wikipedia.org/wiki/Sailor%27s%20Island | Sailor's Island is a settlement in Newfoundland and Labrador. At its peak in 1921 the population was 93, and is now essentially depopulated, no longer being included in regional census data. Some of the last inhabitants floated their homes down harbour to Dark Cove (part of Eastport), where one or two can still be seen.
According to the Government of Canada's Natural Resources of Canada Website it is located in Bonavista Bay.
Populated places in Newfoundland and Labrador |
https://en.wikipedia.org/wiki/Neal%20Caffrey | Neal George Caffrey (born Neal George Bennett) is the main character of the USA Network original series White Collar. Neal is a criminal consultant for the White Collar Crime Division of the FBI in New York City. He is a world-class forger and conman, with a fondness for art, fine wine, Sy Devore suits, fedoras, and beautiful women. Neal speaks eight languages, including conversational Swahili, and has 27 known aliases.
Caffrey was suspected of hundreds of thefts before FBI Agent Peter Burke apprehended him. Neal received a four-year sentence for bond forgery. After escaping from prison — and getting caught once again by Agent Burke when he is found in his ex-girlfriend Kate's apartment with an empty bottle of wine — Neal struck a bargain in exchange for his release from prison after he identifies counterfeiting materials from Peter Burke's suit. Neal helps the FBI catch the most cunning white-collar criminals in the country. Now, Neal must walk the line between his new job as a top FBI consultant, and his old life as a white-collar criminal.
Matt Bomer portrays Neal Caffrey on White Collar. Bomer describes the character as having "the veneer of the charming, hyper-intelligent, eloquent, sly mastermind, but underneath, he was really a kind of die hard romantic who would go to any lengths to find the love of his life."
Personality
Neal is presented as a charming, sophisticated gentleman with a wide range of knowledge, from art to foreign languages, most of which seems to be self-taught; he reveals early in Season 2 that he did not graduate high school. He is described as a romantic, which is shown when he breaks out of prison to track down Kate Moreau, his girlfriend and true love, after she breaks up with him. Neal is also highly secretive, and does not trust anyone completely. In the Season 1 episode "Threads", he tells Mozzie that he lied to both Mozzie and Kate about the location of his stash of stolen goods, telling Mozzie it was in Portland and Kate in San Diego, in order to test their loyalty to him. Neal rarely makes himself vulnerable, hiding behind a facade of indifference or cheerfulness when he is upset, even after a major personal tragedy in the Season 1 finale. He does not enjoy talking about his past, preferring the mystery.
Neal is a people person. His confidence makes it easy for him to con people (particularly women), and he frequently draws attention to himself wherever he goes. Jeff Eastin says of casting Neal: "I wanted a guy who walked into a room and every head turned. Because this guy is elegant, and he’s sophisticated, and he’s smart and he loves the attention."
History
Early life and background
Born Neal George Bennett (Compromising Positions | Season 4: episode 7), Neal grew up in United States Federal Witness Protection Program under the name Danny Brooks in St. Louis, Missouri. His mother told him that his father, James Bennett, a police detective in the Washington, D.C. Metro Police Department, died when he w |
https://en.wikipedia.org/wiki/FiberHome | FiberHome Telecommunication Technologies Co., Ltd. () is a major networking and telecommunication equipment provider in the People's Republic of China. Its headquarters is in Hongshan District, Wuhan, Hubei province, China. Founded in 1999, Fiberhome Networks was one of the 8 affiliated companies and highly specializing on IP networks under the management of Fiberhome Company.
In May 2020, the U.S. Commerce Department's Bureau of Industry and Security said it was adding Fiberhome to its Entity List of organizations subject to Export Administration Regulations governing exports and other transactions. The Commerce Department said Fiberhome was “complicit” in alleged human rights abuses involving Muslim minority groups in the Xinjiang Uighur Autonomous Region (XUAR) in northwest China. U.S. companies will have to obtain special, hard-to-get licenses to do business with Fiberhome.
References
External links
Manufacturing companies based in Wuhan
Networking hardware companies
Telecommunications equipment vendors
Telecommunication equipment companies of China
Telecommunications companies established in 1999
Chinese brands
Chinese companies established in 1999
Companies listed on the Shanghai Stock Exchange |
https://en.wikipedia.org/wiki/Fcron | fcron is a computer program with a GNU General Public License (GNU GPL) license that performs periodic command scheduling. It has been developed on Linux and should work on POSIX systems. As with Anacron, it does not assume that the system is running continuously, and can run in systems that do not run all the time or regularly. It aims to replace Vixie-cron and Anacron with a single integrated program, providing many features missing from the original Cron daemon.
Some of the supported options permit:
run jobs one by one
set the max system load average value under which the job should be run
set a nice value for a job
run jobs at fcron's startup if they should have been run during system down time
mail user to tell them a job has not run and why
run fcron by scripts
run several instances of fcron simultaneously
have fcron exit after it has run the pending jobs
See also
Cron
List of Unix commands
References
External links
Unix process- and task-management-related software |
https://en.wikipedia.org/wiki/Pertemps | Pertemps may refer to:
Pertemps Final, a horse race in the United Kingdom
Birmingham & Solihull R.F.C., formerly the Pertemps Bees
Swinton Handicap Hurdle, also known as Pertemps Network Handicap Hurdle, a horse race in the United Kingdom |
https://en.wikipedia.org/wiki/Wrapped%20distribution | In probability theory and directional statistics, a wrapped probability distribution is a continuous probability distribution that describes data points that lie on a unit n-sphere. In one dimension, a wrapped distribution consists of points on the unit circle. If is a random variate in the interval with probability density function (PDF) , then is a circular variable distributed according to the wrapped distribution and is an angular variable in the interval distributed according to the wrapped distribution .
Any probability density function on the line can be "wrapped" around the circumference of a circle of unit radius. That is, the PDF of the wrapped variable
in some interval of length
is
which is a periodic sum of period . The preferred interval is generally for which .
Theory
In most situations, a process involving circular statistics produces angles () which lie in the interval , and are described by an "unwrapped" probability density function . However, a measurement will yield an angle which lies in some interval of length (for example, 0 to ). In other words, a measurement cannot tell whether the true angle or a wrapped angle , where is some unknown integer, has been measured.
If we wish to calculate the expected value of some function of the measured angle it will be:
.
We can express the integral as a sum of integrals over periods of :
.
Changing the variable of integration to and exchanging the order of integration and summation, we have
where is the PDF of the wrapped distribution and is another unknown integer . The unknown integer introduces an ambiguity into the expected value of , similar to the problem of calculating angular mean. This can be resolved by introducing the parameter , since has an unambiguous relationship to the true angle :
.
Calculating the expected value of a function of will yield unambiguous answers:
.
For this reason, the parameter is preferred over measured angles in circular statistical analysis. This suggests that the wrapped distribution function may itself be expressed as a function of such that:
where is defined such that . This concept can be extended to the multivariate context by an extension of the simple sum to a number of sums that cover all dimensions in the feature space:
where is the th Euclidean basis vector.
Expression in terms of characteristic functions
A fundamental wrapped distribution is the Dirac comb, which is a wrapped Dirac delta function:
.
Using the delta function, a general wrapped distribution can be written
.
Exchanging the order of summation and integration, any wrapped distribution can be written as the convolution of the unwrapped distribution and a Dirac comb:
.
The Dirac comb may also be expressed as a sum of exponentials, so we may write:
.
Again exchanging the order of summation and integration:
.
Using the definition of , the characteristic function of yields a Laurent series about zero for the wrapped distributi |
https://en.wikipedia.org/wiki/Belgian%20railway%20signalling | Belgian railway signalling is the signalling in effect on the Belgian rail network currently operated by Infrabel.
Preamble
There are in Belgium two types of train movement:
'major movement' (e.g. mainline operation) that occurs during normal operation (traffic moves at the speed permitted by the signalling and regulations);
'minor movement' (e.g. shunting) which is done by driving by sight and never faster than .
The change from one movement to the other is done by signals (main stop signals) or a written order.
The first movement (which is always executed as minor movement) happens in the following situations:
a driver taking over a new train;
a change in driver's cab or direction of travel;
receipt, change or removal of train number;
vehicles that can drive on themselves are coupled or uncoupled
when permission is needed to continue to drive after an incident
when beginning to shunt
Within major movement, there are two regimes, linked to bi-directional operation on double track lines:
normal track regime: the signals are located on the left of the track. However, in some cases, the configuration of the environment precludes placing signs on the left track. They are then placed on the right and have an arrow (white arrow on a blue disc).
counter-flow track regime: the signals are located on the right of the track and the aspects are blinking.
The most common way of regime change is by the display of a chevron (V-shaped) sign on a main stop sign (single or combined).
In minor movement, all signals are to be obeyed, both those of the left hand track and the right hand; signals controlling only minor movements are placed on the left. In counter-flow operation, some signals (light or otherwise) are specifically dedicated to minor movements and therefore are ignored by the trains travelling in major movement.
Light signals
The lights are designed and arranged to be visible from a distance (up to two kilometers on a clear day). For this they are equipped with lenses to focus light rays emitted by the bulb, which can be selected and reasonable power. That is why the lights do not seem very intense when viewed from the side while they light up sharply in normal line of vision i.e. in the direction of arrival of the train.
Note that the yellow lights often are orange in reality.
Plain stop signal
The red aspect requires a halt for both major and minor movements. It can be opened for major movement (green when the track gives access to a mainline, or double yellow in stations) or minor movement (red + white). It gives no information about the aspect of the next signal.
A white number below the main aspect restricts the speed (from the first switch or track junction after the signal).
Above the main aspect, the signal can show a chevron (to change the regime), or a "U" (when the train is led towards a dead end).
It can be mounted on a mast or gantry (above the track).
Warning signal
Warns of the aspect of a following main st |
https://en.wikipedia.org/wiki/List%20of%20wealthiest%20Americans%20by%20net%20worth | This is a list of the wealthiest Americans ranked by net worth. It is based on an annual assessment of wealth and assets by Forbes and by data from the Bloomberg Billionaires Index.
The Forbes 400 Richest Americans list has been published annually since 1982. The combined net worth of the 2020 class of the 400 richest Americans was $3.2 trillion, up from $2.7 trillion in 2017. As of October 2020, there were 614 billionaires in the United States.
Top 25 richest Americans
According to Forbes, as of April 2023, the 25 wealthiest people in the United States are as follows:
See also
The World's Billionaires
List of countries by the number of billionaires
References
External links
Bloomberg Billionaires Index
Forbes 400 - The Richest People in America - 2018 list
400 (2018)
Lists of 21st-century people
Net worth
Economy of the United States-related lists |
https://en.wikipedia.org/wiki/Fortress%20of%20the%20Mutant%20Waffles | Fortress of the Mutant Waffles is a game written for the TRS-80 Color Computer by Andrew Pakerski and published in 1983 by T+D Software. The goal is to collect 9 missing bottles of syrup and return them to the beginning in as little time as possible while avoiding mutant waffles. The green and black title screen plays a series of rapid beeps of various pitches, giving the illusion of bubbling syrup.
References
1983 video games
Maze games
TRS-80 Color Computer games
TRS-80 Color Computer-only games
Video games developed in the United States |
https://en.wikipedia.org/wiki/PeoplesTel | Peoples Telecommunication & Information Services Ltd., doing business as (PeoplesTel) (), is a Bangladeshi fixed line operator. It is a private public switched telephone network (PSTN) operator, ISP and Hosted Call Centre Service Provider in Bangladesh.
History
Peoples Telecommunication and Information Services Ltd. (PeoplesTel) () is the successor company of Bangladesh Rural Telecom Authority (BRTA) Pvt Ltd. Established in 1989 BRTA started its operation to provide digital communication in 203 rural Thanas (smallest administrative area of Bangladesh) throughout North, North-East and North-West region of the country. The agreement was done between the Bangladesh Government, represented by Bangladesh Telegraph & Telephone Board (BTTB), the Government owned telephone company. Later in 1993 this agreement was revised and BRTA was provided with the license to operate in 199 Thanas. By being the first private telecom operator in Bangladesh, BRTA paved the way for telecom privatisation in Bangladesh.
Newly formed BTRC divided the country into five operating zones for PSTN operators (North-West, North-East, South-West, South-East and Central). In 2003 BRTC decided to provide licenses for 4 out of the five zones, except Central zone. PeoplesTel obtained their 4 zonal license in 2004 and then on 17 March 2008 obtained the licence to operate in Central zone after BTRC decided to issue Central zone licenses to a number PSTN operators on 25 June 2007.
Chronology
1989: Bangladesh Rural Telecom Authority (BRTA) Rural PSTN license by the Ministry of Posts and Telecommunications of Bangladesh.
1993: License renewed.
15 December 2003: BRTA was bifurcated into two new companies with a mutual agreement among the Directors.
February 2004: PeoplesTel is incorporated and given licenses by BTRC to operate in four out of the five zones.
17 March 2008: PeoplesTel obtained the license to operate in the Central Zone (Dhaka), thus becoming a nationwide PSTN Operator.
Company information
Key persons
Chairman: Mr. T I M Nurun Nabi
Directors: Mr. Shamim Shawkat and Mrs. Shamima Nabi
Subscriber base
As of January 2010, PeoplesTel has over 150 thousand subscribers nationwide.
Numbering scheme
PeoplesTel uses the following numbering scheme for its subscribers:
+880 38 N1N2N3N4N5N6N7N8
where 880 is the International Subscriber Dialling Code for Bangladesh and is needed only in case of dialling from outside.
38 is the access code for PeoplesTel as allocated by the Government of Bangladesh. Omitting +880 will require to use 0 in place of it instead to represent local call, hence 038 is the general access code.
Although 038 has been allocated to PeoplesTel, 0381 is the local code for BTCL in Lakhipur and BTCL is in the process to phase out these numbers.
Services
PeoplesTel provides a various range of services. Along with being a PSTN operator, PeoplesTel is also a nationwide ISP and Hosted Call Centre Service Provider.
PeoplesTel is the first operator |
https://en.wikipedia.org/wiki/Firefly%20algorithm | In mathematical optimization, the firefly algorithm is a metaheuristic proposed by Xin-She Yang and inspired by the flashing behavior of fireflies.
Algorithm
In pseudocode the algorithm can be stated as:
Begin
1) Objective function:
2) Generate an initial population of fireflies
3) Formulate light intensity so that it is associated with
(for example, for maximization problems,
4) Define absorption coefficient
while (t < MaxGeneration)
for i = 1 : n (all n fireflies)
for j = 1 : i (n fireflies)
Vary attractiveness with distance r via
move firefly i towards j;
Evaluate new solutions and update light intensity;
end if
end for j
end for i
Rank fireflies and find the current best;
end while
end
Note that the number of objective function evaluations per loop is one evaluation per firefly, even though the above pseudocode suggests it is n×n. (Based on Yang's MATLAB code.) Thus the total number of objective function evaluations is (number of generations) × (number of fireflies).
The main update formula for any pair of two fireflies and is
where is a parameter controlling the step size, while is a vector drawn from a Gaussian or other
distribution.zae
It can be shown that the limiting case corresponds to the standard Particle Swarm Optimization (PSO). In fact, if the inner loop (for j) is removed and the brightness is replaced by the current global best , then FA essentially becomes the standard PSO.
Criticism
Nature-inspired metaheuristics in general have attracted criticism in the research community for hiding their lack of novelty behind metaphors. The firefly algorithm has been criticized as differing from the well-established particle swarm optimization only in a negligible way.
See also
Swarm intelligence
References
External links
Files of the Matlab programs included in the book: Xin-She Yang, Nature-Inspired Metaheuristic Algorithms, Second Edition, Luniver Press, (2010).
Nature-inspired metaheuristics |
https://en.wikipedia.org/wiki/Networked%20music%20performance | A networked music performance or network musical performance is a real-time interaction over a computer network that enables musicians in different locations to perform as if they were in the same room. These interactions can include performances, rehearsals, improvisation or jamming sessions, and situations for learning such as master classes. Participants may be connected by "high fidelity multichannel audio and video links" as well as MIDI data connections and specialized collaborative software tools. While not intended to be a replacement for traditional live stage performance, networked music performance supports musical interaction when co-presence is not possible and allows for novel forms of music expression. Remote audience members and possibly a conductor may also participate.
History
One of the earliest examples of a networked music performance experiment was the 1951 piece: “Imaginary Landscape No. 4 for Twelve Radios” by composer John Cage. The piece “used radio transistors as a musical instrument. The transistors were interconnected thus influencing each other.”
In the late 1970s, as personal computers were becoming more available and affordable, groups like the League of Automatic Music Composers began to experiment with linking multiple computers, electronic instruments, and analog circuitry to create novel forms of music.
The 1990s saw several important experiments in networked performance. In 1993, The University of Southern California Information Sciences Institute began experimenting with networked music performance over the Internet.The Hub (band), which was formed by original members of The League of Automatic Composers, experimented in 1997 with sending MIDI data over ethernet to distributed locations. However, “ it was more difficult than imagined to debug all of the software problems on each of the different machines with different operating systems and CPU speeds in different cities”. In 1998, there was a three-way audio-only performance between musicians in Warsaw, Helsinki, and Oslo dubbed “Mélange à trois”. The early distributed performances all faced problems such as network delay, issues synchronizing signals, echo, and troubles with the acquisition and rendering of non-immersive audio and video.
The development of high-speed internet over provisioned backbones, such as Internet2, made high quality audio links possible beginning in the early 2000s. One of the first research groups to take advantage of the improved network performance was the SoundWIRE group at Stanford University's CCRMA. That was soon followed by projects such as the Distributed Immersive Performance experiments, SoundJack, and DIAMOUSES.
Awareness in musical performance
Workspace awareness in a face-to-face situation is gathered through consequential communication, feedthrough, and intentional communication. A traditional music performance setting is an example of very tightly-coupled, synergistic collaboration in which participants have a |
https://en.wikipedia.org/wiki/No%20one%20is%20illegal | No one is illegal is a loosely connected international network, which advocates for refugees and migrants present in a country unlawfully. Activists in the network take initiatives in favor of migrants who stay in a country illegally and are at risk of deportation. The network has started a campaign and held rallies to bring wider attention to the situation of refugees. The campaign initially began in Germany as No Person Is Illegal (German: Kein Mensch ist illegal or kmii) and has spread to other countries, including Canada and Belgium.
No one is illegal questions the idea of citizenship as a legal condition for access to and participation in the socio-political sphere.
Germany
History
The first use of the phrase is attributed to Nobel laureate and Holocaust survivor Elie Wiesel in 1988, who used "No Human Being Is Illegal" on a flyer at the "National Campaign for the Civil and Human Rights of Salvadorans".
No Person Is Illegal was founded in 1997 at the "documenta X" art exhibition in Kassel. After a few weeks, thousands of individuals joined as well as the 200 groups and organisations that had joined them in appealing to "help immigrants begin and continue their journeys towards obtaining work and documentation, medical care, education and training, and to assure accommodation and physical survival" regardless of their immigration status. The founding followed the death of deportee Aamir Ageeb at the hands of the German Federal Police. In the wake of Ageeb's death, the "Deportation-Class" campaign set its aims towards airlines that took part in deportations. The campaign culminated in a 2001 online demonstration in conjunction with Libertad. No Person Is Illegal and "Deportation-Class" have drawn the attention of Germany's "Annual Report on the Protection of the Constitution" due to purported connections with "left-wing extremism".
Switzerland
Switzerland Bildung für Alle (Education for All) organization has its own specific task which is attempting to achieve permanent legal stay for immigrants. the organization stated School for all like Autonome Schule (Autonomous School)
Autonomous School Zurich
Autonomous School Zurich is a school for all immigrants.
Canada
A NOII collective of organizations has been established in a number of Canadian cities, including Winnipeg, Vancouver, Toronto, Halifax, Fredericton, Ottawa, Montreal, and London. Activist Harsha Walia is an organizer for the Vancouver chapter, while Yanisa Wu, Kelly Campbell, Sherry Viloria, Evan Macintosh, Jayelyn Rae, Hazim Ismail, and Mitchell van Ineveld organize for the Winnipeg chapter.
References
AutorInnenkollektiv (2000): Ohne Papiere in Europa. Illegalisierung der Migration. Selbstorganisation und Unterstützungsprojekte in Europa.
cross the border (Hg.) (1999): kein mensch ist illegal. Ein Handbuch zu einer Kampagne.
Gerda Heck: ›Illegale Einwanderung‹. Eine umkämpfte Konstruktion in Deutschland und den USA. Edition DISS Band 17. Münster 2008.
External links |
https://en.wikipedia.org/wiki/Semi-membership | In mathematics and theoretical computer science, the semi-membership problem for a set is the problem of deciding which of two possible elements is logically more likely to belong to that set; alternatively, given two elements of which at least one is in the set, to distinguish the member from the non-member.
The semi-membership problem may be significantly easier than the membership problem. For example, consider the set S(x) of finite-length binary strings representing the dyadic rationals less than some fixed real number x. The semi-membership problem for a pair of strings is solved by taking the string representing the smaller dyadic rational, since if exactly one of the strings is an element, it must be the smaller, irrespective of the value of x. However, the language S(x) may not even be a recursive language, since there are uncountably many such x, but only countably many recursive languages.
A function f on ordered pairs (x,y) is a selector for a set S if f(x,y) is equal to either x or y and if f(x,y) is in S whenever at least one of x, y is in S. A set is semi-recursive if it has a recursive selector, and is P-selective or semi-feasible if it is semi-recursive with a polynomial time selector.
Semi-feasible sets have small circuits; they are in the extended low hierarchy; and cannot be NP-complete unless P=NP.
References
Derek Denny-Brown, "Semi-membership algorithms: some recent advances", Technical report, University of Rochester Dept. of Computer Science, 1994
Lane A. Hemaspaandra, Mitsunori Ogihara, "The complexity theory companion", Texts in theoretical computer science, EATCS series, Springer, 2002, , page 294
Lane A. Hemaspaandra, Leen Torenvliet, "Theory of semi-feasible algorithms", Monographs in theoretical computer science, Springer, 2003, , page 1
Ker-I Ko, "Applying techniques of discrete complexity theory to numerical computation" in Ronald V. Book (ed.), "Studies in complexity theory", Research notes in theoretical computer science, Pitman, 1986, , p.40
Computational complexity theory |
https://en.wikipedia.org/wiki/Justified%20%28TV%20series%29 | Justified is an American neo-Western crime drama television series that premiered on March 16, 2010, on the FX network. Developed by Graham Yost, it is based on Elmore Leonard's stories about the character Raylan Givens, particularly "Fire in the Hole". Timothy Olyphant portrays Raylan Givens, a tough deputy U.S. Marshal enforcing his own brand of justice. The series revolves around the inhabitants and culture in the Appalachian mountains area of eastern Kentucky, specifically Harlan County where many of the main characters grew up. It also features Lexington, Kentucky, where the local U.S. Marshals office is situated. The series, comprising 78 episodes, was aired over six seasons and concluded on April 14, 2015.
Justified received critical acclaim throughout most of its run and has been listed by several publications as one of the best shows of the 2010s. Its acting, directing, art direction, and writing were praised, as were the performances of Olyphant and Walton Goggins. Justified was nominated for eight Primetime Emmy Awards, with two wins, for Margo Martindale's performance as Mags Bennett and Jeremy Davies' performance as Dickie Bennett.
In January 2022, FX announced Justified: City Primeval, a limited sequel series with Olyphant reprising his role as Raylan Givens. It premiered on July 18, 2023, and ended on August 29, 2023.
Plot
Deputy U.S. Marshal Raylan Givens is something of a 19th-century-style, Old West lawman living in modern times. His unconventional enforcement of justice makes him a target of criminals and a problem child to his U.S. Marshals Service superior. In response to his controversial but "justified" quick-draw shooting of mob hitman Tommy Bucks in Miami, Givens is reassigned to the Eastern District of Kentucky Marshal's Office, which is based in Lexington. This jurisdiction includes Harlan County, where Raylan was born and raised and which he thought he had escaped for good in his youth.
Season 1
The story arc of season one concentrates on the crimes of the Crowder family. Raylan seeks to protect Ava Crowder (Joelle Carter) from the rest of the Crowder clan after she shoots and kills her husband, Bowman Crowder, in retaliation for years of abuse. Her biggest threat initially comes from Boyd Crowder (Walton Goggins), a local criminal masquerading as a white supremacist whom Raylan shoots in a stand-off. Boyd survives the shot to the chest and claims it is a sign from God that he should change his ways. Raylan hesitates to believe him, but Boyd is soon sent to prison, where he spends his time reading the Bible and preaching to convicts. The season builds towards the release of family patriarch Bo (M. C. Gainey), who wishes to rebuild his family's drug trade and to settle old scores, including one with Raylan's father, Arlo (Raymond J. Barry), who has cheated him out of money. Bo's release is soon followed by Boyd's, after a technicality prevents him from being further incarcerated. While Bo works on gaining dominance |
https://en.wikipedia.org/wiki/Sound%20of%20the%20Sky | is a Japanese anime television series produced by A-1 Pictures and Aniplex and directed by Mamoru Kanbe. The 12-episode anime aired in Japan on the TV Tokyo television network between January 4, 2010 and March 22, 2010. The anime was also simulcast on Crunchyroll. Sound of the Sky was the debut project of Anime no Chikara. A manga adaptation illustrated by Yagi Shinba began serialization in the January 2010 issue of ASCII Media Works' Dengeki Daioh magazine. A visual novel developed by Compile Heart was released on the PlayStation Portable in May 2010.
Plot
Sound of the Sky revolves around a young girl named Kanata Sorami who is inspired to join the military after witnessing a rendition of "Amazing Grace" by a mysterious trumpeter of the Helvetian Army. Becoming a bugler, she is assigned to the 1121st Platoon stationed in the town of Seize (inspired by Cuenca, Spain) in Helvetia (another name for Switzerland), where she is taken into the care of 2nd Lt. Filicia Heideman, M/Sgt. Rio Kazumiya and the rest of the 1121st Platoon. The story takes place in a post-apocalyptic world after a great war regressed humanity's technological capabilities back to early-to-mid 20th century standards.
Characters
Inspired by the song of a mysterious military trumpeter, 15-year-old Kanata joins the army as a bugler and is assigned to the 1121st Platoon. Despite being gifted with absolute pitch, Kanata initially lacks musical prowess, but gradually improves as the story progresses. She is portrayed as optimistic and cheerful, yet dedicated to her duties as a soldier and as a member of the platoon.
Rio is a 17-year-old Master Sergeant who is also a bugler and trumpeter, and the sole instructor of Kanata in learning military calls and signals. Rio is shown to have a no-nonsense attitude and is stricter in her discipline and the issuance of orders as compared to her commanding officer. Later in the story, she is revealed to be the half-sister of the late Princess Iliya, as well as the second heir to the Arkadia family. Due to her strained family history, she joined the 1121st as a means of escape, but later leaves in order to save the peace talks with the Roman Empire and prevent war. She is later promoted to Lieutenant upon rejoining the platoon after the war ends.
The 18-year-old platoon leader of the 1121st with the rank of second lieutenant, Filicia tends to stray away from military convention, preferring to exercise a more casual leadership. Filicia does away with addressing rank with members in the platoon so that everyone is known on a first name basis. Her kindness and gentle nature is well known by the girls as she acts as a type of mother figure to them. Prior to her commission of the 1121st, Filicia was previously assigned to an active combat tank platoon of which she was the only survivor. She is later promoted to captain.
A private and the platoon's designated gunner, Kureha is the youngest of the girls in the 1121st at the age of 14. Kureha has a str |
https://en.wikipedia.org/wiki/Emily%20Howell | Emily Howell is a computer program created by David Cope, Dickerson Emeriti Professor of Music at UC Santa Cruz. Emily Howell is an interactive interface that "hears" feedback from listeners, and builds its own musical compositions from a source database, derived from a previous composing program called Experiments in Musical Intelligence (EMI). Cope attempts to “teach” the program by providing feedback so that it can cultivate its own "personal" style. The software appears to be based on latent semantic analysis.
Emily Howell's first album was released in February 2009 by Centaur Records (CRC 3023). Titled From Darkness, Light, this album contains its Opus 1, Opus 2, and Opus 3 compositions for chamber orchestra and multiple pianos. Its second album Breathless was released in December 2012 by Centaur Records (CRC 3255).
See also
List of music software
Music and artificial intelligence
Computer music
Sonification
References
General references
Computer Models of Musical Creativity, MIT Press (December 16, 2005),
Inline citations
External links
main
Artificial intelligence art
Computer music software
Computer-related introductions in 2009
University of California, Santa Cruz |
https://en.wikipedia.org/wiki/Fred%20Glover | Fred Glover may refer to:
Fred Glover (ice hockey), Canadian NHL player and coach.
Fred W. Glover, computer scientist, inventor of tabu search and of the term "meta-heuristic" |
https://en.wikipedia.org/wiki/Fred%20W.%20Glover | Fred Glover is Chief Scientific Officer of Entanglement, Inc., USA, in charge of algorithmic design and strategic planning for applications of combinatorial optimization in quantum computing. He also holds the title of Distinguished University Professor, Emeritus, at the University of Colorado, Boulder, associated with the College of Engineering and Applied Science and the Leeds School of Business. He is known for his innovations in the area of metaheuristics including the computer-based optimization methodology of Tabu search an adaptive memory programming algorithm for mathematical optimization, and the associated evolutionary Scatter Search and Path Relinking algorithms.
His past and present editorial positions include serving as first Editor-in-Chief and Co-founder of the Journal of Heuristics, Area Editor, INFORMS Journal on Computing, Area Editor, Mathematics of Industrial Systems, Area Editor, Annals of Operations Research, Associate Editor, Management Science, Associate Editor, Operations Research, Honorary Editor, International Journal of Applied Metaheuristic Computing, and Special Issue Editor, European Journal of Operational Research.
He has contributed to the fields of network optimization artificial intelligence discrete optimization, simulation optimization, and quantum-inspired computing, and co-founded the companies Analysis, Research and Computation, Inc. (now within Science Applications International, Inc.), Heuristec, Inc. (now within Tomax, Inc.) and OptTek Systems, Inc[.
Education
Glover received his PhD in operations research in 1965 under Gerald L. Thompson and Herbert A. Simon from Carnegie Mellon University, and served as a Post-doctoral Research Fellow with the Miller Institute at the University of California, Berkeley, in the Industrial Engineering & Operations Research Department headed by George B. Dantzig in 1967. He obtained a Bachelor of Business Administration from the University of Missouri in 1960.
Honors and Awards
Dr. Glover is an elected member of the U.S. National Academy of Engineering and is the recipient of the John von Neumann Theory Prize, the highest honor of the Institute for Operations Research and the Management Sciences. His other awards and honorary fellowships include:
The INFORMS Journal on Computing Test of Time Award (2007, 2022)
Herbert A. Simon Award for Outstanding Contribution in Information Technology and Decision Making, by the International Academy of Information Technology and Quantitative Management (2013)
INFORMS Impact Prize for contributions that have had a broad and enduring impact on the fields of Operations Research and Management Science (2010)
Networks Journal Honor: creation of the Glover-Klingman Prize given annually for best paper to appear in the Networks journal (2003)
Outstanding Achievement Award of the Decision Sciences Institute (1988)
Fellow, Institute of Electrical and Electronics Engineers (IEEE) (2013)
Fellow, Institute of Operations Research and Man |
https://en.wikipedia.org/wiki/Parks%20and%20Recreation%20%28season%201%29 | The first season of Parks and Recreation originally aired in the United States on the NBC television network between April 9 and May 14, 2009. Produced by Deedle-Dee Productions and Universal Media Studios, the series was created by Greg Daniels and Michael Schur, who served as executive producers with Howard Klein. The season stars Amy Poehler, Rashida Jones, Paul Schneider, Aziz Ansari, Nick Offerman, and Aubrey Plaza.
The comedy series focuses on Leslie Knope (Poehler), the deputy director of the Parks and Recreation Department of the fictional town of Pawnee, Indiana. The season consisted of six 22-minute episodes, all of which aired at 8:30 p.m. on Thursdays. Daniels and Schur conceived the show when NBC officials asked Daniels to produce a spin-off of his comedy series The Office, on which Schur was a writer. During development, the creators decided the new show would be a stand-alone series, though it would share the mockumentary style of The Office. Like that show, Parks and Recreation encouraged improvisation among its cast members.
Early test screenings were poor, and many critics and industry observers were skeptical about the show's chances of success. The first season received generally mixed reviews, and several commentators found it too similar to The Office. The premiere episode was watched by 6.77 million viewers, but the viewership declined almost every week in the Nielsen ratings. A season low of 4.25 million viewers watched the final episode, "Rock Show". Despite the low rating, "Rock Show" received the best reviews of the season and convinced some critics that the series had finally found the right tone.
Cast
Main
Amy Poehler as Leslie Knope, the deputy director of the Pawnee parks department, who has not let politics dampen her sense of optimism; her ultimate goal is to become President of the United States. She has a strong love for her home town of Pawnee, and desires to use her position to improve it.
Rashida Jones as Ann Perkins, a nurse who begins a friendship with Leslie after they collaborate to turn an empty pit next to Ann's house into a park. She slowly becomes more involved in the Pawnee government as a result of her friendship with Leslie.
Paul Schneider as Mark Brendanawicz, a city planner with the Pawnee municipal government. He has long been disillusioned with government after being unable to achieve his career ambitions. Leslie harbors a strong crush on Mark due to a romantic encounter they had several years ago, but Mark does not return her feelings. Mark assists Leslie with her plan to turn the pit next to Ann's house into a park, despite believing that the plan has no chance of success.
Aziz Ansari as Tom Haverford, Leslie's self-absorbed and underachieving subordinate. While he is an employee at the parks department, he cares little about his job, and instead focusing on his entrepreneurial ambitions. He takes great pride in his personal appearance and regularly pursues women despite being married |
https://en.wikipedia.org/wiki/12%20Men%20of%20Christmas | 12 Men of Christmas is a 2009 American romantic comedy television film made for the Lifetime Television network. Directed by Arlene Sanford and starring Kristin Chenoweth, the film is based on the novel Dating Mr. December by Phillipa Ashley with the teleplay adaptation written by Jon Maas. Anna Chlumsky, Aaron Abrams, Stephen Huszar, and Peter Mooney also star.
The film had its world premiere on Lifetime on December 5, 2009. The story takes place in Kalispell, Montana, United States, but the film was shot in Calgary, Alberta, Canada. It tells the story of a New York publicist who takes a job in a small town in Montana. The reference to 12 men in the title refers to members of the volunteer Kalispell Search and Rescue team who are the first point of rescue for those in danger at Glacier National Park.
Plot
E.J. Baxter (Kristin Chenoweth) is a headstrong and popular New York City publicist. E.J. seemingly has the "perfect life"; a beautiful condo, a loving fiancé, a great job, and an excellent boss. But E.J.'s world takes a turn for the worse when she catches her fiancé Noah having an affair with her boss Lillah at the office Christmas party, resulting in E.J. breaking Lillah's expensive Gucci pump shoe, and breaking off her engagement with Noah.
Now, having no one to spend Christmas or New Year's with (except her sister's dog), E.J. starts to look for a new job, though with Lillah account black-balling her all over the city, E.J. has no one else to turn to except her boastful sister Roz. Feeling sympathy for her, Roz pushes E.J. to take up a job offer in Kalispell, Montana, to lure corporate retreats for a year.
Upon arriving, E.J. is extremely disappointed to find that her "job" is working at a Chamber of Commerce bureau with no secretaries or office, except her cheerful co-worker Jan Lucas (Anna Chlumsky). After a few days working together, Jan invites E.J. to the town's barbecue where they raise money for equipment for the Kalispell Search & Rescue team. To show respect, E.J. reluctantly goes and meets Dr. Marci Hempel and Eric, members of the search and rescue team. Marci tells E.J. that they raise money by holding various events, triathlons, pancake breakfasts, bake sales, etc. and if they don't raise enough money all of the tourists will go to more popular destinations such as Idaho or Aspen.
The day after the barbecue, E.J drives over to former client Robert Lazaar's chalet to take photos to lure CEOs for corporate retreats. While there, E.J. runs into arrogant Will Abrecht (Josh Hopkins), a member of the rescue squad, swimming in Robert's pool. The two immediately get into an argument. The next day, Jan and E.J. receive leftovers of Kalispell's local calendar which Jan believes is boring because it shows everyday Montana scenery. Remembering a naked Will, E.J. holds a conference with the Search and Rescue team as a new means of funding their equipment. E.J. puts her media know-how to good use by telling them each man can pose half-na |
https://en.wikipedia.org/wiki/Every%20Mother%27s%20Worst%20Fear | Every Mother's Worst Fear is a 1998 American made-for-television thriller film starring Cheryl Ladd, Jordan Ladd and Ted McGinley. This film is a cautionary story of cyberspace, kidnapping and the dangers of chat rooms.
Synopsis
Martha Hoagland is a 16-year-old girl suffering through her parents' recent divorce. Her mother is working long hours. Martha has recently been dumped by her high school boyfriend. Feeling lonely and seeking solace, Martha turns to an online chat room. Martha believes she is chatting with a young man who cares for her, when in reality she is chatting with Scanman, an internet predator involved in a cyber-kidnapping ring. Martha, who has told her online chat friend that she is 21, is lured to join her new "friend". When the investigation starts, he claims he never sent her a ticket. The police, the FBI, and an experienced computer hacker help Martha's mother Connie to rescue her 16-year-old daughter from the "Scanman."
Cast
Cheryl Ladd as Connie Hoagland
Jordan Ladd as Martha Hoagland
Robert Wisden as Jeff Hoagland
Tom Butler as Agent Weatherby
Ted McGinley as Scanman
Blu Mankuma as Detective Maris
Treat Williams as Mitch Carson (uncredited)
Chiara Zanni as Sherry
Vincent Gale as Drew Pederson
Brendan Fehr as Alan
Don Thompson as Martin Penny "Skokie"
External links
1998 television films
1998 films
1998 thriller films
Films about child abduction in the United States
Lifetime (TV network) films
American thriller television films
Films directed by Bill L. Norton
1990s English-language films
1990s American films |
https://en.wikipedia.org/wiki/TPC-W | TPC-W was a web server and database performance benchmark, proposed by Transaction Processing Performance Council.
This benchmark defined the complete Web-based shop for searching, browsing and ordering books. The system under testing needed to provide the implementation of this shop. TPC-W standard describes all pages that must be present in the shop (including sample HTML code), interaction graphs (how the user navigates between the pages), transition tables (that is the probability that the user will move from page A to page B) and database schema. In addition, the standard provided generator to produce synthetic images (book covers) that the system under testing needed to show in the virtual shop. Standard also describes how random strings and random numbers must be generated.
During testing, the server was visited by a growing number of web-bots, each simulating individual customer. The pause between web interactions from the single customer and the number of total pages each customer visits per session are random numbers that must follow asymmetric distribution, specified by the standard. The navigation pattern is defined by three transition tables that differ in accordance with the preferred plans of the user (shopping mix, browsing mix and ordering mix). The main measured parameter was WIPS, the number of web interactions per second that the system is capable to deliver.
It was also possible to visit and actually use the virtual shop with the ordinary browser.
The official TPC-W page in the past included performance comparisons, providing information, how well the virtual shop performs when implemented with various development platforms and running on various web servers and operating systems. This is information that is no longer available from the web site.
While discontinued, TPC-W is still used in universities for teaching, requiring students to implement TPC-W - compliant shop and perform benchmarking .
Other web application benchmarks
RUBBoS
RuBiS
References
- Official page of TPC-W standard
Further reading
Benchmarks (computing) |
https://en.wikipedia.org/wiki/Reksoft | Reksoft is an offshore software engineering company specialising in software development and system integration services, specifically software product engineering, enterprise application services and dedicated centres. Reksoft has passed certification audit ISO 9001:2008, and is assessed to comply with CMMi Level 5. The company is based in St. Petersburg, Russia, and has regional offices in Stockholm, Sweden, and development centres in Moscow and Voronezh, Russia.
In 2008, Technoserv, one of the leading players in the Russian IT market, acquired a 74% stake in Reksoft.
Clients
As of April 2021, Reksoft has served over 1000 companies worldwide, including T-Systems, Cadbury, Fujitsu, Gazprom, Mazda, Philip Morris International, Mavenir Systems, Springer Business+Science Media, Tieto, Lenze, Aastra, Alert Logic, FXDD, Agora Freight and Vimpelcom.
Ranking
In 2009, Reksoft was awarded the rank of Rising Star by the International Association of Outsourcing Professionals. In the same year, Reksoft was listed as one of the top 20 Russian IT service providers.
In 2010, Reksoft was listed in the 2010 Global Services 100 List
In 2011, Reksoft was listed in the 2011 Global Services 100 List».
In 2012, Reksoft was listed in the 2012 Global Services 100 List». This year Reksoft was also awarded the rank of Rising Star by the International Association of Outsourcing Professionals.
In 2020, Reksoft was named one of the Top 100 Western European developers by industry ranking platform Clutch
History
1991: Reksoft is co-founded by Alexander Egorov with two friends from Saint Petersburg State University of Aerospace Instrumentation.
1992: Reksoft wins first international contract, with Swiss telecommunications concern Ascom Infrasys. Reksoft has been developing software for Ascom’s Telecom Solutions and PBX divisions ever since.
1995-1998: Reksoft develops its own branded software products and internet solutions, including Barsum, a call accounting and billing solution, spun off in 2005; , an internet payment gateway, sold to mCommerce, Inc. in 2003; Ozon, Russia's largest internet store, bought out by Baring Vostok Capital Partners investment fund in 2000; and Edelweiss/Medallion, a property management solution, sold to Softbrands, Inc. in 2003.
2000: Reksoft business processes are assessed to comply with ISO 9001:2000 certifications
2001: Reksoft opens in-house training centre where undergraduate students take courses in software development, testing and project management.
2003: Reksoft opens regional sales office in Stockholm, Sweden, and a development centre in Moscow, Russia.
2005: MartinsonTrigon, a Nordic venture capitalist company, has invested 2 million dollars into Reksoft. The investment was used with the purpose to secure the growth strategies of Reksoft.
2006: Reksoft assessed to comply with CMMi Level 4
2007: Reksoft opens regional sales office in Munich, Germany.
2008: Reksoft joins TechnoServ A/S, Russia's largest system integrator, and o |
https://en.wikipedia.org/wiki/Mouse%20Phenome%20Database | The Mouse Phenome Database (MPD) is a web-accessible database of strain characterization data for the laboratory mouse, to facilitate translational research for human health and disease. MPD characterizes phenotype as well as genotype, and provides tools for online analysis. Most phenotype data are in the form of strain surveys (comparisons of 10-40 commonly used mouse strains) and cover such areas as hematology, bone mineral density, cholesterol levels, endocrine function, and aging processes. Genotype data are primarily in the form of single-nucleotide polymorphisms. Data are contributed by participating scientists or downloaded from public resources.
The MPD was begun in 2000, is funded by grants from the National Institutes of Health and other sources, and is headquartered at The Jackson Laboratory.
References
External links
Mouse Phenome Database
Mouse genetics
Online databases
Biological databases |
https://en.wikipedia.org/wiki/Zev%20Brenner | Zev J. Brenner is an Orthodox Jewish radio host and president and founder of Talkline Communications - a Radio/TV network founded in 1981.
Personal life
Brenner graduated from the New York City Technical College of the City University in NY. He married Adena Karen Berkowitz, a lawyer and daughter of William Berkowitz, the national president of the American Jewish Heritage Committee in New York in 1988. He is an ordained Rabbi.
Talk-show
The Talkline talk-show is a regularly scheduled talk-show airing in Metro New York City and has interviewed notable personalities including President Bill Clinton; Secretary of State Hillary Clinton; Senators Joseph Lieberman and Charles Schumer; Israeli Prime Ministers Benjamin Netanyahu, Shimon Peres, Yitzhak Shamir and Yitzhak Rabin; former Vice President Dan Quayle; former Soviet General Secretary Mikhail Gorbachev; Mayor David Dinkins and Al Sharpton.
Brenner is known as one of the only Orthodox Jews in the United States who serves as a talk-show host. He is also known for addressing many important but controversial topics in the Jewish community.
In 2010, the FBI and U.S. Attorney's Office used the show as part of an elaborate sting operation that helped the government convict Malcolm Smith and other New York politicians in a corruption scandal.
See also
Nachum Segal
External links
Talkline's Official Website
References
Living people
American Orthodox Jews
American talk radio hosts
Year of birth missing (living people)
New York City College of Technology alumni |
https://en.wikipedia.org/wiki/Arbitrary%20slice%20ordering | Arbitrary slice ordering (ASO) in digital video, is an algorithm for loss prevention. It is used for restructuring the ordering of the representation of the fundamental regions (macroblocks) in pictures. This type of algorithm avoids the need to wait for a full set of scenes to get all sources. Typically considered as an error/loss robustness feature.
This type of algorithm is included as tool in baseline profile the H.264/MPEG-4 AVC encoder with I Slices, P Slices, Context Adaptative Variable Length Coding (CAVLC), grouping of slices (Slice Group), arbitrary slice order (ASO) and Redundancy slices.
Applications
Primarily for lower-cost applications with limited computing resources, this profile is used widely in videoconferencing, mobile applications and security applications also.
Arbitrary Slice Ordering (ASO) relaxes the constraint that all macroblocks must be sequenced in decoding order, and thus enhances flexibility for low-delay performance important in teleconferencing applications and interactive Internet applications.
Problems
If ASO across pictures is supported in AVC, serious issues arise: slices from different pictures are interleaved. One possible way to solve these issues is to limit ASO within a picture, i.e. slices from different pictures are not interleaved.
However, even if we limit ASO within a picture, the decoder complexity is significantly increased. Because Flexible Macroblock Order FMO extend the concept of slices by allowing non-consecutive macroblocks to belong to the same slice, this section also addresses the decoder complexity introduced by (FMO).
Types of decoding ASO
Association of macroblocks to slice
Impact of ASO on AVC decoders complexity
An example of how macroblocks can be associated to different slices is shown in Figure 1. When ASO is supported, the four slices of this example can be received by the decoder in a random order. Figure 2 shown the following receiving order: slice #4, slice #3, slice #1, and slice #2. The same figure presents the AVC decoder blocks required to support ASO decoding.
Figure 1: An example of macroblock assignment to four slices. Each slice is represented by a different texture.
Figure 2: The AVC decoder blocks need to support ASO decoding.
For each slice, the slice length and the macroblock address (i.e. index with respect to the raster scan order) of the first macroblock (MB) of the slice are extracted by the slice parser (Figure 2). This information, together with the slice itself, is stored in memory (shown as DRAM). In addition, a list of pointers (Figure 2, a pointer for each slice, and each pointing to the memory location where a slice is stored), should be generated. The list of pointers, together with the address of the first macroblock of the slice, will be used to navigate through the out of order slices. The slice length will be used to transfer the slice data from the DRAM to the decoder's internal memory.
Faced with the necessity to decode out of or |
https://en.wikipedia.org/wiki/Emergency%20Digital%20Information%20Service | Emergency Digital Information Service (EDIS) is a wireless datacast based emergency and disaster information service operated by the State of California Governor's Office of Emergency Services. In operation since 1990, the system was upgraded in 1999 to support image and sound capabilities via satellite broadcast. The system is an enhancement to the Emergency Alert System. Like the EAS, it is used for statewide and local emergencies such as severe weather warnings, AMBER Alerts, and civil emergencies. The EDIS system is compatible with CAP and IPAWS. It is also known as the Emergency News Network in Los Angeles.
EDIS uses two frequencies for reception: 37.0200 MHz and 37.3800 MHz
Notes
External links
edis.oes.ca.gov
Disaster preparedness in the United States |
https://en.wikipedia.org/wiki/Emrich | Emrich is a surname. Notable people with the surname include:
Alan Emrich, American writer about and designer of computer games
Armin Emrich (born 1951), German handball player
Brian Emrich (born 1961), sound designer, composer, and musician
Clyde Emrich (1931–2021), American weightlifter
Daniel Emrich, member of the Montana Senate |
https://en.wikipedia.org/wiki/STDU%20Viewer | STDU Viewer is computer software, a compact viewer for many computer file formats: Portable Document Format (PDF), World Wide Fund for Nature (WWF), DjVu, comic book archive (CBR or CBZ), FB2, ePUB, XML Paper Specification (XPS), Text Compression for Reader (TCR), Mobipocket (MOBI), AZW, multi-page TIFF, text file (TXT), PalmDoc (PDB), Windows Metafile (EMF), Windows Metafile (WMF), bitmap (BMP), Graphics Interchange Format (GIF), JPEG-JPG, Portable Network Graphics (PNG), Photoshop Document (PSD), PiCture eXchange (PCX-DCX). It works under Microsoft Windows, and is free for non-commercial use.
STDU viewer is developed in the programming language C++.
Features
STDU Viewer has a tabbed document interface. Current versions allow users to save and restore sessions manually. It displays thumbnails of pages, it can create users' bookmarks, make color adjustments, and change text settings. The program supports three types of search algorithms and all the search results can be displayed in a list.
The rotation to 90 degrees option is useful for the portrait orientation of monitors. The opened document pages can be exported to text or image.
Version history
The first STDU Viewer was version 1.0.60, released on 13 September 2007. It supported three formats: PDF (including hyperlinks embedded), DjVu, and Tagged Image File Format (TIFF).
Version 1.0.76 introduced Unicode character support. Version 1.4.7 introduced the Print document function.
Critical reception
STDU Viewer was appreciated for its feature to read a wide range of ebook formats and can be considered as a replacement for Adobe Acrobat’s reader.
STDU Viewer was included in the list of top 50 freeware of 2009 and best software for students.
The program doesn't support formats for online help Microsoft Compiled HTML Help (CHM), Microsoft Reader (LIT), document (DOC), and HyperText Markup Language (HTML). When printing PDF document, a large temporary file is created, so the printing process is slow.
See also
List of PDF software
Comparison of image viewers
List of portable software
References
External links
PDF readers
Document viewers
Image viewers
Windows-only freeware |
https://en.wikipedia.org/wiki/Mr.%20Monk%20and%20the%20End | "Mr. Monk and the End" is the two-part series finale of the USA Network original criminal mystery dramedy television series, Monk. It is the fifteenth and sixteenth episodes of the eighth and final season, and is the 124th and 125th episodes in the series overall. Adrian Monk (Tony Shalhoub) finally discovers his wife Trudy's (Melora Hardin) murderer after twelve years of searching, concluding a seven-year, eight-season long arc. When "Part 2" aired, it set a series high and a new viewership record for the most watched episode of a regular drama series ever in basic cable with 9.4 million viewers. Both parts were written by series creator Andy Breckman and directed by Randy Zisk.
Plot
In a flashback to December 14, 1997, Trudy Monk asks her husband about his latest investigation, the disappearance of a midwife named Wendy Stroud. Monk and Captain Stottlemeyer question Dr. Malcolm Nash, director of the birthing center where Stroud worked. Stottlemeyer receives a phone call and informs Monk that Trudy has been killed.
In the present day, Monk finds that his latest case is taking him back to the same birthing clinic. Although Stottlemeyer offers Monk the chance to sit the case out, he insists he is okay. The pair learn that Dr. Nash had been shot dead while digitizing patient records. Monk concludes that the murder was committed by a professional hitman, and the police soon find a partial fingerprint that identifies the suspect as Joey Kazarinski. Seeking a warrant for his arrest from Judge Ethan Rickover, the group overhear Rickover telling his wife that he will never move out of his house, learning that he has been nominated for the State Supreme Court. That night, Kazarinski's employer instructs him to kill Monk.
When attending a dinner the following day at Natalie's house, Monk is poisoned with a powerful synthetic toxin based on ricin. Stottlemeyer forms a task force to find out who hired the hitman to kill Dr. Nash and what poison was used on Monk. The group track down Kazarinski to a train station, only for him to be hit by a freight train and killed.
Monk discovers a videotape recording made by Trudy before her death, where she confesses to having had an affair with Rickover when he had been a law professor at Berkeley. The affair resulted in a child, which only lived for a few minutes. Trudy suspected that Rickover might be silencing everyone who knew about the affair, so she made the video just in case. Monk remembers the conversation between Rickover and his wife about his house and deduces that a crucial clue is connected to it.
Natalie realizes that the poison was planted in Monk's hand wipes; the hospital is given this information to make an antidote.
Monk goes to Rickover's house and forces Rickover to dig up the remains of the missing midwife. Rickover admits he committed the murders in order to ensure that he would get the position of appellate judge. Twelve years ago, Wendy Stroud, the nurse who delivered the child, told Ric |
https://en.wikipedia.org/wiki/Turnaround%20time | Turnaround time (TAT) is the amount of time taken to complete a process or fulfill a request. The concept thus overlaps with lead time and can be contrasted with cycle time.
Meaning in computing
In computing, turnaround time is the total time taken between the submission of a program/process/thread/task (Linux) for execution and the return of the complete output to the customer/user. It may vary for various programming languages depending on the developer of the software or the program. Turnaround time may simply deal with the total time it takes for a program to provide the required output to the user after the program is started.
Turnaround time is one of the metrics used to evaluate an operating system's scheduling algorithms.
In case of batch systems, turnaround time will include time taken in forming batches, batch execution and printing results.
With increasing computerization of analytical instruments the distinction between a computing context and a "non-computing" context is becoming semantic.
An example of a "non-computing" context of turnaround time is the time a particular analysis in a laboratory, such as a medical laboratory, other commercial laboratories or a public health laboratory takes to result. Laboratories may publish an average turnaround time to inform their clients, e.g. a health care worker ordering the test, after what time a result can be expected. A prolonged turnaround time may give the requester a clue that a specimen was not received, that an analysis met with problems within the lab including that the result was unusual and the test was repeated for quality control.
Comparisons with other metrics of time
Lead Time vs Turnaround Time: Lead Time is the amount of time, defined by the supplier or service provider, that is required to meet a customer request or demand. Lead-time is basically the time gap between the order placed by the customer and the time when the customer get the final delivery, on the other hand the Turnaround Time is in order to get a job done and deliver the output, once the job is submitted for processing center according to the customer request.
Turnaround Time vs Response Time: Turnaround time is the amount of time elapsed from the time of submission to the time of completion whereas response time is the average time elapsed from submission until the first response is produced.
Turnaround Time vs Wait Time: Waiting time is amount of time a process has been waiting in the ready queue.
Reasons of Delays: In case of warehouses, there are several reasons, due to which TAT can increase. First of all, if laborers or equipment are not working properly, and if the maximum efficiency could not be reached, the process would be delayed. Secondly, the infrastructure, improper infrastructure could be an obstacle for the TAT reduction.
See also
Takt time
Logistics
Cycle time variation
References
Keeping productive can be hard if you aren't finish your task within Turnaround time "8 Key |
https://en.wikipedia.org/wiki/Tucker%20McCall | Tucker McCall is a fictional character from The Young and the Restless, an American soap opera on the CBS network. Introduced by former head writer Maria Arena Bell, the character debuted during the episode airing on December 2, 2009, portrayed by William Russ. The character was slated to be a new businessman and billionaire, leading to speculation that Tucker would become a replacement character for icon Victor Newman (Eric Braeden), as Braeden's future with the series was in jeopardy at the time. However, Tucker ended up being a new character who would be revealed as Katherine Chancellor's (Jeanne Cooper) long lost son. Russ was let go shortly after his debut because producers wanted to take the character in a different direction, resulting in the hiring of Stephen Nichols as his replacement.
The character then became involved with Ashley Abbott (Eileen Davidson) and the two were later married; their union ended after a year due to Tucker's adultery. In 2011, it was revealed that Tucker was the previously unknown father of Devon Hamilton (Bryton James), which also revealed a long ago affair with Yolanda Hamilton (Debbi Morgan); a plot that was met with positive reviews. While several television critics were surprised by the decision to replace Russ with Nichols, the actor was well received throughout his run. In December 2012, it was announced that Nichols had been let go from the soap opera; he made his final appearance on January 29, 2013. In September 2022, Trevor St. John assumed the role of Tucker.
Casting
In October 2009, it was announced that William Russ would be joining the cast of The Young and the Restless as Tucker McCall, a billionaire. Initially, Russ' casting was questioned by the press due to the lack of information on the character and the unsuccessful contract negotiations between Sony Pictures Television and Eric Braeden, who portrays icon businessman Victor Newman. Speculation arose that the producers were attempting to recast Victor or looking for a character to replace him, but Tucker ended up being a completely new character. Russ made his debut on December 2, 2009. Weeks after his debut, it was announced that Russ had been replaced by soap opera veteran Stephen Nichols. Former executive producer and head writer Maria Arena Bell released a statement concerning the casting switch, saying that Russ is a "talented actor" and they "enjoyed working with him", but they had decided to take the character in a "different direction". Bell and co-executive producer Paul Rauch stated that Nichols brought many "complexities, a strength, sexuality, and drama to this character". Afterward, Nelson Branco of TV Guide revealed that former vice president of CBS Daytime, Barbara Bloom, wanted Nichols for the role from the start. Nichols made his debut on January 27, 2010. In December 2012, it was announced that Nichols had been let go from the soap opera and had taped his final scenes. He made his final appearance on January 29, 2013. In |
https://en.wikipedia.org/wiki/The%20Oz%20Music%20Show | The Oz Music Show is an Australian radio program broadcast by the Australian Broadcasting Corporation's Triple J as well as on Radio Australia shortwave radio network. Oz Music Show was first screened in 1991.
Since 1991, the program hosted by Richard Kingsmill broadcast Wednesday nights 10pm to 1am, features included Australian music, interviews and touring information, as well as CDs played by the music programmers and djs to have a listen. Independent bands and music labels are featured as well. There's a live performance recorded in the Triple J studios each week.
Oz Music plays the music videos on Rage featured includes the new Australian music.
In 2006, triple j tv was launched as a successor programme.
External links
The Oz Music Show on triple j (Richard Kingsmill's Australian Music program on triple j radio)
Triple J programs
Australian Broadcasting Corporation radio programs
Australian Broadcasting Corporation original programming
Australian music radio programs |
https://en.wikipedia.org/wiki/Baycar | Baycar (also styled as baycar) is a bus service in Cardiff, serving the city centre and Cardiff Bay.
The service forms part of the wider Cardiff Bus network, but is unique in that the entire Baycar bus system includes its own branded vehicles, bus shelters and boards.
History
The service was introduced in 2006 to connect the city centre to the old Cardiff docklands redeveloped to create Cardiff Bay, a primarily entertainment and retail area.
In 2007, the service was used by 39,000 each week.
Under the 5-year contract, the bus service was subsidised £200,000 per month by Cardiff Council, which owns Cardiff Bus, and by the Welsh Government.
The Baycar system came second to consumer watchdog Bus Users UK Cymru Wales, under the Best Example of Participation in Transport category, at the Chartered Institute of Logistics and Transport Wales' National Transport Awards in 2007.
Service pattern
Services run from around 06:00 until 23:30 Monday to Saturdays (from 08:00 on Sundays and Bank Holidays). Buses run every 10 minutes Monday–Friday daytimes, every 15 minutes Sat-Sun daytimes and every 20 minutes Monday–Friday late evenings.
The core service operates runs from the Wales Millennium Centre to the northern city centre. The route is extended during peak times (Monday–Friday 0645–1930 (to Civic Centre) / 0645–2010 (to Porth Teigr)) so that the north of the route runs through Cathays Park (the Civic Centre) and the south of the route extends to Porth Teigr.
Fares on the service are, a with all Cardiff Bus services, £2.00 for a single, or £4.00 for a return/day-to-go ticket (as of December 2019).
Vehicles
The vehicle, presently ADL Enviro 200, have its own distinct blue livery. It is equipped with seats with leather headrests, air-conditioning, reserved spaces for buggies and wheelchairs, CCTV, free WiFi, on-bus screens with local travel information, hearing induction loop and next stop information.
Route
The route leaves Cardiff Bay and then circles the city centre anti-clockwise, returning south to towards Cardiff Bay. On Friday and Saturday nights and during events at the Millennium Stadium, only the eastern and northern parts of the city centre are served due to road closures to vehicles. In this case, the baycar service terminates in the city centre at Greyfriars, not continuing down Kingsway and St. Mary Street.
Amongst the landmarks and attractions served are:
Cardiff Bay
Roath Lock
Norwegian Church Arts Centre
Wales Millennium Centre
Mermaid Quay
Red Dragon Centre
Senedd
Pierhead Building
Cardiff Waterbus stops
Techniquest
Cardiff City Centre
St David's Centre
Cardiff Central Library
Cardiff International Arena
Capitol Centre
Civic centre
Cardiff University
Cardiff Castle
Millennium Stadium
See also
Capital City Red
Bus transport in Cardiff
Transport in Cardiff
Articulated buses in the United Kingdom
References
External links
Cardiff Bus: Baycar
Transport in Cardiff
Bus transport in Wales
Bus transport in Cardiff
Bus routes in Wale |
https://en.wikipedia.org/wiki/Style%20By%20Jury | Style By Jury was an original Canadian makeover show and format which aired on the W Network from 2004 to 2010. The series was created by Carolyn Meland and executive produced and co-developed with partners Romano D'Andrea and Jeff Preyra at Planetworks Inc.
Plot
The premise of the show was centered around first impressions. Candidates were told that they were doing an audition for a makeover, but were unaware that they had been pre-selected for the show. Hidden in the auditioning room behind a two-way mirror, a jury was asked for honest first opinions about the candidate. Once the shock of the two way mirror is revealed, the jury's first impression would be played back on a monitor, and the candidate would often be brought to tears. This set the launchpad for the makeover journey, tackling both the exterior and interior transformation. At the end of an intensive one week makeover, the candidate returned before an entirely different jury, which was unaware that the subject has had a makeover. What kind of first impression will they make the second time around? Waiting in the wings is one last surprise "special" juror.
The Makeover
The candidates would undergo a top to toe overhaul, typically including extensive cosmetic dentistry, dermatology, hair, make-up, and fashion. The cornerstone of the makeover, however, would be presented as the internal transformation and coaching which together enabled the candidate to view themselves in a whole new light.
Cast
Recurring principals on the show included:
Host: Bruce Turner
Wardrobe Consultant: David Clemmer
Cosmetic Dermatologists: Dr. Kucy Pon and Dr. Fred Weksberg
Lasik Eye Surgeons: Dr. Raymond M. Stein and Dr. Sheldon Herzig
Cosmetic Surgeon: Dr. William Middleton
Hair Stylists: Francesco Fontana and Johnny Cupello
Make-up artist: Korby Banner
Cosmetic Dentistry: Dr. Armaghan Afsar and Dr. Andrew Charkiw
Bombshell Coach: Jacqueline Bradley
International distribution
The series was first distributed by Picture Box's Kate Sanagan and Marily Kynaston and has aired on WE and in Singapore on MediaCorp Channel 5 since 2009, in the Netherlands RTL8, on Bulgarian and Serbian Fox Life, in France on Teva, in Spain on Divinity, and in the United States via syndication (through Program Partners) and Lifetime Real Women through Thunderbird Films.. A Russian version was licensed as well.
In Spain, this TV programme (Tu estilo a juicio) featured on the Divinity channel, which belongs to Mediaset España Comunicación. Mediaset España Comunicación is the largest television network company in Spain.
In 2014, the format rights for the series were acquired by LA production company Electus.
American spinoff
On 13 February 2015, an American version of the series launched on TLC, hosted by Preston Konrad and Louise Roe. It was watched by 1,106,000 U.S. viewers.
References
External links
Style By Jury
Makeover reality television series
Television series by Corus Entertainment
2004 Canadian television series |
https://en.wikipedia.org/wiki/60-bit%20computing | A 60-bit word is typically used for high-precision floating-point calculations; it can also store 10 6-bit characters.
Examples
The only widely-used computers with 60-bit words were produced by Control Data Corporation (CDC), including the CDC 6000 series, the CDC 7600, and the CDC Cyber 70 and 170 series. Though the addressable unit was the 60-bit word, instructions were either 15 or 30 bits.
Early design documents for the IBM 7030 Stretch tentatively specified its word length as 60 bits; the final design used 64.
Emulator
Museum examples of 60-bit CDC machines exist. There also exists an emulator for the series which will simulate the CDC 60-bit machines on commodity hardware and operating systems.
References
Data unit
Control Data Corporation hardware |
https://en.wikipedia.org/wiki/Where%20I%27ve%20Been | Where I've Been was a social networking application that marked its users' travel history on a color-coded map. The site collected user-generated content such as photos, videos and reviews.
History
The Where I've Been map was created as a Facebook application by freelance developer Craig Ulliott in 2007. By June of that year his map had over 400,000 users. In August, it was rumored that the application had been purchased by travel review site TripAdvisor for $3 million, which proved untrue. The application expanded to MySpace that September.
In April 2009, operating with more than 800,000 active monthly users, Where I've Been re-launched with a live site, new functionality focusing on local search, user-generated content, social networking and travel booking, as well as a new map using the Flash platform.
In July 2011, TripAdvisor announced its acquisition of Where I've Been for an undisclosed sum.
In December 2013, the website announced it was closed and redirected users to TripAdvisor.
References
Tripadvisor
American social networking websites
American travel websites
Defunct social networking services
Internet properties established in 2007
Internet properties disestablished in 2013 |
https://en.wikipedia.org/wiki/Carnegie%20Mellon%20University%20Masters%20in%20Software%20Engineering | The Master of Software Engineering (MSE) at Carnegie Mellon University is a master's program founded in 1989 with the intent of developing technical leaders in software engineering practice, as a joint effort between Carnegie Mellon's School of Computer Science and the Software Engineering Institute. A core component of the degree is the studio project, a capstone project that accounts for 40 percent of the course units.
History
Centered around software engineering workshops conducted at the Software Engineering Institute, the degree program's original core concepts and curriculum were developed. The original faculty included many educators who remain currently active, while others have retired or died. The latter notable individuals include Norm Gibbs and Jim 'Coach' Tomayko.
A hallmark of the MSE program is that it targets software practitioners who are already working in the field.
Following its inception, the program has evolved to address a demand for lighter, faster software development processes, enabled by the rapid and widening adoption of the Internet. This included extreme programming, which later became part of agile methods, all of which sought to more rapidly respond to customer requirements in contrast to more deliberative, plan-driven development.
Program directors
2019–Present, Travis Breaux, Director, Masters Programs in Software Engineering
2016-2019, Anthony Lattanze, Director, Masters Programs in Software Engineering
2002–2016, Dr. David Garlan, Director, Masters Programs in Software Engineering
1999-2001, Dr. James E. Tomayko, Director Masters Program in Software Engineering
2001-2008, Mel Rosso-Llopart, Director of Software Engineering Distance Program
1996-2001, Dr. James E. Tomayko, Director of Software Engineering Distance Program
1992-1999, Mary Shaw, Director, Masters Program in Software Engineering
1989-1991, Software Engineering Institute
Curriculum
The MSE program began as a joint effort of the School of Computer Science and the Software Engineering Institute. The degree program is an intensive 16-month curriculum designed for professional software engineers. Class sizes are generally around 20 students. Applicants to the program must have a strong background in computer science, no less than two years of relevant industry experience with an average of five years of experience.
The MSE curriculum has three basic components:
Core Courses develop foundational skills in the fundamentals of software engineering, with an emphasis on design, analysis, and the management of large-scale software systems.
The Studio Project, a capstone project that spans the duration of the program, allows for students to plan and implement a significant software project for an external client. Inspired by the design projects in architecture programs, students work as members of a team under the guidance of faculty advisors (mentors), analyzing a problem, planning the software development effort, executing a solution, and |
https://en.wikipedia.org/wiki/4510 | 4510 may refer to:
The year in the 46th century
MOS Technology 4510, an 8-bit microprocessor chip
RFC 4510, a published standard for the Lightweight Directory Access Protocol for computer communication
4510 Shawna, an asteroid |
https://en.wikipedia.org/wiki/Crossing%20sequence%20%28Turing%20machines%29 | In theoretical computer science, a crossing sequence at boundary i, denoted as or sometimes , is the sequence of states of a Turing machine on input x, such that in this sequence of states, the head crosses between cell i and i + 1 (note that the first crossing is always a right crossing, and the next left, and so on...)
Sometimes, crossing sequence is considered as the sequence of configurations, which represent the three elements: the states, the contents of the tapes and the positions of the heads.
Study of crossing sequences is carried out, e.g., in computational complexity theory.
Turing machine |
https://en.wikipedia.org/wiki/Ferrotramviaria | Ferrotramviaria is a private railway company of Italy. Based in Bari, in the Apulia region, it manages the Ferrovie del Nord Barese network, composed by the Bari–Barletta railway and the Bari metropolitan railway service.
Railway services
Ferrotramviaria operates two railway lines on the network of Ferrovie del Nord Barese:
Bari–Barletta railway, opened in 1965, former known as Ferrovia Bari Nord;
Bari metropolitan railway service, opened in 2008, also known as Metropolitana San Paolo.
On the network are two commuter lines (FM 1 and FM 2) and two regional lines (FR 1 and FR 2) in service.
The company also has two locomotives used on freight services along the Adriatic coast.
Rolling stock
References
External links
Railway companies of Italy
Companies based in Apulia |
https://en.wikipedia.org/wiki/Amnesia%3A%20The%20Dark%20Descent | Amnesia: The Dark Descent is a survival horror adventure video game by Frictional Games, released in 2010 for Microsoft Windows, Mac OS X and Linux operating systems, in 2016 for the PlayStation 4 platform and in 2018 for the Xbox One. The game features a protagonist named Daniel exploring a dark and foreboding castle called Brennenburg, while trying to maintain his sanity by avoiding monsters and unsettling events. The game was critically well-received, earning two awards from the Independent Games Festival and numerous positive reviews.
Originally released independently via online distribution, the game has since been published in retail by 1C Company in Russia and Eastern Europe, as well as THQ in North America. A collection of five short stories set in the world of Amnesia, written by Mikael Hedberg and illustrated by the game's concept artists, was also made available. In addition, the game's soundtrack is available for purchase and a free content expansion Justine has been released, as well as many fan-made expansions and stories for its unique "Custom Story" game mode.
An indirect sequel to The Dark Descent, titled Amnesia: A Machine for Pigs, was released on 10 September 2013. The Amnesia Collection – which contains The Dark Descent, its Amnesia: Justine expansion and A Machine for Pigs was released for PlayStation 4 on 22 November 2016, and for Xbox One on 28 September 2018. The same collection was released on the Nintendo Switch on 12 September 2019. A second sequel, developed by Frictional Games, Amnesia: Rebirth, was announced on 6 March 2020, and was released on 20 October 2020. The third sequel, Amnesia: The Bunker, was released on 6 June 2023.
Gameplay
Amnesia: The Dark Descent is a first-person adventure game with survival horror elements. The player takes control of Daniel, who must navigate Castle Brennenburg while avoiding various dangers and solving puzzles. The gameplay retains the physical object interaction used in the Penumbra series, allowing for physics-based puzzles and interactions such as opening doors and fixing machinery. Smaller items can be stored in an inventory menu, while larger objects can be raised by holding down a mouse button and pushing or pulling the mouse. Objects such as doors or levers can be manipulated by using the mouse in a fashion that imitates moving the said object. The game's difficulty level can be adjusted preceding its initiation, but cannot be readjusted once the game has begun.
In addition to a health indicator, Daniel's sanity must be managed, centered around an "afraid of darkness" mechanic. According to designer Thomas Grip, "the idea was basically that the darkness itself should be an enemy." Sanity is reduced by staying in the dark for too long, witnessing unsettling events or looking directly at monsters. Low sanity causes visual and auditory hallucinations and an increased chance of attracting monsters, while its complete depletion results in a temporary drop in mobility, or |
https://en.wikipedia.org/wiki/Tony%20Greenfield | Tony Greenfield (26 April 1931 – 19 March 2019) was a British statistical consultant and academic. He was formerly Head of Process Computing and Statistics at the British Iron and Steel Research Association, Sheffield, and Professor of Medical Computing and Statistics at Queen's University, Belfast.
Until he retired, at the age of 80, he was a visiting professor to the Industrial Statistics Research Unit of the University of Newcastle-upon-Tyne and to the Universitat Politècnica de Catalunya.
Greenfield co-authored Design and Analyse your Experiments with Minitab with Andrew Metcalfe and Engineering Statistics with Matlab. His inaugural lecture (1980) at Queen's University is still sold as a booklet. His first book, Research Methods for Postgraduates is highly regarded on both sides of the Atlantic and is now in its third edition, published by Wiley. He has also had a strong hand in The Pocket Statistician, Statistical Practice in Business and Industry and an Encyclopaedia of Statistics in Quality and Reliability. One of his contributions to his local community of Great Hucklow is the editing of a history of lead mining in the area: Lead in the Veins.
Tony was a founding member and Past President of European Network for Business and Industrial Statistics and for many years he was a prominent member of the Royal Statistical Society. He was the first editor of RSS News and of the ENBIS newsletter and magazine. In its first ten years, ENBIS grew to a membership base of around 1500 practitioners spread across more than sixty countries.
Tony was a Chartered Statistician (CStat) and a Chartered Scientist (CSci).
Early life
Tony Greenfield was born in Chapeltown, South Yorkshire on 26 April 1931 to Geoffrey James Greenfield (1900–1978) and Hilda Aynsley (1903–1976).
Tony Greenfield worked in an iron mine when he left Bedford School at the age of 17. He later worked in coal mines, a brass tube factory, and in a copper mine and studied mining engineering at Imperial College London. He received the diploma in journalism from the Regent Street Polytechnic, worked on the Sunday Express and Sunday Mirror before turning to technical journalism for ten years. He was an active member of the Sheffield Junior Chamber of Commerce of which he was chairman of the Business Affairs committee and editor of The Hub, the chamber's monthly magazine. At the 1963 conference in Tel Aviv of Junior Chamber International he was acknowledged as the editor of the best junior chamber magazine in the world.
He moved into the steel industry to write technical reports for Operations Research (OR) scientists. There he found satisfaction in solving production problems, studied OR, mathematics, statistics and computing leading to an external degree from University College London. He moved into steel research and became head of process computing and statistics. Much of his work was in design and analysis of experiments for which he received his PhD. When the laboratories clo |
https://en.wikipedia.org/wiki/Transformers%3A%20War%20for%20Cybertron | Transformers: War for Cybertron is a third-person shooter video game based on the Transformers franchise, developed by High Moon Studios and published by Activision. It was released for Xbox 360, PlayStation 3, Nintendo DS and Microsoft Windows in June 2010. Two portable versions were released for the Nintendo DS, one featuring an Autobot campaign, the other a Decepticon campaign. A game for the Wii, Transformers: Cybertron Adventures, was developed by Next Level Games and utilizes the same characters and setting as War for Cybertron.
Set on the Transformers' home planet of Cybertron, prior to their arrival on Earth, the game depicts the deadly civil war between Autobots and Decepticons. Players may pick either faction to play as, as each has its own separate campaign (though the Decepticon campaign chronologically takes place first). The game's plot revolves around Dark Energon, a more dangerous and destructive version of Energon, the substance which powers all Transformers. While the Decepticon leader Megatron seeks this substance for himself, believing it will allow him to return the planet to its "golden age", the Autobots, led by Optimus Prime, attempt to stop him, knowing it would instead doom their homeworld.
War for Cybertron received generally favorable reviews, with many viewing it as an improvement over past Transformers games. It was praised for its multiplayer, character designs, and voice acting, with criticism reserved for the visual design of the game's setting. A sequel, Transformers: Fall of Cybertron, was released in August 2012, and a third game, Transformers: Rise of the Dark Spark, was released in June 2014.
Gameplay
War for Cybertron is played from a third-person perspective. Transformers are classified into four main categories: Leader, Soldier, Scientist, and Scout. Each character in the campaign is classified as one of these types, and their weaponry, abilities and vehicle form are largely influenced by their character class. Players can change between forms at will, and each form has unique abilities. While in robot form characters can also collect different weapons, reminiscent of those found in first-person shooters. While in vehicle form each character can boost their speed.
Each campaign level gives the player a choice of three Transformers. The campaign can be played in single-player or cooperatively via online multiplayer, and players can enter or leave the game at any time. If fewer than three players are present, the game's AI controls the remaining playable characters. Cooperative and competitive modes of the game are limited to online play, with no split screen features available. The game levels are designed to allow characters to comfortably navigate and play the game in either mode.
Multiplayer
Competitive multiplayer games do not allow players to control official, named characters, and instead must design their own Transformer. Similar to the campaign, generic multiplayer characters are split into fo |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.