On the Error-Free Computation of Fast Cosine Transform

We extend our previous work into error-free representations of transform basis functions by presenting a novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT) and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new algebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without any intermediate number representation conversions. The resulting architecture is very regular and reduces latency by 50% compared to a previous error-free design, with virtually the same hardware cost.

Non-verbal signalling in digital discourse:the case of letter repetition

This study focuses on the interactional functions of non-standard spelling, in particular letter repetition, used in text-based computer-mediated communication as a means of non-verbal signalling. The aim of this paper is to assess the current state of non-verbal cue research in computer-mediated discourse and demonstrate the need for a more comprehensive and methodologically rigorous exploration of written non-verbal signalling. The study proposes a contextual and usage-centered view of written paralanguage. Through illustrative, close linguistic analyses the study proves that previous approaches to non-standard spelling based on their relation to the spoken word might not account for the complexities of this CMC cue, and in order to further our understanding of their interactional functions it is more fruitful to describe the role they play during the contextualisation of the verbal messages. The interactional sociolinguistic approach taken in the analysis demonstrates the range of interactional functions letter repetition can achieve, including contribution to the inscription of socio-emotional information into writing, to the evoking of auditory cues or to a display of informality through using a relaxed writing style.

An Lp − Lq - Version of Morgan's Theorem Associated with Partial Differential Operators

2000 Mathematics Subject Classification: 42B10, 43A32.

Some Fractional Extensions of the Temperature Field Problem in Oil Strata

This survey is devoted to some fractional extensions of the incomplete lumped formulation, the lumped formulation and the formulation of Lauwerier of the temperature field problem in oil strata. The method of integral transforms is used to solve the corresponding boundary value problems for the fractional heat equation. By using Caputo’s differintegration operator and the Laplace transform, new integral forms of the solutions are obtained. In each of the different cases the integrands are expressed in terms of a convolution of two special functions of Wright’s type.

Generalized Convolution Transforms and Toeplitz Plus Hankel Integral Equations

Mathematics Subject Classification: 44A05, 44A35

Fekete-Szegö Inequality for Universally Prestarlike Functions

MSC 2010: 30C45

Applications of Subordination Principle to Log-Harmonic Mappings

MSC 2010: 30C45, 30C55

Some Growth and Distortion Theorems for Close-to-Convex Harmonic Functions in the Unit Disc

MSC 2010: 30C45, 30C55

Acceleration of Convergence in Dontchev’s Iterative Method for Solving Variational Inclusions

2000 Mathematics Subject Classification: 47H04, 65K10.

Paediatric prescribing practice and opinions of paediatric prescribers on ePrescribing

Objective The aim of this study was to provide an initial insight into current UK paediatric prescribing practice. Methods In 2012 focus groups were conducted at Birmingham Children's Hospital (UK specialist hospital) with both medical and non-medical prescribers and analysed using thematic analysis. Key findings Both sets of prescribers used a wide range of resources to support their prescribing decisions. Dosing information was most commonly checked, and a lack of specialist paediatric information was reported in existing resources. All groups had high expectations of the support functions that should be included in an electronic prescribing system and could see many potential benefits. Participants agreed that all staff should see the same drug alerts. The overwhelming concern was whether the current information technology infrastructure would support electronic prescribing. Conclusions Prescribers had high expectations of electronic prescribing, but lacked confidence in its delivery. Prescribers use a wide range of resources to support their decision making when prescribing in paediatrics.

Finite Symmetric Functions with Non-Trivial Arity Gap

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.

Optimization of Advertising Resources over Time: A Strategic Analysis

AMS subject classification: 90B60, 90B50, 90A80.

On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.

An Invariant Theory of Surfaces in the Four-Dimensional Euclidean or Minkowski Space

2010 Mathematics Subject Classification: 53A07, 53A35, 53A10.

Sobolev Type Decomposition of Paley-Wiener-Schwartz Space with Application to Sampling Theory

2000 Mathematics Subject Classification: 94A12, 94A20, 30D20, 41A05.