Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
55
Y Do Tngrs Luv 2 Txt Msg?
, 2001
"... Text messaging" --- using a mobile phone to send a message --- has changed how teenagers use wireless phones to communicate and coordinate. While the media reports rapid growth in text messaging, less is known about why teenagers have adopted it. In this paper, we report findings from a study o ..."
Abstract
-
Cited by 180 (12 self)
- Add to MetaCart
Text messaging" --- using a mobile phone to send a message --- has changed how teenagers use wireless phones to communicate and coordinate. While the media reports rapid growth in text messaging, less is known about why teenagers have adopted it. In this paper, we report findings from a study
Controllable-choice Message Sequence Graphs
, 2012
"... We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated restr ..."
Abstract
- Add to MetaCart
We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated
Mining Message Sequence Graphs
"... Dynamic specification mining involves discovering software behavior from traces for the purpose of program comprehension and bug detection. However, mining program behavior from execution traces is difficult for concurrent/distributed programs. Specifically, the inherent partial order relationships ..."
Abstract
-
Cited by 17 (6 self)
- Add to MetaCart
among events occurring across processes pose a big challenge to specification mining. In this paper, we propose a framework for mining partial orders so as to understand concurrent program behavior. Our miner takes in a set of concurrent program traces, and produces a message sequence graph (MSG
Pension Schemes Online Accounting for Tax by Scheme Administrator Response Messages Filename: TM-MSG AccountingforTax.doc
"... Version 7.b ..."
Mining Message Sequence Graphs
"... Dynamic specification mining involves discovering software behavior from traces for the purpose of program comprehen-sion and bug detection. However, mining program behavior from execution traces is difficult for concurrent/distributed programs. Specifically, the inherent partial order relation-ship ..."
Abstract
- Add to MetaCart
-ships among events occurring across processes pose a big challenge to specification mining. In this paper, we pro-pose a framework for mining partial orders so as to under-stand concurrent program behavior. Our miner takes in a set of concurrent program traces, and produces a message sequence graph (MSG
Analysing Message Sequence Graph Specifications ∗
, 2009
"... We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has been no precise description of such a transition system. Several analysis and verification problems concerning MSG speci ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has been no precise description of such a transition system. Several analysis and verification problems concerning MSG
Syntax Requirements of Message Sequence Charts
, 1995
"... messages A message is completely determined by its sender instance, its receiver instance and its message identifier. Therefore, a message can be represented by a triple which consists of these three identifiers. Such a triple will be called an abstract message. A type Msg is defined from which the ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
messages A message is completely determined by its sender instance, its receiver instance and its message identifier. Therefore, a message can be represented by a triple which consists of these three identifiers. Such a triple will be called an abstract message. A type Msg is defined from which
Approximate list-decoding of direct product . . .
"... Given a message msg ∈ {0, 1} N, its k-wise direct product encoding is the sequence of k-tuples (msg(i1),..., msg(ik)) over all possible k-tuples of indices (i1,..., ik) ∈ {1,..., N} k. We give an efficient randomized algorithm for approximate local list-decoding of direct product codes. That is, gi ..."
Abstract
-
Cited by 33 (8 self)
- Add to MetaCart
Given a message msg ∈ {0, 1} N, its k-wise direct product encoding is the sequence of k-tuples (msg(i1),..., msg(ik)) over all possible k-tuples of indices (i1,..., ik) ∈ {1,..., N} k. We give an efficient randomized algorithm for approximate local list-decoding of direct product codes. That is
Academic Publishers, pp. 219-238. y do tngrs luv 2 txt msg? 1
"... Abstract: "Text messaging " — using a mobile phone to send a message — has changed how teenagers use wireless phones to communicate and coordinate. While the media reports rapid growth in text messaging, less is known about why teenagers have adopted it. In this paper, we report f ..."
Abstract
- Add to MetaCart
Abstract: "Text messaging " — using a mobile phone to send a message — has changed how teenagers use wireless phones to communicate and coordinate. While the media reports rapid growth in text messaging, less is known about why teenagers have adopted it. In this paper, we report
Condition Message Coincidence
"... A classifier system is a self-learning system based on syntactically simple rules. It was first introduced by Holland [1]. Lots of rules can be activated at the same time, which is why information is being processed in parallel. 1.1. Simple classifier system According to Holland [1], a non-learning ..."
Abstract
- Add to MetaCart
) that ensures interaction with the environment or its change. At any time the message list can contain zero or more messages. Each message is of similar simple structure and consists of a string of fixed length L and alphabet A msg, say, a binary one. Using this structure makes it possible to compare conditions
Results 1 - 10
of
55
