text:
Computer Go
|Part of a series of articles on
|Game specifics
|History and culture
|Players and organizations
|Computers and mathematics
Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays Go, a traditional board game.
- 1 Performance
- 2 Obstacles to high-level performance
- 3 Tactical search
- 4 State representation
- 5 System design
- 6 Computer programs
- 7 Competitions among computer Go programs
- 8 See also
- 9 References
- 10 Further reading
- 11 External links
Go has long been considered a difficult challenge in the field of AI and is considerably more difficult to solve than chess. Mathematician I. J. Good wrote in 1965:[1]
Go on a computer? – In order to programme a computer to play a reasonable game of Go, rather than merely a legal game – it is necessary to formalise the principles of good strategy, or to design a learning programme. The principles are more qualitative and mysterious than in chess, and depend more on judgment. So I think it will be even more difficult to programme a computer to play a reasonable game of Go than of chess.
The first Go program was written by Albert Zobrist in 1968 as part of his thesis on pattern recognition. It introduced an Influence function to estimate territory and Zobrist hashing to detect ko.
In April 1981 Jonathan K Millen published an article in Byte discussing Wally, a Go program with a 15x15 board that fit within the KIM-1 microcomputer's 1K RAM.[2] Bruce F. Webster published an article in the magazine in November 1984 discussing a Go program he had written for the Apple Macintosh, including the MacFORTH source.[3]
In 1998, very strong players were able to beat computer programs while giving handicaps of 25–30 stones, an enormous handicap that few human players would ever take. There was a case in the 1994 World Computer Go Championship where the winning program, Go Intellect, lost all 3 games against the youth players while receiving a 15-stone handicap.[4] In general, players who understood and exploited a program's weaknesses could win with much larger handicaps than typical players.[5]
Recent developments in Monte Carlo tree search and machine learning have brought the best programs to high dan level on the small 9x9 board. In 2009, the first such programs appeared which could reach and hold low dan-level ranks on the KGS Go Server also on the 19x19 board.
Recent results[edit]
|This section may require cleanup to meet Wikipedia's quality standards. The specific problem is: quite long and hard to read, try to analyse, synthesize and summarize. (October 2014)
In 2008, thanks to an efficient message-passing parallelization, MoGo won one game (out of three) against Cătălin Ţăranu, 5th dan pro, in 9x9 with standard time settings (30 minutes per side). MoGo was running on a cluster provided by "Bull" (32 nodes with 8 cores per node, 3 GHz); the machine was down during one of the lost games. The results of this event were approved by the French Federation of Go. MoGo also played a 19x19 Game against Cătălin Ţăranu and lost in spite of 9 stones handicap. However, MoGo was in good position during most of the game, and lost due to a bad choice in a ko situation at the end. The machine used for this event (the IAGO challenge, organized by the company "Recitsproque") is a good one, but far from the top level in industry[citation needed].
On August 7, 2008, the computer program MoGo running on 25 nodes (800 cores, 4 cpus per node with each core running at 4.7 GHz to produce 15 Teraflops)[6] of the Huygens cluster in Amsterdam beat professional Go player Myungwan Kim (8p) while receiving a nine stone handicap game on the 19x19 board on the KGS Go Server. MoGo won by 1.5 points. Mr. Kim used around 13 minutes of time while MoGo took around 55; however, he felt that using more time would not have helped him win. In after-game commentary, Kim estimated the playing strength of this machine as being in the range of 2–3 amateur dan.[7] MyungWan and MoGo played a total of 4 games of varying handicaps and time limits, each side winning two games. The game records are accessible on KGS where MoGo played as MogoTitan. In a rematch on September 20, Kim won two games giving MoGo nine stones.[8] On August 26, 2008, Mogo beat an amateur 6d while receiving five stones of handicap, this time running on 200 cores of the Huygens cluster.[9]
On September 4, 2008, the program Crazy Stone running on an 8-core personal computer won against 30-year-old professional, Kaori Aoba (4p), receiving a handicap of eight stones. The time control was 30 seconds per move. White resigned after 185 moves. The game was played during the FIT2008 conference in Japan.[10]
In February 2009, MoGo won two 19x19 games against professional Go players in the Taiwan Open 2009. With a 7-stones handicap the program defeated Zhou Junxun (9p), and with a 6-stones handicap it defeated Li-Chen Chien (1p).[11]
On February 14, 2009, Many Faces of Go running on a 32-core Xeon cluster provided by Microsoft won against James Kerwin (1p) while receiving a handicap of seven stones. The game was played during the 2009 AAAS general meeting in Chicago.[12]
On August 7, 2009, Many Faces of Go (version 12) resigned against Myungwan Kim (8p) in a 7-stone handicap game.[13] Many Faces was playing on a 32 node system provided by Microsoft. The "Man vs. Machine" event was part of the 2009 US Go Congress, which was held in Washington DC from August 1 to August 9.[14]
On August 21 and 22, 2009, Zhou Junxun (9p) beat Many Faces of Go, MoGo, and Zen in full-board 7-stone games, beat MoGo in an even 9×9 game, and won one and lost one even 9×9 game against Fuego.[15]
On July 20, 2010, MoGoTW won an even 9×9 game as white against Zhou Junxun (9p).[16]
On July 20, 2010, at the 2010 IEEE World Congress on Computational Intelligence in Barcelona Spain, computer program Zen (written by Yamato of Japan) played professional 4 dan Ping-Chiang Chou of Taiwan in 19x19 Go. Zen received a 6 stone handicap. Each side had 45 minutes. Zen won the game.[17]
On July 28, 2010, at the 2010 European Go Congress in Finland, computer program MogoTW played European professional 5 dan Catalin Taranu 19x19 Go. MogoTW received a 7 stone handicap, and won. MogoTW is a joint project between the MoGo team and a Taiwanese team.[18]
In December 2010, computer program Zen reached the rank 4 dan on the server KGS. Zen was written by Japanese programmer Yoji Ojima.[19]
In June 2011, computer program Zen19D reached the rank of 5 dan on the server KGS, playing games of 15 seconds per move. The account which reached that rank uses a cluster version of Zen running on a 26-core machine.[20] In June 2011, computer program Zen19S achieved a rank of 4 dan on the KGS Go Server. Zen19S plays at 20 minutes main time and then 30 seconds per move. In June 2011, Zen19S played 518 games. A player can download the games of Zen19S from the KGS server. The player can study the games to find the program's weakness and try to exploit it.[19]
Zen matches against Ohashi Hirofumi and Takemiya Masaki were announced in February 2012.[21] On March 17, 2012 Zen beats Takemiya 9p at 5 stones by eleven points followed by a stunning twenty point win at a 4 stone handicap. Takemiya remarked "I had no idea that computer go had come this far."
In March 2012, computer program Zen19D reached the rank of 6 dan on the KGS Go Server, playing games of 15 seconds per move. The account which reached that rank uses a cluster version of Zen running on a 28-core machine.[20] The Zen version which achieved that rank is 9.2d10.
In March 2013, Crazy Stone beat Yoshio Ishida in a 19×19 game with four handicap stones.[22]
On June 5, 2013, computer program Zen defeated Takuto Ooomote with a 3 stone handicap. Takuto Ooomote is a 9 dan on the Tygem server. The 19×19 game used Japanese rules with a time setting of 60 minutes plus 30 seconds byoyomi. They played at the 27th Annual Conference of The Japanese Society for Artificial Intelligence.[23]
On October 4th, 11th, 18th and 25th 2014 the codecentric go challenge 2014 a best of five match in a 19x19 game was played between computer program Crazy Stone and eleven times German go champion Franz-Jozef Dickhut, 6 dan amateur, until one side had registered three wins. The match was played even so without a handicap. In the realm of amateur go, it doesn't get much stronger than this. No stronger player has ever before agreed to play a serious competition against a go program on even terms, without a handicap. Franz-Jozef Dickhut won as was expected by most observers and the contenders themselves before the match. Crazy Stone won however the first match by 1,5 points which was a resounding exclamation mark that the top go programs have reached top amateur level.[24]
On October 3rd, 17th, 24th and 31th 2015 the codecentric go challenge 2015 a best of five match in a 19x19 game was played between computer program Zen and Franz-Jozef Dickhut, 6 dan amateur, until one side had registered three wins. The match was played even so without a handicap. Franz-Jozef Dickhut won with 3-1. Zen won the first match by 1,5 points.[25]
Obstacles to high-level performance[edit]
|This section needs additional citations for verification. (October 2007)
For a long time it was a widely held opinion that computer Go posed a problem fundamentally different from computer chess. It was believed that methods relying on fast global search with relatively little domain knowledge would not be effective against human experts. Therefore, a large part of the computer Go development effort was during these times focused on ways of representing human-like expert knowledge and combining this with local search to answer questions of a tactical nature. The result of this were programs that handled many situations well but which had very pronounced weaknesses compared to their overall handling of the game. Also, these classical programs gained almost nothing from increases in available computing power per se and progress in the field was generally slow.
A few researchers grasped the potential of probabilistic methods and predicted that they would come to dominate computer game-playing,[26] but many others considered a strong Go-playing program something that could be achieved only in the far future, as a result of fundamental advances in general artificial intelligence technology. Even writing a program capable of automatically determining the winner of a finished game was seen as no trivial matter.
The advent of programs based on Monte Carlo search starting in 2006 changed this situation in many ways with the first 9-dan professional Go players being defeated in 2013 by multicore computers, albeit with 4-stone handicap.
Size of board[edit]
The large board (19×19, 361 intersections) is often noted as one of the primary reasons why a strong program is hard to create. The large board size is a problem to the extent that it prevents an alpha-beta searcher without significant search extensions or pruning heuristics from achieving deep look-ahead.
So far, the largest game of Go being completely solved has been played on a 5×5 board. It was achieved in 2002, with black winning by 25 points (the entire board), by a computer program called MIGOS (MIni GO Solver).[27]
Most moves are possible[edit]
Continuing the comparison to chess, Go moves are not as limited by the rules of the game. For the first move in chess, the player has twenty choices. Go players begin with a choice of 55 distinct legal moves, accounting for symmetry. This number rises quickly as symmetry is broken and soon almost all of the 361 points of the board must be evaluated. Some moves are much more popular than others and some are almost never played, but all of them are possible.
Techniques in chess that cannot be applied to Go[edit]
|This section requires expansion. (February 2012)
The general weakness of computer Go programs compared with computer chess programs has served to generate research into many new programming techniques. The techniques that proved to be the most effective in computer chess have generally shown to be mediocre at Go.
Evaluation function[edit]
While a simple material counting evaluation is not sufficient for decent play in chess, it is often the backbone of a chess evaluation function, when combined with more subtle considerations like isolated/doubled pawns, rooks on open files (columns), pawns in the center of the board and so on. These rules can be formalized easily, providing a reasonably good evaluation function that can run quickly.
These types of positional evaluation rules cannot efficiently be applied to Go. The value of a Go position depends on a complex analysis to determine whether or not the group is alive, which stones can be connected to one another, and heuristics around the extent to which a strong position has influence, or the extent to which a weak position can be attacked.
More than one move can be regarded as the best depending on which strategy is used. In order to choose a move, the computer must evaluate different possible outcomes and decide which is best. This is difficult due to the delicate trade-offs present in Go. For example, it may be possible to capture some enemy stones at the cost of strengthening the opponent's stones elsewhere. Whether this is a good trade or not can be a difficult decision, even for human players. The computational complexity also shows here as a move might not be immediately important, but after many moves could become highly important as other areas of the board take shape.
Combinatorial problems[edit]
Sometimes it is mentioned in this context that various difficult combinatorial problems (in fact, any NP-hard problem) can be converted to Go-like problems on a sufficiently large board; however, the same is true for other abstract board games, including chess and minesweeper, when suitably generalized to a board of arbitrary size. NP-complete problems do not tend in their general case to be easier for unaided humans than for suitably programmed computers: it is doubtful that unaided humans would be able to compete successfully against computers in solving, for example, instances of the subset sum problem. Hence, the idea that we can convert some NP-complete problems into Go problems does not help in explaining the present human superiority in Go.
Given that the endgame contains fewer possible moves than the opening (fuseki) or middle game, one could suppose that it was easier to play, and thus that computers should be easily able to tackle it. In chess, computer programs perform worse in chess endgames because the ideas are long-term, unless the number of pieces is reduced to an extent that allows taking advantage of solved endgame tablebases.
The application of surreal numbers to the endgame in Go, a general game analysis pioneered by John H. Conway, has been further developed by Elwyn R. Berlekamp and David Wolfe and outlined in their book, Mathematical Go (ISBN 978-1-56881-032-4). While not of general utility in most playing circumstances, it greatly aids the analysis of certain classes of positions.
Nonetheless, although elaborate study has been conducted, Go endgames have been proven to be PSPACE-hard. There are many reasons why they are so hard:
- Even if a computer can play each local endgame area flawlessly, we cannot conclude that its plays would be flawless in regard to the entire board. Additional areas of consideration in endgames include sente and gote relationships, prioritization of different local endgames, territory counting & estimation, and so on.
- The endgame may involve many other aspects of Go, including 'life and death', which are also known to be NP-hard.[28][29]
- Each of the local endgame areas may affect one another. In other words, they are dynamic in nature although visually isolated. This makes it much more difficult for computers to deal with. This nature leads to some very complex situations like Triple Ko, Quadruple Ko, Molasses Ko and Moonshine Life.
Thus, it is very unlikely that it will be possible to program a reasonably fast algorithm for playing the Go endgame flawlessly, let alone the whole Go game.[30]
Why humans are (still) better at Go[edit]
Go has features that might be easier for humans than computers. The pieces never move about (as they do in Chess), nor change state (as they do in Reversi). The game lends itself to a visual nature that is difficult to implement in a computer program. [31] There are, however, some rare Go positions known as "ishi-no-shita", in which stones are repeatedly captured and re-played on the same points. Reading the sequences of moves in these situations may be much easier for computers than humans.
Order of play[edit]
Current Monte-Carlo-based Go engines can have difficulty solving problems when the order of moves is important.[32]
Tactical search[edit]
One of the main concerns for a Go player is which groups of stones can be kept alive and which can be captured. This general class of problems is known as life and death. The most direct strategy for calculating life and death is to perform a tree search on the moves which potentially affect the stones in question, and then to record the status of the stones at the end of the main line of play.
However, within time and memory constraints, it is not generally possible to determine with complete accuracy which moves could affect the 'life' of a group of stones. This implies that some heuristic must be applied to select which moves to consider. The net effect is that for any given program, there is a trade-off between playing speed and life and death reading abilities.
With Benson's algorithm, it is possible to determine the chains which are unconditionally alive and therefore would not need to be checked in the future for safety.
State representation[edit]
An issue that all Go programs must tackle is how to represent the current state of the game. For programs that use extensive searching techniques, this representation needs to be copied and/or modified for each new hypothetical move considered. This need places the additional constraint that the representation should either be small enough to be copied quickly or flexible enough that a move can be made and undone easily.
The most direct way of representing a board is as a one- or two-dimensional array, where elements in the array represent points on the board, and can take on a value corresponding to a white stone, a black stone, or an empty intersection. Additional data is needed to store how many stones have been captured, whose turn it is, and which intersections are illegal due to the Ko rule.
Most programs, however, use more than just the raw board information to evaluate positions. Data such as which stones are connected in strings, which strings are associated with each other, which groups of stones are in risk of capture and which groups of stones are effectively dead are necessary to make an accurate evaluation of the position. While this information can be extracted from just the stone positions, much of it can be computed more quickly if it is updated in an incremental, per-move basis. This incremental updating requires more information to be stored as the state of the board, which in turn can make copying the board take longer. This kind of trade-off is indicative of the problems involved in making fast computer Go programs.
An alternative method is to have a single board and make and take back moves so as to minimize the demands on computer memory and have the results of the evaluation of the board stored. This avoids having to copy the information over and over again.
System design[edit]
New approaches to problems[edit]
Historically, GOFAI (Good Old Fashioned AI) techniques have been used to approach the problem of Go AI. More recently, neural networks are being looked at as an alternative approach. One example of a program which uses neural networks is WinHonte.[33]
These approaches attempt to mitigate the problems of the game of Go having a high branching factor and numerous other difficulties.
Computer Go research results are being applied to other similar fields such as cognitive science, pattern recognition and machine learning.[34] Combinatorial Game Theory, a branch of applied mathematics, is a topic relevant to computer Go.[34]
Design philosophies[edit]
The only choice a program needs to make is where to place its next stone. However, this decision is made difficult by the wide range of impacts a single stone can have across the entire board, and the complex interactions various stones' groups can have with each other. Various architectures have arisen for handling this problem. The most popular use:
- some form of tree search,
- the application of Monte Carlo methods,
- the application of pattern matching,
- the creation of knowledge-based systems, and
- the use of machine learning.
Few programs use only one of these techniques exclusively; most combine portions of each into one synthetic system.
Minimax tree search[edit]
One traditional AI technique for creating game playing software is to use a minimax tree search. This involves playing out all hypothetical moves on the board up to a certain point, then using an evaluation function to estimate the value of that position for the current player. The move which leads to the best hypothetical board is selected, and the process is repeated each turn. While tree searches have been very effective in computer chess, they have seen less success in Computer Go programs. This is partly because it has traditionally been difficult to create an effective evaluation function for a Go board, and partly because the large number of possible moves each side can make each leads to a high branching factor. This makes this technique very computationally expensive. Because of this, many programs which use search trees extensively can only play on the smaller 9×9 board, rather than full 19×19 ones.
There are several techniques, which can greatly improve the performance of search trees in terms of both speed and memory. Pruning techniques such as alpha–beta pruning, Principal Variation Search, and MTD-f can reduce the effective branching factor without loss of strength. In tactical areas such as life and death, Go is particularly amenable to caching techniques such as transposition tables. These can reduce the amount of repeated effort, especially when combined with an iterative deepening approach. In order to quickly store a full-sized Go board in a transposition table, a hashing technique for mathematically summarizing is generally necessary. Zobrist hashing is very popular in Go programs because it has low collision rates, and can be iteratively updated at each move with just two XORs, rather than being calculated from scratch. Even using these performance-enhancing techniques, full tree searches on a full-sized board are still prohibitively slow. Searches can be sped up by using large amounts of domain specific pruning techniques, such as not considering moves where your opponent is already strong, and selective extensions like always considering moves next to groups of stones which are about to be captured. However, both of these options introduce a significant risk of not considering a vital move which would have changed the course of the game.
Results of computer competitions show that pattern matching techniques for choosing a handful of appropriate moves combined with fast localized tactical searches (explained above) were once sufficient to produce a competitive program. For example, GNU Go was competitive until 2008.
Knowledge-based systems[edit]
Novices often learn a lot from the game records of old games played by master players. There is a strong hypothesis that suggests that acquiring Go knowledge is a key to make a strong computer Go. For example, Tim Kinger and David Mechner argue that "it is our belief that with better tools for representing and maintaining Go knowledge, it will be possible to develop stronger Go programs." They propose two ways: recognizing common configurations of stones and their positions and concentrating on local battles. "... Go programs are still lacking in both quality and quantity of knowledge."[35]
After implementation, the use of expert knowledge has been proved very effective in programming Go software. Hundreds of guidelines and rules of thumb for strong play have been formulated by both high level amateurs and professionals. The programmer's task is to take these heuristics, formalize them into computer code, and utilize pattern matching and pattern recognition algorithms to recognize when these rules apply. It is also important to have a system for determining what to do in the event that two conflicting guidelines are applicable.
Most of the relatively successful results come from programmers' individual skills at Go and their personal conjectures about Go, but not from formal mathematical assertions; they are trying to make the computer mimic the way they play Go. "Most competitive programs have required 5–15 person-years of effort, and contain 50–100 modules dealing with different aspects of the game."[36]
This method has until recently been the most successful technique in generating competitive Go programs on a full-sized board. Some example of programs which have relied heavily on expert knowledge are Handtalk (later known as Goemate), The Many Faces of Go, Go Intellect, and Go++, each of which has at some point been considered the world's best Go program.
Nevertheless, adding knowledge of Go sometimes weakens the program because some superficial knowledge might bring mistakes: "the best programs usually play good, master level moves. However, as every games player knows, just one bad move can ruin a good game. Program performance over a full game can be much lower than master level."[36]
Monte-Carlo methods[edit]
One major alternative to using hand-coded knowledge and searches is the use of Monte Carlo methods. This is done by generating a list of potential moves, and for each move playing out thousands of games at random on the resulting board. The move which leads to the best set of random games for the current player is chosen as the best move. The advantage of this technique is that it requires very little domain knowledge or expert input, the trade-off being increased memory and processor requirements. However, because the moves used for evaluation are generated at random it is possible that a move which would be excellent except for one specific opponent response would be mistakenly evaluated as a good move. The result of this are programs which are strong in an overall strategic sense, but are imperfect tactically.[citation needed] This problem can be mitigated by adding some domain knowledge in the move generation and a greater level of search depth on top of the random evolution. Some programs which use Monte-Carlo techniques are Fuego, The Many Faces of Go v12, Leela, MoGo, Crazy Stone, MyGoFriend, and Zen.
In 2006, a new search technique, upper confidence bounds applied to trees (UCT), was developed and applied to many 9x9 Monte-Carlo Go programs with excellent results. UCT uses the results of the play outs collected so far to guide the search along the more successful lines of play, while still allowing alternative lines to be explored. The UCT technique along with many other optimizations for playing on the larger 19x19 board has led MoGo to become one of the strongest research programs. Successful early applications of UCT methods to 19x19 Go include MoGo, Crazy Stone, and Mango. MoGo won the 2007 Computer Olympiad and won one (out of three) blitz game against Guo Juan, 5th Dan Pro, in the much less complex 9x9 Go. The Many Faces of Go won the 2008 Computer Olympiad after adding UCT search to its traditional knowledge-based engine.
Machine learning[edit]
While knowledge-based systems have been very effective at Go, their skill level is closely linked to the knowledge of their programmers and associated domain experts. One way to break this limitation is to use machine learning techniques in order to allow the software to automatically generate rules, patterns, and/or rule conflict resolution strategies.
This is generally done by allowing a neural network or genetic algorithm to either review a large database of professional games, or play many games against itself or other people or programs. These algorithms are then able to utilize this data as a means of improving their performance. Notable programs using neural nets are NeuroGo and WinHonte.
Machine learning techniques can also be used in a less ambitious context to tune specific parameters of programs which rely mainly on other techniques. For example, Crazy Stone learns move generation patterns from several hundred sample games, using a generalization of the Elo rating system.[37]
Computer programs[edit]
- AYA by Hiroshi Yamashita
- Crazy Stone by Rémi Coulom (sold as Saikyo no Igo in Japan)
- DolBaram by Lim Jaebum
- Fuego, an open source Monte Carlo program
- Goban, Macintosh OS X Go program by Sen:te (requires free Goban Extensions)
- GNU Go, an open source classical Go program
- Go++ by Michael Reiss (sold as Strongest Go or Tuyoi Igo in Japan)
- Go Intellect by Ken Chen
- Handtalk/Goemate, developed in China by Zhixing Chen (sold as Shudan Taikyoku in Japan)
- Haruka by Ryuichi Kawa (sold as Saikouhou in Japan)
- Indigo by Bruno Bouzy
- Katsunari by Shin-ichi Sei
- KCC Igo, from North Korea (sold as Silver Star or Ginsei Igo in Japan)
- Leela, the first Monte Carlo program for sale to the public
- The Many Faces of Go by David Fotland (sold as AI Igo in Japan)
- MyGoFriend by Frank Karger
- MoGo by Sylvain Gelly; parallel version http://www.lri.fr/~teytaud/mogo.html by many people.
- Pachi open source Monte Carlo program by Petr Baudiš, online version Peepo by Jonathan Chetwynd, with maps and comments as you play
- Smart Go by Anders Kierulf, inventor of the Smart Game Format
- Zen by Yoji Ojima aka Yamato (sold as Tencho no Igo in Japan); parallel version by Hideki Kato.
Competitions among computer Go programs[edit]
Several annual competitions take place between Go computer programs, the most prominent being the Go events at the Computer Olympiad. Regular, less formal, competitions between programs occur on the KGS Go Server (monthly) and the Computer Go Server (continuous).
Prominent go-playing programs include Crazy Stone, Zen, Aya, Mogo, The Many Faces of Go, pachi and Fuego, all listed above; and Taiwanese-authored coldmilk, Dutch-authored Steenvreter, and Korean-authored DolBaram.
The first computer Go competition was sponsored by Acornsoft, and the first regular ones by USENIX. They ran from 1984 to 1988. These competitions introduced Nemesis, the first competitive Go program from Bruce Wilcox, and G2.5 by David Fotland, which would later evolve into Cosmos and The Many Faces of Go.
One of the early drivers of computer Go research was the Ing Prize, a relatively large money award sponsored by Taiwanese banker Ing Chang-ki, offered annually between 1985 and 2000 at the World Computer Go Congress (or Ing Cup). The winner of this tournament was allowed to challenge young players at a handicap in a short match. If the computer won the match, the prize was awarded and a new prize announced: a larger prize for beating the players at a lesser handicap. The series of Ing prizes was set to expire either 1) in the year 2000 or 2) when a program could beat a 1-dan professional at no handicap for 40,000,000 NT dollars. The last winner was Handtalk in 1997, claiming 250,000 NT dollars for winning an 11-stone handicap match against three 11–13 year old amateur 2–6 dans. At the time the prize expired in 2000, the unclaimed prize was 400,000 NT dollars for winning a 9-stone handicap match.[38]
Many other large regional Go tournaments ("congresses") had an attached computer Go event. The European Go Congress has sponsored a computer tournament since 1987, and the USENIX event evolved into the US/North American Computer Go Championship, held annually from 1988-2000 at the US Go Congress.
Japan started sponsoring computer Go competitions in 1995. The FOST Cup was held annually from 1995 to 1999 in Tokyo. That tournament was supplanted by the Gifu Challenge, which was held annually from 2003 to 2006 in Ogaki, Gifu. The UEC Cup has been held annually since 2007.
Rule Formalization Problems in computer-computer games[edit]
When two computers play a game of Go against each other, the ideal is to treat the game in a manner identical to two humans playing while avoiding any intervention from actual humans. However, this can be difficult during end game scoring. The main problem is that Go playing software, which usually communicates using the standardized Go Text Protocol (GTP), will not always agree with respect to the alive or dead status of stones.
While there is no general way for two different programs to "talk it out" and resolve the conflict, this problem is avoided for the most part by using Chinese, Tromp-Taylor, or AGA rules in which continued play (without penalty) is required until there is no more disagreement on the status of any stones on the board. In practice, such as on the KGS Go Server, the server can mediate a dispute by sending a special GTP command to the two client programs indicating they should continue placing stones until there is no question about the status of any particular group (all dead stones have been captured). The CGOS Go Server usually sees programs resign before a game has even reached the scoring phase, but nevertheless supports a modified version of Tromp-Taylor rules requiring a full play out.
It should be noted that these rule sets mean that a program which was in a winning position at the end of the game under Japanese rules (when both players have passed) could lose because of poor play in the resolution phase, but this is not a common occurrence and is considered a normal part of the game under all of the area rule sets.
The main drawback to the above system is that some rule sets (such as the traditional Japanese rules) penalize the players for making these extra moves, precluding the use of additional playout for two computers. Nevertheless, most modern Go Programs support Japanese rules against humans and are competent in both play and scoring (Fuego, Many Faces of Go, SmartGo, etc.).
Historically, another method for resolving this problem was to have an expert human judge the final board. However, this introduces subjectivity into the results and the risk that the expert would miss something the program saw.
Many programs are available that allow computer Go engines to play against each other and they almost always communicate via the Go Text Protocol (GTP).
GoGUI and its addon gogui-twogtp can be used to play two engines against each other on a single computer system.[39] SmartGo and Many Faces of Go also provide this feature.
To play as wide a variety of opponents as possible, the KGS Go Server allows Go engine vs. Go engine play as well as Go engine vs. human in both ranked and unranked matches. CGOS is a dedicated computer vs. computer Go server.
See also[edit]
- ^ http://www.chilton-computing.org.uk/acl/literature/reports/p019.htm
- ^ Millen, Jonathan K (April 1981). "Programming the Game of Go". Byte. p. 102. Retrieved 18 October 2013.
- ^ Webster, Bruce (November 1984). "A Go Board for the Macintosh". Byte. p. 125. Retrieved 23 October 2013.
- ^ Program versus Human Performance
- ^ See for instance http://www.intgofed.org/history/computer_go_dec2005.pdf Archived May 28, 2008 at the Wayback Machine
- ^ http://www.nwo.nl/nwohome.nsf/pages/NWOA_7HHBNS
- ^ Computer Beats Pro at U.S. Go Congress http://www.usgo.org/index.php?%23_id=4602
- ^ September 21, 2008; Volume 9, #49 SPECIAL EDITION!
- ^ Sensei's Library: MoGo
- ^ Crazy Stone defeated 4-dan professional player with a handicap of 8 stones.
- ^ "French software and Dutch national Supercomputer Huygens establish a new world record in Go". The Netherlands Organization for Scientific Research (NWO). 25 February 2009. Retrieved 2009-03-06.
- ^ Many Faces of Go defeated 1-dan professional player with a handicap of 7 stones.
- ^ AGA News
- ^ 2009 US Go Congress
- ^ 2009 IEEE International Conference on Fuzzy Systems
- ^ Computers vs Humans in Barcelona (WCCI 2010)
- ^ Computer program Zen with 6 stone handicap beat professional 4 dan Ping-Chiang Chou of Taiwan
- ^ Computer program MogoTW with 7 stone handicap beat European professional 5 dan Catalin Taranu
- ^ a b Sensei's Library KGS Bot Ratings
- ^ a b http://www.gokgs.com/gameArchives.jsp?user=+Zen19D
- ^ http://www.lifein19x19.com/forum/viewtopic.php?f=18&t=5572
- ^ "「アマ六段の力。天才かも」囲碁棋士、コンピューターに敗れる 初の公式戦". MSN Sankei News. Retrieved 27 March 2013.
- ^ Wedd, Nick. "Human-Computer Go Challenges". Computer Go Information. Retrieved 27 June 2013.
- ^ codecentric go challenge
- ^ codecentric go challenge
- ^ Game Tree Searching with Dynamic Stochastic Control pp. 194–195
- ^ 5×5 Go is solved by MIni GO Solver
- ^ On page 11: "Crasmaru shows that it is NP-complete to determine the status of certain restricted forms of life-and-death problems in Go." (See the following reference.) Erik D. Demaine, Robert A. Hearn (2008-04-22). "Playing Games with Algorithms: Algorithmic Combinatorial Game Theory". arXiv:cs/0106019.
- ^ Marcel Crasmaru (1999). "On the complexity of Tsume-Go". Lecture Notes in Computer Science. Lecture Notes in Computer Science (London, UK: Springer-Verlag) 1558: 222–231. doi:10.1007/3-540-48957-6_15. ISBN 978-3-540-65766-8.
- ^ See Computer Go Programming pages at Sensei's Library
- ^ "The Go-Playing Program Called Go81" by Tapani Raiko
- ^ example of weak play of a computer program
- ^ WinHonte 2.01
- ^ a b Müller, Martin. Computer Go, Artificial Intelligence 134 (2002): p150
- ^ Müller, Martin. Computer Go, Artificial Intelligence 134 (2002): p151
- ^ a b Müller, Martin. Computer Go, Artificial Intelligence 134 (2002): p148
- ^ Computing Elo Ratings of Move Patterns in the Game of Go
- ^ World Computer Go Championships
- ^ Using GoGUI to play go computers against each other
Further reading[edit]
- Co-Evolving a Go-Playing Neural Network, written by Alex Lubberts & Risto Miikkulainen, 2001
- Computer Game Playing: Theory and Practice, edited by M.A. Brauner (The Ellis Horwood Series in Artificial Intelligence), Halstead Press, 1983. A collection of computer Go articles. The American Go Journal, vol. 18, No 4. page 6. [ISSN 0148-0243]
- A Machine-Learning Approach to Computer Go, Jeffrey Bagdis, 2007.
- Minimalism in Ubiquitous Interface Design Wren, C. and Reynolds, C. (2004) Personal and Ubiquitous Computing, 8(5), pages 370–374. Video of computer Go vision system in operation shows interaction and users exploring Joseki and Fuseki.
- Monte-Carlo Go, presented by Markus Enzenberger, Computer Go Seminar, University of Alberta, April 2004
- Monte-Carlo Go, written by B. Bouzy and B. Helmstetter from Scientific Literature Digital Library
- Static analysis of life and death in the game of Go, written by Ken Chen & Zhixing Chen, 20 February 1999
- article describing the techniques underlying Mogo
External links[edit]
|Wikibooks has a book on the topic of: Computer Go
- video: computer Go to come
- Mick's Computer Go Page
- Extensive list of computer Go events
- All systems Go by David A. Mechner (1998), discusses the game where professional Go player Janice Kim won a game against program Handtalk after giving a 25-stone handicap.
- Kinger, Tim and Mechner, David. An Architecture for Computer Go (1996)
- Computer Go and Computer Go Programming pages at Sensei's Library
- Computer Go bibliography
- Another Computer Go Bibliography
- Computer Go mailing list
- Published articles about computer Go on Ideosphere gives current estimate of whether a Go program will be best player in the world
- Information on the Go Text Protocol commonly used for interfacing Go playing engines with graphical clients and internet servers
- The Computer Go Room on the K Go Server (KGS) for online discussion and running "bots"
- Two Representative Computer Go Games, an article about two computer Go games played in 1999, one with two computers players, and the other a 29-stone handicap human-computer game
- What A Way to Go describes work at Microsoft Research on building a computer Go player.
- Cracking Go, by Feng-hsiung Hsu, IEEE Spectrum magazine, October 2007 argues why it should be possible to build a Go machine stronger than any human player


