Metamorphosen des Autors im Internet

Digital media transform social options of access with regard to producers, recipients, and literary works of art themselves. New labels for new roles such as »prosumers « and »wreaders« attest to this. The »blogger« provides another interesting new social figure of literary authorship. Here, some old desiderata of Dadaism appear to find a belated realization. On the one hand, many web 2.0 formats of authorship amplify and widen the freedom of literary productivity while at the same time subjecting such production to a periodic schedule. In comparison to the received practices of authors and recipients many digital-cultural forms of narrating engender innovative metalepses (and also their sublation). Writing in the net for internet-publics enables the deliberate dissolution of the received autobiographical pact with the reader according to which the author’s genuine name authenticates the author’s writing. On the other hand, the digital-cultural potential of dissolving the autobiographical pact stimulates scandals of debunking and unmasking and makes questions of author-identity an issue of permanent contestation. Digital-cultural conditions of communication amplify both: the hideand- seek of authorship as well as the thwarting of this game by recipients who delight in playing detective. In effect, pace Foucault’s and Barthes’ postulates of the death of the author, the personality and biography of the author once again tend to become objects of high intrinsic value

AN IMPROVED LOAD SHEDDING SCHEDULING STRATEGY FOR SOLVING POWER SUPPLY DEFISIT

When high electricity demand growth not matched by the growth in generating capacity, energy deficit problem cannot be avoided. Power outages of up to 6 hours per day are part of the power crisis experienced by electricity consumers in Sumatra. The utility has applied load shedding approach to tackle the problem, however, there are weaknesses on the current load shedding program. It is discovered that most of the power outage occurs randomly without any prior notice and sometime lasted for many hours. Load shedding program is not properly scheduled and not fairly distributed among all consumers. A proper scheduling program must have a clear periodic schedule, fixed outage hours, fairly distributed and alternated among consumers and most importantly solve energy deficit problem. This paper presented an improved load shedding scheduling strategy based on Round Robin method. The method is then illustrated and applied on actual daily load profile of Sumatra electrical system.

Reactive GTS Allocation Protocol for Sporadic Events Using the IEEE 802.15.4

Wireless sensor networks (WSNs) find applications in the industrial automation where periodic and sporadic events occur. The combined propagation of information generated by periodic and sporadic events from a sensor node to an actuator node is challenging due to random nature of sporadic events, particularly, if the deadlines are hard. The IEEE 802.15.4 standard provides the basis for a real-time communication mechanism between neighboring nodes of the WSN at the media access control layer. However, the standard does not address such communications over multiple hops. To support the industrial applications with such requirements, this work proposes a novel online control protocol that exploits the basis provided by the IEEE 802.15.4 standard. The proposed control protocol ensures that a given offline sporadic schedule can be adapted online in a timely manner such that the static periodic schedule has not been disturbed and the IEEE 802.15.4 standard compliance remains intact. The proposed protocol is simulated in OPNET. The simulation results are analyzed and presented in this paper to prove the correctness of the proposed protocol regarding the efficient real-time sporadic event delivery along with the periodic event propagation.

A Resource-Oriented Petri Net Approach to Scheduling and Control of Time-Constrained Cluster Tools in Semiconductor Fabrication

Because of residency time constraints and activity time variation for cluster tools, it is very challenging to schedule them. This chapter addresses their real-time scheduling issues and conducts their schedulability analysis in considering residency time constraints and bounded activity time variation. A Petri Net (PN) model, called Resource-Oriented PN (ROPN) is developed to model them. Such formal models describe not only the behavior of both initial transient and steady state processes of cluster tools but also determine the robot activity sequence with robot waits included. They are very compact, independent of wafer flow pattern, and useful for discrete-event control. It is due to the proposed models that scheduling cluster tools are converted into determining robot wait times. A two-level operational architecture is proposed to include an off-line periodic schedule and real-time controller. The former determines when a wafer should be placed into a process module for processing, while the latter regulates robot wait times on-line in order to reduce the effect of activity time variation on wafer sojourn times in process modules. Therefore, the system can adapt to random activity time variation. Based on the PN model, real-time operational architecture, and real-time control policy, it analyzes the effect of activity time variation on wafer sojourn time delay at a process module and presents its upper bounds. The upper bounds are given in an analytical form and can be easily evaluated. Then, it derives schedulability conditions that are in closed form expressions. If schedulable, an algorithm is developed to obtain an off-line periodic schedule. This schedule together with the real-time control policy forms a real-time schedule. It is optimal in terms of cycle time and can be analytically computed, which represents significant advance in this area. Several examples are used to show the applications of the proposed approach.

A Resource-Oriented Petri Net Approach to Scheduling and Control of Time-Constrained Cluster Tools in Semiconductor Fabrication

Because of residency time constraints and activity time variation for cluster tools, it is very challenging to schedule them. This chapter addresses their real-time scheduling issues and conducts their schedulability analysis in considering residency time constraints and bounded activity time variation. A Petri Net (PN) model, called Resource-Oriented PN (ROPN) is developed to model them. Such formal models describe not only the behavior of both initial transient and steady state processes of cluster tools but also determine the robot activity sequence with robot waits included. They are very compact, independent of wafer flow pattern, and useful for discrete-event control. It is due to the proposed models that scheduling cluster tools are converted into determining robot wait times. A two-level operational architecture is proposed to include an off-line periodic schedule and real-time controller. The former determines when a wafer should be placed into a process module for processing, while the latter regulates robot wait times on-line in order to reduce the effect of activity time variation on wafer sojourn times in process modules. Therefore, the system can adapt to random activity time variation. Based on the PN model, real-time operational architecture, and real-time control policy, it analyzes the effect of activity time variation on wafer sojourn time delay at a process module and presents its upper bounds. The upper bounds are given in an analytical form and can be easily evaluated. Then, it derives schedulability conditions that are in closed form expressions. If schedulable, an algorithm is developed to obtain an off-line periodic schedule. This schedule together with the real-time control policy forms a real-time schedule. It is optimal in terms of cycle time and can be analytically computed, which represents significant advance in this area. Several examples are used to show the applications of the proposed approach.

SCHEDULING SENSORS BY TILING LATTICES

Suppose that wirelessly communicating sensors are placed in a regular fashion on the points of a lattice. Common communication protocols allow the sensors to broadcast messages at arbitrary times, which can lead to problems should two sensors broadcast at the same time. It is shown that one can exploit a tiling of the lattice to derive a deterministic periodic schedule for the broadcast communication of sensors that is guaranteed to be collision-free. The proposed schedule is shown to be optimal in the number of time slots.