10,669,781 research outputs found
A Framework for Quality-Driven Delivery in Distributed Multimedia Systems
In this paper, we propose a framework for Quality-Driven Delivery (QDD) in distributed multimedia environments. Quality-driven delivery refers to the capacity of a system to deliver documents, or more generally objects, while considering the users expectations in terms of non-functional requirements. For this QDD framework, we propose a model-driven approach where we focus on QoS information modeling and transformation. QoS information models and meta-models are used during different QoS activities for mapping requirements to system constraints, for exchanging QoS information, for checking compatibility between QoS information and more generally for making QoS decisions. We also investigate which model transformation operators have to be implemented in order to support some QoS activities such as QoS mapping
Reading porn: the paradigm shift in pornography research
This paper examines the paradigm shift in pornography theory and research from a focus on 'texts and effects' through to work emerging from the late 1980's onwards. The paper considers the reconceptualisation of pornography as a category, the location of pornography in relation to cultural hierarchy and form, the changing status of pornography in relation to mainstream representations, the significance of developing technologies and the movement towards more situated accounts of pornographic texts and their audiences as a series of attempts to contextualise the question 'what is pornography?'</p
Remarks on the k-error linear complexity of p(n)-periodic sequences
Recently the first author presented exact formulas for the number of 2ⁿn-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k >2, of a random 2ⁿn-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more sophisticated generalization of the Chan-Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for pⁿn-periodic sequences over Fp, p prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of pⁿn-periodic sequences over Fp
- …