text:
DVD Reviews, 27th October, 2013
- From: Sunday Tasmanian
- October 27, 2013
DVD Reviews for the 27th October, 2013
The Purge [MA]
Stars: Ethan Hawke, Lena Headey
Director: James DeMonaco
Available: Now on DVD and BD
A HORROR / thriller where a US society has legalised violence and crime for one night should have said a lot about its culture (the fact that it exists says something I guess) but sadly this is mostly about the blood-letting.
Epic [PG]
Stars: Amanda Seyfried, Colin Farrell
Available: Now on DVD and BD
THE story might not dazzle nor the world fully enchant but the animation in this family friendly tale about pixie-like woodland critters at war over the forest is downright stunning.
Hummingbird [MA]
Stars: Jason Statham, Agata Buzek
Director: Steven Knight
Available: Now on DVD and BD
JASON Statham continues to expand out from his kicky and punchy ways this time in a light action drama about an AWOL soldier with post-traumatic stress disorder who's trying to clean up his life and the streets of London.
The Internship [M]
Stars: Vince Vaughn, Owen Wilson
Director: Shawn Levy
Available: Now on DVD and BD
VINCE Vaughn and Owen Wilson's comedy partnership underwhelms to the point of disappointment in this "meh" comedy about a couple of outdated salesman who talk their way into internships at Google.

