Service-centric Networking Extensions

This paper discusses several issues of Service-Centric Networking (SCN) as an extension of the Information-Centric Networking (ICN) paradigm. SCN allows extended caching, where not exactly the same content as requested can be read from caches, but similar content can be used to produce the content requested, e.g., by filtering or transcoding. We discuss the issue of naming and routing for general dynamic services for both tightly coupled and decoupled ICN approaches. Challenges and solutions for service management are identified, in particular for composed services, which allow distributed in-network processing of service requests. We introduce the term Software-Defined Service-Centric Networking as an extension of Software-Defined Networking. A prototype implementation for SCN proofs its validity and feasibility and underlines its potential benefits.

Observations of the Eastern Maine Coastal Current and Its Offshore Extensions in 1994

Cold surface temperatures, reflecting Scotian Shelf origins and local tidal mixing, serve as a tracer of the Eastern Maine Coastal Current and its offshore extensions, which appear episodically as cold plumes erupting from the eastern Maine shelf. A cold water plume emanating from the Eastern Maine Coastal Current in May 1994 was investigated using advanced very high resolution radiometer (AVHRR) imagery, shipboard surveys of physical and biochemical properties, and satellite-tracked drifters. Evidence is presented that suggests that some of the plume waters were entrained within the cyclonic circulation over Jordan Basin, while the major portion participated in an anticyclonic eddy at the distal end of the plume. Calculations of the nitrate transported offshore by the plume show that this feature can episodically export significant quantities of nutrients from the Eastern Maine Coastal Current to offshore regions that are generally nutrient depleted during spring-summer. A series of AVHRR images is used to document the seasonal along-shelf progression of the coastal plume separation point. We speculate on potential causes and consequences of plume separation from the coastal current and suggest that this feature may be an important factor influencing the patterns and overall biological productivity of the eastern Gulf of Maine.

From doubled Chern–Simons–Maxwell lattice gauge theory to extensions of the toric code

We regularize compact and non-compact Abelian Chern–Simons–Maxwell theories on a spatial lattice using the Hamiltonian formulation. We consider a doubled theory with gauge fields living on a lattice and its dual lattice. The Hilbert space of the theory is a product of local Hilbert spaces, each associated with a link and the corresponding dual link. The two electric field operators associated with the link-pair do not commute. In the non-compact case with gauge group R, each local Hilbert space is analogous to the one of a charged “particle” moving in the link-pair group space R2 in a constant “magnetic” background field. In the compact case, the link-pair group space is a torus U(1)2 threaded by k units of quantized “magnetic” flux, with k being the level of the Chern–Simons theory. The holonomies of the torus U(1)2 give rise to two self-adjoint extension parameters, which form two non-dynamical background lattice gauge fields that explicitly break the manifest gauge symmetry from U(1) to Z(k). The local Hilbert space of a link-pair then decomposes into representations of a magnetic translation group. In the pure Chern–Simons limit of a large “photon” mass, this results in a Z(k)-symmetric variant of Kitaev’s toric code, self-adjointly extended by the two non-dynamical background lattice gauge fields. Electric charges on the original lattice and on the dual lattice obey mutually anyonic statistics with the statistics angle . Non-Abelian U(k) Berry gauge fields that arise from the self-adjoint extension parameters may be interesting in the context of quantum information processing.

Lipschitz extensions of maps between Heisenberg groups

Let $\H^n$ be the Heisenberg group of topological dimension 2n+1 . We prove that if n is odd, the pair of metric spaces $(\H^n, \H^n)$ does not have the Lipschitz extension property.

International Transfer Pricing for Goods and Intangible Asset Licenses in a Decentralized Multinational Corporation: Review and Extensions

We review and extend the core literature on international transfer price manipulation to avoid or evade taxes. Under negotiated transfer pricing with a viable bargaining structure, including performance evaluation disconnected from the transfer price, divisions voluntarily exchange accurate information to obtain firm-wide optimality, a result not dependent on restraint from exercising internal market power. For intangible licenses, a larger optimal profit shift for a given tax rate change strengthens incentives for transfer pricing abuse. In practice, an intangible's arm's length range is viewed as a guideline, a context where incentives for abuse materialize. Transfer pricing for intangibles obliges greater tax authority scrutiny.

Modular extensions for modular (Logic) languages

We address the problem of developing mechanisms for easily implementing modular extensions to modular (logic) languages. By(language) extensions we refer to different groups of syntactic definitions and translation rules that extend a language. Our use of the concept of modularity in this context is twofold. We would like these extensions to be modular, in the sense above, i.e., we should be able to develop different extensions mostly separately. At the same time, the sources and targets for the extensions are modular languages, i.e., such extensions may take as input sepárate pieces of code and also produce sepárate pieces of code. Dealing with this double requirement involves interesting challenges to ensure that modularity is not broken: first, combinations of extensions (as if they were a single extensión) must be given a precise meaning. Also, the sepárate translation of múltiple sources (as if they were a single source) must be feasible. We present a detailed description of a code expansion-based framework that proposes novel solutions for these problems. We argüe that the approach, while implemented for Ciao, can be adapted for other Prolog-based systems and languages.

Towards modular extensions for a modular language

Modularity allows the construction of complex designs from simpler, independent units that most of the time can be developed separately. In this paper we are concerned with developing mechanisms for easily implementing modular extensions to modular (logic) languages. By (language) extensions we refer to different groups of syntactic definitions and translation rules that extend a language. Our application of the concept of modularity in this context is twofold. We would like these extensions to be modular, in the above sense, i.e., we should be able to develop different extensions mostly separately. At the same time, the sources and targets for the extensions are modular languages, i.e., such extensions may take as input separate pieces of code and also produce separate pieces of code. Dealing with this double requirement involves interesting challenges to ensure that modularity is not broken: first, combinations of extensions (as if they were a single extension) must be given a precise meaning. Also, the separate translation of multiple sources (as if they were a single source) must be feasible. We present a detailed description of a code expansion-based framework that proposes novel solutions for these problems. We argue that the approach, while implemented for Ciao, can be adapted for other languages and Prolog-based systems.

