OpenRaiser/Intern-Atlas huggingface dataset:
Temporal influence over the Last.fm social network
Venue: arXiv cs.SI 2013
Year: 2013

Several recent results show the influence of social contacts to spread certain properties over the network, but others question the methodology of these experiments by proposing that the measured effects may be due to homophily or a shared environment. In this paper we justify the existence of the social influence by considering the temporal behavior of Last.fm users. In order to clearly distinguish between friends sharing the same interest, especially since Last.fm recommends friends based on similarity of taste, we separated the timeless effect of similar taste from the temporal impulses of immediately listening to the same artist after a friend. We measured strong increase of listening to a completely new artist in a few hours period after a friend compared to non-friends representing a simple trend or external influence. In our experiment to eliminate network independent elements of taste, we improved collaborative filtering and trend based methods by blending with simple time aware recommendations based on the influence of friends. Our experiments are carried over the two-year "scrobble" history of 70,000 Last.fm users.
Structure and Dynamics of Coauthorship, Citation, and Impact within CSCW
Venue: arXiv cs.DL 2013
Year: 2013

CSCW has stabilized as an interdisciplinary venue for computer, information, cognitive, and social scientists but has also undergone significant changes in its format in recent years. This paper uses methods from social network analysis and bibliometrics to re-examine the structures of CSCW a decade after its last systematic analysis. Using data from the ACM Digital Library, we analyze changes in structures of coauthorship and citation between 1986 and 2013. Statistical models reveal significant but distinct patterns between papers and authors in how brokerage and closure in these networks affects impact as measured by citations and downloads. Specifically, impact is unduly influenced by structural position, such that ideas introduced by those in the core of the CSCW community (e.g., elite researchers) are advantaged over those introduced by peripheral participants (e.g., newcomers). This finding is examined in the context of recent changes to the CSCW conference that may have the effect of upsetting the preference for contributions from the core.
Algebraic Structure of Combined Traces
Venue: arXiv cs.LO 2013
Year: 2013

Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are able to capture the notions of causality and simultaneity of atomic actions which take place during the process of a system's operation. The aim of this paper is a transfer to the domain of comtraces and developing of some fundamental notions, which proved to be successful in the theory of traces. In particular, we introduce and then apply the notion of indivisible steps, the lexicographical canonical form of comtraces, as well as the representation of a comtrace utilising its linear projections to binary action subalphabets. We also provide two algorithms related to the new notions. Using them, one can solve, in an efficient way, the problem of step sequence equivalence in the context of comtraces. One may view our results as a first step towards the development of infinite combined traces, as well as recognisable languages of combined traces.
A novel method based on the Tikhonov functional for non-negative solution of a system of linear equations with non-negative coefficients
Venue: arXiv cs.NA 2013
Year: 2013

We propose a novel method for a solution of a system of linear equations with the non-negativity condition. The method is based on the Tikhonov functional and has better accuracy and stability than other well-known algorithms.
Knowledge Representation for Robots through Human-Robot Interaction
Venue: arXiv cs.AI 2013
Year: 2013

The representation of the knowledge needed by a robot to perform complex tasks is restricted by the limitations of perception. One possible way of overcoming this situation and designing "knowledgeable" robots is to rely on the interaction with the user. We propose a multi-modal interaction framework that allows to effectively acquire knowledge about the environment where the robot operates. In particular, in this paper we present a rich representation framework that can be automatically built from the metric map annotated with the indications provided by the user. Such a representation, allows then the robot to ground complex referential expressions for motion commands and to devise topological navigation plans to achieve the target locations.
Data mining application for cyber space users tendency in blog writing: a case study
Venue: arXiv cs.CY 2013
Year: 2013

Blogs are the recent emerging media which relies on information technology and technological advance. Since the mass media in some less-developed and developing countries are in government service and their policies are developed based on governmental interests, so blogs are provided for ideas and exchanging opinions. In this paper, we highlighted performed simulations from obtained information from 100 users and bloggers in Kohkiloye and Boyer Ahmad Province and using Weka 3.6 tool and c4.5 algorithm by applying decision tree with more than %82 precision for getting future tendency anticipation of users to blogging and using in strategically areas.
A new approach in dynamic traveling salesman problem: a hybrid of ant colony optimization and descending gradient
Venue: arXiv cs.NE 2013
Year: 2013

Nowadays swarm intelligence-based algorithms are being used widely to optimize the dynamic traveling salesman problem (DTSP). In this paper, we have used mixed method of Ant Colony Optimization (AOC)and gradient descent to optimize DTSP which differs with ACO algorithm in evaporation rate and innovative data. This approach prevents premature convergence and scape from local optimum spots and also makes it possible to find better solutions for algorithm. In this paper, we are going to offer gradient descent and ACO algorithm which in comparison to some former methods it shows that algorithm has significantly improved routes optimization.
Distributed Association Control and Relaying in MillimeterWave Wireless Access Networks
Venue: arXiv cs.NI 2013
Year: 2013

In millimeterWave wireless networks the rapidly varying wireless channels demand fast and dynamic resource allocation mechanisms. This challenge is hereby addressed by a distributed approach that optimally solves the fundamental resource allocation problem of joint client association and relaying. The problem is posed as a multi assignment optimization, for which a novel solution method is established by a series of transformations that lead to a tractable minimum cost flow problem. The method allows to design distributed auction solution algorithms where the clients and relays act asynchronously. The computational complexity of the new algorithms is much better than centralized general-purpose solvers. It is shown that the algorithms always converge to a solution that maximizes the total network throughput within a desired bound. Both theoretical and numerical results evince numerous useful properties in comparison to standard approaches and the potential applications to forthcoming millimeterWave wireless access networks.
Cooperative Caching Framework for Mobile Cloud Computing
Venue: arXiv cs.NI 2013
Year: 2013

Due to the advancement in mobile devices and wireless networks mobile cloud computing, which combines mobile computing and cloud computing has gained momentum since 2009. The characteristics of mobile devices and wireless network makes the implementation of mobile cloud computing more complicated than for fixed clouds. This section lists some of the major issues in Mobile Cloud Computing. One of the key issues in mobile cloud computing is the end to end delay in servicing a request. Data caching is o ne of the techniques widely used in wired and wireless networks to improve data access efficiency. In this paper we explore the possibility of a cooperative caching approach to enhance data access efficiency in mobile cloud computing. The proposed approach is based on cloudlets, one of the architecture designed for mobile cloud computing.
Context-aware QR-codes
Venue: arXiv cs.IT 2013
Year: 2013

This paper describes a new model for presenting local information based on the network proximity. We present a novelty mobile mashup which combines Wi-Fi proximity measurements with QR-codes. Our mobile mashup automatically adds context information the content presented by QR-codes. It simplifies the deployment schemes and allows to use unified presentation for all data points, for example. This paper describes how to combine QR-codes and network proximity information.
Resolution in Linguistic Propositional Logic based on Linear Symmetrical Hedge Algebra
Venue: arXiv cs.LO 2013
Year: 2013

The paper introduces a propositional linguistic logic that serves as the basis for automated uncertain reasoning with linguistic information. First, we build a linguistic logic system with truth value domain based on a linear symmetrical hedge algebra. Then, we consider Gödel's t-norm and t-conorm to define the logical connectives for our logic. Next, we present a resolution inference rule, in which two clauses having contradictory linguistic truth values can be resolved. We also give the concept of reliability in order to capture the approximative nature of the resolution inference rule. Finally, we propose a resolution procedure with the maximal reliability.
A Visual Cryptographic Encryption Technique for Securing Medical Images
Venue: arXiv cs.CR 2013
Year: 2013

The increased growth in the use of transmission of multimedia medical contents over unsecured and open networks provides insecurity for confidential patient information over these networks. Digital encryption of medical images before transmission and storage is proposed as a way to effectively provide protection of patient information. Encryption before watermarking of these images is necessary in order to ensure inaccessibility of information to unauthorized personnel with patient. This paper presented a visual cryptographic technique for encrypting of medical images before transmission or storage of them. This will make such images inaccessible by unauthorized personnel and also ensures confidentiality. The process made use of an encryption technique that is based on pixel shuffling and a secret key generated from the image.
Wavelet Analysis of Dynamic Behaviors of the Large Interconnected Power System
Venue: arXiv cs.SY 2013
Year: 2013

In this paper, the simulation of the disturbance propagation through a large power system is performed on the WSCC 127 bus test system. The signal frequency analysis from several parts of the power system is performed by applying the Wavelet Transform (WT). The results show that this approach provides the system operators with some useful information regarding the identification of the power system low-frequency electromechanical oscillations, the identification of the coherent groups of generators and the insight into the speed retardation of some parts of the power system. The ability to localize the disturbance is based on the disturbance propagation through the power system and the time-frequency analysis performed by using the WT is presented along with detailed physical interpretation of the used approach.
Extracting Connected Concepts from Biomedical Texts using Fog Index
Venue: arXiv cs.CL 2013
Year: 2013

In this paper, we establish Fog Index (FI) as a text filter to locate the sentences in texts that contain connected biomedical concepts of interest. To do so, we have used 24 random papers each containing four pairs of connected concepts. For each pair, we categorize sentences based on whether they contain both, any or none of the concepts. We then use FI to measure difficulty of the sentences of each category and find that sentences containing both of the concepts have low readability. We rank sentences of a text according to their FI and select 30 percent of the most difficult sentences. We use an association matrix to track the most frequent pairs of concepts in them. This matrix reports that the first filter produces some pairs that hold almost no connections. To remove these unwanted pairs, we use the Equally Weighted Harmonic Mean of their Positive Predictive Value (PPV) and Sensitivity as a second filter. Experimental results demonstrate the effectiveness of our method.
On the Change in Archivability of Websites Over Time
Venue: arXiv cs.DL 2013
Year: 2013

As web technologies evolve, web archivists work to keep up so that our digital history is preserved. Recent advances in web technologies have introduced client-side executed scripts that load data without a referential identifier or that require user interaction (e.g., content loading when the page has scrolled). These advances have made automating methods for capturing web pages more difficult. Because of the evolving schemes of publishing web pages along with the progressive capability of web preservation tools, the archivability of pages on the web has varied over time. In this paper we show that the archivability of a web page can be deduced from the type of page being archived, which aligns with that page's accessibility in respect to dynamic content. We show concrete examples of when these technologies were introduced by referencing mementos of pages that have persisted through a long evolution of available technologies. Identifying these reasons for the inability of these web pages to be archived in the past in respect to accessibility serves as a guide for ensuring that content that has longevity is published using good practice methods that make it available for preservation.
TOFEC: Achieving Optimal Throughput-Delay Trade-off of Cloud Storage Using Erasure Codes
Venue: arXiv cs.NI 2013
Year: 2013

Our paper presents solutions using erasure coding, parallel connections to storage cloud and limited chunking (i.e., dividing the object into a few smaller segments) together to significantly improve the delay performance of uploading and downloading data in and out of cloud storage. TOFEC is a strategy that helps front-end proxy adapt to level of workload by treating scalable cloud storage (e.g. Amazon S3) as a shared resource requiring admission control. Under light workloads, TOFEC creates more smaller chunks and uses more parallel connections per file, minimizing service delay. Under heavy workloads, TOFEC automatically reduces the level of chunking (fewer chunks with increased size) and uses fewer parallel connections to reduce overhead, resulting in higher throughput and preventing queueing delay. Our trace-driven simulation results show that TOFEC's adaptation mechanism converges to an appropriate code that provides the optimal delay-throughput trade-off without reducing system capacity. Compared to a non-adaptive strategy optimized for throughput, TOFEC delivers 2.5x lower latency under light workloads; compared to a non-adaptive strategy optimized for latency, TOFEC can scale to support over 3x as many requests.
Characterisation of Strongly Normalising lambda-mu-Terms
Venue: arXiv cs.LO 2013
Year: 2013

We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to represent the particular notion of continuation used in the literature for the definition of semantics for the lambda-mu-calculus. This makes it possible to lift the well-known characterisation property for strongly-normalising lambda-terms - that uses intersection types - to the lambda-mu-calculus. From this result an alternative proof of strong normalisation for terms typeable in Parigot's propositional logical system follows, by means of an interpretation of that system into ours.
Reconciling positional and nominal binding
Venue: arXiv cs.PL 2013
Year: 2013

We define an extension of the simply-typed lambda calculus where two different binding mechanisms, by position and by name, nicely coexist. In the former, as in standard lambda calculus, the matching between parameter and argument is done on a positional basis, hence alpha-equivalence holds, whereas in the latter it is done on a nominal basis. The two mechanisms also respectively correspond to static binding, where the existence and type compatibility of the argument are checked at compile-time, and dynamic binding, where they are checked at run-time.
Compiling symbolic attacks to protocol implementation tests
Venue: arXiv cs.CR 2013
Year: 2013

Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but the feasability of these scenarios need to be confirmed at the implementation level. However, bridging the gap between an abstract attack scenario derived from a specification and a penetration test on real implementations of a protocol is still an open issue. This work investigates an architecture for automatically generating abstract attacks and converting them to concrete tests on protocol implementations. In particular we aim to improve previously proposed blackbox testing methods in order to discover automatically new attacks and vulnerabilities. As a proof of concept we have experimented our proposed architecture to detect a renegotiation vulnerability on some implementations of SSL/TLS, a protocol widely used for securing electronic transactions.
A Novel Architecture for Relevant Blog Page Identifcation
Venue: arXiv cs.IR 2013
Year: 2013

Blogs are undoubtedly the richest source of information available in cyberspace. Blogs can be of various natures i.e. personal blogs which contain posts on mixed issues or blogs can be domain specific which contains posts on particular topics, this is the reason, they offer wide variety of relevant information which is often focused. A general search engine gives back a huge collection of web pages which may or may not give correct answers, as web is the repository of information of all kinds and a user has to go through various documents before he gets what he was originally looking for, which is a very time consuming process. So, the search can be made more focused and accurate if it is limited to blogosphere instead of web pages. The reason being that the blogs are more focused in terms of information. So, User will only get related blogs in response to his query. These results will be then ranked according to our proposed method and are finally presented in front of user in descending order
An Information Theoretic Point of View to Contention Resolution
Venue: arXiv cs.IT 2013
Year: 2013

We consider a slotted wireless network in an infrastructure setup with a base station (or an access point) and N users. The wireless channel gain between the base station and the users is assumed to be i.i.d., and the base station seeks to schedule the user with the highest channel gain in every slot (opportunistic scheduling). We assume that the identity of the user with the highest channel gain is resolved using a series of contention slots and with feedback from the base station. In this setup, we formulate the contention resolution problem for opportunistic scheduling as identifying a random threshold (channel gain) that separates the best channel from the other samples. We show that the average delay to resolve contention is related to the entropy of the random threshold. We illustrate our formulation by studying the opportunistic splitting algorithm (OSA) for i.i.d. wireless channel [9]. We note that the thresholds of OSA correspond to a maximal probability allocation scheme. We conjecture that maximal probability allocation is an entropy minimizing strategy and a delay minimizing strategy for i.i.d. wireless channel. Finally, we discuss the applicability of this framework for few other network scenarios.
Sparse Packetized Predictive Control for Networked Control over Erasure Channels
Venue: arXiv cs.SY 2013
Year: 2013

We study feedback control over erasure channels with packet-dropouts. To achieve robustness with respect to packet-dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. To reduce the data size of packets, we propose to adopt sparsity-promoting optimizations, namely, ell-1-ell-2 and ell-2-constrained ell-0 optimizations, for which efficient algorithms exist. We derive sufficient conditions on design parameters, which guarantee (practical) stability of the resulting feedback control systems when the number of consecutive packet-dropouts is bounded.
FpSynt: a fixed-point datapath synthesis tool for embedded systems
Venue: arXiv cs.AR 2013
Year: 2013

Digital mobile systems must function with low power, small size and weight, and low cost. High-performance desktop microprocessors, with built-in floating point hardware, are not suitable in these cases. For embedded systems, it can be advantageous to implement these calculations with fixed point arithmetic instead. We present an automated fixed-point data path synthesis tool FpSynt for designing embedded applications in fixed-point domain with sufficient accuracy for most applications. FpSynt is available under the GNU General Public License from the following GitHub repository: http://github.com/izhbannikov/FPSYNT
Packetized Predictive Control for Rate-Limited Networks via Sparse Representation
Venue: arXiv cs.SY 2013
Year: 2013

We study a networked control architecture for linear time-invariant plants in which an unreliable data-rate limited network is placed between the controller and the plant input. The distinguishing aspect of the situation at hand is that an unreliable data-rate limited network is placed between controller and the plant input. To achieve robustness with respect to dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. In our formulation, we design sparse packets for rate-limited networks, by adopting an an ell-0 optimization, which can be effectively solved by an orthogonal matching pursuit method. Our formulation ensures asymptotic stability of the control loop in the presence of bounded packet dropouts. Simulation results indicate that the proposed controller provides sparse control packets, thereby giving bit-rate reductions for the case of memoryless scalar coding schemes when compared to the use of, more common, quadratic cost functions, as in linear quadratic (LQ) control.