subset: commoncrawl


text:
Friday, January 20, 2012
Saturday, January 21, 2012
501 4th Street, NW
Washington, DC 20001
Program Information
Some of our greatest music comes out of our most troubled times. Slavery. Assassinations. The throes of worldwide war.
Performing our 8th annual winter concert, the 18th Street Singers present "In These Our Darkest Hours." The subjects of these pieces – and often their composers – faced some of history's most difficult circumstances, yet inspired fantastic works of music that impacted generations to come. This program explores the musical legacy of our toughest times and the human spirit that endures through them.
Program includes works from classical icons Francis Poulenc, Felix Mendelssohn, and Samuel Barber, plus music from U2, Sweet Honey in the Rock, and the rich tradition of American spirituals.
Please join us for a light reception in the church following the concert.


text:
jGuru Forums
Posted By:
Posted On:
Sunday, March 24, 2002 01:07 AM
I wrote a tcp/ip client application and it suffers from a big memory leaks.
Using OptimizeIt tool I found out that most of the memory usage is in the following classes:
int[] - 8940 objects
char[] - 4568 objects
java.lang.String - 4445 objects
object[] - 6381 objects
short[] - 1943 objects
java.util.Hashtable$Entry 2074 - objects
java.lang.Class - 1246 objects
byte[] - 1289 objects
When I entered each one of the objects in the above list I noticed that about 60% of the memory in each object is in java.awt.EventDispatchThread.run().
I don't know what it means.
How can I avoid it ?
Another question that may be related to the above problem is - Do I need to do something with the events or actions (any clean up) when for example a button listener gets an event and calls the action procedure.
All my application future is depends whether this memory problem will be fixed so anyones help will be welcomed.
Lior Cohen.


