86,654 research outputs found
Theatre and the novel, from Behn to Fielding
No full textEver since Ian Watt’s The Rise of the novel (1957), many critics have argued that a constitutive element of the early ‘novel’ is its embrace of realism. Anne F. Widmayer contends, however, that Restoration and early eighteenth-century prose narratives employ techniques that distance the reading audience from an illusion of reality; irony, hypocrisy, and characters who are knowingly acting for an audience are privileged, highlighting the artificial and false in fictional works. Focusing on the works of four celebrated playwright-novelists, Widmayer explores how the increased interiority of their prose characters is ridiculed by the use of techniques drawn from the theatre to throw into doubt the novel’s ability to portray an unmediated ‘reality’. Aphra Behn’s dramatic techniques question the reliability of female narrators, while Delarivier Manley undermines the impact of women’s passionate anger by suggesting the self-consciousness of their performances. In his later drama, William Congreve subverts the character of the apparently objective critic that is recurrent in his prose work, whilst Henry Fielding uses the figure of the satirical writer in his rehearsal plays to mock the novelist’s aspiration to control the way a reader reads the text. Through analysing how these writers satirize the reading public’s desire for clear distinctions between truth and illusion, Anne F. Widmayer also highlights the equally fluid boundaries between prose fiction and drama. Introduction 1. Aphra Behn’s dramatic techniques in prose: credibility and female power i. Behn’s and Southerne’s Oroonokos: individuals and groups ii. Parallels between the narrator and Oroonoko iii. Echoes of Rover I 2. Performed emotion in Delarivier Manley’s works: actors and voyeurs i. Discovering emotion in Manley’s plays ii. Scenes in Manley’s prose iii. Validating female emotion in Memoirs of Europe and The Power of love 3. Hybrid dramatic-narrative techniques: William Congreve’s Incognita and The Old batchelor i. Staging lovers in Dryden’s Assignation and Congreve’s Incognita ii. Scarron’s influence upon Incognita iii. Heartwell as satirical commentator in The Old batchelor 4. Abandoning control over ‘reality’: author-characters in Henry Fielding’s plays i. The satirist satirized in Fielding’s author-character plays ii. Author-characters as Fielding’s theatrical avatars 5. Self-conscious anti-realism: readers as actor-authors in Henry Fielding’s prose i. Fielding’s self-ironizing author-characters ii. Novel characters who comment metatheatrically 6. Conclusion Bibliography Inde
Computational aspects of a 2-player Stackelberg shortest paths tree game
No full textLet a communication network be modelled by a directed graph G = (V,E) of n nodes and m edges. We consider a one-round two-player network pricing game, the Stackelberg Shortest Paths Tree (StackSPT) game. This is played on G, by assuming that edges in E are partitioned into two sets: a set E F of edges with a fixed positive real weight, and a set E P of edges that should be priced by one of the two players (the leader). Given a distinguished node r ∈ V, the StackSPT game is then as follows: the leader prices the edges in E P in such a way that he will maximize his revenue, knowing that the other player (the follower) will build a shortest paths tree of G rooted at r, say S(r), by running a publicly available algorithm. Quite naturally, for each edge selected in the solution, the leader’s revenue is assumed to be equal to the loaded price of an edge, namely the product of the edge price times the number of paths from r in S(r) that use it. First, we show that the problem of maximizing the leader’s revenue is NP-hard as soon as |E P | = Θ(n). Then, in search of an effective method for solving the problem when the size of E P is constant, we focus on the basic case in which |E P | = 2, and we provide an efficient O(n 2 logn) time algorithm. Afterwards, we generalize the approach to the case |E P | = k, and we show that it can be solved in polynomial time whenever k = O(1)
Chemically defined antibody- and small molecule-drug conjugates for in vivo tumor targeting applications: A comparative analysis
No full textWe present the first direct comparative evaluation of an antibody-drug conjugate and of a small molecule-drug conjugate for cancer therapy, using chemically defined products which bind with high-affinity to carbonic anhydrase IX, a marker of tumor hypoxia and of renal cell carcinoma
Variations on the Author
No full text“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
[Newspaper Clipping: Author Claims Evidence of Second JFK Assassin #1]
No full textNewspaper article titled "Author Claims Evidence of Second JFK Assassin." The article states that author Richard J. Whalen concluded "that there is circumstantial evidence to support the theory of a second assassin in the shooting of President John F. Kennedy.
Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game
No full textLet a communication network be modelled by a directed graph G = (V,E) of n nodes and m edges. We consider a one-round two-player network pricing game, the Stackelberg Shortest Paths Tree (StackSPT) game. This is played on G, by assuming that edges in E are partitioned into two sets: a set E F of edges with a fixed positive real weight, and a set E P of edges that should be priced by one of the two players (the leader). Given a distinguished node r ∈ V, the StackSPT game is then as follows: the leader prices the edges in E P in such a way that he will maximize his revenue, knowing that the other player (the follower) will build a shortest paths tree of G rooted at r, say S(r), by running a publicly available algorithm. Quite naturally, for each edge selected in the solution, the leader’s revenue is assumed to be equal to the loaded price of an edge, namely the product of the edge price times the number of paths from r in S(r) that use it. First, we show that the problem of maximizing the leader’s revenue is NP-hard as soon as |E P | = Θ(n). Then, in search of an effective method for solving the problem when the size of E P is constant, we focus on the basic case in which |E P | = 2, and we provide an efficient O(n 2 logn) time algorithm. Afterwards, we generalize the approach to the case |E P | = k, and we show that it can be solved in polynomial time whenever k = O(1)
Also By The Same Author: AKTiveAuthor, a Citation Graph Approach to Name Disambiguation
No full textThe desire for definitive data and the semantic web drive for inference over heterogeneous data sources requires co-reference resolution to be performed on those data. In particular, name disambiguation is required to allow accurate publication lists, citation counts and impact measures to be determined. This paper describes a graph-based approach to author disambiguation on large-scale citation networks. Using self-citation, co-authorship and document source analyses, AKTiveAuthor clusters papers, achieving precision of 0.997 and recall of 0.818 over a test group of eight surname clusters
Algorithmic gems in the data miner's cave
No full textWhen I was younger and spent most of my time playing in the field of (more) theoretical computer science, I used to think of data mining as an uninteresting kind of game: I thought that area was a wild jungle of ad hoc techniques with no flesh to seek my teeth into. The truth is, I immediately become kind-of skeptical when I see a lot of money flying around: my communist nature pops out and I start seeing flaws everywhere.
I was an idealist, back then, which is good. But in that specific case, I was simply wrong. You may say that I am trying to convince myself just because my soul has been sold already (and they didn’t even give me the thirty pieces of silver they promised, btw). Nonetheless, I will try to offer you evidences that there are some gems, out there in the data miner’s cave, that you yourself may appreciate.
Who knows? Maybe you will decide to sell your soul to the devil too, after all
John F. Kennedy telegram to Roosevelt
No full textJersey Homesteads (later the Borough of Roosevelt) was established in the 1930s as an agro-industrial cooperative community. It was established specifically for urban Jewish garment workers, many of whom had emigrated from Europe. President John F. Kennedy sent a telegram to the citizens of Roosevelt, New Jersey, apologizing for not being able to attend the memorial dedication in honor of former President Franklin Delano Roosevelt. (Jersey Homesteads became Roosevelt in 1945 in honor of the president.) President Kennedy expressed his gratitude to the people of Roosevelt for constructing the memorial, and commented that it will serve as a constant reminder of Roosevelt's good works
Logarithmic variance profiles and the corresponding f-1 spectra of temperature fluctuations in turbulent Rayleigh-Bénard convection
No full textWe report experimental results for the temperature variance 2(z) and the corresponding frequency spectra P(f) in turbulent Rayleigh-Bénard convection (RBC) in a cylindrical sample of aspect ratioT= D/L = 1:00 (D = 1:12 m is the diameter and L = 1:12 m the height). The measurements were conducted in the Rayleigh-number range 1011 < Ra < 1:35 1014 and Pr ' 0:8. For Ra = 1:35x1014, 2(z) could be described well by a logarithmic dependence on the vertical position z in a range of z 1 < z < z 2 with z 1 ' 70 and z 2 = 0:1L. Here L=(2Nu) is the thickness of a thin thermal sublayer adjacent to the horizontal plate where the heat flux (denoted by the Nusselt number Nu) is carried mostly by thermal diffusion. In the log layer, we found that the temperature spectra had a significant frequency range over which P(f) f with close to 1. As Ra decreased, increased so that the log layer became thinner. At Ra = 2:05 1011, z 2 < z 1 and therefore there was no range for a log layer. Correspondingly, the temperature spectrum near the horizontal plate did not have the f1 scaling form either
- …
