Prescribed error tolerances within fixed computational times for scattering problems of arbitrarily high frequency: the convex case

We present a new algorithm for the numerical solution of problems of electromagnetic or acoustic scattering by large, convex obstacles. This algorithm combines the use of an ansatz for the unknown density in a boundary-integral formulation of the scattering problem with an extension of the ideas of the method of stationary phase. We include numerical results illustrating the high-order convergence of our algorithm as well as its asymptotically bounded computational cost as the frequency increases.     

The operational semantics of user-defined relationships in object oriented database systems

In semantic data models, abstract relationship (e.g. generalization, aggregation, etc.) semantics are defined, specifying how insertion, deletion and modification operations made at a higher level of abstraction can affect the objects abstracted over and vice versa. These semantics, also known as structural constraints, are expressed through so-called update rules. This perspective has been somewhat lost in most object-oriented systems, where user-defined relationships are supported as simple pointers and their semantics are embedded, distributed and replicated within the operations accessing these pointers. This paper inherits and extends the treatment of relationships found in semantic data models to behavioural object-oriented models by presenting an approach to uniformly capture the update rules for user-defined relationships. The stress is not on supporting relationships as first-class objects, but on describing their update rules (or operational semantics) through a set of constructors namely, reaction, anticipation, delegation and exception. The approach has been borne out by an implementation in an active object-oriented database system.     

A Parallel Dynamic Binary Translator for Efficient Multi-Core Simulation

In recent years multi-core processors have seen broad adoption in application domains ranging from embedded systems through general-purpose computing to large-scale data centres. Simulation technology for multi-core systems, however, lags behind and does not provide the simulation speed required to effectively support design space exploration and parallel software development. While state-of-the-art instruction set simulators (Iss) for single-core machines reach or exceed the performance levels of speed-optimised silicon implementations of embedded processors, the same does not hold for multi-core simulators where large performance penalties are to be paid. In this paper we develop a fast and scalable simulation methodology for multi-core platforms based on parallel and just-in-time (Jit) dynamic binary translation (Dbt). Our approach can model large-scale multi-core configurations, does not rely on prior profiling, instrumentation, or compilation, and works for all binaries targeting a state-of-the-art embedded multi-core platform implementing the ARCompact instruction set architecture (Isa). We have evaluated our parallel simulation methodology against the industry standard Splash-2 and Eembc MultiBench benchmarks and demonstrate simulation speeds up to 25,307 Mips on a 32-core x86 host machine for as many as 2,048 target processors whilst exhibiting minimal and near constant overhead, including memory considerations.     

On restricted one-counter machines

Let be the class of real-time nondeterministic one-counter machines whose counters make at mostone reversal. Let ₁ (respectively, ₂) be the subclass consisting of machines whose only nondeterministic move is in the choice of when to reverse the counter (respectively, when to start using the counter). ₁ and ₂ are among the simplest known classes of machines for which the universe problem has been shown undecidable. (The universe problem for a class of machines is the problem of deciding if an arbitrary machine in the class accepts all its inputs.) Here, we show that the classes of languages accepted by machines in ₁ and ₂ are incomparable. Moreover, the union of the language classes is properly contained in the class defined by . We also, briefly, look at the closure properties of these machines.This research was supported in part by NSF Grant MCS78-01736.     

FSCRIPT,a full portable text formatting program

FSCRIPT is a program designed to handle texts in an easy way. The text is given as card in an unformatted way together with the desired commands. These commands (there are 33 different commands) control the formatting of the text. FSCRIPT has been written in ANS FORTRAN.     

Visualization of level-of-detail meshes on the GPU

Extensive research has been carried out in multiresolution models for many decades. The tendency in recent years has been to harness the potential of GPUs to perform the level-of-detail extraction on graphics hardware. The aim of this work is to present a new level-of-detail scheme based on triangles which is both simple and efficient. In this approach, the extraction process updates vertices instead of indices, thus providing a perfect framework for adapting the algorithms to work completely on GPU shaders. One of the key aspects of our proposal is the need for just a single rendering pass in order to obtain the desired geometry. Moreover, coherence among the different approximations is maximized by means of a symmetric extraction algorithm, which performs the same process when refining and coarsening the mesh. Lastly, we also introduce different uses of the scheme to offer continuous and view-dependent resolution.     

COACH: COllaborative certificate stAtus CHecking mechanism for VANETs

Vehicular Ad Hoc Networks (VANETs) require mechanisms to authenticate messages, identify valid vehicles, and remove misbehaving vehicles. A public key infrastructure (PKI) can be used to provide these functionalities using digital certificates. However, if a vehicle is no longer trusted, its certificates have to be revoked and this status information has to be made available to other vehicles as soon as possible. In this paper, we propose a collaborative certificate status checking mechanism called COACH to efficiently distribute certificate revocation information in VANETs. In COACH, we embed a hash tree in each standard Certificate Revocation List (CRL). This dual structure is called extended-CRL. A node possessing an extended-CRL can respond to certificate status requests without having to send the complete CRL. Instead, the node can send a short response (less than 1 kB) that fits in a single UDP message. Obviously, the substructures included in the short responses are authenticated. This means that any node possessing an extended-CRL can produce short responses that can be authenticated (including Road Side Units or intermediate vehicles). We also propose an extension to the COACH mechanism called EvCOACH that is more efficient than COACH in scenarios with relatively low revocation rates per CRL validity period. To build EvCOACH, we embed an additional hash chain in the extended-CRL. Finally, by conducting a detailed performance evaluation, COACH and EvCOACH are proved to be reliable, efficient, and scalable.     

IPTV: challenges and future directions

The move to IP Protocol Television (IPTV) has challenged the traditional television industry by opening the Internet to high quality real time television content delivery. Thus it has provided an enabling set of key technologies to understand and foster further innovations in the multimedia landscape and to create dynamics in the TV value chain. This editorial provides a brief overview of this special issue. It begins with a short introduction to IPTV Technology and then summarizes the main contributions of the selected papers for this special issue, highlighting their salient features and novel results.     

A cognitive-behavioral model of problematic online gaming in adolescents aged 12–22 years

The aim of this study was to apply the cognitive behavioral model of problematic Internet use to the context of online game use to obtain a better understanding of problematic use of online games and its negative consequences. In total, 597 online game playing adolescents aged 12–22 years participated in this study. Results showed that the cognitive behavioral model of problematic Internet use can also be used in the context of online game use. More specifically, preference for online social interaction, mood regulation and deficient self-regulation appeared to play an important role in predicting negative outcomes from problematic online game use. Together, these cognitions and behaviors explained 79% of the variance of negative outcomes scores. These findings can be used to develop strategies that aim at reducing problematic online game behavior and its negative consequences.     

Why girls go pink: Game character identification and game-players’ motivations

Based on social role theory and uses and gratifications, this study provides insights into the popularity of so-called pink games. This study is the first to examine the roles of identification, playing time, and age in the experience of motivations while playing an online role-playing game. Drawing upon a survey among 2261 girls between10 and 17 of age, our results show that identification with characters in the game is an important process in explaining girls’ gaming motivations. In addition, identification and motivations are intensified with playing time. Although age affects identification negatively, age is not related to the most important motive in playing pink games: social interaction. This study has important theoretical and practical implications for the popularity of pink games among girls.