text:
Jim McClure
- Filed Under
Bill Dutton has been appointed interim director of operations for the Roscoe Village Foundation effective March 1, following the resignation of Executive Director James H. McClure Jr.
McClure has been chief executive officer of the foundation since December 2006. He left his position effected Feb. 8 to pursue other endeavors, said Ann Simpson, president of the foundation board of trustees.
During his tenure at Roscoe Village McClure has worked to continue the focus of the Roscoe Village Foundation mission: the preservation, restoration and interpretation of Roscoe's heritage during the Ohio canal period.
Dutton is currently a member of the Montgomery Foundation Board and will take a leave of absence to serve as Interim Director for the Roscoe Village Foundation. Chad Miller will be the village contact until Dutton's start date.


text:
New from Lagos del Mundo, a project showcasing Mexican craftsmanship, the hand woven basket is made in the state of Guerrero in the South of Mexico. Baskets have been used since ancient times to help people carry and contain food. They continue to adapt with time and today they are often used for decoration. Made from durable, lightweight palm with hand sewn leather handles.
- Designer : Lagos del Mundo
- Material : Palm
- Dimensions : 17" diameter x 16"h
- Product: Basket
- Brand: Lagos del Mundo
- Retailer: Merchant No. 4
- Designer: Lagos Del Mundo
Have an opinion? Care to comment? We'd love to hear what you have to say.


text:
12 extra pages of Black Friday DEALS
in our online flyer
View Black Friday Flyer
From computer glitches to smartphone mishaps, Geek Squad can save the day. Our Agents are ready and waiting to set up, support, protect and repair.
Let us help you recycle your old and unwanted electronics. Find out more Best Buy's commitment to the environment and how your province is working to make a difference.
The Parts Store has millions of parts for your appliance, electronic, and wireless device needs, so if there's something you're looking for, chances are they've got it.
With our team of experienced, non-commissioned Consultants making a claim will be less stressful. They can help you replace your lost goods quickly and easily.
Best Buy's Trade-In Program is a great way to trade your gently used electronics for a Best Buy Canada gift card that can be used in-store or online.
Never miss a deal. Sign up for the newsletter.
Join the conversation and learn more about the latest gadgets, technology, and more with Plug-In. Become a member and be a part of the community.
Discuss topics, share your tips and tricks, and check out what products everyone is raving about.
Get the latest news and reviews about technology, movies, music, and so much more.
Skylake: Intel's 6th generation Core chips
Check it out >
When you accumulate enough points to earn a certificate based on your certificate amount preference, you will receive a notification e-mail.
We will automatically issue your certificate in your online account and deduct the corresponding points.
Reward certificates will be automatically sent to you via email for viewing and printing as well as made available in your Reward Zone online account.
Redeeming a reward certificate is easy! If you haven't already, log in to your Reward Zone™ account and print your certificate. Simply bring it to your local Best Buy store and use it like cash.
Sign in to print certificates >
Note: Reward certificate redemption is not yet available at BestBuy.ca
DOOR CRASHER DEALS on Computers, Tablets & Accessories
Shop Now
DOOR CRASHER DEALS on TVs & Home Theatre
SAVE UP TO $1000 on Major Appliances
SAVE ON OVER 2000 Baby Essentials
NEED HELP? Give us a call at 1-866-BEST-BUY (237-8289)
© 2015 Best Buy Canada Ltd. All rights reserved. For personal, noncommercial use only.


text:
The Environmental
Performance Measurement Project
aims to shift environmental decision-making to firmer analytic
foundations using environmental indicators and statistics. In
collaboration with the Center
for International Earth Science Information Network (CIESIN)
at Columbia University, and the World
Economic Forum, the project produces a periodically updated
Environmental Sustainability Index (ESI). The ESI is a composite
index tracking a diverse set of socioeconomic, environmental,
and institutional indicators that characterize and influence environmental
sustainability at the national scale. An Environmental Performance
Index focusing on assessing key environmental policy outcomes
using trend analysis and performance targets is under development.
Please contact us via email at firstname.lastname@example.com
or via telephone at 203.432.3123, with any questions or concerns.
2005 Environmental
Sustainability Index: Benchmarking National Environmental Stewardship
The Environmental Sustainability Index was formally released in
Davos, Switzerland, at the annual meeting of the World Economic
Forum on Friday, 28 January 2005. The full report in PDF format
is available for download below.


