Conformance Testing of Preemptive Real-Time Systems

The paper presents an approach for model-based black-box conformance testing of preemptive real-time systems using Labeled Prioritized Time Petri Nets with Stopwatches (LPrSwTPN). These models not only specify system/environment interactions and time constraints. They further enable modelling of suspend/resume operations in real-time systems. The test specification used to generate test primitives, to check the correctness of system responses and to draw test verdicts is an LPrSwTPN made up of two concurrent sub-nets that respectively specify the system under test and its environment. The algorithms used in the TINA model analyzer have been extended to support concurrent composed subnets. Relativized stopwatch timed input/output conformance serves as the notion of implementation correctness, essentially timed trace inclusion taking environment assumptions into account. Assuming the modelled systems are non deterministic and partially observable, the paper proposes a test generation and execution algorithm which is based on symbolic techniques and implements an online testing policy and outputs test results for the (part of the) selected environment

Effects of Narcissism, Leisure Boredom, and Gratifications Sought on User-Generated Content Among Net-Generation Users

This research identifies the gratifications sought by the net-generation when producing user-generated content (UGC) on the internet. Members of the Net-generation want to vent negative feelings, show affection to their frieds and relatives, be involved in others' lives, and fulfill their need to be recognized. These gratifications were all found to be significantly associated with the users' various levels of participation in UGC (e.g., Facebook, YouTube, blogs, online forums, etc.) What's more, narcissism was predictive of content generation in social networking sites, blogs, and personal webpage, while leisure boredom was significantly linked to expressing views in forums, updating personal website, and participating in consumer reviews. In particular, the results showed the Net-geners who encountered leisure boredom had a higher tendency to seek interaction with friends online. Implications of findings are discussed

Efficient Algorithms for the Sum Selection Problem and k Maximum Sums Problem

Given a sequence of n real numbers A=a1,a2,…,an and a positive integer k, the Sum Selection Problem is to find the segment A(i∗,j∗)=ai∗,ai∗+1,…,aj∗ such that the rank of the sum View the MathML source is k over all View the MathML source segments. We present a deterministic algorithm for this problem that runs in O(nlogn) time. The previously best known result for this problem is a randomized algorithm that runs in expected O(nlogn) time. Applying this algorithm we can obtain a deterministic algorithm for the k Maximum Sums Problem, i.e., the problem of enumerating the k largest sum segments, that runs in O(nlogn+k) time. The previously best known randomized and deterministic algorithms for the k Maximum Sums Problem run respectively in expected O(nlogn+k) time and in worst case O(nlog2n+k) time