DOCSLIB.ORG

Graduation Program

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graduation Program SUFFOLKSUFFOLK COUNTYCOUNTY COMMUNITY COMMUNITY COLLEGE COLLEGE COMMENCEMENT EXERCISES MAY 22, 2011 11:00 A.M. AMMERMAN CAMPUS EASTERN CAMPUS MICHAEL J. GRANT CAMPUS SELDEN RIVERHEAD BRENTWOOD DESIGNATIONS With distinction: Students of the graduating class who have attained at least a 3.5 cumulative grade point average are graduated with distinction. With highest distinction: Students of the graduating class who have attained at least a 3.8 cumulative grade point average are graduated with highest distinction. Pi Alpha Sigma: Students who have achieved a 3.5 cumulative grade point average upon completion of 36 credits, and who have no incomplete grades at the time, receive this honor designation. Honors Graduate: This designation is given to graduates who have completed the Honors Diploma Sequence (i.e., a minimum of six honors courses) or Honors Recognition Sequence (i.e., a minimum of three honors courses). Phi Theta Kappa: Phi Theta Kappa is the international honor society for two-year colleges. The organization, which has a chapter on each of the College’s three campuses, recognizes and encourages scholarship among community college students. Alpha Beta Gamma: Alpha Beta Gamma is the business honor society for two-year colleges. The society exists to recognize and reward academic excellence among business students. Chapters are available on each of the College’s three campuses. Alpha Sigma Lambda: Alpha Sigma Lambda is a national honor society that recognizes and honors superior scholarship and leadership in adult students. A chapter is available on the Eastern Campus. Chi Alpha Epsilon: Chi Alpha Epsilon is a national honor society that recognizes academic achievements of students admitted to colleges by non-traditional criteria and serves students in the Educational Opportunity Program, Student Support Services and College Success Programs. Psi Beta: Psi Beta’s mission is to promote professional development of psychology students in two-year colleges through promotion and recognition of excellence in scholarship, leadership, research, and community service. ACADEMIC DRESS The academic dress of robe, hood, and mortarboard is derived from the regular costume of medieval students. Since they were nearly all priests or monks in training, the students wore long clerical robes with warm hoods to keep out the drafts in their chilly halls and chapels. This dress became distinctly a student’s uniform in thirteenth-century England. As the English college passed from under church control, the robes and hoods became more colorful. Today, English academic dress is known for its brilliant scarlet robes and hoods. America borrowed the idea from England without, at first, the bright colors. As early as 1880, many colleges had their own colors and shapes for the gowns of the different degrees. During that decade, colleges began to dress their students, facul- ty, and trustees in robes because it made the graduation ceremonies more impressive and increased the attendance. By 1893, the situation had become so chaotic that a large number of colleges appointed a commission to draft a uniform code for the wearing of caps, gowns and hoods. The 1895 code, with some revision in 1960, is in force today. All students in today’s ceremony will be wearing the bachelor’s gown without the hood since they will be receiving the associate degree in arts or sciences. The full bachelor’s dress includes the hood three feet in length, and the mortarboard cap. The master’s gown is similar to the bachelor’s in general shape but has either no sleeves or long trunk-like flaps under- neath the sleeve. The master’s hood is three and one-half feet long. The doctor’s gown is fuller and has long velvet pan- els draped around the neck and stitched down the front edges. The doctor’s hood is four feet long and rounded at the bot- tom. You may see these distinctions in the academic dress of the faculty. The inside of the hood is lined with the color of the college or university attended. If there are two official colors, they may be arranged in a chevron design. The holder of the hood carries the color of the department or field of learning. 2 Trustees of Suffolk County Community College Ernesto Mattace, Jr., Chairperson Walter C. Hazlitt, Vice Chairperson Dafny Irizarry, Secretary Belinda Alvarez-Groneman Saul R. Fenchel Bryan Lilly Patricia McMahon Paul V. Pontieri, Jr. Theresa Sanders Angelika Fieseler, Student Trustee Suffolk County Executive Steve Levy Suffolk County Treasurer Angie M. Carpenter Suffolk County Legislature William J. Lindsay, Presiding Officer Vivian Viloria-Fisher, Deputy Presiding Officer Wayne R. Horsley, Chairperson-Economic Development, Higher Education and Energy Committee Sarah Anker John M. Kennedy, Jr. Thomas F. Barraga Ricardo Montano Kate M. Browning Tom Muratore Tom Cilmi Lynne C. Nowick Jon Cooper Edward P. Romaine Louis D’Amaro Jay H. Schneiderman Jack Eddington Steven H. Stern DuWayne Gregory Central Administration Dr. Shaun L. McKay, President George Gatta, Jr., Executive Vice President James Amoroso, Vice President for Business and Financial Affairs Mary Lou Araneo, Vice President for Institutional Advancement Dr. Nathaniel Pugh, Vice President for Planning and Institutional Effectiveness Dr. Marvin L. Bright, Associate Vice President for Student Affairs William F. Connors, Jr., Associate Vice President for Academic Affairs, College Dean of Faculty John Lombardo, Associate Vice President for Workforce and Economic Development Louis Petrizzo, College General Counsel 3 SUFFOLK COUNTY COMMUNITY COLLEGE The Trustees, Administration, Faculty, and Staff of the College welcome you to the 2011 COMMENCEMENT EXERCISES Order of Exercises........................................Page 5 Ammerman Campus Candidates for Degrees.......................Page 6 Michael J. Grant Campus Candidates for Degrees.......................Page 17 Eastern Campus Candidates for Degrees.......................Page 24 4 Suffolk County Community College Order of Exercises Dr. Shaun L. McKay, President - Presiding ACADEMIC PROCESSIONAL....................................................................................................................Dennis Reissig, Grand Marshal Academic Chair of Mathematics and Computer Science Ammerman Campus PLEDGE OF ALLEGIANCE....................................................................................................................Dr. Shaun L. McKay and Audience “AMERICA THE BEAUTIFUL”..............................................................................................................................................College Choir Dr. Alice Cavanaugh, Director INVOCATION........................................................................................................................................................Msgr. Brian J. McNamara Vicar for Clergy – Diocese of Rockville Centre PRESIDENT’S WELCOME............................................................................................................................................Dr. Shaun L. McKay President GREETINGS FROM THE...............................................................................................................................................Ernesto Mattace, Jr. BOARD OF TRUSTEES Chairperson RECOGNITION OF INVITED GUESTS...................................................................................................................William F. Connors, Jr. Associate Vice President for Academic Affairs/ College Dean of Faculty GREETINGS FROM .........................................................................................................................David Purificato, Ammerman Campus THE GRADUATES Doralyn DeDios, Michael J. Grant Campus Danielle Anderson, Eastern Campus COMMENCEMENT ADDRESS....................................................................................................................................Elizabeth J. Millings Doctoral Student at Columbia University SCCC Class of 2008 CONFERRING OF DEGREES.......................................................................................................................................Dr. Shaun L. McKay William F. Connors, Jr. PRESENTATION OF DIPLOMAS...........................................................................................................................Campus Executive Dean Dr. James E. Sherwood, Ammerman Campus Dr. James M. Keane, Michael J. Grant Campus Dr. Evon W. Walters, Eastern Campus READING OF NAMES.........................................................................Charles T. Wittreich, Jr., and Thomas Bovino, Ammerman Campus Dr. Meryl Rogers and Dr. Randolph Manning, Michael J. Grant Campus Dr. Robert Beodeker and Dean James I. J. Frost, Eastern Campus CONCLUDING REMARKS.......................................................................................................................................William F. Connors, Jr. The Call to Ceremony will be performed by the Suffolk County Emerald Society Pipe and Drum Band. The Academic Processional and Recessional will be performed by the Symphonic Band and College Orchestra, Professor Eric Bush, Director. (The audience is requested to stand for the Processional and Recessional) 5 AMMERMAN CAMPUS GRADUATION ASSOCIATE IN ARTS January 2011 Antonio A. Abbatiello Brian L. Cohen Bridget R. Flinter Matthew J. Kearns Nicholas J. Abbruzzese Britney M. Cohen ** Jesse Friszell Ashleyann Marie Keating Nicholas M. Accardi Ricardo Antonio Colón +* Michelle L. Gaddis Krystal D. Kennedy
Load more