text:
Daily NewsView All News
Around the Web – Zimbabwe condemns illegal "labour brokers"
The government in Zimbabwe has warned firms not to make use of "middlemen" when looking to hire new staff as labour broking or subcontracting remains illegal in the country, All Africa writes.
"Labour broking is mostly prevalent in South Africa and Namibia, but here it's illegal and perpetrators face prosecution," warned the director of labour administration at the Ministry of Labour and Social Services, Paul Dzvit.
In Zimbabwe the practice of labour broking is illegitimate according to the Labour Act. But companies still make use of subcontractors who mainly send workers into the food industry, including for firms such as Schweppes who recently lost an arbitration hearing.
One of the directors acting as a labour broker defended the practice. "Workers should not complain about our agreement as they are paid well and in time. The minimum wage here is US$317, and they should be grateful," said Osnath Dube of Weberly Investments.


text:
- Equipment World - http://www.equipmentworld.com -
Oldcastle's APAC-Texas acquire 2 sand and gravel company assets
Posted By Equipment World Staff On February 11, 2011 @ 1:10 am In Construction News | No Comments
APAC-Texas Inc., part of Oldcastle Materials Inc., has acquired the assets of two independent sand and gravel companies operating in Austin.
The three sand and gravel plants of Shumaker Enterprises and Austin Reclaimed Materials' single location will be combined and operated under the name of Austin Aggregates. These acquisitions mark Oldcastle Materials' entry into the Austin aggregate market and will enhance the ability of the operations to serve their customers with a full line of materials and paving products.
Based in Atlanta, Ga., Oldcastle Materials is a vertically integrated supplier of aggregates, asphalt, ready mixed concrete and paving services in the United States with operations at 1,400 locations nationwide.The company operates under the North American arm of international building supply company CRH plc, based in Dublin, Ireland.
Article printed from Equipment World: http://www.equipmentworld.com
URL to article: http://www.equipmentworld.com/oldcastles-apac-texas-acquire-2-sand-and-gravel-company-assets/
Click here to print.
Copyright © 2012 Equipment World -- Development. All rights reserved.


text:
+ Reply to Thread
Results 1 to 3 of 3
Thread: Red, blotchy rash
Red, blotchy rash
My 8 month old daughter has developed a rash and I wondered if anyone could help me figure out what's causing it.
It started last night with faint blotchy patches on her head. The blotches were small in size, it looked quite rashy but not angry. This morning it was slightly worse but not too much so and she's seemed fine in herself (a little grumpier than usual), so I thought I'd give it another day before going to the doctors. Throughout this afternoon and this evening it's gotten worse - it looks much more red, the rash is more dense and has spread to her belly and back. I'm going to take her to be checked over in the morning but in the meantime wondered if anyone had experienced similar?
With regards to her general health, she did have a low grade fever 4 days ago which I put down to teething - her bottom two teeth have just popped through. She has had some runny poos and has been grumpy but again I had put that down to teething. As for allergies - her washing powder is the same I haven't introduced any new foods.
Would greatly appreciate any thoughts!
- Join Date
- Jun 2011
- Posts
- 12,385
Hi Katherine
How is she in herself? Does she have a temperature at this moment?
Is she eating and drinking ok?
It is so difficult to know what it could be without seeing your little one, we do have a section here at Netmums all about Childhood rashes just here.
Can you come back to us and let us know how she is Katherine
I'd definitely check with the doctor but my lo had the same sort of rash over the weekend. it was red blotchy and slightly raised. She didn't itch and seemed ok in herself, maybe a bit grumpy. She is also teething. I took her to the doctors and they said it was a viral rash. They couldn't be specific about what had caused it but said it was nothing to worry about. They told me to wait a few days and it would go by itself. I found it quite upsetting to see her usually perfect skin all red and spotty but sure enough a few days on and it's nearly all gone.
Hope you lo is ok too


text:
|Preoperative management of the patient with coronary artery disease before abdominal aortic surgery.
MedLine Citation:
|PMID: 3496947 Owner: NLM Status: MEDLINE
|Coronary artery disease accounts for more than half of the morbidity and mortality associated with abdominal aortic surgery. To improve the results of vascular surgery, the risk of perioperative cardiac ischemia should be evaluated in each patient. Routine coronary angiography demonstrated severe correctable coronary artery disease in 14% of patients who had no history or electrocardiographic evidence of coronary artery disease. Exercise testing before abdominal aortic aneurysm repair will identify patients at high risk of cardiac ischemia. Dipyridamole-thallium imaging will identify high-risk patients before surgery for aortoiliac occlusive disease. Some patients with symptomatic coronary disease who are at extremely high risk should undergo preoperative coronary revascularization. Others should have their vascular surgery deferred, because their cardiac risk may exceed the anticipated benefit of the vascular surgery. Patients at moderate risk may need more intensive intraoperative monitoring. Patients without evidence of cardiac ischemia with stress may undergo vascular surgery with a low risk of perioperative cardiac ischemia. Finally, patients who have evidence of ischemic heart disease should be considered for coronary revascularization following successful vascular repair in order to prolong their survival.
|R D Weisel
Related Documents :
|1447267 - Influence of coronary artery disease and left ventricular dysfunction on postoperative ...
15993647 - To examine the effectiveness of a hospital-based nurse-led secondary prevention clinic.
8010337 - Perioperative myocardial infarction with noncardiac surgery.
4030147 - Type a behavior and myocardial infarction. a 9.5-year follow-up of a small cohort.
7479447 - Congestive heart failure. considerations for primary care physicians.
17153517 - Particulate air pollution and nonfatal cardiac events. part i. air pollution, personal ...
Publication Detail:
|Type: Journal Article; Research Support, Non-U.S. Gov't
Journal Detail:
|Title: Canadian journal of surgery. Journal canadien de chirurgie Volume: 30 ISSN: 0008-428X ISO Abbreviation: Can J Surg Publication Date: 1987 Jul
Date Detail:
|Created Date: 1987-09-02 Completed Date: 1987-09-02 Revised Date: 2007-08-16
Medline Journal Info:
|Nlm Unique ID: 0372715 Medline TA: Can J Surg Country: CANADA
Other Details:
|Languages: eng Pagination: 237-9 Citation Subset: IM
Export Citation:
|APA/MLA Format Download EndNote Download BibTex
|MeSH Terms
Aorta, Abdominal
Aortic Aneurysm / surgery
Aortic Diseases / surgery*
Coronary Artery Bypass
Coronary Disease / diagnosis*, radiography, surgery
Exercise Test
Preoperative Care*
From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine
Previous Document: Endophthalmitis due to Oerskovia xanthineolytica.
Next Document: Preservation of platelets and blood products by intravenously administered dipyridamole in patients ...


text:
I'm going to try to pay more attention to the group, though I'm not otherwise active in the dA community anymore. I may not post blog entries too regularly, but I check the group messages almost daily and there's always something to add to the gallery.
As for the gallery, when I first opened the group I tried to be "fun!" with the titles of the folders. I've changed them to be sensible, though uninspired titles. Folder names don't need to be artsy, that's the contents' job.
To be honest, the Guild is also a dark group as well, not strictly horror anymore. I don't think that quite warrants a name change, and besides, horror art is and always was the main contribution. Please, though, don't submit stick figures. Yes, this has actually happened before. Yes, on one more than one occasion. I try to accept all levels of technique, but for the love of Hell, submit pieces that took some effort.
In closing: to all my new members, my Bloody Pocketknives, welcome! To all my veterans, I'm grateful you're still with me!
Please read the rules on the front page, as they have recently been edited.


text:
Detroit's downtown and Midtown have seen plenty of investment and redevelopment, but not much in the ways of affordable housing. / 2012 photo by Carlos Osorio/Associated Press
More than $250 million for nothing.
Thats the new baseline for widespread returns on public development investment in Detroit at a time when the citys broke, and when the debate about the revitalization gap between the citys core and its neighborhoods is as heated as ever.
Detroit is lost, it seems, when it comes to translating big wins in the citys core into benefits for most of the people who live here, and we need both city and state government to step it up when it comes to balancing the swell of good fortune thats overtaking parts of the city.
■ Full coverage: Detroits financial crisis
The citys development arms and the state will spend $261 million to build a new downtown hockey arena for the Detroit Red Wings, whose billionaire owner will chip in about $189 million of the cost.
■ Related: Detroit Red Wings' new stadium land transfer approved by City Council
But its also true that the deal doesnt include any agreement for community benefits so no guaranteed jobs for Detroiters, only targets that may or may not be met; no spinoff investment by the Ilitch family into programs or brick-and-mortar into struggling neighborhoods.
■ Related: Ilitches to get all revenues from new publicly financed Red Wings arena
■ Related: New Red Wings arena project should mean jobs for Detroiters, groups say
The deal got approved a few weeks ago, but it kept coming to mind this week during panels I moderated about development at the Environmental Grantmakers Association meeting and the Detroit Policy Conference. Its also exactly the kind of shortsighted policy that historian Tom Sugrue decried in a Q&A in the Free Press last Sunday.
■ Sugrue: Trickle-down urbanism won't work in Detroit
■ Chat replay: Urban studies expert Tom Sugrue, discusses Detroit's future with readers
The citys rebound is doomed to fail if it doesnt expand from downtown and Midtown to Detroits hardest-hit areas and most economically isolated people. Thats the message I heard over and over this week, and one thats echoing louder and louder in the conversation about how to get the city back on its feet.
But look where we are: State and local governments agree to a massive public investment in a downtown stadium but cant manage even the most meager benefits agreement.
That makes it difficult to imagine how affordable housing agreements might be included in upcoming residential projects around the citys core, or how benefits to public schools might be siphoned out of high-end commercial developments.
The stadium will bring people and some economic activity (how much is debatable, according to many studies) to an area that doesnt have them now, but theres no guarantee it will do anything more.
This is precisely what Sugrue, author of The Origins of the Urban Crisis: Race and Inequality in Postwar Detroit and a lecturer about Detroit and other struggling urban centers, says is the wrong strategy.
The kinds of jobs that are being created by a lot of the downtown redevelopment are jobs for folks who have significant education, skills and means already, Sugrue told Free Press reporter John Gallagher last week. Theyre not, by and large, creating stable secure jobs for folks down the ladder, for working-class folks, in particular.
In some cases, were seeing others step up to ensure that development is more inclusive; theyre playing the role without any requirements.
Midtown Inc., which is responsible for much of the development and buzz that transformed the area around Wayne State University and the Medical Center, typically strives for a mix of market-rate and affordable housing.
Last week, it announced a rehab of the abandoned Strathmore Hotel into a residential development, and it will be split 60-40 between market and affordable housing. At the Auburn on Cass Avenue, the breakdown is 80-20; and at the Garfield Building on Woodward, its 70-30.
It can take a little longer and be a little more difficult to finance projects that way, Midtown CEO Sue Mosey said. But its possible, and we think its important.
Mosey said the government funding that helps finance her projects often doesnt require any affordable housing set-asides. At the Strathmore, for instance, the Michigan Economic Development Corporation approved tax credits to help with the development; but that money comes with no obligations to supply affordable housing.
Similarly, the controversy over redevelopment of a low-income Capitol Park apartment building arises from government exercising no pressure on developers to think about current residents.
The development is necessary; the citys core has been neglected far too long. But without widespread benefits, its not a solution to the citys deepest problems.
More than $250 million for nothing. Thats where were starting.
Government here can do far, far better at making public and private investment pay off for everyone in Detroits rebirth.
Stephen Henderson is editorial page editor for the Free Press and the host of American Black Journal, which airs at 12:30 p.m. Sundays on Detroit Public Television. Contact him at 313-222-6659 or firstname.lastname@example.com.


