Data Services Inc.'s Jerry Messer to Receive DMCNY Silver Apple Award

New York, NY (PRWEB) November 02, 2011

Gerald F. Messer, President/CEO of Data Services, Inc., a leading provider of multichannel services to marketing organizations across the globe, has been selected by the Direct Marketing Club of New York (DMCNY) as a recipient of its Silver Apple Award. This award recognizes those members of the direct marketing community who have made a significant contribution to the DMCNY as well as the overall direct marketing industry over a career of 25+ years.

Messers career spans over 40 years in the industry with his involvement with Data Services, Inc. beginning in 1986. Under his leadership, Data Services, Inc. achieved many milestones, specifically in the field of international data processing services for marketers looking to expand their direct mail programs to lucrative global markets. This includes being the first company in the world to offer Canadian Letter-Carrier Presort & Canadian Address Hygiene services and later being the first to offer US, Canadian & International Data Processing services under one roof, solutions that have saved hundreds of Data Services clients untold millions that would have otherwise been wasted due to mailing invalid address data.

When asked for comment upon receiving notice of his selection, Messer stated, It is truly an honor to be counted amongst a whos who of direct marketing legends who have received this award over the years. He continued, Im very much looking forward to sharing a great evening with this years other recipients as well as my friends in the DMCNY community. Those being honored along with Messer are Joseph Gomez of FMI Direct, Tom Mastrocola of American Express Publishing, Adrea Rubin of Adrea Rubin Marketing & Management, David Williams of Merkle as well as this years Golden Apple Honoree, Ralph Stevens of Ralph Stevens & Associates.

Messer is a former President of the US Direct Marketing Associations International Council, a member of the International Mailers Advisory Group (IMAG), the Federation of European Direct & Interactive Marketing (FEDMA), the Canadian Marketing Association (CMA) as well as a member and supporter of the Direct Marketing Club of New York (DMCNY) and Direct Marketing Association of Washington (DMAW).

The 2011 DMCNY Silver Apple Award Gala will be held Thursday, November 10, 2011 at the Hudson Theatre in New York, NY. For more information visit the DMCNY at http://www.dmcny.org.

About Data Services, Inc.:

Founded in 1967 and based in Salisbury, MD with offices in New York, Florida and Virginia, Data Services, Inc. is a leading provider of US, Canadian, and International data processing and enhancement services for direct and multichannel marketing organizations across the globe. These services include US, Canadian, and international address hygiene, merge/purge, NCOA, email address hygiene, match-back processing, data appends, list rental fulfillment, Email Broadcasting and much more. More info is available web at http://www.dataservicesinc.com.

About the DMCNY:

The Direct Marketing Club of New York (DMCNY) is the tri-state organization that has provided the support, education, and a network of opportunities to direct marketers for over 60 years. DMCNY is a regional, professional non-profit association for all those interested in direct marketing.

###

Find More Apple Press Releases

Microsoft Researcher to Receive ACM Award for Powerful New Tools to Solve Today's Computational Problems

New York, NY (PRWEB) April 26, 2011

The ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) http://sigact.acm.org will present its 2011 Knuth Prize to Ravi Kannan of Microsoft Research Labs India for developing influential algorithmic techniques aimed at solving long-standing computational problems. Kannans contributions address the challenges of computation with massive data that characterize todays information-driven environment. His foundational work spans many areas of theoretical computer science including lattices and their applications, geometric algorithms, machine learning, and computational linear algebra. The Knuth Prize, named in honor of Donald Knuth of Stanford University who has been called the "father" of the analysis of algorithms, will be presented at the ACM Symposium on Theory of Computing (STOC), held as part of the Federated Computing Research Conference (FCRC), June 7, 2011, in San Jose, CA. Kannan will give the Knuth Prize Lecture to an FCRC plenary audience.

Much of Kannans work has focused on efficient algorithms for mathematical and geometric problems in computer science. One of his research papers, published in 1990, has been called by some one of the most remarkable algorithmic achievements ever. It addresses the issue of easy formulas for volumes of simple three-dimensional objects like spheres and cubes. The paper, written with Martin Dyer of the University of Leeds and Alan Frieze of Carnegie Mellon University, shows how to efficiently produce estimates of the volumes of arbitrary high-dimensional convex sets. The method they developed uses random walks to do geometric sampling, a technique now central to the theory of algorithms. The winner of the Fulkerson Prize in Discrete Mathematics in 1991, this paper also introduced the notion of geometric isoperimetry, a measure of an area marked by boundaries, to theoretical computer science.

In his breakthrough 1991 paper, Kannan tackled the Frobenius problem, which seeks to find the largest number that cannot arise from a combination of certain denominations. For example, it is not possible to make seven dollars from a combination of three and five dollar bills, but every amount eight and higher is possible. Kannans paper gave the first efficient algorithm for finding this Frobenius number. This algorithm also led to important developments in integer programming and quantifier elimination.

Kannan was also cited for his research on algorithms for finding low-rank approximations to matrices, applicable to principal component analysis, which was conducted with Frieze and Santosh Vempala, then of Carnegie Mellon University. In a 1999 paper with Frieze, Kannan introduced the Weak Regularity Lemma, which has become an important new combinatorial tool in areas including sublinear algorithms, streaming algorithms, and graph limits.

A principal Researcher at Microsoft Research India, Kannan leads the algorithms research group. He is the also the first adjunct faculty of Computer Science and Automation at the Indian Institute of Science. Before joining Microsoft, he was a professor of computer science and of applied mathematics at Yale University. He previously taught at Carnegie Mellon University and the Massachusetts Institute of Technology.

A graduate with a B. Tech from the Indian Institute of Technology in Bombay, Kannan earned a Ph.D. at Cornell University.

The Knuth Prize is given every 18 months by ACM SIGACT and the IEEE Technical Committee on the Mathematical Foundations of Computer Science and includes a $ 5,000 award.

About ACM

ACM, the Association for Computing Machinery http://www.acm.org is the worlds largest educational and scientific computing society, uniting computing educators, researchers and professionals to inspire dialogue, share resources and address the fields challenges. ACM strengthens the computing professions collective voice through strong leadership, promotion of the highest standards, and recognition of technical excellence. ACM supports the professional growth of its members by providing opportunities for life-long learning, career development, and professional networking.

About SIGACT

The ACM Special Interest Group on Algorithms and Computation Theory http://sigact.acm.org fosters and promotes the discovery and dissemination of high quality research in the domain of theoretical computer science. The field includes algorithms, data structures, complexity theory, distributed computation, parallel computation, VLSI, machine learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra, program semantics and verification, automata theory, and the study of randomness. Work in this field is often distinguished by its emphasis on mathematical technique and rigor.

###

More Org Domains Press Releases