Pragmatic language disorder in Parkinson's disease and the potential effect of cognitive reserve

It is known that patients with Parkinson\u2019s Disease (PD) may show deficits in several areas of cognition, including speech and language abilities. One domain of particular interest is pragmatics, which refers to the capacity of using language in context for a successful communication. Several studies showed that some specific aspects of pragmatics \u2013 both in production and in comprehension \u2013 might be impaired in patients with PD. However, a clear picture of pragmatic abilities in PD is still missing, as most of the existing studies focused on specific aspects of the pragmatic competence rather than on sketching a complete pragmatic profile. Moreover, little is known on the potential role of protective factors in compensating the decline of communicative skills as the disease progresses. The present study has two aims: (1) to provide a complete picture of pragmatic abilities in patients with PD, by using a comprehensive battery (Assessment of Pragmatic Abilities and Cognitive Substrates, APACS) and by investigating the relationship with other aspects of cognitive functioning (e.g., working memory and Theory of Mind) and (2) to investigate whether Cognitive Reserve, i.e., the resilience to cognitive impairment provided by life experiences and activities, may compensate for the progressive pragmatic deficits in PD. We found that patients with PD, compared to healthy matched controls, had worse performance in discourse production and in the description of scenes, and that these impairments were tightly correlated with the severity of motor impairment, suggesting reduced intentionality of engaging in a communicative exchange. Patients with PD showed also an impairment in comprehending texts and humor, suggesting a problem in inferring from stories, which was related to general cognitive impairment. Notably, we did not find any significant difference between patients and controls in figurative language comprehension, a domain that is commonly impaired in other neurodegenerative diseases. This might be indicative of a specific profile of pragmatic impairment in patients with PD, worth of further investigation. Finally, Cognitive Reserve measures showed a high degree of association with pragmatic comprehension abilities, suggesting that the modification of life-styles could be a good candidate for compensating the possible problems in understanding the pragmatic aspects of language experienced by patients with PD

A VNF modeling approach for verification purposes

Network Function Virtualization (NFV) architectures are emerging to increase networks flexibility. However, this renewed scenario poses new challenges, because virtualized networks, need to be carefully verified before being actually deployed in production environments in order to preserve network coherency (e.g., absence of forwarding loops, preservation of security on network traffic, etc.). Nowadays, model checking tools, SAT solvers, and Theorem Provers are available for formal verification of such properties in virtualized networks. Unfortunately, most of those verification tools accept input descriptions written in specification languages that are difficult to use for people not experienced in formal methods. Also, in order to enable the use of formal verification tools in real scenarios, vendors of Virtual Network Functions (VNFs) should provide abstract mathematical models of their functions, coded in the specific input languages of the verification tools. This process is error-prone, time-consuming, and often outside the VNF developers’ expertise. This paper presents a framework that we designed for automatically extracting verification models starting from a Java-based representation of a given VNF. It comprises a Java library of classes to define VNFs in a more developer-friendly way, and a tool to translate VNF definitions into formal verification models of different verification tools

A novel approach for security function graph configuration and deployment

Network virtualization increased the versatility in enforcing security protection, by easing the development of new security function implementations. However, the drawback of this opportunity is that a security provider, in charge of configuring and deploying a security function graph, has to choose the best virtual security functions among a pool so large that makes manual decisions unfeasible. In light of this problem, the paper proposes a novel approach for synthesizing virtual security services by introducing the functionality abstraction. This new level of abstraction allows to work in the virtual level without considering the different function implementations, with the objective to postpone the function selection jointly with the deployment, after the configuration of the virtual graph. This novelty enables to optimize the function selection when the pool of available functions is very large. A framework supporting this approach has been implemented and it showed adequate scalability for the requirements of modern virtual networks

Automated optimal firewall orchestration and configuration in virtualized networks

Emerging technologies such as Software-Defined Networking and Network Functions Virtualization are making the definition and configuration of network services more dynamic, thus making automatic approaches that can replace manual and error-prone tasks more feasible. In view of these considerations, this paper proposes a novel methodology to automatically compute the optimal allocation scheme and configuration of virtual firewalls within a user-defined network service graph subject to a corresponding set of security requirements. The presented framework adopts a formal approach based on the solution of a weighted partial MaxSMT problem, which also provides good confidence about the solution correctness. A prototype implementation of the proposed approach based on the z3 solver has been used for validation, showing the feasibility of the approach for problem instances requiring tens of virtual firewalls and similar numbers of security requirements

An Efficient Data Exchange Algorithm for Chained Network Functions

In-network function chaining often involves the deployment of multiple applications into a single, possibly multi-tenant, middlebox. This approach has gained much interest since new network paradigms, such as Software Defined Networking (SDN) and Network Function Virtualization (NFV), have been proposed to virtualize resources as well as network functions. In this scenario, it is very common to move data (e.g., packets) from an application to another by means of a switching module that is in charge of chaining network functions in the correct order, also ensuring an adequate level of isolation between any two virtualized components. With this purpose in mind, this paper proposes an efficient algorithm to handle the communication between the internal soft-switch and the heterogeneous network functions that are executed on the same server. Our proposal is designed with the aim of dealing with high speed packet processing, hence an extensive performance evaluation is also provided to prove the goodness of our solution in this context