Rigorous comparison of parabolically tapered and conventional multimode-interference-based 3-dB power splitters in InGaAsP/InP waveguides

Design issues such as optical transmission, interference mechanisms, the splitting ratio, the polarization dependence, and the fabrication tolerances of a compact parabolically tapered multimode-interference (MMI)-based 3-dB power splitter on an InP-based deeply etched ridge waveguide, by use of the finite-element-based beam-propagation method, are presented. The benefits and drawbacks of the use of the tapered structure, in comparison with an untapered MMI-based 3-dB splitter, have also been investigated.     

Characteristic measures of switching functions

A basic problem in switching theory is the optimal realizations of switching functions in a certain basis and with respect to a certain characteristic measure such as complexity, circuit cost, number of input terminals, delay time. Naturally this problem has received much attention and although a general solution has not been accomplished, many very good results have been obtained.This survey does not attempt to include all the literature concerning this general problem. Some outstanding and basic papers will be reviewed emphasizing ideas, assumptions, results and limitations. A measure of circuit performance, labeled L(n), a characteristic index of the class of n-variable functions, will be defined. This measure is an important tool for understanding the difficulties of the problem and for obtaining most of the results. This survey reviews the most significant literature on problems concerning characteristic measures of switching functions, and in particular, measures of circuit complexity, formula complexity or length, and delay time required to realize switching functions. The asymptotic and finite behavior, the upper and lower bounds, and the order of magnitude of L(n) are included for each particular case.     

A soft computing approach for privacy requirements engineering: The PriS framework

Soft computing continuously gains interest in many fields of academic and industrial domain; among the most notable characteristics for using soft computing methodological tools is the ability to handle with vague and imprecise data in decision making processes. Similar conditions are often encountered in requirements engineering. In this paper, we introduce the PriS approach, a security and privacy requirements engineering framework which aims at incorporating privacy requirements early in the system development process. Specifically, PriS provides a set of concepts for modelling privacy requirements in the organisation domain and a systematic way-of-working for translating these requirements into system models. The conceptual model of PriS uses a goal hierarchy structure. Every privacy requirement is either applied or not on every goal. To this end every privacy requirement is a variable that can take two values [0,1] on every goal meaning that the requirements constraints the goal (value 1) or not (value 0). Following this way of working PriS ends up suggesting a number of implementation techniques based on the privacy requirements constraining the respective goals. Taking into account that the mapping of privacy variables to a crisp set consisting of two values [0,1] is constraining, we extend also the PriS framework so as to be able to address the degree of participation of every privacy requirement towards achieving the generic goal of privacy. Therefore, we propose a fuzzification of privacy variables that maps the expression of the degree of participation of each privacy variable to the [0,1] interval. We also present a mathematical framework that allows the concurrent management of combined independent preferences towards the necessity of a privacy measure; among the advantages of the presented extended framework is the scalability of the approach in such a way that the results are not limited by the number of independent opinions or by the number of factors considered while reasoning for a specific selection of privacy measures.     

Parallel and scalable processing of spatio-temporal RDF queries using Spark

The ever-increasing size of data emanating from mobile devices and sensors, dictates the use of distributed systems for storing and querying these data. Typically, such data sources provide some spatio-temporal information, alongside other useful data. The RDF data model can be used to interlink and exchange data originating from heterogeneous sources in a uniform manner. For example, consider the case where vessels report their spatio-temporal position, on a regular basis, by using various surveillance systems. In this scenario, a user might be interested to know which vessels were moving in a specific area for a given temporal range. In this paper, we address the problem of efficiently storing and querying spatio-temporal RDF data in parallel. We specifically study the case of SPARQL queries with spatio-temporal constraints, by proposing the DiStRDF system, which is comprised of a Storage and a Processing Layer. The DiStRDF Storage Layer is responsible for efficiently storing large amount of historical spatio-temporal RDF data of moving objects. On top of it, we devise our DiStRDF Processing Layer, which parses a SPARQL query and produces corresponding logical and physical execution plans. We use Spark, a well-known distributed in-memory processing framework, as the underlying processing engine. Our experimental evaluation, on real data from both aviation and maritime domains, demonstrates the efficiency of our DiStRDF system, when using various spatio-temporal range constraints.

     

