text:
Algorithms and Networks in The Times
Steve Lohr wrote a New York Times essay on the CSTB 2016 Symposium held earlier this month. Lohr highlights the presentations of Richard Karp on the Algorithmic Nature of Scientific Theories and Jon Kleinberg on Social Networks, both of whom gave similar presentations at FOCS.
Some members of our community have worked on network protocols that use economic mechanisms to distribute bandwidth throughout the network. Would this research violate the concept of network neutrality? That depends on what you mean by network neutrality.
The Internet pioneer Tim Berners-Lee writes
It is of the utmost importance that, if I connect to the Internet, and you connect to the Internet, that we can then run any Internet application we want, without discrimination as to who we are or what we are doing. We pay for connection to the Net as though it were a cloud which magically delivers our packets. We may pay for a higher or a lower quality of service. We may pay for a service which has the characteristics of being good for video, or quality audio. But we each pay to connect to the Net, but no one can pay for exclusive access to me.
So an ISP like Comcast could accept money from say Disney to distribute their bits faster as long as they make the same deal available to all other content providers.
Some people take a more stringent view like the (failed) Markey Amendment to the COPE Act.
Each network provider has the duty to operate its broadband network in a non-discriminatory manner so that any person can offer or provide content, applications, and services through, or over, such broadband network with equivalent or better capability than the provider tends to itself or affiliated parties, and without the imposition of a charge for such nondiscriminatory network operation.
The amendment would have required ISPs to provide the same service to all content providers without additional charge. This might prevent any market mechanism for bandwidth distribution.
Our role as theorists is not to debate the ethical issues of network neutrality but rather to help frame the debate by understanding the technical issues raised by the various definitions of network neutrality and how these rules can affect the overall efficiency of routing bits through the net.
Posted by Lance Fortnow at 6:53 PM 6 comments:
The Generalist
As you readers know, my colleague Janos Simon went to FOCS last week. Janos wasn't an author, he wasn't on the program or organizing committees, he wasn't an invited speaker, he didn't sing in the band and he doesn't live within driving distance of Berkeley. Janos Simon went to FOCS not because he had an official reason, but rather to keep up with the latest results in theory. FOCS had low attendance this year (about 220) because it doesn't attract many Janos Simons, people who travel to FOCS because they want to, not because they feel they have to.
Janos Simon is part of a dying breed, a generalist in theoretical computer science. Janos goes to most STOC and FOCS conference and few specialized conferences like SODA and Complexity. In three decades of research, Janos has studied complexity, algorithms (distributed, parallel, randomized), VLSI and networks well as having interests in nearly every area of theory. It's impossible to arrange parallel sessions at FOCS in way that won't cause a conflict for Janos.
Back in the 70's a graduate student could keep up with the latest research in all of TCS and produce significant results in his or her career in many different areas. Today we seem to push out very specialized researchers focused not just on some subarea like algorithms or complexity but even in more specialized areas like streaming algorithms or PCPs.
Such specialization has its risks, for example getting so caught up in an area that you lose track of the motivation for studying the topic in the first place. Also we lose some sense of community when theorists in different areas lose interest in following each others work. But can a young Janos Simon survive today as a generalist or are we doomed to further specialization as students search for successful research agendas?
Posted by Lance Fortnow at 5:39 PM 17 comments:
Whose Thesis is it Anyway?
Ten years ago Bob Soare realized that the name "recursion theory" did not do justice to his field so he single-handedly changed the name of the field to Computability theory. Now he wants to correct the early history of computability and credit to whom credit is due, naming Turing.
The canonical wisdom in most computability textbooks is that there were several researchers in the early 1930's working on various formal definitions to capture the intuitive notion of a computable function, and that Turing was just one of them and shares the credit with them. This is incorrect. It was Turing and Turing alone not Church, not Kleene, not Post, and not even Gödel himself. It was Turing who:
gave the first convincing model for an intuitively computable function;
gave a precise demonstration that this formal model captured the intuitive notion; and
defined the universal Turing machine, which is of immense importance.
You can see Soare's historical view here.
Yesterday Soare gave a preview of a talk at the Chicago logic seminar. He focused mostly on the work of the 30's and how Kleene later established the terminology Recursion Theory and Church's Thesis. Soare argues that Turing deserves most of the credit for the Thesis because Turing gave solid arguments for the thesis and Gödel always gave Turing credit. Church may have first formulated the thesis but Turing's work made it credible.
We computer scientists have been using "Church-Turing Thesis" for years and with Soare's historical background, Church-Turing still seems like the way to go.
Posted by Lance Fortnow at 9:37 AM 11 comments:
Introductory CS Sequences
At most universities the first year CS courses tend to cover programming. These courses differ from first-year sequences in other departments in several important ways.
In most disciplines, the topics of the introductory sequence have not significantly changed since I went to college and even since my father went to school. In CS our introductory courses seem to change every few years. I don't think anyone currently teaches PL/C (or any other PL/1-variant) that I learned in CS 101 at Cornell. Computer Science didn't even exist as a field when my father when to college in the 50's.
In most disciplines any professor in the department deeply knows the material taught in the introductory sequence. Any professor could teach the intro sequence, or if they can't it's not because they don't know the material. This is certainly not true in computer science.
A professor at a state university noted that their CS majors had internships after their first year and commented "CS is the only discipline where we have to make the students employable after the first year."
In non-CS scientific disciplines, different universities generally teach the same material to their first-year students. Different physics departments teach with different books at different levels and maybe material in different orders but there is general agreement of what basic concepts of physics that first year students should know.
Go to any computer science conference and you'll hear discussion about what programming language gets taught at their schools. Nearly every department has people disagreeing about which programming language to teach to the first years. I tend to stay out of these fights for it is a lose-lose proposition. Win the argument and you'll end up teaching the class.
Posted by Lance Fortnow at 10:54 AM 21 comments:
FOCS Funding, Music and Talks
Another Janos Simon report from the FOCS conference in Berkeley.
News from yesterday's Business Meeting (continued). Most of the news from NSF is a repeat of last years sorry state of affairs: no money, not enough influence.
Influence: We (TCS) are a lowly leaf, instead of a child of the root in the CS organizational tree. This is both bad for money, and very bad for influence and image. Bill Steiger is working hard for a change.
Money: bad news. More precisely, when Bill Steiger got to NSF, all his budget was already spent. (Budget = $4.1 million, plus 2.8, a share of the money for three subprograms). Of the ~500 CS proposals to NSF, about 90-100 were for Theory. Bill managed to fund 18, by hard work, persuading others to let Theory have a bit of their budget, etc. The SING (network) program was also seriously underfunded (~100 proposals, 7 funded, one of these was theory-flavored.)
Perspectives for 2007 are not good. Again, the money is pretty much spent, but Steiger will do the best he can. NSF budget should be within 10% of 2006. About 4-5 CAREER grants might be funded, no large Theory projects will be. SING will again be very competitive.
If you are interested in submitting a proposal do talk to Bill Steiger. He will try to help.
An appeal by Bill Steiger: please send "nuggets" to him—descriptions of neat Theory results. They are VERY useful.
Dick Karp spoke, and thanked Bill in the name of the Theory community. After a round of applause, Karp explained that other science communities lobby for NSF projects: astronomers get observatories, satellites; physicists get accelerators, or focused projects. They have an internal discussion and then lobby lawmakers and NSF. CS, in particular Theory, should do likewise.
He appealed for mobilizing the community. NSF wants CS to suggest visionary activities, and CRA got a few millions to organize us to suggest ideas. Theory should make sure we are well represented.
Avi briefly noted that out of 0.5 billion to CS, Theory gets 6-10 million, yet we are about 20% of the community. We need politics. We should also think of service at NSF as part of our service.
At the end of the meeting, it was announced that Hal Gabow will be the next TC chair.
The final part of the proceedings was moving to the adjacent ballroom where we were treated to a rock concert. Christos Papadimitriou, suitably dressed in all black was the keyboard player, Anna Karlin had one of the electric guitars: the rest of the band (Lady X and The Positive Eigenvalues) was unknown to me. Lady X was Andrea Frome (a Berkeley grad student), and the performances were very good. Eventually Christos also sang. (Luca reviews the concert with pictures.)
MONDAY talks.
There was an invited talk by Terry Senjowski, a distinguished neuroscientist. He talked about how vision is influenced by knowledge and expectations, and how our brains seem to have learning feedback mechanisms, and that simple neural networks can learn surprisingly complicated stuff. I can report more fully if there is interest; he did not make direct connections to Theory.
Again today there were a number of very interesting papers. A cute question from the point location talk: in 2D is nearest neighbor as hard as point location? As usual, clever crypto papers, and quantum results, including one by Xiaoming Sun and Andy Yao with real heavy duty math.
A most interesting/controversial talk was by Leslie Valiant. He explored paths to try to prove that NC2=P#P—he thinks this would be cleaner than the current complexity zoo. The paper is a continuation of the research direction started with his matchgate computations. He considers "holographic reductions" that conserve number of solutions, not by direct translation as the usual parsimonious reductions do, but in complicated ways: they are many-to-many maps but still conserve counts. Using these, he is able to prove interesting stuff, like counting number of satisfying assignments mod 7 is in P, but 7 may be the only such modulus.
The paper that won the Machtey award is very nice, and Nick Harvey did a superb job of presenting it. He has probabilistic algorithms to find matchings in non-bipartite graphs that achieve time O(nω) where ω is the exponent of matrix multiplication. There was another algorithm with the same bound (Mucha and Sankowski, FOCS 2004), but Nick Harvey managed to do what no other general matching algorithm does: it is easy to understand. Read it!
Finally a paper I could not hear, but is interesting if only to show how taste changes. Back in the remote prehistory of CS—around the very early sixties—people were very interested in small universal machines. They wanted to see how simple could objects be and yet have undecidability "built in." More precisely, for what pairs (s,a) is there a universal Turing machine with s states and a tape symbols? (The product sa is the "size" of the machine). The smallest machines were constructed by Minsky, using as a subroutine "tag systems" that are a kind of "Post production systems" that are a kind of type 0 grammar. The simulations introduced an exponential overhead, so these smallest machines were very slow. It has been an open problem for over 40 years whether this exponential slowdown was really necessary. The paper by Woods and Neary shows that this is NOT necessary, and gives a polytime algorithm for all known minimal-size universal Turing machines.
FOCS Day 1 and Business Meeting
Janos Simon continues his reports from Berkeley.
Dick Karp gave a 1-hour invited talk in two parts. First he gave a short version of "Why TCS is important to other sciences." This is a sermon that ought to be delivered to deans, and to non-theory folks in CS.
TCS points out the computational nature of natural and social processes, and provides a language for their descriptions analogous to Math providing equations that describe phenomena and methods to manipulate equations.
TCS alters world views in other areas, providing paradigms to understand and to model.
Biology: cell process regulation.
Learning: (in humans, animals) paradigms, models and algorithms from Computational Learning Theory
Molecular self-assembly
Strategic Behavior of companies
Physics: Quantum Mechanics and quantum computing.
Math: too numerous to mention, algebra, Fourier techniques, Social sciences: web, data for social interactions and behavior, etc.
Karp also gave examples of where convergence between CS and other areas benefited both disciplines including Belief propagation, error correcting codes and constraint satisfaction.
Janos' Comment: I think it is important to emphasize that CS contributes more than a passive lens: we are not a tool, but a partner.
The second part of Karp's talk was a set of examples from Computational Molecular Biology, illustrating some of the contributions/research accomplishments. He gave 5 examples of "Algorithmic Challenges in Computational Molecular Biology." [Many are associated with Berkeley because Karp is quite familiar with these]
Sequencing Genomes. He talked mostly about Myers' contribution to shotgun sequencing. His algorithmic ideas were crucial to the success of the technique, which, against biologists' expectations, became the standard. The technique: extract many random sequences of the genome, of known fixed length, 2, 10, 50, 150 kb pairs. read 500-1000 nucleotides from opposite ends computationally assemble the genome. Myers came up with several tricks the do NOT work for arbitrary sequences, but take into account the domain. Had to use biological knowledge.
Parametric Sequence Alignment. The Needleman-Wunsch algorithm (aka dynamic programming) gives best alignment of two sequences (DNA fragments) given scores for matching letters, mismatches, or matching a letter with a space (modeling insertions/deletions). What if these costs are not known? Clever algorithm by Pachter and Strumfels, using polytopes for this parametric problem
Inferring Evolutionary History (Daskalakis, Mossel and Roch, STOC 06)
Genetic Variation Zhihong Ding, Vladimir Filkov, Dan Gusfield: A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem
Regulation of Gene Expression (ran out of time)
Some other interesting talks I heard:
Nguyen, Ong, Vadhan: Statistical zero-knowledge from any 1-way function. Omer Reingold liked this. I did too. They prove that 1-way functions (in some sense the weakest crypto assumption) is sufficient for giving a zero-knowledge proof—under new definitions. The usual one is that soundness is statistical (absolute) and zero-knowledge is computational (guaranteed only about polynomially bounded adversaries). This paper inverts the roles, answering a question proposed in 1992. The proof technique is new.
Assaf Naor presented two difficult and impressive results, showing that problems of embedding one metric space in another have a deep mathematical background, and interesting CS applications. The papers have difficult proofs that may well be worth studying.
Santosh Vempala presented a great result (with Laci Lovasz) showing how sampling log-concave functions is related to optimization problems.
I found the results on derandomization, and hardness amplification quite interesting (section 4B) and was convinced of the virtues of smoothed analysis (concurrent section 4A). Ryan O'Donnell gave a beautiful presentation of new nonapproxability results in session 5A, and I learned that honest majority is easier in a quantum setting in session 5B.
Highlights of the business meeting:
Machtey Award for Best Student Paper: Nicholas J. A. Harvey for Algebraic Structures and Algorithms for Matching and Matroid Problems.
Stats: 243 submissions, 71 accepted (~30%), ~220 attendees. By comparison
SODA 387/139 36%
ESA 215/55 26%
STOC 280/78 27%
CCC 85/28 32%
Deadlines: CCC Dec 3, program Chair Peter Bro Miltersen, STOC Nov 20 (no joint submissions to CCC)
STOC 07 will be at FCRC in San Diego. Hotel will cost 129/139 single/double. Dates are June 11-13 for STOC, June 8-16 for FCRC.
FOCS 07 will be in Providence, RI. Program chair is Alistair Sinclair. Location is the new Renaissance Hotel, currently under construction.
FOCS 08 will be in Philadelphia.
Our community received a number of prizes, previously reported here: Jon Kleinberg, Nevanlinna Prize, Danzig Prize to Eva Tardos, and co-winners of the Fulkerson Prize: Manindra Agrawal, Neeraj Kayal and Nitin Saxena, "PRIMES is in P", Annals of Mathematics, Volume 160, issue 2, 2004, Pages 781--793. and Mark Jerrum, Alistair Sinclair and Eric Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries", J. ACM, Volume 51, Issue 4, 2004, Pages 671--697. Neil Robertson and Paul D. Seymour, "Graph Minors. XX. Wagner's conjecture", Journal of Combinatorial Theory, Series B, Volume 92, Issue 2 , 2004, Pages 325--357. (not really TCS, but we'll claim it!)
There was a new proposal by Umesh Vazirani: let us have no paper proceedings. Instead, let the papers be submitted (perhaps as little as one week before the conference) to a website. This would allow postponing submissions by perhaps 2 months, and would get extra benefits (cheaper registration, text searchable, available everywhere.
A lively discussion ensued. The economics of the proposal are unclear: would it decrease attendance? Should we worry about the economics? Some people like having the paper version at the conference. Making the "electronic proceedings" have page numbers, formatting, etc. would still imply text processing and editing. On the other hand, an electronic version would have substantial advantages. Would IEEE let us do it? What about libraries who paid for the proceedings?
It was pointed out that the IEEE electronic library is unreasonably expensive, and many institutions do not have it. A quick vote was taken, and results were inconclusive. Many wanted a CD with the proceedings. About an equal number of people wanted proceedings with CD as no proceedings and electronic versions only.
Our leaders promised to study the matter.
Finally the NSF report. Bill Steiger is going back to academia, in August. He was warmly thanked for his efforts for the community. I will give a detailed report tomorrow.
FOCS Begins
Weblog correspondent Janos Simon reports from Berkeley.
This is a pre-FOCS FOCS report, filling in for Lance.
FOCS 2006 is at Berkeley Marina, a lovely place on the Bay, with expensive sailboats next to the hotel gardens, against the beautiful backdrop of the San Francisco Bay, with the Berkeley hills on the other side. All of this even comes at a relatively cheap price.
Unfortunately the hills of Berkeley are not so near: downtown Berkeley is about 3 miles from the hotel, on the other side of train tracks and the interstate. This not only prevents one from easily strolling around the Berkeley campus and stopping at one of the nice coffeehouses or bookstores, but also makes getting dinner more of an adventure, involving a cab or a hotel shuttle. I am not complaining about the organizers: putting a conference together is a difficult balancing act, with too many constraints.
The conference itself should be excellent, with very strong papers, including the solution of the 2-player Nash equilibrium that won the best paper award. There will be three invited talks, all dealing in one way or other with Theory interacting with other areas of knowledge: tomorrow (Sunday) Karp will talk about "Theory of Computation as a Lens on the Sciences", Monday Terry Senjowski will teach us about Vision, and Tuesday Jon Kleinberg will discuss networks, social and technological. The biggest innovation relative to previous FOCS will be the presentation of Lady X and the Positive Eigenvalues, a rock concert. [For those with a historical bug, this is not an absolute first. Dexter Kozen, with Anna Karlin of the Severe Tire Damage rock band—the first to broadcast a rock concert on the internet—have in the past help expand our horizons in these directions, I believe at the Palo Alto conference, but I cannot offer precise pointers.]
The conference has parallel sessions (pros and cons have been previously and exhaustively discussed), so I will only be able to provide a very incomplete report of the papers presented. I should also add that I expect to miss many talks, not only due to my non-quantum nature and consequent lack of ability to be in two places at the same time, but also due to random phenomena: sleeping late, meeting friends, discussing ideas, wandering into the wrong lecture room, and forgetting about the time of talks I wanted to hear. So the papers I'll mention are not necessarily the ones I chose to listen to, just the ones I happened to not miss, and inferences about my taste or the quality of papers ignored would likely be mistaken.
Given that caveat, I can talk about two very nice results to be presented today. I heard them at Chicago before the conference.
The first is Tom Hayes' paper that gives a sufficient condition for certain important probabilistic models to converge rapidly. For definitions, technical details, etc read the paper. What I liked is that the paper is not only a significant technical improvement, but this seems to be the "correct" reason that lurked behind previous proofs, and this (I think) will be the proof we will teach.
The second is the paper by Belkin, Narayanan and Niyogi on estimating the surface area of a convex body. Both the area and the volume of high-dimensional convex bodies are very hard to approximate by the "natural" method of approximating the boundary by a simple smooth object: the number of parameters to do so grows too fast. For the volume, one can use random walks: an appropriate random walk on the space is stopped and we record whether we stopped inside or outside the object. The ratio of these events can be used to estimate the volume. Unfortunately this does not work for the surface area. The very cute idea of the Belkin et al paper is to put a heat source inside the object, and observe the amount of heat that leaks outside: this will be proportional to the area
Of course there are lots of technical difficulties, but they can be overcome. The details are not easy, but I thought the idea was new and nice.
David Pennock gives a CS view of prediction markets and gambling on his new weblog Oddhead. For those interested in prediction markets also take a look at the group blog Midas Oracle.
Chris Leonard, former editor of the Elsevier theory journals, returns to academic publishing for the open-access publisher BioMed Central to help them expand into physics, math and CS. He writes about changes in scientific publishing (and other topics) in his weblog.
Should teachers try to make math interesting and relevant? No, according to Tom Loveless.
And I'd be remiss not to mention the lengthy New York Times profile on Shing-Tung Yau.
For-Profit Universities
On Monday the Chicago Bears played the Arizona Cardinals at the University of Phoenix stadium. Is this the stadium where the University of Phoenix normally plays their football games? No, the University of Phoenix doesn't even have a football team or a traditional college campus at all. Rather the University of Phoenix is a for-profit university with about 300,000 students taught at several small campuses in the US and beyond and online focusing on career-oriented majors. In an AP Interview, their new president Bill Pepicello explains their mission.
Our philosophy for serving students is the same as Harvard or Ohio State, and that is we're mission-driven. The mission of, say, Harvard is to serve a certain sector of the population and their mission is not to grow. And that's true of higher education in general. The reason the University of Phoenix exists at all is that is that all of those various (universities) and their missions did not provide access to a large number of students who are capable and wanted access to higher education. And that's our mission.
This university fills a need for training Americans for new careers as we continue to ship manufacturing and service jobs overseas. But the University of Phoenix doesn't fulfill other traditional university functions like basic or applied research or being the intellectual center of their communities.
For-profit universities haven't posed much of a threat for the traditional university model in the US. But in the long run as people get more comfortable with the virtual world of the internet, universities with a large on-line presence might radically change higher education as we know it.
Meanwhile India has a shortage of trained professionals as the country explores how to best address its higher educational needs. Germany on the other hand is focusing on encouraging high-level research by establishing elite universities, graduate schools and research clusters.
So how did the University of Phoenix get their name on the football stadium? The same reason the White Sox play in U.S. Cellular field—corporate sponsorship. At least we don't put corporate logos on the fronts of our jerseys like the European footballers.
Scott and P versus NP
In the eighth Complexitycast, Bill Gasarch and I dissect Scott Aaronson's Ten Arguments for Believing P≠NP and briefly Bill's P versus NP Poll. MP3 (24:55, 4.3MB)
Favorite Theorems: The Yao Principle
September Edition
What is the best a probabilistic algorithm can do for the worst-case input? Perhaps it might be easier to show the limitations of a deterministic algorithm on the average over an adversarially chosen distribution of inputs. Andrew Yao observed these values are one and the same.
Andrew Yao, "Probabilistic Computations: Toward a Unified Measure of Complexity." FOCS 1977
Best to view this result as a zero-sum game. Alice chooses a deterministic algorithm A and Ian chooses an input I. Ian receives t dollars from Alice where t is the "cost" of algorithm A on input I. By applying von Neumann's minimax theorem Ian and Alice have probabilistic equilibrium strategies. That is Ian has a distribution of inputs that achieve an expected cost t no matter what algorithm Alice chooses. Also Alice has a probabilistic algorithm (a randomized choice of deterministic algorithms) that will achieve an expected cost of the same t no matter what input Ian chose.
The Yao Principle applies when we don't consider the algorithmic complexity of the players. For example in communication complexity we have two players who each have a separate half of an input string and they want to compute some function of the input with the minimum amount of communication between them. The Yao principle states that the best probabilistic strategies for the players will achieve exactly the communication bounds as the best deterministic strategy over a worst-case distribution of inputs.
The Yao Principle plays a smaller role where we measure the running time of an algorithm since applying the Principle would require solving an extremely large linear program. But since so many of our bounds are in information-based models like communication and decision-tree complexity, the Yao Principle, though not particularly complicated, plays an important role in lower bounds in a large number of results in our field.
Numb3rs of Collaborators
Last week's episode of Numb3rs The Mole had a mildly interesting academic side story. [Mild Spoiler Warning] Charlie, the mathematician, discovered that his friend Larry, the physicist, published a paper without asking Charlie to collaborate on the math, which according to Charlie would make the paper go from "very good" to "great". Larry later confessed to Charlie's dad that he worried too much about relying so much on a single collaborator, especially one so busy helping his brother at the FBI. Eventually Larry and Charlie talked out their issues and agreed to work together again.
In the real academic world you rarely see two people collaborate almost exclusively over a long period of time. We all have certain people with whom we collaborate often because we have similar interests, complement each other's skills, or simply that we work well together. But having a single collaborator can lead to narrow research, using the other as a crutch and worrying that outsiders won't know which one is the stronger researcher. But most importantly we thrive on variety and having different collaborators keeps research exciting.
Posted by Lance Fortnow at 8:09 PM 1 comment:
What Happened to Departmental Tech Reports?
Imagine back to the early 90's before we had a world-wide web. You had a new result, a nice result but not so important that you would do a mass email. You wanted to mark the result with a time-stamp and make it available to the public so you created a departmental technical report, basically handing a copy of the paper to a secretary. You would get a report number and every now and then a list of reports was sent out to other universities who could request a copy of any or all of the reports. Eventually the paper would go to some conference and journal but the technical report made the paper "official" right away.
As the web developed CS departments started putting their tech reports online. But why should you have to go to individual department web sites to track down each report? So people developed aggregators like NCSTRL that collected pointers to the individual paper and let you search among all of them. CiteSeer went a step further, automatically searching and parsing technical reports and matching citations.
But why have technical reports divided by departments? We each live in two communities—our university and our research field. It's the latter that cares about the content of our papers. So now we see tech report systems by research area, either area specific systems like ECCC or very broad report systems like arXiv that maintain specific lists in individual subareas that bypass the department completely.
What's next? Maybe I won't submit a tech report at all letting search engines like Google Scholar or tagging systems like CiteULike organize the papers. Departmental tech reports still exist but don't play the role they once did and who can predict how we will publish our new results even five or ten years down the road.
STOC Undergrad Research Competition
The ACM Symposium on Theory of Computing (STOC) will host its first Undergraduate Student Research Competition in 2007 sponsored by Microsoft Research. From the entrants a number of students will be invited to attend the conference at FCRC in San Diego in June where they will present their work at a poster session. Four to five finalists will give oral presentations at the conference. The top three finalists will receive cash prizes and advance to the grand finals of the broader ACM Student Research Competition.
As an added bonus participating in a project can only help your grad school applications as many Ph.D. programs like to see some research experience. Submission deadline is not until February 23 but you'll have to start very soon to get a project ready in time. So go find some ideas from a friendly CS theory professor at your university and get cracking.
See you in San Diego.
Posted by Lance Fortnow at 10:34 PM 2 comments:
Wholly Natural
My daughter's math text list natural numbers as {1,2,&hellip} and whole numbers as {0,1,2,&hellip}. I remembered them the other way around, after all zero seems natural but is a whole lot of nothing. But for her homework she has to use the textbook terminology lest she gets marked wrong.
Afterwards in my class I used the phrase "For every natural number n" and then stopped myself and asked the class about what natural and whole means to them. The class had diverse opinions and also mentioned something called counting numbers. Searching various web sources seem to agree for the most part that whole numbers start with 0 but are less clear on the natural and counting numbers.
For that class and in most of what I do the distinction is irrelevant since we usually only care about "sufficiently large" n. But if you are using a context where zero matters, please use the terms "nonnegative integers" and "positive integers" so as to not confuse those of us who can't keep our whole and naturals straight.
Theory Confidential
I hate to keep secrets but in our field much of what we discuss should be kept confidential as much as possible. What do we need to keep quiet about?
Recommendation Letters. Should only be read by during the recruiting process and never by the candidate except as required by law. If someone other than the candidate asks you for a recommendation you shouldn't even mention to the candidate that you were asked.
Referee Reports. While the reports themselves are furnished to the author, the identity of the referees must be kept secret. Any discussion between the referees and authors should go through the editor.
Committees. Any discussion in a program committee (or any other kind of committee) should remain closed except as agreed upon in the committee. This allows the committee members to speak freely. In a PC you shouldn't even mention whether a paper was submitted.
NSF Panels. You should not disclose any discussion during an NSF panel, or even the fact that you were a panelist.
Salaries. You can announce your own salary but you shouldn't mention other people's salaries. Exceptions for surveys and states that require that the public have access to the salaries of all of their employees including state university professors. Update: I've just been told I am not allowed to publicly announce my salary as a University of Chicago employee. Apparently the employer can decide the appropriate policy for salary disclosure in the US.
Personal Information. Disabilities, Illnesses physical and mental, Gender, Sexual Orientation, Marriage, Children, Religion, Race and other related issues except as necessary or as already publicly known.
Email and Personal Discussions. You shouldn't reveal research or other discussions with someone else without their permission.
So what can you talk about? Anything made public, on a web page, in writing or in "public" is fair game. After all we bloggers do need stuff to write about.
If you truly want things you say to remain private then don't say it. With many theorists having loose lips and the minimal security of email you cannot count on the fact that what you say that should not be spread will remain unspread.
Brochure Season
Tis the season that my fellow professors and I start receiving collections of brochures, newsletters and posters from various CS departments around the country. I never see this propaganda from the top four departments (MIT, CMU, Berkeley and Stanford) but usually that next level or below trying to exclaim how great they are.
The brochures look the most impressive, for example Wisconsin-Madison with 36 glossy pages including a two-page spread on Jin-Yi Cai and the P vs. NP problem.
The thrill is in the chase for Cai and others in Theory of Computing. He describes his research with the language of an artist, drive by "elegance, internal logic and beauty." The usefulness of the findings in this field can often be transformational, but they may not be evident until decades later.
Newsletters focus more on recent hires, awards and research activities. Rutgers, for instance, has a full page on new hire (and former NEC colleague) Joe Kilian. The profile even mentions Joe's work on the Franklin eBookman. "As a theorist, it was rather strange to realize that I could go to Staples and buy a device that contains actual code I've written."
The posters have a more specific function like advertising the graduate program or announcing distinguished lecturers. They can't really expect us to travel a thousand miles to see a single talk. I suspect the distinguished lecturer posters really say "We are a real department because famous computer scientists visit us."
Brochures, newsletters and posters all have the same true purpose of branding, so we think of those departments when we recommend graduate schools for our undergrads, faculty jobs for our Ph.D. students and when we fill out those questionnaires that lead to departmental rankings.
The departmental web page has become the true portal that potential students and faculty go to to explore a department. Most CS departments that home pages high on content but often low on visual appeal. Departments should put as much effort into the style of their web pages as much as they do for those brochures, newsletters and posters.
Embargoed Science
NPR's On the Media interviewed an old college friend of mine, science writer Vincent Kiernan, about his new book Embargoed Science.
"Embargoed Science" refers to articles that some journals, such as Science or Nature, send to science writers in advance of publication under strict rules not to write about the article until publication date. The embargo supposedly gives writers a chance to do interviews and background research before they have to write the stories. Kiernan argues that embargoes misdirect science journalists.
It sets up a system by which journalists are given powerful incentives to cover a certain kind of story about science – the latest "eureka moment," and those eureka moments come several times each week. And so the journalists are directed toward those stories and away from critical, skeptical coverage of science as an enterprise, with all its fraud, with all its successes, with all the ethical issues…Lots of very, very good science gets published in many, many journals. There are literally thousands of journals, and journalists monitor 30, 40, if they're lucky – the ones with embargoes. The ones that are not embargoed, that also publish very, very good science, like a bunch of geophysical journals, they are largely ignored by journalists.
We can learn a lesson here, though perhaps not the lesson Kiernan wants us to learn. If we want more publicity for our best results, we should embargo those results, sending the articles and supplementary explanatory material to reporters in advance. Though this would mean not publicly announcing those results before they appear in journal, something that might not fly very well in the computer science community.
Recommendation Systems
The big CS news of the week: Netflix, the online DVD subscription rental site, has announced a million-dollar prize for substantially improving their movie recommendation system. The New York Times has the story, NPR has an interview with James Bennett, Netflix vice-president of recommendation systems, and John Langford gives his take.
Recommendation Systems (or Collaborative Filtering) tries to match one person's interests based on the interests of a large collection of other users. At first this seems like an easy task, just trying to match vectors. But the simple ideas don't work very well. The AI community have developed much more sophisticated techniques that have been implemented in companies that take recommendation systems seriously, like Amazon and Netflix. Apparently these techniques have reached the point of diminishing returns, thus the contest.
I understand that Amazon wants to sell more stuff, but why does Netflix take the problem so seriously, to the point of having a VP of recommendation systems as well as running this contest? They only recommend to already paying subscribers, the amount of extra business they get or keep by a strong recommendation system seems minimal.
But I shouldn't complain. Too often the public thinks of computer science as simply writing programs and making them run quickly. The Netflix contest sheds light on a different view of CS that shows the depth in a seemingly simple problem.
The million-dollar prize puts recommendation systems in the same class as the P versus NP Millenium Prize. Though if you could show P = NP by giving a quick algorithm for NP-complete problems, you can use that algorithm to develop a great recommendation system and collect a cool two mill.
Can you submit a paper to a conference that you are not sure you can attend?
You have agreed to give an invited talk at a conference. But you find yourself traveling too much. Can you cancel your talk?
You have accepted a tenure-track job at a good school but then you get an offer at a more desirable place? Can you take back your acceptance at the first place?
You promised to referee a paper by a specific date. But life gets busy. Can you let the deadline slide?
Of the correct answers to all of the above is "No!" When you submit a paper to a conference, agree to give a talk, accept a job or promise to referee you make a commitment and you should, as a responsible member of the scientific community, honor your commitments.
Many members of our community treat such commitments quite seriously but unfortunately too many of us don't. For the latter group put yourself on the other side. Think of the editor dealing with referees who aren't refereeing and the author not getting his paper reviewed in a reasonable amount of time. Think of the department that has stopped their job search believing they have filled their opening. Think of the conference organizers having to reshuffle their program for talks not given.
Sometimes you have extenuating circumstances, like an illness, that do give you reasonable excuse. And you could always ask; people will often modify or let you out of your commitments if you make a polite request. But you must make every effort to honor your commitments. If you don't think you can then you shouldn't commit in the first place.
The ultimate commitment you make is the commitment to research. Once you start graduate school you make a promise to focus on science and your research as your main objectives. Only by keeping that commitment can you truly succeed as a scientist.
How much commitment do you need? In a ham and cheese omelet the chicken and the cow are involved but the pig is committed.
The New CCC
Not the Conference on Computational Complexity but the Computing Community Consortium, a new organization funded by the NSF and organized by the Computing Research Association. The CCC will develop major research opportunities and "grand challenges" enlisting community involvement in creating new research visions and activities.
The original NSF solicitation focused on large-scale infrastructure but a CCC white paper, while purposely vague, seems to take a broader view.
Compelling visions take many forms. History has amply demonstrated the importance of entrepreneurial, grassroots efforts as creative engines in computing research. History has also demonstrated the value of large teams, large facilities, and large amounts of funding. Many see an increasing need for shared research facilities and teams in our field to allow us to tackle certain "grand challenge" problems. Planning for large-scale research should not, and need not, harm smaller-scale efforts or place them at a disadvantage.
The challenge for the Computing Community Consortium is to catalyze the computing research community to debate longer range, more audacious research challenges; to build consensus around research visions; to articulate those research visions; to evolve the most promising visions toward clearly defined initiatives; and to work with funding organizations to move the challenges and visions toward funding initiatives. The CCC will do this without harming the research environment that has created the computing world of today.
The NSF has awarded six million dollars over three years to the project, a rather large sum for an organization that won't actually do any research. Given this commitment, the CCC will play a major role in shaping CS research for several years. We should all work to help the CCC truly reach its potential of developing new funded programs across the full spectrum of computer science research.


Discovering easy ways to save will boost your odds of sticking to your goals.
Even if you earn enough to live comfortably, it doesn't mean your bank account balance will be moving north. It's very possible it could be near a relatively uncomfortable level.
For those who've been there, we feel your frustration. And if you're ready to take action, then check this out: here's a financial plan geared toward those who want to spend and save, comfortably, at the same time.
Here's to feeling more power than pain when it comes to your savings. Just follow these five steps.
Instead of depositing your entire paycheck in your checking account, direct deposit part of it into a separate savings account.
Why: If you're automatically saving money in a separate account, you could be less likely spend it. It's called "paying yourself first" because you're tucking away funds for your own goals before you pay others.
Also, saving on the regular can boost your chances of making steadfast progress toward your goals.
It's possible to have it both ways – to enjoy things and put some of your new wealth to long-term goals. Here's how: Commit to saving up a significant portion of any additional income you receive as a result of a salary bump and divert it to your savings account using direct deposit.
If you carry a balance from month to month you could be spending a lot of money on interest charges that you could use to bulk up your savings instead.
But you don't have to swear off credit cards – who wants to give up great rewards? -- but it's possible to use your credit cards more to your advantage.
Here's how: try to pay your bill in full each month (keeping in mind other bills or financial obligations). If you need to carry a balance, consider paying more than the minimum if you can and consider budgeting to pay it off as soon as your budget permits.
Go through your subscriptions and cut the ones you no longer use and see if there's a free version that offers what you want. Also look into sharing a subscription and splitting the bill with a friend or family member.
How this could add up: Closing an unused $10/month subscription would save you $120 in a year.
If you're credit card offers cash rewards, claim them and save them! If you don't want to use a credit card, consider options --like or a rewards app that offers cash rewards or discount codes at places for things you already buy at places where you already shop.
Discovering easy ways to save will boost your odds of sticking to your goals. Setting something up once or making a simple change or transaction every so often, could lead to steadfast progress.


Will new guidelines to reduce C-sections change maternity care?
Women planning to deliver at some birth centers are being encouraged to stay at home when their labor begins. They are advised to rest, eat, walk around and not to time every contraction.
For the first time, scientists have succeeded in coaxing laboratory cultures of human stem cells to develop into the specialized, unique cells needed to repair a patient's defective or diseased bladder.
(HealthDay)—More and more Americans are being prescribed powerful narcotic drugs when they visit the emergency department for problems such as low back pain or a pounding headache, a new study finds.
Twice in six months, Bobbie Wilburn walked home from the grocery store because her car had been stolen. It hadn't. She just couldn't remember where she parked.


LOOK Buildings does not employ our own construction crew; however, a builder's network in multiple areas is available. We have built relationships with many contractors of all trades that we feel confident will satisfy the expected duties needed to install a LOOK Building.
LOOK will work with multiple subcontractors to complete a turn-key building (Limits may apply).
LOOK will hire a general contractor to work with LOOK and with the customer on finishes.
LOOK's buildings are simple for the do-it-yourselfer. The customer can choose to do parts of the construction themselves if not all, or ask LOOK Buildings for a list of referrals if needed. The customer is responsible for collecting labor pricing, scheduling (will work with LOOK on schedule) and manage labor.
Let us know your location and what areas of construction you need performed.


text:
Temple Univ. initiative aims to keep more Black Philly youth in college
Poverty, violence hurt retention efforts, study finds
By: Special to the Capital-Star - November 1, 2021 10:08 am
Temple University in Philadelphia (Image via Temple University/The Philadelphia Tribune).
By Alan Tucker
PHILADELPHIA — An alarming number of Philadelphia residents face frequent challenges, hardships, and obstacles in pursuit of earning a college degree.
Daniel Liberis, a West Oak Lane resident, is one of thousands of African-American students in Philadelphia who have dropped out of college due to economic hardships.
With the guidance of Temple University's Hope Center for College, Community, and Justice, Liberis recently reconnected with like minded peers and gained a network of support and access to resources that will help him achieve his academic goals.
In light of a new survey released by the Hope Center, the organization is now recommending for both the city and state to implement widespread action to uplift residents out of poverty and into prosperity. Their survey highlights affordability as the key barrier for those who live In the nation's poorest major city whom wish to excel in college and ultimately earn a degree.
Liberis, like many young high school graduates, was seeking a change in environment and an opportunity for upward mobility or as he says "a better life." Part of his reason for applying to college was also to flee communities with high crime rates.
"I applied partly because I didn't want to be home inside a community with violence, there's so much violence in the city. I wanted to be in an environment where I could focus on school," he said.
Liberis initially started his college journey at Kutztown University in Berks County. He ultimately withdrew due to financial burdens or as the #RealCollege survey suggests, "basic needs insecurity."
"My father's business was actually encountering financial instability, in fact some financial problems. He wasn't able to put me through school like how he initially said he would. Life happens. Life hit him like it hit me. We're all humans at the end of the day," Liberis said.
With no one else to ask for help things were looking dim.
'It is a strong state name': Pa. State System announces new identity for western regional campus
"My mother refused to take out any loans, my father couldn't take out any loans, and I didn't have any credit or was under the age of 21 so I needed a co-signer," Liberis said.
Testimonials like Liberis' are starting to sound too familiar. Fortunately for him and as a result of his hard work and dedication, he's back on track, working, and currently attending Penn State University and is scheduled to graduate in 2022.
The Hope Center's recommendations are aimed at reversing the trend of Philadelphians dropping out of college. In the city, approximately one in four residents lives in poverty, and more than one in six residents over 25 started college but left before graduation. Comparatively, half of the city's available jobs require at least some education beyond high school.
"When communities fail to support students, they fail at allowing them to succeed," said Sara Goldrick-Rab, president and CEO of The Hope Center. "We urge community leaders and organizations to use our recommendations to change the trajectory of Philadelphia's aspiring adult students."
'We are Philadelphia's university': As he takes the helm Temple's new prez talks future plans
Recommendations include augmenting existing community-based and college-run programs aimed at those who have not completed degrees, expanding access to supports like the Supplemental Nutrition Assistance Program (SNAP), creating a citywide emergency aid fund and expanding affordable child care offerings.
Victoria Peurifoy is going for her bachelor's degree in organizational leadership at Peirce College. At 69, she's considered a senior citizen student.
"I'm a writer and spoken word artist who is also a ghost writer, facilitator and speaker. And I find that people who have certain credentials behind their names, get more play than someone who supposedly doesn't, not considering the level of experience that they have," Peurifoy said.
Peurifoy has been assisted by Graduate! Philadelphia and wrote a book which debuted Oct. 9.
"Philadelphians Speak Up About Barriers to College Completion" features the efforts of community organizations such as Graduate! Philadelphia to lift adult students out of poverty and into prosperity. It also recommends key actions by city and state leaders to help Philadelphians find an affordable way to complete their studies and improve their economic mobility.
Peurifoy has three adult children who support her wholeheartedly. But when they were younger it was challenging to care for a family and maintain a full time student status.
However, she managed to complete an associate program at the Community College of Philadelphia but desired to go further years later.
"The day that I was supposed to graduate from community college in 1993 was the same day that I was burying my mother. So a lot of things I put off [due to ] family, life, work, responsibilities and all that," said Peurifoy.
Nearly two out of five survey respondents without a college degree said rent and child care are not affordable while trying to attend college.
"Those were some of the reasons why everything was delayed. But then when my sister presented to me about going back to school, of course I made the normal excuses. What am I supposed to do? and how am I supposed to do that?"
"I can't afford that, you know. But she said, stop making excuses and just go, a way will be made. So, fortunately, the gentleman who was my enrollment counselor asked if I graduated from community college. I said, "yes", he said," you know, they have a grant that they give students that graduate from community college to come to Pierce?," said Peurifoy.
The financial award and flattering letters of recommendations made achieving a bachelor's degree real for Peurifoy.
"The one thing that was a very big advantage of having the scholarship was that it allowed me to pay for books. The books for my class were very expensive," she said.
In Peurifoy's case "The Triumph Continues," the name of her new motivational memoir and as a COVID-19 survivor her story is her story of triumph. Like Liberis, she is scheduled to graduate next year.
For Peurifoy and Liberis, things are seemingly well but overall there is much more that needs to be done to create better opportunities for Philadelphia residents.
The coronavirus pandemic created new hardships and is having longer lasting effects on African-American students for various reasons. One serious concern is the increase in violent crimes in Philadelphia over the last year.
"Safety plays a big role," said Jabari Jones, president of West Philadelphia's largest coalition of small businesses and the convener of West Philadelphia's entrepreneurship ecosystem.
"We've had two recent incidents that happened in the middle of the day, of like four people getting shot or three people getting shot. And so our students and parents hear those stories or things of that nature, and make different kinds of decisions and say you know what?, I don't want to be on campus or I may not want an off campus apartment or some students are even making the decision to say hey you know what I think I'm going to take classes online only and stay home," Jones said.
"Ultimately the decisions that people, we've kind of been advocating for a while, are then deciding either not to be here in our community or also not to shop in our community. That overwhelmingly affects the economy of West Philadelphia and the businesses that are around those college campuses that depend on that business, because they're going to see decreased traffic," he said.
Alan Tucker is a reporter for the Philadelphia Tribune, where this story first appeared.

Temple Univ. initiative aims to keep more Black Philly youth in college

by Special to the Capital-Star, Pennsylvania Capital-Star
November 1, 2021

redpajama_set_name: RedPajamaCommonCrawl


Born in Berlin, of an American mother and a French father, he grew up in Paris. He started to learn the piano when was 5 and after studying classical piano in school, he studied jazz, in particular with Jeff Gardner. His encounter with Francis Paudras (whose movie, "Round Midnight", tells the moving story of a lasting friendship with Bud Powell) played an important role his initiation into jazz. Jacky then went to the United States to attend the Berklee College of Music. In 1993, after winning the prestigious Thelonious Monk Award, he began touring with Betty Carter. He then decided to move to New York, where he still lives today.
Exactly one year after his triumph in the Thelonious Monk competition, the New York Times Magazine introduced Jacky as one of the 30 under 30, that is to say one of the 30 artists most likely to change American culture in the next 30 years. He then signed with the prestigious Blue Note label.
He made three trio recordings for Blue Note (Jacky Terrasson, Reach, and Alive). He then devoted himself to several collaborations: "Rendezvous", with Cassandra Wilson, and "What it is", with Michael Brecker and Mino Cinelu. Beginning in 2001, he recorded "A Paris" for Blue Note, a very personal interpretation of French classics; "Smile", (Best Jazz Album of the Year, 2003 Victoires du Jazz and a Gold Django), and finally a solo album, "Mirror".
In February 2012, Jacky Terrasson signed with Universal Jazz France. His first recording, "Gouache", will appear in Fall 2012, and it is a joyous celebration of his 20-year career. In this recording, he is surrounded by the best of the upcoming New York jazz generation, but also by Michel Portal, Stéphane Belmondo, Minino Garay, and singer Cecile McLorin-Salvant.
He performs regularly in solo and in trio in the great jazz festivals (Montreal, San Francisco, Montreux, North Sea Jazz, Marciac); and in the most prestigious Piano festivals (Klavier Ruhr Festival, Lucerne, La Roque d'Anthéron, Piano aux Jacobins). He also plays regularly in Asia, in Japan, South Korea and in China, as well as in Europe and the United States.
If we were to describe his playing, we would compare Jacky Terrasson to Bud Powell for his carefully controlled velocity on the piano keys, to Ahmad Jamal for his sense of phrasing, but also for his knowledge of the great French composers such as Ravel, Fauré and Debussy. Through his fingers, as Jacky mingles and melts the colors and the inventions of the great pianists of yesterday and today, as he creates his own style, subtle and fresh played with facility and ease, pushed by the desire to rewrite and reinvent, again and again, every day and forever.
Jackie Terrasson's "Gouache" was reviewed in the July 2013 issue of DownBeat!


Crafity is a professional software development and consultancy company located in the Netherlands.
The main focus of the company is to help clients automate their business and doing this in a transparent, qualitative and cost effective way.
Main activities of the company are consultancy and development services. Crafity helps clients solve practical IT challenges as well as coming up with new and interesting ways of putting technology to use.
Send us an email to get in touch.


Agendas and staff reports are available prior to meetings. Minutes are posted in next meeting's packet.
A five-member board of directors governs our district, with each director elected to represent one of five geographic areas. The directors serve overlapping four-year terms. The board establishes policy on the district's mission, goals, and operations. It represents the general public in deciding issues related to water supply. The board also has the authority to adopt ordinances that have the force of law within the district.
The board reviews staff recommendations and decides which policies should be implemented in light of the district's mission and goals. The board also monitors the implementation of its policies. The board appoints a general manager to supervise all district operations.
Directors are elected to office in accordance with the provisions of the Municipal Water District Law of 1911 (State Water Code Section 71000). Directors are elected officials representing each of MMWD's five divisions and are elected by voters in the November general election in even-numbered years. For information on election procedures please visit the County of Marin Elections Department.


Go here? Tell us why you love Chattahoochee Presbyterian Church. Visited? Tell us what a newcomer can expect.
Enter your email address to receive an informative welcome email from Chattahoochee Presbyterian Church.


text:
Our recent findings show that
The share of private schooling has grown rapidly in some of our study countries. Between 2002 and 2009, the uptake of private schooling for 8-year-olds increased from 24 per cent to 44 percent in Andhra Pradesh.
Students in private schools in Andhra Pradesh do not learn more mathematics or the local language at the primary level than students in government schools but do have substantial gains in English skills. At the secondary level, there seem to be modest additional gains for private school students. Most differences in the test scores of private and government school students reflect pre-existing gaps from socio-economic and other background factors.
Teachers in private schools are less well-paid and younger but perform as well at much lower salaries – this enables private schools to be considerably more cost-effective.
Parents choose private schools frequently because of the emphasis on English skills and because of general perceptions of private schools providing better education.
Access to private schools still remains inequitable with a lower proportion of girls and children from poorer families and children in rural areas accessing private schools – this calls for a careful assessment of the role of private schools in an Education for All framework.


text:
Home › Photography Masters › Category Archives › People
Subscribe to this category
Biography: 19th Century Danish photographer Mary Steen
Mary Dorothea Frederica Steen (1856 – 1939) was a Danish photographer and feminist. At the age of 28, she opened a studio in Copenhagen where she specialized in indoor photography. In 1884, at the age of 28, she opened her own photographic studio on Amagertorv in the centre of Copenhagen. At the 1888 Nordic Exhibition she won a silver medal…
Biography: human rights photographer Alice Seeley Harris
Alice Seeley Harris (1870–1970) was an English missionary and an early documentary photographer. Her photography helped to expose the human rights abuses in the Congo Free State under the regime of Leopold II, King of the Belgians. In 1889, aged 19 yrs, Alice entered the Civil Service and was later appointed to the Accountant General's office in GPO London. Alice…
Biography: 19th Century photographer Henry Peach Robinson
Henry Peach Robinson (1830 – 1901) was an English pictorialist photographer best known for his pioneering combination printing – joining multiple negatives or prints to form a single image; an early example of photomontage. In 1852 he exhibited an oil painting, On the Teme Near Ludlow, at the Royal Academy. That same year he began taking photographs, and five years…
Biography: 19th Century photographer Heinrich Kühn
Heinrich Kühn (1866 – 1944) was an Austrian–German photographer and photography pioneer. Kühn is regarded one of the forefathers of fine art photography, the movement that helped photography to establish itself as an art on its own. His photographs closely resemble impressionist paintings, with their frequent use of soft lighting and focus. Kühn was part of the pictorialist photographic movement.…
Biography: 19th Century East Asia photographer Felice Beato
Felice Beato (1832 – 1909) was an Italian–British photographer. He was one of the first people to take photographs in East Asia and one of the first war photographers. Because of the existence of a number of photographs signed "Felice Antonio Beato" and "Felice A. Beato", it was long assumed that there was one photographer who somehow photographed at the…
Biography: 19th Century Royal photographer William Bambridge
William Bambridge (1820 – 1879) was born in Windsor, Berkshire, England. In 1848 Bambridge joined the studio of William Fox Talbot in the castle at Windsor. In 1854, he was appointed the Royal Photographer to Queen Victoria, remaining in the Queen's employment for 14 years. His subjects include not only members of the Royal family and their pets but also…
Biography: 19th Century photographer Giuseppe Primoli
Giuseppe Primoli (1851 – 1927) was an Italian photographer. He lived in Paris from 1853 to 1870. He befriended writers and artists both in Italy and France, and was host to Guy de Maupassant, Paul Bourget, Alexandre Dumas fils, Sarah Bernhardt and others in Palazzo Primoli in Rome. In 1901 he became the sole owner of the palazzo, which he…
Biography: Pictorial/Nudes photographer Arthur F. Kales
Arthur F. Kales (1882 – 1936) received a law degree from the University of California at Berkeley in 1903. While living in the Bay Area, he became interested in the burgeoning Pictorialist movement in photography that flourished there, and his images met with immediate success. Kales moved to Los Angeles to work in advertising but returned to San Francisco in…
Biography: 19th Century Dutch-Flemish photographer Isidore van Kinsbergen
Isidore van Kinsbergen (1821 – 1905) was a Dutch-Flemish engraver who took the first archaeological and cultural photographs of Java during the Dutch East Indies period in the nineteenth century. Having studied painting and singing in Paris, he joined a French opera group that travelled to Batavia (the present day Jakarta) in 1851. After several performances the group left the…
Biography: 19th Century Daguerreotype Studio – Southworth & Hawes
Albert Sands Southworth (1811-1894) and Josiah Johnson Hawes (1808-1901) operated a daguerreotype studio together in Boston, MA. They are considered the finest American portrait photographers of the nineteenth century. Southworth & Hawes worked almost exclusively in the daguerreotype process. Working in the 8 ½ x 6 ½ inch whole plate format, their images are brilliant, mirror-like, and finely detailed. Writing…
Biography: 19th Century British India photographer Fred Bremner
Fred Bremner (1863-1941) was a Scottish photographer. His portraiture work in British India, spanning 1882 to 1922, preserves a record of life in the period. In 1882, Bremner accepted an offer of work from his brother-in-law G. W. Lawrie, who ran a successful photography business in Lucknow, and he was assigned work throughout northern India (modern India and Pakistan). In…
Biography: Broadway photographer Joseph Byron
Joseph Byron (January 1847 – May 28, 1923) was an English photographer who founded the Byron Company in Manhattan. He was born in England. His father, grandfather, and greatgrandfather were photographers. He received a commission from the British government to photograph the conditions in English coal mines. He emigrated to the United States in 1888 with his children, Percy Claude…
Biography: 19th Century Javanese photographer Kassian Cephas
Kassian Cephas (1845 – 1912) was a Javanese photographer of the court of the Yogyakarta Sultanate. He was the first indigenous person from Indonesia to become a professional photographer and was trained at the request of Sultan Hamengkubuwana VI (r. 1855–1877). After becoming a court photographer in as early 1871, he began working on portrait photography for members of the…
Biography: American West photographer Edward S. Curtis
4 April 2017 0
Edward Sheriff Curtis (1868 – 1952) was an American photographer and ethnologist whose work focused on the American West and on Native American people. Edward was born in Wisconsin to parents Ellen and Johnson Curtis. His sister, Eva, was born in 1870 and his brother, Asahel, in 1874. Edward also had an older brother, Ray, born in 1861. After Asahel's…
Biography: pictorial photographer Emma Justine Farnsworth
Emma J. Farnsworth (1860-1952) was an American photographer from Albany, New York. Farnsworth had training in the arts. After receiving her first camera in 1890, her photographs were displayed at the World's Columbian Exposition (1893). Before the end of the decade, she had been awarded almost 30 medals at various exhibitions in the world. Her work was also displayed at…
Biography: pioneer paparazzo Ron Galella
Ronald Galella (born January 10, 1931) is an American photographer, known as a pioneer paparazzo. Dubbed "Paparazzo Extraordinaire" by Newsweek and "the Godfather of the U.S. paparazzi culture" by Time magazine and Vanity Fair, he is regarded as the most controversial celebrity photographer in the world.
Biography: Documentary / People photographer John Albok
John Albok (1894–1982) was a Hungarian photographer who immigrated to the United States and documented street scenes in New York City during the Great Depression and later. For sixty years, using a 5 x 7 view camera and then a twin lens reflex camera, Albok took as his subject people and passersby outside his shop, and New York City life…
Biography: Documentary photographer Walker Evans
Walker Evans (1903 – 1975) was an American photographer best known for his work for the Farm Security Administration (FSA) documenting the effects of the Great Depression. Much of Evans's work from the FSA period uses the large-format, 8×10-inch camera. He said that his goal as a photographer was to make pictures that are "literate, authoritative, transcendent". Many of his…
Biography: People/Portrait photographer Pedro Luis Raota
Pedro Luis Raota (1934-1986) was an Argentinian photographer. At a young age he sold his bicycle to buy a camera, determined to learn the art of photography. He quickly took up portrait photography in Santa Fe de la Vera Cruz and later moved to Villaguary where he enthusiastically set up his own studio. Since his first recognition in 1958, he…
Biography: People photographer Adam Clark Vroman
Adam Clark Vroman was born April 15, 1856, in La Salle, Illinois. Died July 24, 1916, in Altadena, California. Vroman started working for the Railroad in 1874. In 1892, to improve his wife's health, they moved to Pasadena, California. He began taking photographs in 1892. In 1895 he started work on a complete series of the California missions. That summer…
Vintage Photos of Moscow in 1910s
After losing the status as capital of the empire, the population of Moscow at first decreased, from 200,000 in the…


While cavities are a problem for a lot of people, do you know how they develop and if you have a cavity? Dental caries, more commonly known as cavities, start as decay that creates a tiny hole in the enamel and can develop into a big problem if left untreated. If you know the symptoms of a cavity, you'll know to schedule an appointment to get it fixed before the cavity becomes a bigger problems needing a root canal or other lengthy procedure. The best way to detect cavities in the early stages is by scheduling regular cleanings and exams at your dentist's office in Chicago, IL. With advanced equipment like digital x-rays, we can check for an existing cavity as well as weakened areas of enamel that are at high risk. However, if you're experiencing symptoms of a cavity, like pain or sensitivity, you should try to get an earlier appointment.
A cavity can change the color of the infected tooth or cause the development of spots. Black or brown areas on your enamel are an obvious symptom that you have a cavity. Even if you don't have other cavity symptoms, enamel discoloration is a big clue that you need a dentist. Even though you may not concerned about discoloration affecting the appearance of your smile, you should be worried about your health. Make an appointment at your dentist in Chicago, IL to get enamel discoloration diagnosed and treated.
Both your mouth and stomach have bacteria, which can be beneficial or harmful. Harmful bacteria, usually left by high sugar drinks and food, when you don't remove it fast enough, becomes plaque. The acid in these plaque formations erode the enamel making it thin and weak. In time, a hole (cavity) develops in the enamel. Since the molars have lots of grooves and crevices that give bacteria a hiding place, cavities often develop here. One way to avoid cavities is to limit your consumption of food and drinks that are high in sugar and acid (like citrus juices and soda). Flossing and brushing at least twice a day also helps to minimize the chance of developing cavities. Patients who do get cavities a lot ask about preventive treatments like professional fluoride rinses and sealants.
If you make an appointment at DentalWorks in Chicago, IL with symptoms of a cavity or other concerns, we will usually begin with a basic examination to check your oral health. We may need digital x-rays to diagnose the problem and see if the decay has spread. When the cavity is diagnosed, your dentist can create a plan for treatment. Typically, the cavity will be removed from the enamel and then the area is protected with a filling. DentalWorks offers fillings made with composite resin, which will be tinted based on the color of your teeth so it blends seamlessly. If a filling is not enough to cover the cavity, we may suggest a custom onlay, inlay, or dental crown. Root canal therapy may be necessary if the decay has reached the dental pulp.
Professional cleanings and exams at your dentist are the best way to prevent cavities. However, if you haven't been in a while or you are concerned that you may have a cavity, go to a dentist in Chicago, IL. Don't suffer from sensitivity, pain, and toothaches; we will work hard to make your appointment quick while getting you the right treatment. For patients with anxiety about visiting the dentist, ask for more information on our sedation methods to keep you comfortable and relaxed throughout your exam and treatment.


text:
<!DOCTYPE html>
<html>
	{% include head.html %}
	<body>
	{% include header.html %}
		<main id="main" role="main">
			{{ content }}
		</main>
		{%include footer.html%}
		{% include scripts.html %}
	</body>
</html>

redpajama_set_name: RedPajamaGithub


950 Marietta Street, Atlanta GA Zip Code: 30318.
Serving All Areas of Atlanta Call Now: 770-552-9255. Free Apartment Locating service. We match your needs to availablities offered by the hundreds of apartment communities we list. We tailor make you a list of communties with vacancies in your area, price range and size. Call us today.


text:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">

<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>MobileApplicationCertificate (ContactLab SOAP API Java Client - NEXT 2.23.0 API)</title>
<meta name="date" content="2019-11-07">
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">

JavaScript is disabled on your browser.

Skip navigation links

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

Prev Class

Next Class

Frames

No Frames

All Classes

Summary:

Nested |

Field |

Constr |

Method

Detail:

Field |

Constr |

Method

com.contactlab.api.ws.domain

Class MobileApplicationCertificate

java.lang.Object

com.contactlab.api.ws.domain.MobileApplicationCertificate

Direct Known Subclasses:

APNsMobileApplicationCertificate, GCMsMobileApplicationCertificate

public abstract class MobileApplicationCertificate
extends java.lang.Object

Java class for MobileApplicationCertificate complex type.

The following schema fragment specifies the expected content contained within this class.

 <complexType name="MobileApplicationCertificate">
   <complexContent>
     <restriction base="{http://www.w3.org/2001/XMLSchema}anyType">
       <sequence>
         <element name="id" type="{http://www.w3.org/2001/XMLSchema}int"/>
         <element name="code" type="{http://www.w3.org/2001/XMLSchema}string" minOccurs="0"/>
         <element name="ownerCustomerId" type="{http://www.w3.org/2001/XMLSchema}int"/>
         <element name="active" type="{http://www.w3.org/2001/XMLSchema}boolean"/>
         <element name="versionBy" type="{http://www.w3.org/2001/XMLSchema}int"/>
         <element name="insertedAt" type="{http://www.w3.org/2001/XMLSchema}dateTime" minOccurs="0"/>
         <element name="lastModifiedAt" type="{http://www.w3.org/2001/XMLSchema}dateTime" minOccurs="0"/>
         <element name="authorized" type="{http://www.w3.org/2001/XMLSchema}boolean"/>
         <element name="authorizedOn" type="{http://www.w3.org/2001/XMLSchema}dateTime" minOccurs="0"/>
         <element name="authorizedBy" type="{http://www.w3.org/2001/XMLSchema}int" minOccurs="0"/>
         <element name="pushEndpointType" type="{domain.ws.api.contactlab.com}PushEndpointType" minOccurs="0"/>
         <element name="mobileApplicationCode" type="{http://www.w3.org/2001/XMLSchema}string" minOccurs="0"/>
         <element name="assignments" type="{domain.ws.api.contactlab.com}MobileApplicationCertificateAssignment" maxOccurs="unbounded" minOccurs="0"/>
       </sequence>
     </restriction>
   </complexContent>
 </complexType>

Field Summary

Fields

Modifier and Type
Field and Description

protected boolean
active

protected java.util.List<MobileApplicationCertificateAssignment>
assignments

protected boolean
authorized

protected java.lang.Integer
authorizedBy

protected javax.xml.datatype.XMLGregorianCalendar
authorizedOn

protected java.lang.String
code

protected int
id

protected javax.xml.datatype.XMLGregorianCalendar
insertedAt

protected javax.xml.datatype.XMLGregorianCalendar
lastModifiedAt

protected java.lang.String
mobileApplicationCode

protected int
ownerCustomerId

protected PushEndpointType
pushEndpointType

protected int
versionBy

Constructor Summary

Constructors

Constructor and Description

MobileApplicationCertificate()

Method Summary

All Methods Instance Methods Concrete Methods

Modifier and Type
Method and Description

java.util.List<MobileApplicationCertificateAssignment>
getAssignments()

Gets the value of the assignments property.

java.lang.Integer
getAuthorizedBy()

Gets the value of the authorizedBy property.

javax.xml.datatype.XMLGregorianCalendar
getAuthorizedOn()

Gets the value of the authorizedOn property.

java.lang.String
getCode()

Gets the value of the code property.

int
getId()

Gets the value of the id property.

javax.xml.datatype.XMLGregorianCalendar
getInsertedAt()

Gets the value of the insertedAt property.

javax.xml.datatype.XMLGregorianCalendar
getLastModifiedAt()

Gets the value of the lastModifiedAt property.

java.lang.String
getMobileApplicationCode()

Gets the value of the mobileApplicationCode property.

int
getOwnerCustomerId()

Gets the value of the ownerCustomerId property.

PushEndpointType
getPushEndpointType()

Gets the value of the pushEndpointType property.

int
getVersionBy()

Gets the value of the versionBy property.

boolean
isActive()

Gets the value of the active property.

boolean
isAuthorized()

Gets the value of the authorized property.

void
setActive(boolean value)

Sets the value of the active property.

void
setAuthorized(boolean value)

Sets the value of the authorized property.

void
setAuthorizedBy(java.lang.Integer value)

Sets the value of the authorizedBy property.

void
setAuthorizedOn(javax.xml.datatype.XMLGregorianCalendar value)

Sets the value of the authorizedOn property.

void
setCode(java.lang.String value)

Sets the value of the code property.

void
setId(int value)

Sets the value of the id property.

void
setInsertedAt(javax.xml.datatype.XMLGregorianCalendar value)

Sets the value of the insertedAt property.

void
setLastModifiedAt(javax.xml.datatype.XMLGregorianCalendar value)

Sets the value of the lastModifiedAt property.

void
setMobileApplicationCode(java.lang.String value)

Sets the value of the mobileApplicationCode property.

void
setOwnerCustomerId(int value)

Sets the value of the ownerCustomerId property.

void
setPushEndpointType(PushEndpointType value)

Sets the value of the pushEndpointType property.

void
setVersionBy(int value)

Sets the value of the versionBy property.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

id

protected int id

code

protected java.lang.String code

ownerCustomerId

protected int ownerCustomerId

active

protected boolean active

versionBy

protected int versionBy

insertedAt

protected javax.xml.datatype.XMLGregorianCalendar insertedAt

lastModifiedAt

protected javax.xml.datatype.XMLGregorianCalendar lastModifiedAt

authorized

protected boolean authorized

authorizedOn

protected javax.xml.datatype.XMLGregorianCalendar authorizedOn

authorizedBy

protected java.lang.Integer authorizedBy

pushEndpointType

protected PushEndpointType pushEndpointType

mobileApplicationCode

protected java.lang.String mobileApplicationCode

assignments

protected java.util.List<MobileApplicationCertificateAssignment> assignments

Constructor Detail

MobileApplicationCertificate

public MobileApplicationCertificate()

Method Detail

getId

public int getId()

Gets the value of the id property.

setId

public void setId(int value)

Sets the value of the id property.

getCode

public java.lang.String getCode()

Gets the value of the code property.

Returns:

possible object is
     String

setCode

public void setCode(java.lang.String value)

Sets the value of the code property.

Parameters:

value - allowed object is
     String

getOwnerCustomerId

public int getOwnerCustomerId()

Gets the value of the ownerCustomerId property.

setOwnerCustomerId

public void setOwnerCustomerId(int value)

Sets the value of the ownerCustomerId property.

isActive

public boolean isActive()

Gets the value of the active property.

setActive

public void setActive(boolean value)

Sets the value of the active property.

getVersionBy

public int getVersionBy()

Gets the value of the versionBy property.

setVersionBy

public void setVersionBy(int value)

Sets the value of the versionBy property.

getInsertedAt

public javax.xml.datatype.XMLGregorianCalendar getInsertedAt()

Gets the value of the insertedAt property.

Returns:

possible object is
     XMLGregorianCalendar

setInsertedAt

public void setInsertedAt(javax.xml.datatype.XMLGregorianCalendar value)

Sets the value of the insertedAt property.

Parameters:

value - allowed object is
     XMLGregorianCalendar

getLastModifiedAt

public javax.xml.datatype.XMLGregorianCalendar getLastModifiedAt()

Gets the value of the lastModifiedAt property.

Returns:

possible object is
     XMLGregorianCalendar

setLastModifiedAt

public void setLastModifiedAt(javax.xml.datatype.XMLGregorianCalendar value)

Sets the value of the lastModifiedAt property.

Parameters:

value - allowed object is
     XMLGregorianCalendar

isAuthorized

public boolean isAuthorized()

Gets the value of the authorized property.

setAuthorized

public void setAuthorized(boolean value)

Sets the value of the authorized property.

getAuthorizedOn

public javax.xml.datatype.XMLGregorianCalendar getAuthorizedOn()

Gets the value of the authorizedOn property.

Returns:

possible object is
     XMLGregorianCalendar

setAuthorizedOn

public void setAuthorizedOn(javax.xml.datatype.XMLGregorianCalendar value)

Sets the value of the authorizedOn property.

Parameters:

value - allowed object is
     XMLGregorianCalendar

getAuthorizedBy

public java.lang.Integer getAuthorizedBy()

Gets the value of the authorizedBy property.

Returns:

possible object is
     Integer

setAuthorizedBy

public void setAuthorizedBy(java.lang.Integer value)

Sets the value of the authorizedBy property.

Parameters:

value - allowed object is
     Integer

getPushEndpointType

public PushEndpointType getPushEndpointType()

Gets the value of the pushEndpointType property.

Returns:

possible object is
     PushEndpointType

setPushEndpointType

public void setPushEndpointType(PushEndpointType value)

Sets the value of the pushEndpointType property.

Parameters:

value - allowed object is
     PushEndpointType

getMobileApplicationCode

public java.lang.String getMobileApplicationCode()

Gets the value of the mobileApplicationCode property.

Returns:

possible object is
     String

setMobileApplicationCode

public void setMobileApplicationCode(java.lang.String value)

Sets the value of the mobileApplicationCode property.

Parameters:

value - allowed object is
     String

getAssignments

public java.util.List<MobileApplicationCertificateAssignment> getAssignments()

Gets the value of the assignments property.

 This accessor method returns a reference to the live list,
 not a snapshot. Therefore any modification you make to the
 returned list will be present inside the JAXB object.
 This is why there is not a set method for the assignments property.

 For example, to add a new item, do as follows:

    getAssignments().add(newItem);

 Objects of the following type(s) are allowed in the list
 MobileApplicationCertificateAssignment

Skip navigation links

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

Prev Class

Next Class

Frames

No Frames

All Classes

Summary:

Nested |

Field |

Constr |

Method

Detail:

Field |

Constr |

Method

Copyright © 2019 ContactLab. All Rights Reserved.


text:
package com.iluwatar.property;

/**
 * Interface for prototype inheritance
 */
public interface Prototype {

  Integer get(Stats stat);

  boolean has(Stats stat);

  void set(Stats stat, Integer val);

  void remove(Stats stat);
}


I was fortunate to meet George once. We were introduced by Robbie Meyer of L'Angevin while I was out in Napa working harvest this past October. We arrived to George's house unannounced, and after walking through the vineyard, George was gracious enough to chat with us. He talked about how the California wine industry had changed, how excited he was about all the new interest in balanced wines, and even the blogosphere.
Unsurprisingly, we also talked about Ribolla Gialla — and George made a fantastic joke about some of his clients picking too early.
George entered the wine industry in 1972 while an executive with Schlitz Brewing Company. That year, the company purchased Geyser Peak Winery and appointed Vare as president. Over the next few years, he grew Geyser Peak into a 700,000 case winery before resigning to launch a number of other wine brands. George is likely best known for Luna Vineyards, which he founded in 1995 with wine industry veteran Mike Moone.
Our thoughts go out to all George's friends and family. He'll be missed.
George was not just a fine and generous wine person, he was an extraordinary human. His optimism and determination in the face of a devastating battle with melanoma was inspirational. He kept his humor to the end and his love for life and wine. The world has lost a marvelous person who, in the words of my wife, was a gentle giant. God rest his soul.


text:
The book of evidence; John Banville
Edition: Twenty-fifth anniversary edition
Class Number: THRILLER
Publisher: Picador, 2014
Previous edition: London: Secker & Warburg, 1989
Originally published: London: Secker & Warburg, 1989
Freddie Montgomery is a gentleman first and a murderer second. He committed two crimes - he stole a small Dutch master from a wealthy family friend and he murdered a chambermaid who caught him in the act. He tells his own story in spellbinding prose.
Series: Picador classic
Additional information: xv, 283 pages, illustrations (black and white), 20 cm, pbk
Mrs Osmond
Note: Originally published: UK: Viking, 2017 Having fled Rome and a stultifying marriage, Isabel Osmond is in London, brooding on the recent disclosure of her husband's shocking, years-long betrayal of her. What should she do now, and which way should she turn, in the emotional labyrinth where she has been trapped for so long? Reawakened by grief and the knowledge of having been grievously wronged, she determines to resume her youthful quest for freedom and independence. Soon Isabel must return to Italy and confront her husband, and seek to break his powerful hold on her. But will she succeed in outwitting him, and securing her revenge?


Is there anyone you can count on as much as your pet? Sure, they can't really help with the chores or remind you of appointments, but they're always there to give you a little love and more than a few laughs. This week we celebrate our pets by showing them how much we appreciate them. This can be shown in so many ways from a new toy to special treats to an extra long walk or play session. This week is also a good time to make sure your pet's medical needs are up-to-date too.
I received a copy of Nanny Paws from Two Lions to check out. All opinions are my own.
Copyright Wendy Wahman, 2018, courtesy of Two Lions Publishing.
Wendy Wahman's laugh-out-loud story will delight kids, and any pet owner will instantly recognize the zany shenanigans that endear furry friends to a family. As a particular Tuesday plays out, adorable Ally and Mae's sweet poodle is at the center of the action, eager to help out just as any good nanny would. But who is she really helping? Wahman's straightforward storytelling juxtaposes hilariously with her madcap illustrations that offer up funny, dog-centric interpretations of each task in the children's day.
Kids will fall in love with this little pink poodle and want her to visit every day, making Nanny Paws a perfect addition to the family bookshelf or classroom library.
Discover more about Wendy Wahman, her books, and her art on her website.
Pause a moment to watch the Nanny Paws book trailer!
A print of your pet's paw makes a cute magnet for your fridge or locker to give you a paw…er, hand… holding those important messages and pictures. Here's how to do this easy craft with your dog or cat.
Slowly add the water and mix the dough, kneading it until it is smooth and soft. Add more water if necessary.
Carefully press your pet's paw into the dough.
Today's holiday was established to encourage people to have courage and do that thing inside them that might be a little different or way out there, but actually defines them. Without people who have explored those other possibilities, the world would be missing out on some amazing art, inventions, innovations, music, and, of course, books! To celebrate, unleash your inner you or go a little wild. Who knows? It might become a regular thing that makes you happy!
Image copyright Gus Gordon, 2017, text copyright Jason Carter Eaton, 2017. Courtesy of Crown Books for Young People.
The town daredevil made a world record after spotting the cat. The town librarian had a life-changing revelation after seeing the cat. And little Bushy Brows Billiam, suddenly understood his lesson better by looking at things a bit differently.
All through town, people began tilting their head and even walking at a slant. Architects began building homes, apartments, and stores that leaned, and car makers designed "off-kilter" vehicles. The effect on the town and the people was amazing. They found favorite possessions they thought lost forever, "and rediscovered old friends they thought they'd never know again." The first Tuesday of the year was designated "Catawampus Cat Day." Confetti was flung at an angle, a band played off-key, and the crowd was entirely catawampus.
In his delightfully inventive story, Jason Carter Eaton rejoices in all those people (and cats) who walk their own way through life. He encourages young readers to embrace their uniqueness, telling them it's a good thing to view the world with a different perspective. Even as the catawampus cat inspires the townspeople, Eaton strikes a humorous cautionary note about the nature of fads. He also happily reminds readers that the truly innovative will always find a way to be different.
Gus Gordon's adorably confident cat sets off his chain reaction of "uniqueness" in detailed mixed-media illustrations that provide lots of opportunities for kids to discover new (and old—sometimes even antique) perspectives as they watch the catawampus cat walk through this diverse town in his own particular way. Surprising and funny details drawn in along the way will also have readers lingering and giggling over each page. Cat lovers will recognize some endearing cat-titudes in the catawampus cat that make feline friends so loveable. The endpapers provide a map of the catawampus cat's route through this very lucky town.
Smile- and laugh-inducing from cover to cover, The Catawampus Cat would be a favorite and often-asked-for choice for home and classroom libraries.
To learn more about Gus Gordon, his books, and his art, visit his website.
Did you know that gardening is good exercise? Well, all that tilling and digging and bending and carrying adds up to quite a strenuous workout! Today's holiday encourages couch potatoes (eye just couldn't help myself) to get up and get out! In addition to exercise, gardening provides other health benefits, such as nutritious food, stress relief, and a sunny dose of vitamin D. So grab a planter or patch, some dirt, and some seeds and plot out (so sorry…) your garden!
Image copyright Rosalind Beardshaw, text copyright Anna McQuinn. Courtesy of Charlesbridge Publishing.
When the garden is in full bloom, Lola's daddy helps her hang the string of bells above it. Mary Mary is given her own special spot too. When her little plot looks perfect, Lola invites her friends to see her garden. She and Mommy make cupcakes, and Lola wears a flowered shirt, flowers in her hair, and a beaded bracelet.
Lola's friends love the garden. "They share the crunchy peas and sweet strawberries that Mommy grew." While the four friends enjoy the cupcakes and juice, Lola entertains them with a story starring her Mary Mary doll. Already Lola is thinking about what garden she will plant next.
Little ones will be excited to meet Lola, whose love of flowers and the "Mary Mary" poem spurs her creativity in so many directions—from gardening to crafting to cooking to pretending. Anna McQuinn's engaging story shows how reading can inspire action, and puts Lola in charge of making her vision come true. With simple yet lovely storytelling, McQuinn taps into children's desires to reenact what they see and read and to share their successes with others. Through her work, Lola becomes the subject of her own "Lola Lola" poem, which closes the book.
Rosalind Beardshaw's Lola is an adorable and determined girl with an ever-present smile. Young readers will love being invited into Lola's home, going along to the garden store, watching her flowers bloom into glorious colors, and joining her picnic with friends. Seeing the progression of all of Lola's projects may motivate readers to copy her—which would make for a fun summer activity!
Discover more about Anna McQuinn, her books, and her work with children on her website!
Visit Rosalind Beardshaw's website to learn more about her books and artwork!
You can join Lola in her adventures with these fun activities on the Alanna Books website!
Players continue rolling the die and "planting" vegetables until each of the determined number of rows have been filled with the determined number of vegetables.


text:
Father Jenkins extends prayers to family of Michael Adamek, 57
Author: Dennis Brown
Michael Adamek, a 57-year-old longtime custodial employee of the University of Notre Dame, was discovered unresponsive at 6:34 a.m. Thursday (Sept. 20) in the driver's seat of his automobile in the library parking lot. He had left work earlier, complaining that he felt unwell.
A passer-by notified Notre Dame police, who responded moments later with University fire department EMTs and determined that Adamek had died. There was no evidence of foul play. The St. Joseph County coroner, who also responded to the scene, will determine the cause of the death.
"My prayers are with the Adamek family and with Michael's friends and co-workers at this sad and difficult time," Notre Dame President Rev. John I .Jenkins, C.S.C., said.
Pandemic, racial justice, the economy drove Notre Dame students to the polls in 2020
Alumnus Joe Donnelly confirmed as US ambassador to the Holy See
In celebrating MLK Day, students consider what it means to be a 'beloved community'
Office of Human Resources Vice President Robert McQuade to retire June 30


Blog Posts | Welcome to AutoForexTrader!
In our first short AFT introduction we have described couple of basic features of this automated forex trading system. In this second article, we will try to look at some other features in greater detail such as what trading platform does EA need, what strategy choice does it offer, what trading instruments can one actually..
Your automated forex trading system is here Finally! Let me welcome you to our brand new web site dedicated to our awesome profit making machine called Automated Forex Trader. This amazing automated forex trading system is ready for you to take full advantage of it right now! We are excited about launching this site and..