text:
Fantasy Casting
Neeson to star as Zeus in `Clash of the Titans'
LOS ANGELES (AP) -- Liam Neeson is set to begin work on his first film since the death of wife Natasha Richardson.
Neeson will play Zeus in a remake of "Clash of the Titans" opposite Ralph Fiennes.
Louis Leterrier will direct the film, which is scheduled to begin production in the United Kingdom later this month.
The original "Clash of the Titans" from 1981 starred Laurence Olivier as Zeus.
This marks the first project for the 56-year-old Neeson since Richardson's death in a skiing accident. The 45-year-old actress died March 18 after falling and hitting her head during a lesson in Quebectwo days earlier. He had signed on to star in the movie before her death.
Most Watched on Wonderwall
Fashion Offenders
Fergie, Sarah Jessica Parker, and Heidi Klum all get an F on this week's Fashion Offenders.Watch Video »
Diva Double Date
Beyonce and Alicia Keys double date with their famous hubbies on today's Celebs Gone Social.Watch Video »
Where Are They?
See what the cast of "American Beauty" is up to today.Watch Video »
J.Lo's Mini Me
Jennifer Lopez shares an adorable photo of her look-alike daughter, plus more celebritots on social media on today's Celebs Gone Social.Watch Video »
First Pitch
Prince Harry, Jessica Alba and more stars who threw out the first pitch at baseball games.Watch Video »
Aussie Babe
Sofia Vergara poses in a revealing neon bikini while her "Modern Family" castmates hit the beach in Australia on Celebs Gone Social.Watch Video »


text:
This guide, adapted from AAMC, provides answers to frequently asked questions about M.D.-Ph.D. programs.
The Career Development and Diversity Center at Stanford learned valuable lessons about designing a team science training program.
One factor common to scientists working in all parts of the translational realm is the ability to truly collaborate with people across disciplines. Listen to four scientists at a 2009 workshop organized by Science Careers discuss their own transdisciplinary approach.
Conveying complex material during a scientific presentation is difficult for everyone, but it's especially challenging for speakers who aren't fluent and confident in the conference language.
Workplace stress is intensifying in the sciences. Here are some ways of dealing with it.
The key to success is being flexible and open to change as well as having a collaborative spirit.
A Science/AAAS Custom Publishing Office feature.
Enter keywords, locations or job types to start searching for your new science career
Opening a free account lets you utilize all the tools you'll need for a successful job search including:
Register now
© 2015 American Association for the Advancement of Science. All Rights Reserved.
AAAS is a partner of HINARI, AGORA, OARE, PatientInform, CrossRef, and COUNTER.
You have reached the bottom of the page. Back to top


text:
Two pizza delivery employees reported that they were robbed at gunpoint in York Sunday night, according to York City Police.
Eduardo Llamos and William Santiago said they were robbed by unknown suspects while they were delivering pizza in the 300 block of Brooklyn Avenue at 11:50 p.m. Sunday, police said.
York City Police Chief Wes Kahley said Thursday the practice of criminals preying on delivery drivers is unfortunately, nothing new. "That's been going on for as long as I've been here (at the department)," he said.
Kahley added that his officers see a spike in "street-type robberies" during the holidays.
"It always seems to be around the holidays -- I don't know if people are trying to get money for Christmas," he said. "Maybe there's more people on the street with cash for the holidays."


text:
December 1, 2015
ATLANTA (AP) - U.S. Customs and Border Protection agents at the world's busiest airport say they've foiled a destructive beetle from entering the country, where it could have done massive damage to crops.
Customs officers at Atlanta's Hartsfield-Jackson International Airport said Tuesday they recently intercepted the khapra beetle in the luggage of two passengers arriving from India.
Authorities say experts at a federal lab confirmed it was the khapra beetle, one of the world's most destructive pests which attacks stored seed and grain products.
Customs officials said that a khapra beetle outbreak in the U.S. could cost millions of dollars in cleanup efforts. They said the damage could lead to tremendous economic losses to seed and grain producers because other nations would likely impose quarantine restrictions on contaminated exports of U.S. grain.
Click Here to access the online Public Inspection File
Viewers with disabilities can get assistance accessing this station's FCC Public Inspection File by contacting the station with the information listed below. Questions or concerns relating to the accessibility of the FCC's online public file system should be directed to the FCC at 888-225-5322, 888-835-5322 (TTY), or email@example.com.


text:
December 1, 2015
James E. Holmes appears in Arapahoe County District Court, Monday, July 23, 2012, in Centennial, Colo. (AP Photo/Denver Post, RJ Sangosti, Pool)
CENTENNIAL, Colo. (AP) -- Defense lawyers say the man charged with the Colorado movie theater killings has an unspecified condition that will keep him from attending a court hearing scheduled for Thursday.
Court documents filed Wednesday didn't give any details of James Holmes' condition. The documents said only that Holmes' condition "renders him unable to be present in court for (Thursday's) hearing."
The defense asked the judge to postpone the hearing, which was scheduled to discuss pretrial motions and media requests for information under state open records laws.
A judge will hold a hearing Wednesday to consider the request.
The 24-year-old Holmes is charged with killing 12 people and injuring at least 58 by opening fire in a crowded theater on July 20.
He's being held without bail and hasn't entered a plea.
Click Here to access the online Public Inspection File
Viewers with disabilities can get assistance accessing this station's FCC Public Inspection File by contacting the station with the information listed below. Questions or concerns relating to the accessibility of the FCC's online public file system should be directed to the FCC at 888-225-5322, 888-835-5322 (TTY), or firstname.lastname@example.com.


text:
Ok, I might regret this someday, but other projects beckon. I got this a few years back and it has created some of my finest negatives. Unfortunately, I've never quite bonded with the camera itself and after stepping back into LF, I find myself really wanting the view camera experience once again. But to be perfectly honest, this is going to help fund a Engagement ring, so there's that too.
I literally just got it back from Precision Camera Works who put in the new and improved prism (which Mamiya later released to the relief of camera repairmen), calibrated the rangefinder to each lens, and gave the body a full CLA since the advance mechanism and curtain weren't perfectly smooth anymore. Effectively this thing is better than new in some regards, as Mamiya later released parts to repairshops responding to user complaints. You can see the $400 invoice in the picture. Total rolls through the camera border on 250-350. That's it.
So here she is, Mamiya 7II body, 43mm lens with viewfinder and hood, 80mm lens (no hood...fell off a cliff), 150mm lens with hood, all caps, and the 135mm panoramic adapter. The lenses are LN condition and the body has a few little rub marks anf faint scratches on the bottom and one of the sides from handling and the tripod.
I have a busy weekend ahead of me, but wanted to get this off my chest as not to be distracted. This camera has treated me very well and the glass is simply astonishing, but alas, time to move on to different things. I'm asking $3,200, shipped here in the USA. I'll take care of packing and insuring it to whoever buys. Also, money will be fed back into APUG.
Thanks for looking,


text:
Fragmentos e Souvenirs paulistanos, Vol.1
Galeria Luisa Strina, Sao Paulo, Brazil
Before I left for São Paulo, my grandmother warned me that thieves would cut off my fingers to get my rings, and friends said I could watch a local television station dedicated to reporting nothing but the day's murders and violent crimes. While there was no truth to these tales, the city did seem to be too vast and dangerous to allow for any romantic sense of discovery on foot or a feeling that I could access it merely through an abundance of time, curiosity or meditation. Neither residents nor tourists here have the luxuries of the flâneur – and neither do the city's artists.
'Fragmentos e Souvenirs Paulistanos, Vol.1' (Fragments and Souvenirs Paulistanos, Vol.1), an exhibition spread over three gallery floors that gathered impressions of São Paulo from local and international artists, confirmed that this particular metropolis is best seen from a distance – both the distance provided by the gallery itself (located on a sheltered, up-market street) and that afforded by Conceptual artistic approaches. As the exhibition's title suggests, the most authentic view of São Paulo is one generated by fruitless navigations, fragmentary memories and the piecing together of the physical remainders or everyday objects that conjure them up. These 'souvenirs', like one of Franz Ackermann's 'mental maps' (1994– ongoing), say less about the place we visited than our memories of the experience there. The impression of the metropolis we're left with is chaotic, incomplete and often incorrect.
Armin Linke's Favela Paraisópolis, São Paulo, Brazil (2001) both confronts and confirms outsiders' prejudices about the city's social problems. In the foreground a young kid with a loose shirt falling from his shoulders faces the camera with indifference as he slogs up a street beneath a criss-cross of telephone lines. Behind him the makeshift brick and tin roofed dwellings of the favela where he lives are overshadowed by the towering high-rises of one of São Paulo's richest neighbourhoods. All of it can be seen with Thomas Struth-ian clarity, as a clichéd observation of the proximity of the city's wealthy and its poor.
If every work in the show had attempted to illustrate São Paulo's social paradoxes, the result would have been a collection of literal interpretations that criticize or romanticize this condition. Luckily other works said more about the city with less information. Objects drawn from its urban fabric, sometimes imitating the agglomeration of tacked-on pieces or the scraps of materials that often seem to make up its streets and buildings, were recontextualized in the gallery, frequently employing the languages of Minimalism and Conceptualism. Artists recycled such everyday objects as tennis shoes, newspapers and coins as metaphors for specific social conditions. Jac Leirner's Adesivo 41 (Cavellini 2) (Sticker 41 (Cavellini 2) 2004) is an assemblage of found stickers and paper scraps arranged on Perspex, but to no greater effect than simply to create order out of the city's detritus. The Brazilian artist Marepe leaned a prefabricated wooden door against the wall as if awaiting hinges or a layer of paint. But next to it the artist fabricated a matching window out of wood (A Porta e a Janela, A Door and a Window, 2004) – the door was no longer a ready-made but a sophisticated elaboration on a piece of two by four, or
a piece of local artisanship.
The majority of works were made through a subtraction of information or a withholding of facts and observations. Marcius Galan's Foco (Focus, 2004), two framed white surfaces dotted with clusters of red pins, seemed to represent a concentration of crime scenes or some other grim statistic. But there was no legend to this map, nor any lines or boundaries. A piece that at first promised to provide statistical information turned out to be a kind of voodoo or acupuncture on paper. Similarly Jorge Macchi's As Folhas Mortas (Two Empty Folha de Sao Paulo) I (2004) is a delicate lacework
Christy Lange


text:
Belfast is the capital of Northern Ireland and with a population of around 270,000 is the United Kingdom's 14th largest city. Its unique history, which has seen it play a leading role in the linen industry, rope-making, tobacco production and most recently shipbuilding, is visible throughout the city. Visitors flock to experience the Titanic quarter, including the Titanic Dock and Pump House, where the famous ship last rested on dry land. The City Hall also symbolises Belfast at the height of the Industrial Revolution. Other attractions include Ulster Museum, home to exhibitions of art, history and natural science and Crumlin Road Gaol, where many notorious executions took place throughout the twentieth century. For those staying more than a few days, the awe-inspiring Giant's Causeway is a worthwhile day trip.
In recent years Belfast has put all its efforts into becoming a top tourist destination and its accommodation is truly world-class. In the top end range, a massive regeneration project on the waterfront has seen old shipyards converted into luxury apartments. But there are hotels to suit everyone's budget, with cheap quality accommodation near Queen's University and mid-range to luxury hotels around the shopping districts of the Golden Mile and Shaftesbury Square.
Belfast has two airports, Belfast International and George Best City Airport. It is also accessible by ferry from several destinations in Scotland and northern England, as well as by train from all major cities around Ireland and Northern Ireland. Getting around the city could not be easier, with buses running every 10 minutes until 11pm, when they are replaced by regular night buses. Visitors can explore the city centre on foot or by bicycle


text:
Meet samuiintern
Travelfish contributions by samuiintern
The first number represents the total number of published reviews by samuiintern. The bracketed figure is submitted reviews -- reviews may not be published for editorial reasons or may be removed because the property concerned has been delisted from Travelfish or has closed.
Life according to samuiintern
We are a husband and wife team who have been travelling the world together for the past 6 years. Originally from the UK we have worked and lived on 4 continents - at the minute we are calling Koh Samui home.
Past travels
Future travels
The lowdown
Age: In the region of 30-39
Currently hanging out in: Thailand
Boy or girl: Male
Webpage: -
Travelfisher since: 22nd June, 2012
Travelfish member #: 71,337


text:
Travelling doesn't also have to imply an extended trip throughout the world. Many enjoyable spots to visit are almost within your backyard or maybe a day's drive away. This article can help you to prepare journeys that happen to be each exciting and cost-effective. Travelling is about meeting new men and women and wherever you go, you will always find new facial looks.
Make sure that you do not be enticed by any 'sight seeing' journeys from an individual you meet on the neighborhood. These individuals typically are trying to swindle you, grab by you, or even worse. Stay to the prepare and you should not speak with total strangers that are attempting to provide you with anything for money.
Think about inquiring your family members medical doctor to get a referral to a traveling expert before you decide to vacation. A journey treatments professional is skilled in the kinds of prescription drugs you require before you visit a certain region on earth. They could give required vaccines and medications that you can get, like contra –malarial supplements, and can know a lot better than a family group medical doctor just what the guidelines are.
Some advice most of us neglect, alter the bed sheets in case you are staying anywhere more than a day or two. During getaway, we have a tendency to assume that we have been in a marvelous entire world exactly where standard points don't can be found. Even so, they do, and in case we just forget about them, you are able to suffer from unsightly infections particularly if you are residing in a comfortable weather. Maintain your bedding alterations on a regular basis.
When you are traveling to some international country, prevent dressing up in ways that markings you like a well-off visitor. Wear typical, informal garments and don't dress in expensive timepieces, jewelry, video cameras, and other things which can get in touch with attention to you. Try not to bring many things together with you in the daytime, to avoid owning your issues shed or taken.
If you're going on a luxury cruise, be sure you load an electric power strip along. Most bedrooms aboard cruise liners will simply have 1 (probably two) potential outlets. If you have numerous devices that will have to be plugged, in you'll be happy you introduced an electrical strip as an alternative to fighting above shops.
Think about your most affordable type of journey! At times, it may well seem sensible to get a close distance in an a couple of state radius, but will it be cost effective? At times airlines or trains will offer inexpensive bargains to in which you are planning to go and it may help save you lots of time and money by looking at into this ahead of your departure.
As noted at first of the post, travel doesn't must imply an extended, prolonged excursion in the continents. It could basically mean per day vacation to a new village or perhaps a camping getaway up from the mountain tops. This post can assist you prepare for your holiday, regardless of how big or small.


text:
Notices of default in November is lowest total since August '06
Mortgage defaults in San Diego County continued to dip in November, helping the local market maintain a more than six-year low and keeping at bay the theory of another foreclosure surge, figures show. Foreclosures also fell last month.
The county racked up 819 notices of default last month, an almost 15 percent drop from October and a 50 percent drop from the same month a year ago, says a Tuesday report from local real estate tracker DataQuick.
Notices of default mark the first official step in the foreclosure process, but not all of such cases result in foreclosures. Homeowners can avert foreclosure through a number of means, including getting a loan modification or completing a short sale, a deal in which they sell their homes for less than what they owe as long as the lender gives an OK.
November's default tally is the lowest for the county since August 2006, when 794 defaults were recorded. They peaked at 3,832 in March 2009.
Real estate experts during the past year have pointed to the steady rise of short sales as a significant factor in explaining why housing distress numbers have fallen and continue to fall. A national mortgage deal between 49 states and five big banks has pushed lenders to complete more short sales in an effort to help overextended borrowers and fulfill the terms of the historic settlement.
In all, nearly 40,000 short sales have been completed in California through the deal, based on a report from Joseph Smith, the watchdog of the mortgage settlement, in November.
The number of San Diego County property owners who have had their homes foreclosed upon also fell in November. They totaled 432, a 13 percent fall from October and a 35 percent fall from a year ago. They peaked at 2,004 in July 2008.
"The two things that stood out on the foreclosure front this year is the big switch toward short sales nationally from foreclosures and the improving economy and housing market," said DataQuick analyst Andrew LePage. "It's allowed prices to stabilize ... so that results in fewer people getting into trouble in the first place."
While drops in completed foreclosures might bode well for owners, it has put a damper on homebuying because housing inventory in the county has been significantly curtailed. There were about 4,700 active home listings in late November, a 43 percent drop from November 2009, the year when foreclosures peaked.
Foreclosures that have been resold in the local market, which tend to be more discounted than traditional, non-distressed homes, now make up close to 14 percent of the total homebuying market, DataQuick numbers show. They once made up 55 percent of the market, a peak, in January 2009.
It appears housing distress is trending downward nationwide. Irvine-based real estate data firm RealtyTrac recently reported that foreclosure filings numbered 180,817 across the nation in November. That's a 3 percent decrease from October and a 19 percent decrease from a year ago. Foreclosure filings includes notices of default, scheduled foreclosure auctions and completed foreclosures.


text:
Unique barrister's cabinet
Circa: 1900
Price: POA
These cabinets were developed by the Globe Wernicke company and the construction is reminiscent of stacked shelves. They were popular in law offices - hence the name - and first made in the US, but like this excellent example, the company soon also made them in England for the Rumpoles of the courts. Who knows what lurid tales of the legal world it could tell?


text:
Paver, pavers, stonework, stone, cobblestone, flagstone, bluestone, blue stone, hardscape, hardscaping, poolscape, poolscaping, landscape,
landscaping, outdoor living, firepit, fire pit, grill, outdoor kitchen, walkway, driveway, deck, decks, patio, patios, concrete, cement, masonry, mortar,
stone veneer, brick, finished basements, basement, finished attics, attic, carpentry, custom carpentry, additions, addition, stand alone, structures,
roofing, siding, retaining walls, wall, kitchen, kitchens, bathroom, bathrooms, remodeling, renovate, renovations, home improvement, construction,
contractor, contractors, General contractor, CLC, CLC Contractors, builder, builders, deck refacing, deck refinishing, EP Henry, Techo-Bloc, CST,
Cambridge, Trex, Composite, Timbertech, Fiberon, Bucks, Bucks County, Montgomery County, Yardley, Newtown, Langhorne, New Hope, Chalfont,
Upper Makefield, Lower Makefield, Hopewell, Princeton, Montgomery, Wrightstown, Buckingham, Hilltown, Horsham, Bluebell, Doylestown,
Washington Crossing, Furlong, Plumbstead, Plumbsteadville, Pipersville, Richboro, Southampton, Northampton, Holland, Bedminster, Maple Glen,
Ambler, Rushland, Lahaska, Wyncote, Dublin, Belgian Block, drystack, limestone, ledgestone, trellis, pergola, porch, steps,
Landscape / Hardscape
Masonry / Concrete
Custom Carpentry / Trim
Finished Basements
Before & After
CLC Contractors
Your first choice for superior craftsmanship and guaranteed customer satisfaction.
Quality and Pride in Workmanship
Just moved in and need to make your new
house your own or have you outgrown the old
look and its now time to make some changes?
CLC Contracting can convert your dreams into
reality. Whether it be a new kitchen, an addition
for the growing family, a deck or hardscaping to
finish that look in the yard or simply convert
that under-utilized basement to a beautiful and
customized family retreat and entertainment
area, CLC can do it all.
Quality workmanship demands attention to
details that many others ignore. With CLC the
bar is kept high, thus insuring that all
expectations are exceeded. From concept to
completion, we are with you all the way,
designing your project in such a way to not only
satisfy your needs today but also position your
property for future phases of development
Copyright © 2007-2010 CLC Contractors.com. All rights reserved.


text:
- Filed Under
As she began her walk home along South Ninth Street Wednesday afternoon, Lafayette's Sharon Granger regretted leaving her umbrella at home.
But about five minutes into the trip, she gave up trying to stay dry and tried to enjoy her hike home in the rain.
"I mean, once you're this soaked it doesn't even matter anymore. Why rush?" she said. "I was totally unprepared for this. (The weather) was wonderful this morning."
After heavy rainfall hit the area Tuesday, more thunderstorms are on tap for today.
According to the National Weather Service, the new precipitation combined with a second January thaw will bring another round of river flooding beginning Wednesday and continuing into early February.
This morning, the forecast calls for a 60 percent chance of rain and snow, and drops to 30 percent tonight.
Over the next few days, the highest flood levels will be in northern Indiana and along the Wabash River. Flooding could develop along the Tippecanoe River downstream of Oakdale Dam, an area that has not flooded so far in January.
On Tuesday night, the Wabash River at the Brown Street overlook in Lafayette was predicted to reach minor flooding levels around 5 p.m. tonight, and crest at 18.4 feet at 1 a.m. Thursday.
- Justin L. Mack/ email@example.com


text:
Browser does not support script.
Subjects taught at LSE | Services and divisions (administration)
All research groups | Research subject areas
The Department of Finance would like to congratulate all of its 12 month MSc students who graduated this year at the recent December ceremony. On the 18th of December students from the MSc Management and Regulation of Risk Programme attended a packed graduation ceremony in the Peacock Theatre where they shook hands with the Director and officially graduated from the LSE.
The ceremony was followed by drinks receptions for the students, their families and departmental faculty and staff.
The Department would like to wish all graduating students every success in the future and hope that they can stay in touch.
Click on images to enlarge:
Use of this website is subject to, and implies acceptance of, its Terms of use (including Copyright and intellectual property, Privacy and data protection and Accessibility). The London School of Economics and Political Science is a School of the University of London. It is a charity and is incorporated in England as a company limited by guarantee under the Companies Acts (Reg no. 70527).The registered office address of the School is: The London School of Economics and Political Science, Houghton Street, London WC2A 2AE, UK; Tel: +44 (0)20 7405 7686


text:
It happened today – 13 June
Estimated reading time: 1 minute
On 13th June 2004, the Canadian Grand Prix was held in Montreal. Ferrari tackled qualifying with the race in mind, with the F2004s of Michael Schumacher and Rubens Barrichello carrying a heavy fuel load with the idea of making a single stop in the race. As a result, the Italian cars didn't exactly shine on Saturday, securing only sixth and seventh places.
In the race, the Ferraris rapidly moved up the order, with their strategy seeing them moving up place by place until they were at the head of the order. Michael Schumacher went on to take his 77th win, Ferrari's 174th.
Barrichello was third at the flag, but a few hours later he was promoted to second, after Ralf Schumacher was disqualified because his brakes did not conform to the regulations. Worth noting for the history books, this was the Scuderia's 66th one-two finish, while Jenson Button moved up to third in the BAR.


text:
Designing custom websites for years we know the true results of having a one-of-a-kind look... Read more...
If you have a web site or small business website and are trying to get your products and services noticed...
Read more...
We specialize in affordable high quality printing, and offer a wide range of printing services... Read more...
Web Coast Concepts, Inc. is a Web Design Company located in Las Vegas specializing in Ecommerce Website Design, CMS web design, Website Hosting, and Internet Marketing. Website Design for any and all businesses large or small.
Based in Las Vegas and creating websites for hundreds of businesses nationwide. Our Las Vegas Web Design is both affordable and the highest of quality.
We help new and established businesses to sell products via ecommerce, increase your product awareness or simply increase sales and leads from your website.
Our Web Design Company has a strong design & marketing background. We start your website design and development by applying real world marketing techniques first. We then integrate our state of the art technology coding and creative features necessary to best promote your products or services.
Web Coast Concepts, Inc. has developed thousands of professional websites for businesses just like yours. Our Las Vegas Web Design company is a complete integrated solution so you can focus on every day business. Most of our websites are fully automated and easily managed with our content management system.
Using our company for your online marketing and development needs helps you focus on other important business matters. Let us handle the web design process and managing of your web properties. We can include a full SEO report for your website and make suggestions on how to improve your rankings and traffic. Google like to change the ways it searches for sites on a regular basis. Diverse link building strategy and unique content is a great way to start your website off. We have copywriters, expert link builders, seo strategists and online pay per click managers to help your business increase its sales or leads.
We specialize in everything a small business needs to succeed online. From Web Design to affordable search marketing services, we can achieve the goal your business deserves.
Web Coast Concepts is a dedicated customer service driven web design company. We believe that every client deserves the very best in communication and satisfaction. Being a small business we understand that one on one attention is required for web design services. Every client has unique and specific needs. By Having a dedicated website specialist to guide you through the entire process we make it seamless and easier than ever! With competitive pricing and outstanding customer service, experience the Web Coast way! Call us today!
The services provided by Web Coast Concepts web design company was amazing. The results of our marketing campaign increased our sales 30% and the website is beautiful!
- Jennifer Caldon -
Thank you for making our website functional and professional. John Melwak has been exceptional in his service and professional opinion.
- Alpine Sprinkler -
Company: Web Coast Concepts inc
Email: sales (at) webcoastconcepts (dot) com
Toll Free: 1-800-957-0135
Local: 1-702-514-1566


text:
|Home Movies Music Celebs Gallery Down South Videos Downloads eCards Search RSS
|Scoop Home Bollywood Music Down South Fashion Interviews News & Happenings Hollywood
Kareena Kapoor wants to do a love story with Shah Rukh Khan
25th Oct 2006 22.00 IST
By ApunKaChoice
Kareena Kapoor is not satisfied doing a five-minute cameo opposite Shah Rukh Khan . She wants a full-fledged romantic role opposite the star.
Even though Kareena was Shah Rukh's heroine in Asoka , the actress is very eager to work in another movie with King Khan. A self confessed ardent fan of Shah Rukh, she wants to do "an out-and-out love story" with SRK.
Among Shah Rukh's movies, Kareena likes Aditya Chopra 's Dilwale Dulhaniya Le Jayenge the most. She claims to have seen the movie more than a hundred times.
Now she hopes that some filmmaker should cast her and SRK in a love story of equal intensity. It seems Kareena's brief role in Don has not sated her desire to work with SRK.
For the time being, Kareena is excited to have signed Mani Ratnam 's Lajjo in which she gets to share the screen with her other favourite Bollywood star, Aamir Khan . In the film she plays a village belle.
Kareena says she is ready to sign new projects. But her only condition is that the script should excite her.
"I can't commit to a project that doesn't excite me. I really want to work again with Vishal Bhardwaj ," she says.
Kareena says she would feel lucky if she is signed on by Rakeysh Omprakash Mehra or Rajkumar Hirani . Both Rang De Basanti and Lage Raho Munnabhai are among her favourite films of this year.
As for Karan Johar , she says he will remain a good friend irrespective of the fact whether they work together or not.
Kareena Kapoor
Shah Rukh Khan
Aditya Chopra
Dilwale Dulhaniya Le Jayenge
Mani Ratnam
Aamir Khan
Vishal Bhardwaj
Rakeysh Omprakash Mehra
Rajkumar Hirani
Rang De Basanti
Lage Raho Munnabhai
Karan Johar
ECARDS > Valentines Day, New Year, Diwali, Birthday, Valentines, Love, Christmas
CardWeaver.com > Birthday, Holi
celebs » wallpapers » the celeb A-Z
who's in » Freida Pinto | Anushka Sharma | Katrina Kaif | Deepika Padukone | Ranbir Kapoor | Dev Patel | Aishwarya Rai | Abhishek Bachchan | Imran Khan | Shahrukh Khan | Salman Khan | Aamir Khan | Hrithik Roshan | Akshay Kumar | Zayed Khan | Saif Ali Khan | John Abraham | Shahid Kapur | Kareena Kapoor | Vidya Balan | Priyanka Chopra | Rani Mukherjee | Mallika Sherawat | Bipasha Basu | Preity Zinta | Kajol | Neha Dhupia | Sameera Reddy | Juhi Chawla | Karisma Kapoor | Madhuri Dixit | Chitrangada Singh | Payal Rohatgi | Sneha Ullal | Mahima Chaudhary | Meghna Naidu | Rakhi Sawant | Bhumika Chawla | Lisa Ray | Dimple Kapadia | Ayesha Takia | Dia Mirza | Sushmita Sen | Amisha Patel | Esha Deol | Amrita Rao | Amrita Arora | Genelia D'Souza | Arjun Rampal | Amitabh Bachchan | Vivek Oberoi | Raima Sen | Riya Sen | Rekha | Rimi Sen | Nigar Khan | Tanushree Dutta | Yana Gupta | Shilpa Shetty | Celina Jaitley | Sonam Kapoor | Neha Oberoi | Nisha Rawal | Manjari Fadnis | Kamal Haasan | Rajnikant | Asin | Sanjay Dutt | Shahid Kapoor | Sherlyn Chopra | Farhan Akhtar | Prachi Desai | Mandira Bedi | Shahana Goswami | Konkona Sen Sharma | Kangana Ranaut | Mugdha Godse | Masumeh Makhija | Minissha Lamba | Nandana Sen | Malaika Arora | Shweta Kumar | Namitha | Kalki Koechlin | Mahi Gill | Shakeela | Lara Dutta | A R Rahman | Trisha | Shruti Haasan | Neetu Chandra | Shriya Saran | Padma Lakshmi | Emma Watson | Kelly Clarkson | Britney Spears | Anne Hathaway | Anjana Sukhani | Tila Tequila | Soha Ali Khan | Priyamani | Sonal Chauhan | Vaishali Desai | Jackky Bhagnani | Kristen Stewart | Robert Pattinson | Neil Nitin Mukesh | Shiney Ahuja | more...