TITLE

SOCIAL CONSTRAINTS AND IDENTITY PROBLEMS IN PHILIP ROTH'S ZUCKERMAN BOUND

AUTHOR(S)
KALAY, Faruk
PUB. DATE
October 2013
SOURCE
Journal of Academic Social Science Studies;Oct2013, Vol. 6 Issue 8, p889
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Philip Roth dealing with anti-Semitism, alienation and identity in especially Jewish society is one of the distinguish American-Jewish writers in the twentieth century. Zuckerman Bound recounts the famous Jewish author Nathan Zuckerman who has marginal novels which are not popular among Jews. In The Ghost Writer, Zuckerman challenging with his family, relatives and milieu intends to be a novelist like Lonoff. The protagonist becomes a famous novelist in his other novel, Zuckerman Unbound. However, he is in the middle of a war against the society. In The Anatomy Lesson he is subverted by his mentality and brother who thinks that Zuckerman is responsible for their parents' death. The protagonist intensifies on Jewish society and culture rather than himself in his last novel Prague Orgy. Not only does Zuckerman discuss with people in other religion but also he is a controversial person in Jewish society. In fact, Roth depicts himself by penning a protagonist Zuckerman. The feeling of disorientation and statelessness rise in Zuckerman/Roth mind in four novels. For example in Anatomy Lesson, Zuckerman becomes "a helpless patient who is compelled to ask himself whether or not he can even become someone different" (Wilson, 2005: 104). Also Greenberg depicts the same novel as "Zuckerman's involvement with transgression as a man and a writer" (1997). In each novel, the reader can find the attempts of adaptation, isolation and how the protagonist alters in both Jewish and American society. Even though the themes dealt with differ from each novel, by and large, the plot is predicated on the protagonist's psychology. In this study, Roth / Zuckerman' s identity and the social constraints shaping them will be argued.
ACCESSION #
99624789

 

Related Articles

  • Linear-Time Algorithms for Scheduling on Parallel Processors. Monma, Clyde L. // Operations Research;Jan/Feb82, Vol. 30 Issue 1, p116 

    Linear-time algorithms are presented for several problems of scheduling n equal-length tasks on m identical parallel processors subject to precedence constraints. This improves upon previous time bounds for the maximum lateness problem with tree-like precedence constraints, the...

  • ECONOMIC LOT SCHEDULING FOR MULTIPLE PRODUCTS ON PARALLEL IDENTICAL PROCESSORS. Carreno, Jose Juan // Management Science;Mar90, Vol. 36 Issue 3, p348 

    This paper deals with an identical multiprocessor, multiproduct, lot-size scheduling problem under deterministic conditions. The problem is an extension of the single-processor ELSP problem. The objective is to minimize the average production and inventory costs per unit time subject to...

  • The average behaviour of greedy algorithms for the knapsack problem: General distributions. Diubin, Gennady; Korbut, Alexander // Mathematical Methods of Operations Research;2003, Vol. 57 Issue 3, p449 

    The paper is a generalization of [4], [5] for arbitrary distributions of coefficients. It is supposed that the coefficients of the objective function and the constraint of the knapsack problem are independent identically distributed random variables having a density with support [0, 1], and the...

  • Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints. Su, Ling-Huey // International Journal of Advanced Manufacturing Technology;Mar2009, Vol. 40 Issue 5/6, p572 

    This study addresses the identical parallel machine scheduling problem with job deadlines and machine eligibility constraints to minimize total job completion time. Jobs must be completed before or at a deadline and preemptions are not allowed. Every job is allowed to be processed on a specified...

  • LINEAR PROGRAMMING TECHNIQUE FOR SOLVING INTERVAL-VALUED CONSTRAINT MATRIX GAMES. JIANG-XIA NAN; DENG-FENG LI // Journal of Industrial & Management Optimization;Oct2014, Vol. 10 Issue 4, p1059 

    The purpose of this paper is to propose an effective linear programming technique for solving matrix games in which the payoffs are expressed with intervals and the choice of strategies for players is constrained, i.e., interval- valued constraint matrix games. Because the payoffs of the...

  • Optimal parallel machines scheduling with machine availability and eligibility constraints. Sheen, Gwo-Ji; Liao, Lu-Wen; Lin, Cheng-Feng // International Journal of Advanced Manufacturing Technology;Feb2008, Vol. 36 Issue 1/2, p132 

    In reality, the machine might become unavailable due to machine breakdowns or various inevitable reasons, and machine might have different capability to processing job. Motivated by this, we consider the problem of scheduling n non-preemptive and independent jobs on m identical machines...

  • Parallel machine scheduling by column generation. Van Den Akker, J. M.; Hoogeveen, J. A.; Van De Velde, S. L. // Operations Research;Nov/Dec99, Vol. 47 Issue 6, p862 

    Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only &Nscipt;&Pscript;-hard, but also very hard from a practical point of view. In this paper, we...

  • Bézout Identities with Inequality Constraints. Lawton, Wayne M.; Micchelli, Charles A. // Vietnam Journal of Mathematics;Jun2000, Vol. 28 Issue 2, p97 

    Examines the Bézout identities with inequality constraints. Existence of the positive values in the length bounded by a function; Application of the Swan theorem and the Michael selection theorem for the Bé identity solutions; Solution of the inequality constraints for multivariate...

  • Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs. Benson, H. P. // Journal of Optimization Theory & Applications;Jul2010, Vol. 146 Issue 1, p1 

    In this article, a branch and-bound outer approximation algorithm is presented for globally solving a sum-of-ratios fractional programming problem. To solve this problem, the algorithm instead solves an equivalent problem that involves minimizing an indefinite quadratic function over a nonempty,...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics