OpenRaiser/Intern-Atlas huggingface dataset:
A Case Study on Model-Based Development of Robotic Systems using MontiArc with Embedded Automata
Venue: arXiv cs.SE 2014
Year: 2014

Software development for service robotics is inherently complex. Even a single robot requires the composition of several sensors, actuators, and software modules. The systems are usually developed by groups of domain experts, rarely software engineering experts. Thus the resulting software systems are monolithic programs solving a single problem on a single platform. We claim modeling of both structure and behavior of robots in a modular way leads to better reusable software. We report on a study about the modeling of robotics software with the structure and behavior modeling language MontiArcAutomaton. This study assesses the benefits and difficulties of model-based robotics software development using MontiArc-Automaton. Our findings are based on a survey, discussions with the participants, and key figures from their development behavior. We present the project, our study, lessons learned, and future work based on the insights gained
A review of the characteristics of 108 author-level bibliometric indicators
Venue: arXiv cs.DL 2014
Year: 2014

An increasing demand for bibliometric assessment of individuals has led to a growth of new bibliometric indicators as well as new variants or combinations of established ones. The aim of this review is to contribute with objective facts about the usefulness of bibliometric indicators of the effects of publication activity at the individual level. This paper reviews 108 indicators that can potentially be used to measure performance on the individual author level, and examines the complexity of their calculations in relation to what they are supposed to reflect and ease of end-user application.
Modeling Cloud Architectures as Interactive Systems
Venue: arXiv cs.SE 2014
Year: 2014

The development and maintenance of cloud software is complicated by complex but crucial technological requirements that are tightly coupled with each other and with the softwares actual business functionality. Consequently, the complexity of design, implementation, deployment, and maintenance activities increases. We present an architecture description language that raises the level of technological abstraction by modeling cloud software as interactive systems. We show how its models correspond to an architecture style that particularly meets the requirements of cloud-based cyber-physical systems. The result provides a basis for an architecture-driven model-based methodology for engineering cloud software.
Complexity Analysis of Joint Subcarrier and Power Allocation for the Cellular Downlink OFDMA System
Venue: arXiv cs.IT 2014
Year: 2014

Consider the cellular downlink Orthogonal Frequency Division Multiple Access (OFDMA) system where a single transmitter transmits signals to multiple receivers on multiple discrete subcarriers. To adapt fast channel fluctuations, the transmitter should be able to dynamically allocate subcarrier and power resources. Assuming perfect channel knowledge, we formulate the joint subcarrier and power allocation problem as two optimization problems: the first is the one of minimizing the total transmission power subject to quality of service constraints, and the second is the one of maximizing a system utility function subject to power budget constraints. In this letter, we show that both the aforementioned formulations of the joint subcarrier and power allocation problem are generally NP-hard. We also identify several subclasses of the problem which are polynomial time solvable.
A Dual Model of Open Source License Growth
Venue: arXiv cs.CY 2014
Year: 2014

Every open source project needs to decide on an open source license. This decision is of high economic relevance: Just which license is the best one to help the project grow and attract a community? The most common question is: Should the project choose a restrictive (reciprocal) license or a more permissive one? As an important step towards answering this question, this paper analyses actual license choice and correlated project growth from ten years of open source projects. It provides closed analytical models and finds that around 2001 a reversal in license choice occurred from restrictive towards permissive licenses.
Characterizing Internet Video for Large-scale Active Measurements
Venue: arXiv cs.MM 2014
Year: 2014

The availability of high definition video content on the web has brought about a significant change in the characteristics of Internet video, but not many studies on characterizing video have been done after this change. Video characteristics such as video length, format, target bit rate, and resolution provide valuable input to design Adaptive Bit Rate (ABR) algorithms, sizing playout buffers in Dynamic Adaptive HTTP streaming (DASH) players, model the variability in video frame sizes, etc. This paper presents datasets collected in 2013 and 2014 that contains over 130,000 videos from YouTube's most viewed (or most popular) video charts in 58 countries. We describe the basic characteristics of the videos on YouTube for each category, format, video length, file size, and data rate variation, observing that video length and file size fit a log normal distribution. We show that three minutes of a video suffice to represent its instant data rate fluctuation and that we can infer data rate characteristics of different video resolutions from a single given one. Based on our findings, we design active measurements for measuring the performance of Internet video.
A Lightweight Identification Protocol for Embedded Devices
Venue: arXiv cs.CR 2014
Year: 2014

The task of this paper is to introduce a new lightweight identification protocol based on biometric data and elliptic curves. In fact, we combine biometric data and asymetric cryptography, namely elliptic curves and standard tools to design a multifactor identification protocol. Our scheme is light, very fast, secure and robust against all the known attacks on identification protocol. Therefore, one can use it in any constraint device such as embedded systems.
Parametric Linear Dynamic Logic
Venue: arXiv cs.LO 2014
Year: 2014

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all $ω$-regular specifications while still maintaining many of LTL's desirable properties like an intuitive syntax and a translation into non-deterministic Büchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all $ω$-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic Büchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.
Model Checking Paxos in Spin
Venue: arXiv cs.LO 2014
Year: 2014

We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization exploits abstractions that follow from reduction theorems applied to the specific case-study. We apply the model checker Spin to automatically validate finite instances of the model and to extract preconditions on the size of quorums used in the election phases of the protocol.
Timed Runtime Monitoring for Multiparty Conversations
Venue: arXiv cs.DC 2014
Year: 2014

We propose a dynamic verification framework for protocols in real-time distributed systems. The framework is based on Scribble, a tool-chain for design and verification of choreographies based on multiparty session types, developed with our industrial partners. Drawing from recent work on multiparty session types for real-time interactions, we extend Scribble with clocks, resets, and clock predicates constraining the times in which interactions should occur. We present a timed API for Python to program distributed implementations of Scribble specifications. A dynamic verification framework ensures the safe execution of applications written with our timed API: we have implemented dedicated runtime monitors that check that each interaction occurs at a correct timing with respect to the corresponding Scribble specification. The performance of our implementation and its practicability are analysed via benchmarking.
Experimental Study of Phase Transition in Pedestrian Flow
Venue: arXiv cs.MA 2014
Year: 2014

The transition between low and high density phases is a typical feature of systems with social interactions. This contribution focuses on simple evacuation design of one room with one entrance and one exit; four passing-through experiments were organized and evaluated by means of automatic image processing. The phase of the system, determined by travel time and occupancy, is evaluated with respect to the inflow, a controlled boundary condition. Critical values of inflow and outflow were described with respect to the transition from low density to congested state. Moreover, microscopic analysis of travel time is provided.
The proposal of improved component selection framework
Venue: arXiv cs.SE 2014
Year: 2014

Component selection is considered one of hard tasks in Component Based Software Engineering (CBSE). It is difficult to find the optimal component selection. CBSE is an approach that is used to develop a software system from pre-existing software components. Appropriate software component selection plays an important role in CBSE. Many approaches were suggested to solve component selection problem. In this paper the component selection is done by improving the integrated component selection framework by including the pliability metric. Pliability is a flexible measure that assesses software quality in terms of its components quality. The validation of this proposed solution is done through collecting a sample of people who answer an electronic questionnaire that composed of 20 questions. The questionnaire is distributed through social sites such as Twitter, Facebook and emails. The result of the validation showed that using the integrated component selection framework with pliability metric is suitable for component selection.
A Multi-agent Based Digital Preservation Model
Venue: arXiv cs.MA 2014
Year: 2014

Master's Degree Thesis: Department of Physics, University of Turin Supervisor: Prof. Marco Maggiora, Department of Physics, University of Turin; email: marco.maggiora@unito.it Co-Supervisor: Prof. Walter Allasia, Innovation Department, EURIX; email: allasia@eurix.it The thesis describes an agent-based model aimed to simulate those processes in which a digital object faces the risk of obsolescence, a migration process has to be performed and the most appropriate file format has to be adopted. Agents have been designed in order to monitor and control the local system where they reside and its environment. They are able to become aware of obsolescent formats based on global parameters such as their diffusion. They communicate as well with each other to find out the most suitable preservation action to be performed. Agents request suggestions that are evaluated and propagated according to a weighting based on the level of trust assigned to both the agents who identified the problem and proposed the solution. In the current research, the definition of the trust level has been chosen based on the cultural and geographical distances, the expertise of the involved agents and the file format numerosity. The level of trust between two agents is automatically updated after every interaction by the mean of a feedback mechanism profiting of an inter agent communication based on stigmergy. Summing up, the thesis demonstrates how a multi-agent system can either perform an autonomous preservation action or suggest a list of best candidate solutions to the user. It benefits the management of several kinds of digital archive, especially those with limited resources specifically dedicated to digital preservation, such as small personal collections and many public institutions.
A Complete framework for ambush avoidance in realistic environments
Venue: arXiv cs.AI 2014
Year: 2014

Operating vehicles in adversarial environments between a recurring origin-destination pair requires new planning techniques. A two players zero-sum game is introduced. The goal of the first player is to minimize the expected casualties undergone by a convoy. The goal of the second player is to maximize this damage. The outcome of the game is obtained via a linear program that solves the corresponding minmax optimization problem over this outcome. Different environment models are defined in order to compute routing strategies over unstructured environments. To compare these methods for increasingly accurate representations of the environment, a grid-based model is chosen to represent the environment and the existence of a sufficient network size is highlighted. A global framework for the generation of realistic routing strategies between any two points is described. This framework requires a good assessment of the potential casualties at any location, therefore the most important parameters are identified. Finally the framework is tested on real world environments.
Significance of the teamwork in agile software engineering
Venue: arXiv cs.SE 2014
Year: 2014

A Software Engineering project depends significantly on team performance, as does any activity that involves human interaction. In the last years, the traditional perspective on software development is changing and agile methods have received considerable attention. Among other attributes, the ageists claim that fostering creativity is one of the keys to response to common problems and challenges of software development today. The development of new software products requires the generation of novel and useful ideas. It is a conceptual framework introduced in the Agile Manifesto in 2001. This paper is written in support of agile practices in terms of significance of teamwork for the success of software projects. Survey is used as a research method to know the significance of teamwork.
Recursive Total Least-Squares Algorithm Based on Inverse Power Method and Dichotomous Coordinate-Descent Iterations
Venue: arXiv cs.SY 2014
Year: 2014

We develop a recursive total least-squares (RTLS) algorithm for errors-in-variables system identification utilizing the inverse power method and the dichotomous coordinate-descent (DCD) iterations. The proposed algorithm, called DCD-RTLS, outperforms the previously-proposed RTLS algorithms, which are based on the line-search method, with reduced computational complexity. We perform a comprehensive analysis of the DCD-RTLS algorithm and show that it is asymptotically unbiased as well as being stable in the mean. We also find a lower bound for the forgetting factor that ensures mean-square stability of the algorithm and calculate the theoretical steady-state mean-square deviation (MSD). We verify the effectiveness of the proposed algorithm and the accuracy of the predicted steady-state MSD via simulations.
Approximating Upper Degree-Constrained Partial Orientations
Venue: arXiv cs.DS 2014
Year: 2014