Reversible language extensions and their application in debugging

A range of methodologies and techniques are available to guide the design and implementation of language extensions and domainspecific languages. A simple yet powerful technique is based on source-tosource transformations interleaved across the compilation passes of a base language. Despite being a successful approach, it has the main drawback that the input source code is lost in the process. When considering the whole workflow of program development (warning and error reporting, debugging, or even program analysis), program translations are no more powerful than a glorified macro language. In this paper, we propose an augmented approach to language extensions for Prolog, where symbolic annotations are included in the target program. These annotations allow selectively reversing the translated code. We illustrate the approach by showing that coupling it with minimal extensions to a generic Prolog debugger allows us to provide users with a familiar, source-level view during the debugging of programs which use a variety of language extensions, such as functional notation, DCGs, or CLP{Q,R}.

Efficiency and spatial equity impacts of high-speed rail extensions in urban areas

Urban areas benefit from significant improvements in accessibility when a new high speed rail (HSR) project is built. These improvements, which are due mainly to a rise in efficiency, produce locational advantagesand increase the attractiveness of these cities, thereby possibly enhancing their competitivenessand economic growth. However, there may be equity issues at stake, as the main accessibility benefits are primarily concentrated in urban areas with a HSR station, whereas other locations obtain only limited benefits. HSR extensions may contribute to an increase in spatial imbalance and lead to more polarized patterns of spatial development. Procedures for assessing the spatial impacts of HSR must therefore follow a twofold approach which addresses issues of both efficiency and equity. This analysis can be made by jointly assessing both the magnitude and distribution of the accessibility improvements deriving from a HSR project. This paper describes an assessment methodology for HSR projects which follows this twofold approach. The procedure uses spatial impact analysis techniques and is based on the computation of accessibility indicators, supported by a Geographical Information System (GIS). Efficiency impacts are assessed in terms of the improvements in accessibility resulting from the HSR project, with a focus on major urban areas; and spatial equity implications are derived from changes in the distribution of accessibility values among these urban agglomerations.

Heavyweight extensions to the UML metamodel to describe the C3 architectural style

UML is widely accepted as the standard for representing the various software artifacts generated by a development process. For this reason, there have been attempts to use this language to represent the software architecture of systems as well. Unfortunately, these attempts have ended in the same representations (boxes and lines) already criticized by the software architecture community.In this work we propose an extension to the UML metamodel that is able to represent the syntactics and semantics of the C3 architectural style. This style is derived from C2. The modifications to define C3 are described in section 4. This proposal is innovative regarding UML extensions for software architectures, since previous proposals where based on light extensions to the UML meta-model, while we propose a heavyweight extension of the metamodel. On the other hand, this proposal is less ambitious than previous proposals, since we do not want to represent in UML any architectural style, but only one: C3.

Synaptic Vesicles Form by Budding from Tubular Extensions of Sorting Endosomes in PC12 Cells

The putative role of sorting early endosomes (EEs) in synaptic-like microvesicle (SLMV) formation in the neuroendocrine PC12 cell line was investigated by quantitative immunoelectron microscopy. By BSA-gold internalization kinetics, four distinct endosomal subcompartments were distinguished: primary endocytic vesicles, EEs, late endosomes, and lysosomes. As in other cells, EEs consisted of vacuolar and tubulovesicular subdomains. The SLMV marker proteins synaptophysin and vesicle-associated membrane protein 2 (VAMP-2) localized to both the EE vacuoles and associated tubulovesicles. Quantitative analysis showed that the transferrin receptor and SLMV proteins colocalized to a significantly higher degree in primary endocytic vesicles then in EE-associated tubulovesicles. By incubating PC12 cells expressing T antigen-tagged VAMP (VAMP-TAg) with antibodies against the luminal TAg, the recycling pathway of SLMV proteins was directly visualized. At 15°C, internalized VAMP-TAg accumulated in the vacuolar domain of EEs. Upon rewarming to 37°C, the labeling shifted to the tubular part of EEs and to newly formed SLMVs. Our data delineate a pathway in which SLMV proteins together with transferrin receptor are delivered to EEs, where they are sorted into SLMVs and recycling vesicles, respectively.

Detecting implicit expressions of affect in text using EmotiNet and its extensions

In the past years, an important volume of research in Natural Language Processing has concentrated on the development of automatic systems to deal with affect in text. The different approaches considered dealt mostly with explicit expressions of emotion, at word level. Nevertheless, expressions of emotion are often implicit, inferrable from situations that have an affective meaning. Dealing with this phenomenon requires automatic systems to have “knowledge” on the situation, and the concepts it describes and their interaction, to be able to “judge” it, in the same manner as a person would. This necessity motivated us to develop the EmotiNet knowledge base — a resource for the detection of emotion from text based on commonsense knowledge on concepts, their interaction and their affective consequence. In this article, we briefly present the process undergone to build EmotiNet and subsequently propose methods to extend the knowledge it contains. We further on analyse the performance of implicit affect detection using this resource. We compare the results obtained with EmotiNet to the use of alternative methods for affect detection. Following the evaluations, we conclude that the structure and content of EmotiNet are appropriate to address the automatic treatment of implicitly expressed affect, that the knowledge it contains can be easily extended and that overall, methods employing EmotiNet obtain better results than traditional emotion detection approaches.