Adaptive Smooth Simulcast Protocol (ASSP) for Video Applications: Description and Performance Evaluation

In this paper, we present Adaptive Smooth Simulcast Protocol (ASSP) for simulcast transmission of multimedia data over best-effort networks. ASSP is a new multiple-rate protocol that implements a single rate TCP-friendly protocol as the underlying congestion control mechanism for each simulcast stream. The key attributes of ASSP are: (a) TCP-friendly behavior, (b) adaptive per-stream transmission rates, (c) adaptive scalability to large sets of receivers and (d) smooth transmission rates that are suitable for multimedia applications. We evaluate the performance of ASSP under an integrated simulation environment which combines the measurements of both network and video performance metrics. We also compare ASSP against other proposed solutions and the results demonstrate that the performance of ASSP is significantly better than the tested solutions. Finally, ASSP is a practical solution with very low implementation complexity for video transmission over best-effort networks.     

Ontology-based sentiment analysis of twitter posts

The emergence of Web 2.0 has drastically altered the way users perceive the Internet, by improving information sharing, collaboration and interoperability. Micro-blogging is one of the most popular Web 2.0 applications and related services, like Twitter, have evolved into a practical means for sharing opinions on almost all aspects of everyday life. Consequently, micro-blogging web sites have since become rich data sources for opinion mining and sentiment analysis. Towards this direction, text-based sentiment classifiers often prove inefficient, since tweets typically do not consist of representative and syntactically consistent words, due to the imposed character limit. This paper proposes the deployment of original ontology-based techniques towards a more efficient sentiment analysis of Twitter posts. The novelty of the proposed approach is that posts are not simply characterized by a sentiment score, as is the case with machine learning-based classifiers, but instead receive a sentiment grade for each distinct notion in the post. Overall, our proposed architecture results in a more detailed analysis of post opinions regarding a specific topic.     

Chord-PKI: A distributed trust infrastructure based on P2P networks

Many P2P applications require security services such as privacy, anonymity, authentication, and non-repudiation. Such services could be provided through a hierarchical Public Key Infrastructure. However, P2P networks are usually Internet-scale distributed systems comprised of nodes with an undetermined trust level, thus making hierarchical solutions unrealistic. In this paper, we propose Chord-PKI, a distributed PKI architecture which is build upon the Chord overlay network, in order to provide security services for P2P applications. Our solution distributes the functionality of a PKI across the peers by using threshold cryptography and proactive updating. We analyze the security of the proposed infrastructure and through simulations we evaluate its performance for various scenarios of untrusted node distributions.     

Using Information Retrieval techniques for supporting data mining

The classic two-stepped approach of the Apriori algorithm and its descendants, which consisted of finding all large itemsets and then using these itemsets to generate all association rules has worked well for certain categories of data. Nevertheless for many other data types this approach shows highly degraded performance and proves rather inefficient.

We argue that we need to search all the search space of candidate itemsets but rather let the database unveil its secrets as the customers use it. We propose a system that does not merely scan all possible combinations of the itemsets, but rather acts like a search engine specifically implemented for making recommendations to the customers using techniques borrowed from Information Retrieval.     

Study of the thermal behaviour of alipharomatic polyesters around the glass–rubber transition region by thermomechanical analysis: the mobile and rigid amorphous fraction

The objective of this work was the study using thermomechanical analysis (TMA) of a peculiar behaviour, which was observed some years ago, around the glass–rubber transition region in some thermoplastic alipharomatic polyesters. For this purpose a series of nine alipharomatic polyesters was prepared by the two‐stage melt polycondensation method in a glass batch reactor and subjected to TMA in both penetration and expansion mode. Differential scanning calorimetry (DSC) was additionally used and the results are discussed focusing mainly on the first derivative curve of TMA thermograms in the penetration mode. From this curve, which shows two distinct peaks, the first peak could be attributed to the glass transition temperature (T_g) of the mobile amorphous fraction, since the value coincides with that obtained from DSC and is due to the abrupt shrinkage of the amorphous part of the sample. The second peak (up to 40 °C higher than T_g) is due most probably to the softening of the rigid amorphous fraction and the passage of the polymeric sample from the glass region to the cold crystallization region. When the sample is more crystalline than amorphous then the first peak is smaller or is completely absent. Copyright © 2006 Society of Chemical Industry