In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph $G=(V,E)$, together with two degree constraint functions $d^-,d^+ : V \to \mathbb{N}$. The goal is to orient as many edges as possible, in such a way that for each vertex $v \in V$ the number of arcs entering $v$ is at most $d^-(v)$, whereas the number of arcs leaving $v$ is at most $d^+(v)$. This problem was introduced by Gabow [SODA'06], who proved it to be MAXSNP-hard (and thus APX-hard). In the same paper Gabow presented an LP-based iterative rounding $4/3$-approximation algorithm. Since the problem in question is a special case of the classic 3-Dimensional Matching, which in turn is a special case of the $k$-Set Packing problem, it is reasonable to ask whether recent improvements in approximation algorithms for the latter two problems [Cygan, FOCS'13; Sviridenko & Ward, ICALP'13] allow for an improved approximation for Upper Degree-Constrained Partial Orientation. We follow this line of reasoning and present a polynomial-time local search algorithm with approximation ratio $5/4+\varepsilon$. Our algorithm uses a combination of two types of rules: improving sets of bounded pathwidth from the recent $4/3+\varepsilon$-approximation algorithm for 3-Set Packing [Cygan, FOCS'13], and a simple rule tailor-made for the setting of partial orientations. In particular, we exploit the fact that one can check in polynomial time whether it is possible to orient all the edges of a given graph [Gyárfás & Frank, Combinatorics'76].
IMS-based mobile learning system
Venue: arXiv cs.CY 2014
Year: 2014

Electronic (E) learning management system is not a novel idea in the educational domain. Learning management systems are used to deal with academic activities such as course syllabi, time table scheduling, assessments and project discussion forums. Almost, all the top universities of world are using general purpose/customized solutions to manage learning management systems like SAP, Oracle, Moodle and Blackboard. The aim of this paper i.e., Mobile (M) Learning System (MLS) is not to substitute the traditional web based E learning applications but to enhance it by amalgamating both web and mobile technologies. This idea justifies the proposal of M learning system to use some of the services of E learning system from mobiles. MLS will use state-of-the-art IP Multimedia Sub System technology. The emphasis in this research will be on the technical implementation of the Session Initiation Protocol (SIP) using IP Multimedia Subsystem (IMS) to develop an MLS not only for the students of the King Abdulaziz University but it will be beneficial for the students of other universities at Kingdom of Saudi Arabia. A customized CBD is proposed as per the nature of MLS project. MLS case study is used as a research design to validate the customized CBD model. Multi-tier applications architecture (client, web, and business) will be adopted during the development of MLS case study. An MLS will be developed and tested using IMS platform to check its practicality for the students of King Abdulaziz University. It is anticipated that the proposed system will significantly facilitate to both the students and teachers of KAU during their off campus activities.
A Note on Cross Correlation Distribution of Ternary m-Sequences
Venue: arXiv cs.IT 2014
Year: 2014

In this note, we prove a conjecture proposed by Tao Zhang, Shuxing Li, Tao Feng and Gennian Ge, IEEE Transaction on Information Theory, vol. 60, no. 5, May 2014. This conjecture is about the cross correlation distribution of ternary $m$-sequences.
Video In Sentences Out
Venue: arXiv cs.CV 2014
Year: 2014

We present a system that produces sentential descriptions of video: who did what to whom, and where and how they did it. Action class is rendered as a verb, participant objects as noun phrases, properties of those objects as adjectival modifiers in those noun phrases, spatial relations between those participants as prepositional phrases, and characteristics of the event as prepositional-phrase adjuncts and adverbial modifiers. Extracting the information needed to render these linguistic entities requires an approach to event recognition that recovers object tracks, the trackto-role assignments, and changing body posture.
A Note on the Ranking of Saudi Arabian Universities based on highlycited.com
Venue: arXiv cs.DL 2014
Year: 2014

Recently, Thomson Reuters has published its 2014 list of highly cited researchers (HCRs)[1]. Initial studies over the list [2] suggested that some universities (for instance, King Abdulaziz University in Saudi Arabia) may have been manipulating its world ranking by contracting with highly cited researchers. In this work, we analyse the ranking of other Saudi universities based solely on the list. Our analysis suggests that other universities in Saudi Arabia do not follow the steps of King Abdulaziz University when it comes to contracting with HCRs.
Public Spheres in Twitter- and Blogosphere. Evidence from the US
Venue: arXiv cs.SI 2014
Year: 2014

The political requires a forum for its deliberation and Habermas has located it in the public spheres. Originally, mass media's role was one of a facilitator of these debates. However, under the immense pressures of free market competition and mobile audiences, mass media prefers episodic over thematic news. On the opposite end of the spectrum, social media has been heralded as a new forum, a reincarnation of the ailing public spheres to further the deliberation of the political. But do the followers of political parties in social media endorse thematic or episodic content? To answer this question, I look at the most recent 3,200 tweets that were broadcast from the Republican and Democratic Twitter accounts. By employing Latent dirichlet allocation, I extract the prevailing topics of these tweets and linked websites. Generalized linear models are used to describe the relationship between episodicity, thematicity and the endorsement counts of the posts analyzed. I find that there is a stark contrast between the behavior of Democratic and Republican followers. In general, there seems to be a slight preference for thematic messages. Interestingly, the distance to an election increases the odds of a message to be endorsed.
Task-group Relatedness and Generalization Bounds for Regularized Multi-task Learning
Venue: arXiv cs.LG 2014
Year: 2014

In this paper, we study the generalization performance of regularized multi-task learning (RMTL) in a vector-valued framework, where MTL is considered as a learning process for vector-valued functions. We are mainly concerned with two theoretical questions: 1) under what conditions does RMTL perform better with a smaller task sample size than STL? 2) under what conditions is RMTL generalizable and can guarantee the consistency of each task during simultaneous learning? In particular, we investigate two types of task-group relatedness: the observed discrepancy-dependence measure (ODDM) and the empirical discrepancy-dependence measure (EDDM), both of which detect the dependence between two groups of multiple related tasks (MRTs). We then introduce the Cartesian product-based uniform entropy number (CPUEN) to measure the complexities of vector-valued function classes. By applying the specific deviation and the symmetrization inequalities to the vector-valued framework, we obtain the generalization bound for RMTL, which is the upper bound of the joint probability of the event that there is at least one task with a large empirical discrepancy between the expected and empirical risks. Finally, we present a sufficient condition to guarantee the consistency of each task in the simultaneous learning process, and we discuss how task relatedness affects the generalization performance of RMTL. Our theoretical findings answer the aforementioned two questions.