4,026 research outputs found
ASTYLISTIC ANALYSIS OF HONEST DECEPTION REFLECTED INPIRATES OF THE CARIBBEAN: THE CURSE OF THE BLACK PEARL
This researchis aimedat describing thehonest deceptionused in a film
entitledPirates of the Caribbean: The Curse of the Black Pearl. There are three
objectives of this research. The first is to provide the description and analysis of
honest deception phenomenain the mentioned film. This research explores three
types of honest deception:hyperbole, irony, and sarcasm. The second is to provide
abrief description and discussion of the language functionrelated to the use of
honest deception. The last is to reveal the life in pirates’ world in Pirates of the
Caribbean: The Curse of the Black Pearlthrough the occurrence of honest
deception.
The data source of this research wasa film entitled Pirates of the
Caribbean: The Curse of the Black Pearl. The data of this research were taken
from the characters’ dialogues by watching the film whichwerethen checked by
reading the script. The data of this research were some verbal expressions in
words, phrases, clauses, sentences, and paragraphs, and non-verbal
expressions/actions which were related tothe verbal ones. The data were then
analyzed usingadescriptive qualitative method. It gaveasufficient description of
the factual data of the phenomena and provided its logical and rational
interpretation based on relevant theories. Data trustworthiness was achieved
through credibility, reliability, and conformability.Theresearch findings show that (1) there are three types of honest
deception found in the film among 21 occurrences: hyperbole (11 times or
52.38%),irony (5 times or23.81%), and sarcasm (5 times or23.81%). Hyperbole
is an extremely effective literary device since it is dramatically more descriptive
in getting a point across and making a desired effect. (2)There are four types of
language functions found in the film, namely: emotive (3times or14.29%),
conative (6times or28.57%), referential (11times or52.38%), and phatic (once
or4.76%). Referential is the highest function since it is logically often found in
the language use. Most utterances have referential contents. (3) Thereflection of
life in the pirates’ world in the filmis presented through the analysis of honest
deception. There are some aspectsthatcan beseen: (a) pirates’ world is a life that
is full of immorality and contempt, (b) the use of swear words is very common in
the pirates’ world, (c) pirateshave lingo in communicatingin their everyday life,
(d) pirates commonly consistof men; it is against pirates' rules for women to be
on board, (e) pirates always fly gruesome flagsto makea mark on their ships, (f)
the most precious prizes for pirates are chests of gold, silver and jewels, (g) a
mutiny is one problem that often appears in their world, and (h) pirating is
prohibited by international law becauseitunsettlesthe life of manypeople.
Keywords: stylistics, honest deception,Pirates of the Caribbean: The Curse of the
Black Pearl
Stability conditions for a discrete-time decentralised medium access algorithm
We consider a stochastic queueing system modelling the behaviour of a
wireless network with nodes employing a discrete-time version of the standard
decentralised medium access algorithm. The system is {\em unsaturated} -- each
node receives an exogenous flow of packets at the rate packets per
time slot. Each packet takes one slot to transmit, but neighboring nodes cannot
transmit simultaneously. The algorithm we study is {\em standard} in that: a
node with empty queue does {\em not} compete for medium access; the access
procedure by a node does {\em not} depend on its queue length, as long as it is
non-zero. Two system topologies are considered, with nodes arranged in a circle
and in a line. We prove that, for either topology, the system is stochastically
stable under condition . This result is intuitive for the circle
topology as the throughput each node receives in a saturated system (with
infinite queues) is equal to the so called {\em parking constant}, which is
larger than . (The latter fact, however, does not help to prove our
result.) The result is not intuitive at all for the line topology as in a
saturated system some nodes receive a throughput lower than .Comment: 22 page
Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks
We consider a decentralised multi-access algorithm, motivated primarily by
the control of transmissions in a wireless network. For a finite single-hop
network with arbitrary interference constraints we prove stochastic stability
under the natural conditions. For infinite and finite single-hop networks, we
obtain broad rate-stability conditions. We also consider symmetric finite
multi-hop networks and show that the natural condition is sufficient for
stochastic stability
Heavy-traffic analysis of the maximum of an asymptotically stable random walk
For families of random walks with we consider their maxima . We
investigate the asymptotic behaviour of as for
asymptotically stable random walks. This problem appeared first in the 1960's
in the analysis of a single-server queue when the traffic load tends to 1 and
since then is referred to as the heavy-traffic approximation problem. Kingman
and Prokhorov suggested two different approaches which were later followed by
many authors. We give two elementary proofs of our main result, using each of
these approaches. It turns out that the main technical difficulties in both
proofs are rather similar and may be resolved via a generalisation of the
Kolmogorov inequality to the case of an infinite variance. Such a
generalisation is also obtained in this note.Comment: 9 page
Stability of a Markov-modulated Markov Chain, with application to a wireless network governed by two protocols
We consider a discrete-time Markov chain , , where
the -component forms a Markov chain itself. Assume that is
Harris-ergodic and consider an auxiliary Markov chain whose
transition probabilities are the averages of transition probabilities of the
-component of the -chain, where the averaging is weighted by the
stationary distribution of the -component.
We first provide natural conditions in terms of test functions ensuring that
the -chain is positive recurrent and then prove that these conditions
are also sufficient for positive recurrence of the original chain .
The we prove a "multi-dimensional" extension of the result obtained. In the
second part of the paper, we apply our results to two versions of a
multi-access wireless model governed by two randomised protocols.Comment: 23 page
The end time of SIS epidemics driven by random walks on edge-transitive graphs
Network epidemics is a ubiquitous model that can represent different
phenomena and finds applications in various domains. Among its various
characteristics, a fundamental question concerns the time when an epidemic
stops propagating. We investigate this characteristic on a SIS epidemic induced
by agents that move according to independent continuous time random walks on a
finite graph: Agents can either be infected (I) or susceptible (S), and
infection occurs when two agents with different epidemic states meet in a node.
After a random recovery time, an infected agent returns to state S and can be
infected again. The End of Epidemic (EoE) denotes the first time where all
agents are in state S, since after this moment no further infections can occur
and the epidemic stops.
For the case of two agents on edge-transitive graphs, we characterize EoE as
a function of the network structure by relating the Laplace transform of EoE to
the Laplace transform of the meeting time of two random walks. Interestingly,
this analysis shows a separation between the effect of network structure and
epidemic dynamics. We then study the asymptotic behavior of EoE (asymptotically
in the size of the graph) under different parameter scalings, identifying
regimes where EoE converges in distribution to a proper random variable or to
infinity. We also highlight the impact of different graph structures on EoE,
characterizing it under complete graphs, complete bipartite graphs, and rings
Local stability in a transient Markov chain
We prove two propositions with conditions that a system, which is described
by a transient Markov chain, will display local stability. Examples of such
systems include partly overloaded Jackson networks, partly overloaded polling
systems, and overloaded multi-server queues with skill based service, under
first come first served policy.Comment: 6 page
- …