Recommended publications
  • Dear Class of 2019, Congratulations!
    Dear Class of 2019, Congratulations! We want your graduation day to run as smoothly as possible, so as the Faculty Marshals, we are providing some basic instructions in this email and we invite you to attend a graduation rehearsal on Wednesday, May 15th at 5:00 p.m. in Francis Auditorium. Where do I go graduation morning? Arrive at Hunt Dining Hall (only students may enter) • Graduate Students: Go to Hunt East (up the right side of stairs) • Undergraduate Students: Go to Hunt West (up the left side of stairs) What if I have mobility issues? • The procession and recession require students to climb and descend a lot of steps. The lines of graduates move at a moderate pace but they do keep moving. If you have difficulties with stairs, you can join the line of graduates at the base of the steps OR you may request reserved seating near the podium. • Contact Dr. Amy Diduch at [email protected] to discuss your needs. What do I wear? • Arrive already robed. The bathrooms will be too crowded to use as a dressing room. • Listen to weather reports and dress appropriately. • Wear shoes that are comfortable for you to walk in up and down stairs. • Keep in mind that you could be sitting for two hours in the direct sun – make sure that you are hydrated. (Sunglasses may be worn). How do I put on my regalia? • The hood goes over your head with the white velvet facing outwards and the yellow and white silk facing inwards. • The cap sits straight / flat on your head.
    [Show full text]
  • Well-Founded Functions and Extreme Predicates in Dafny: a Tutorial
    EPiC Series in Computing Volume 40, 2016, Pages 52–66 IWIL-2015. 11th International Work- shop on the Implementation of Logics Well-founded Functions and Extreme Predicates in Dafny: A Tutorial K. Rustan M. Leino Microsoft Research [email protected] Abstract A recursive function is well defined if its every recursive call corresponds a decrease in some well-founded order. Such well-founded functions are useful for example in computer programs when computing a value from some input. A boolean function can also be defined as an extreme solution to a recurrence relation, that is, as a least or greatest fixpoint of some functor. Such extreme predicates are useful for example in logic when encoding a set of inductive or coinductive inference rules. The verification-aware programming language Dafny supports both well-founded functions and extreme predicates. This tutorial describes the difference in general terms, and then describes novel syntactic support in Dafny for defining and proving lemmas with extreme predicates. Various examples and considerations are given. Although Dafny’s verifier has at its core a first-order SMT solver, Dafny’s logical encoding makes it possible to reason about fixpoints in an automated way. 0. Introduction Recursive functions are a core part of computer science and mathematics. Roughly speaking, when the definition of such a function spells out a terminating computation from given arguments, we may refer to it as a well-founded function. For example, the common factorial and Fibonacci functions are well-founded functions. There are also other ways to define functions. An important case regards the definition of a boolean function as an extreme solution (that is, a least or greatest solution) to some equation.
    [Show full text]
  • Student Clubs & Organizations
    Student Clubs & Organizations www.wilmu.edu/StudentLife American Criminal Justice Association-Lambda Alpha Epsilon--Alpha Delta Chi Chapter The Wilmington University Criminal Justice Association provides out-of-class learning experiences, networking opportunities, social interactions, and a sense of camaraderie among the Criminal Justice majors. Dr. James Warwick; 302.356.6863 [email protected] Checkmates Do you like playing chess or want to learn how to play chess? WilmU Checkmates meets at the New Castle Campus in the Student Center! All are invited to join, regardless of experience! Johnathon Miloro; 302.327.4747 [email protected] Digital Film Making Club The purpose of the Digital Film Making Club is to provide members with networking, education, career and portfolio development. Timothy Day; 302.356.6871 [email protected] Dover Ambassadors The Dover Ambassadors assist with University events, provide campus tours, answer questions from the student perspective, and help with student services at the Dover site. Additionally, Ambassadors give back through participating in community service in the area. Jonathan Mallory; 302.734.2495 [email protected] Dover Cyber Maker Club The Dover Cyber Maker Club’s primary purpose is to help students develop their skills with computer and network security. Students are able to take advantage of partnerships with Microsoft and VMware and learn how to build their own learning environment on their own computers. Additionally, students learn how to utilize Linux and Open Source software. Steven Gomolski [email protected] Education Club This club is for any students who are interested in the education profession and in child development.
    [Show full text]
  • ACHS Member Societies
    ACHS Certified Member Honor Societies Society Field Alpha Beta Gamma Business Alpha Chi All Academic Fields Alpha Epsilon Agricultural, Food, and Biological Engineering Alpha Epsilon Delta Premedical Alpha Epsilon Rho Electronic Media Alpha Eta Mu Beta Biomedical Engineering Alpha Iota Delta Decision Sciences and Information Systems Alpha Kappa Delta Sociology Alpha Kappa Mu All Academic Fields Alpha Lambda Delta First-Year Success Alpha Phi Sigma Criminal Justice Alpha Pi Mu Industrial Engineering Alpha Sigma Lambda Continuing Education and Lifelong Learning Alpha Sigma Mu Metallurgy and Materials Engineering General Scholarship - Jesuit Institutions of Higher Alpha Sigma Nu Education Beta Gamma Sigma Business and Management Beta Kappa Chi Natural Sciences and Mathematics Library & Information Studies and Information Beta Phi Mu Technology Chi Epsilon Civil Engineering Chi Sigma Iota Professional Counseling General Scholarship in Colleges and Universities Delta Epsilon Sigma with a Catholic Tradition Delta Mu Delta Business Administration Delta Tau Alpha Agriculture Epsilon Pi Phi Emergency Management and Homeland Security Epsilon Pi Tau Professions in Technology Gamma Theta Upsilon Geography Kappa Mu Epsilon Mathematics Kappa Omicron Nu Human Sciences Kappa Tau Alpha Journalism and Mass Communication Lambda Pi Eta Communication Lambda Sigma Student Leadership, Scholarship and Service Mortar Board Scholarship, Leadership and Service Mu Kappa Tau Marketing National Society of Scabbard and Reserve Officer Training Corps Blade ACHS Certified
    [Show full text]
  • Programming Language Features for Refinement
    Programming Language Features for Refinement Jason Koenig K. Rustan M. Leino Stanford University Microsoft Research [email protected] [email protected] Algorithmic and data refinement are well studied topics that provide a mathematically rigorous ap- proach to gradually introducing details in the implementation of software. Program refinements are performed in the context of some programming language, but mainstream languages lack features for recording the sequence of refinement steps in the program text. To experiment with the combination of refinement, automated verification, and language design, refinement features have been added to the verification-aware programming language Dafny. This paper describes those features and reflects on some initial usage thereof. 0. Introduction Two major problems faced by software engineers are the development of software and the maintenance of software. In addition to fixing bugs, maintenance involves adapting the software to new or previously underappreciated scenarios, for example, using new APIs, supporting new hardware, or improving the performance. Software version control systems track the history of software changes, but older versions typically do not play any significant role in understanding or evolving the software further. For exam- ple, when a simple but inefficient data structure is replaced by a more efficient one, the program edits are destructive. Consequently, understanding the new code may be significantly more difficult than un- derstanding the initial version, because the source code will only show how the more complicated data structure is used. The initial development of the software may proceed in a similar way, whereby a software engi- neer first implements the basic functionality and then extends it with additional functionality or more advanced behaviors.
    [Show full text]
  • Developing Verified Sequential Programs with Event-B
    UNIVERSITY OF SOUTHAMPTON Developing Verified Sequential Programs with Event-B by Mohammadsadegh Dalvandi A thesis submitted in partial fulfillment for the degree of Doctor of Philosophy in the Faculty of Physical Sciences and Engineering Electronics and Computer Science April 2018 UNIVERSITY OF SOUTHAMPTON ABSTRACT FACULTY OF PHYSICAL SCIENCES AND ENGINEERING ELECTRONICS AND COMPUTER SCIENCE Doctor of Philosophy by Mohammadsadegh Dalvandi The constructive approach to software correctness aims at formal modelling of the in- tended behaviour and structure of a system in different levels of abstraction and verifying properties of models. The target of analytical approach is to verify properties of the final program code. A high level look at these two approaches suggests that the con- structive and analytical approaches should complement each other well. The aim of this thesis is to build a link between Event-B (constructive approach) and Dafny (analytical approach) for developing sequential verified programs. The first contribution of this the- sis is a tool supported method for transforming Event-B models to simple Dafny code contracts (in the form of method pre- and post-conditions). Transformation of Event-B formal models to Dafny method declarations and code contracts is enabled by a set of transformation rules. Using this set of transformation rules, one can generate code contracts from Event-B models but not implementations. The generated code contracts must be seen as an interface that can be implemented. If there is an implementation that satisfies the generated contracts then it is considered to be a correct implementation of the abstract Event-B model. A tool for automatic transformation of Event-B models to simple Dafny code contracts is presented.
    [Show full text]
  • Master's Thesis
    FACULTY OF SCIENCE AND TECHNOLOGY MASTER'S THESIS Study programme/specialisation: Computer Science Spring / Autumn semester, 20......19 Open/Confidential Author: ………………………………………… Nicolas Fløysvik (signature of author) Programme coordinator: Hein Meling Supervisor(s): Hein Meling Title of master's thesis: Using domain restricted types to improve code correctness Credits: 30 Keywords: Domain restrictions, Formal specifications, Number of pages: …………………75 symbolic execution, Rolsyn analyzer, + supplemental material/other: …………0 Stavanger,……………………….15/06/2019 date/year Title page for Master's Thesis Faculty of Science and Technology Domain Restricted Types for Improved Code Correctness Nicolas Fløysvik University of Stavanger Supervised by: Professor Hein Meling University of Stavanger June 2019 Abstract ReDi is a new static analysis tool for improving code correctness. It targets the C# language and is a .NET Roslyn live analyzer providing live analysis feedback to the developers using it. ReDi uses principles from formal specification and symbolic execution to implement methods for performing domain restriction on variables, parameters, and return values. A domain restriction is an invariant implemented as a check function, that can be applied to variables utilizing an annotation referring to the check method. ReDi can also help to prevent runtime exceptions caused by null pointers. ReDi can prevent null exceptions by integrating nullability into the domain of the variables, making it feasible for ReDi to statically keep track of null, and de- tecting variables that may be null when used. ReDi shows promising results with finding inconsistencies and faults in some programming projects, the open source CoreWiki project by Jeff Fritz and several web service API projects for services offered by Innovation Norway.
    [Show full text]
  • Essays on Emotional Well-Being, Health Insurance Disparities and Health Insurance Markets
    University of New Mexico UNM Digital Repository Economics ETDs Electronic Theses and Dissertations Summer 7-15-2020 Essays on Emotional Well-being, Health Insurance Disparities and Health Insurance Markets Disha Shende Follow this and additional works at: https://digitalrepository.unm.edu/econ_etds Part of the Behavioral Economics Commons, Health Economics Commons, and the Public Economics Commons Recommended Citation Shende, Disha. "Essays on Emotional Well-being, Health Insurance Disparities and Health Insurance Markets." (2020). https://digitalrepository.unm.edu/econ_etds/115 This Dissertation is brought to you for free and open access by the Electronic Theses and Dissertations at UNM Digital Repository. It has been accepted for inclusion in Economics ETDs by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. Disha Shende Candidate Economics Department This dissertation is approved, and it is acceptable in quality and form for publication: Approved by the Dissertation Committee: Alok Bohara, Chairperson Richard Santos Sarah Stith Smita Pakhale i Essays on Emotional Well-being, Health Insurance Disparities and Health Insurance Markets DISHA SHENDE B.Tech., Shri Guru Govind Singh Inst. of Engr. and Tech., India, 2010 M.A., Applied Economics, University of Cincinnati, 2015 M.A., Economics, University of New Mexico, 2017 DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Economics At the The University of New Mexico Albuquerque, New Mexico July 2020 ii DEDICATION To all the revolutionary figures who fought for my right to education iii ACKNOWLEDGEMENT This has been one of the most important bodies of work in my academic career so far.
    [Show full text]
  • Dafny: an Automatic Program Verifier for Functional Correctness K
    Dafny: An Automatic Program Verifier for Functional Correctness K. Rustan M. Leino Microsoft Research [email protected] Abstract Traditionally, the full verification of a program’s functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced verification tasks, such as ex- tended static checking, have enjoyed the automation offered by satisfiability-modulo-theories (SMT) solvers. More recently, powerful SMT solvers and well-designed program verifiers are starting to break that tradition, thus reducing the effort involved in doing full verification. This paper gives a tour of the language and verifier Dafny, which has been used to verify the functional correctness of a number of challenging pointer-based programs. The paper describes the features incorporated in Dafny, illustrating their use by small examples and giving a taste of how they are coded for an SMT solver. As a larger case study, the paper shows the full functional specification of the Schorr-Waite algorithm in Dafny. 0 Introduction Applications of program verification technology fall into a spectrum of assurance levels, at one extreme proving that the program lives up to its functional specification (e.g., [8, 23, 28]), at the other extreme just finding some likely bugs (e.g., [19, 24]). Traditionally, program verifiers at the high end of the spectrum have used interactive proof assistants, which require the user to have a high degree of prover expertise, invoking tactics or guiding the tool through its various symbolic manipulations. Because they limit which program properties they reason about, tools at the low end of the spectrum have been able to take advantage of satisfiability-modulo-theories (SMT) solvers, which offer some fixed set of automatic decision procedures [18, 5].
    [Show full text]
  • Academic Regalia
    ACADEMIC REGALIA The academic regalia worn today at the University of West Florida originated in the univer-sities of the Middle Ages when a warm gown and hood were useful for scholar and cleric in unheated buildings. The distinctive gown also served to set the student apart from his fellow citizens of the community. Until the Civil War, students at most American universities wore caps and gowns daily while in residence. These varied in design until they were standardized in 1894. At that time it was decided that all robes would be black; bachelors’ gowns of silk with long closed sleeves; doctors’ gowns also carried three velvet bands around each sleeve above the elbow. Hoods, made of the same materials as the gowns, were varied in length with the degree. The lining of the hood indicated the academic discipline in which the degree was earned. In the recent years several universities have decided to return to a distinctive gown de-sign, particularly in the color of the garment. However, there has been no change in the standard colors that represent the disciplines. At the University of West Florida, each bachelor’s degree candidate or graduate wears a blue and green tassel on the cap (mortar board). The tassels of master’s and specialist’s degree candidates and graduates represent the specific degree or discipline achieved. Doctoral degree recipients wear a gold tassel. In addition, baccalaureate graduates who have earned a 3.5 accumulative grade point average or higher are entitled to wear gold honor cords on their gowns. ACADEMIC HOOD
    [Show full text]
  • Bounded Model Checking of Pointer Programs Revisited?
    Bounded Model Checking of Pointer Programs Revisited? Witold Charatonik1 and Piotr Witkowski2 1 Institute of Computer Science, University of Wroclaw, [email protected] 2 [email protected] Abstract. Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference of a dangling pointer, are express- ible in a fragment of first-order logic with two-variables. Second, the fragment is closed under weakest preconditions wrt. finite paths. Third, data structures like trees, lists etc. are expressible by inductive predi- cates defined in a fragment of Datalog. Finally, the combination of the two fragments of the two-variable logic and Datalog is decidable. In this paper we improve this technique by extending the expressivity of the underlying logics. In a sequence of examples we demonstrate that the new logic is capable of modeling more sophisticated data structures with more complex dependencies on heaps and more complex analyses. 1 Introduction Automated verification of programs manipulating dynamically allocated pointer structures is a challenging and important problem. In [11] the authors proposed a bounded model checking (BMC) procedure for imperative programs that manipulate dynamically allocated pointer struc- tures on the heap. Although in this procedure an explicit bound is assumed on the length of the program execution, the size of the initial data structure is not bounded. Therefore, such programs form infinite and infinitely branching transition systems. The procedure is based on the following four observations. First, error conditions like dereference of a dangling pointer, are expressible in a fragment of first-order logic with two-variables.
    [Show full text]
  • The Merger Control Review
    [ Exclusively for: Suncica Vaglenarova | 09-Sep-15, 07:52 AM ] ©The Law Reviews The MergerThe Control Review Merger Control Review Sixth Edition Editor Ilene Knable Gotts Law Business Research The Merger Control Review The Merger Control Review Reproduced with permission from Law Business Research Ltd. This article was first published in The Merger Control Review - Edition 6 (published in July 2015 – editor Ilene Knable Gotts) For further information please email [email protected] The Merger Control Review Sixth Edition Editor Ilene Knable Gotts Law Business Research Ltd PUBLISHER Gideon Roberton BUSINESS DEVELOPMENT MANAGER Nick Barette SENIOR ACCOUNT MANAGERS Katherine Jablonowska, Thomas Lee, Felicity Bown ACCOUNT MANAGER Joel Woods PUBLISHING MANAGER Lucy Brewer MARKETING ASSISTANT Rebecca Mogridge EDITORIAL COORDINATOR Shani Bans HEAD OF PRODUCTION Adam Myers PRODUCTION EDITOR Anne Borthwick SUBEDITOR Caroline Herbert MANAGING DIRECTOR Richard Davey Published in the United Kingdom by Law Business Research Ltd, London 87 Lancaster Road, London, W11 1QQ, UK © 2015 Law Business Research Ltd www.TheLawReviews.co.uk No photocopying: copyright licences do not apply. The information provided in this publication is general and may not apply in a specific situation, nor does it necessarily represent the views of authors’ firms or their clients. Legal advice should always be sought before taking any legal action based on the information provided. The publishers accept no responsibility for any acts or omissions contained herein. Although the information provided is accurate as of July 2015, be advised that this is a developing area. Enquiries concerning reproduction should be sent to Law Business Research, at the address above.
    [Show full text]