OpenRaiser/Intern-Atlas huggingface dataset:
Recent Developments with the licas System 2
Venue: arXiv cs.DC 2014
Year: 2014

The licas (lightweight Internet-based communication for autonomic services) system is a Java-based open source framework for building service-based networks, similar to what you would use a Cloud or SOA platform for. The framework comes with a server for running the services on, mechanisms for adding services to the server, mechanisms for linking services with each other, and mechanisms for allowing the services to communicate with each other. The general architecture of the system is now fairly well set, where this paper describes recent developments that have focused on making the framework more robust and additional features for easier programming.
Recent Developments with the licas System
Venue: arXiv cs.DC 2014
Year: 2014

This paper describes recent developments with the licas (lightweight Internet-based communication for autonomic services) software package. In particular, it describes how the architecture and functionality have changed from the first version release. The autonomous nature of the system is focused on, which requires independent behaviour and metadata descriptions of each service. The system has now also been ported to the Java mobile environment. Then some open questions or problems will be discussed in the areas of metadata consistency, security and trust. Finally, some solutions to these problems will also be suggested.
The Obvious Solution to Semantic Mapping -- Ask an Expert
Venue: arXiv cs.IR 2014
Year: 2014

The semantic mapping problem is probably the main obstacle to computer-to-computer communication. If computer A knows that its concept X is the same as computer B's concept Y, then the two machines can communicate. They will in effect be talking the same language. This paper describes a relatively straightforward way of enhancing the semantic descriptions of Web Service interfaces by using online sources of keyword definitions. Method interface descriptions can be enhanced using these standard dictionary definitions. Because the generated metadata is now standardised, this means that any other computer that has access to the same source, or understands standard language concepts, can now understand the description. This helps to remove a lot of the heterogeneity that would otherwise build up though humans creating their own descriptions independently of each other. The description comes in the form of an XML script that can be retrieved and read through the Web Service interface itself. An additional use for these scripts would be for adding descriptions in different languages, which would mean that human users that speak a different language would also understand what the service was about.
Multiview Hessian regularized logistic regression for action recognition
Venue: arXiv cs.CV 2014
Year: 2014

With the rapid development of social media sharing, people often need to manage the growing volume of multimedia data such as large scale video classification and annotation, especially to organize those videos containing human activities. Recently, manifold regularized semi-supervised learning (SSL), which explores the intrinsic data probability distribution and then improves the generalization ability with only a small number of labeled data, has emerged as a promising paradigm for semiautomatic video classification. In addition, human action videos often have multi-modal content and different representations. To tackle the above problems, in this paper we propose multiview Hessian regularized logistic regression (mHLR) for human action recognition. Compared with existing work, the advantages of mHLR lie in three folds: (1) mHLR combines multiple Hessian regularization, each of which obtained from a particular representation of instance, to leverage the exploring of local geometry; (2) mHLR naturally handle multi-view instances with multiple representations; (3) mHLR employs a smooth loss function and then can be effectively optimized. We carefully conduct extensive experiments on the unstructured social activity attribute (USAA) dataset and the experimental results demonstrate the effectiveness of the proposed multiview Hessian regularized logistic regression for human action recognition.
Robustness: a new SLIP model based criterion for gait transitions in bipedal locomotion
Venue: arXiv cs.RO 2014
Year: 2014

Bipedal locomotion is a phenomenon that still eludes a fundamental and concise mathematical understanding. Conceptual models that capture some relevant aspects of the process exist but their full explanatory power is not yet exhausted. In the current study, we introduce the robustness criterion which defines the conditions for stable locomotion when steps are taken with imprecise angle of attack. Intuitively, the necessity of a higher precision indicates the difficulty to continue moving with a given gait. We show that the spring-loaded inverted pendulum model, under the robustness criterion, is consistent with previously reported findings on attentional demand during human locomotion. This criterion allows transitions between running and walking, many of which conserve forward speed. Simulations of transitions predict Froude numbers below the ones observed in humans, nevertheless the model satisfactorily reproduces several biomechanical indicators such as hip excursion, gait duty factor and vertical ground reaction force profiles. Furthermore, we identify reversible robust walk-run transitions, which allow the system to execute a robust version of the hopping gait. These findings foster the spring-loaded inverted pendulum model as the unifying framework for the understanding of bipedal locomotion.
An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon
Venue: arXiv cs.GR 2014
Year: 2014

In this paper a new algorithm has been proposed which can fix the problem of Weiler Atherton algorithm. The problem of Weiler Atherton algorithm lies in clipping self intersecting polygon. Clipping self intersecting polygon is not considered in Weiler Atherton algorithm and hence it is also a main disadvantage of this algorithm. In our new algorithm a self intersecting polygon has been divided into non self intersecting contours and then perform the Weiler Atherton clipping algorithm on those sub polygons. For holes we have to store the edges that is not own boundary of hole contour from recently clipped polygon. Thus if both contour is hole then we have to store all the edges of the recently clipped polygon. Finally the resultant polygon has been produced by eliminating all the stored edges.
Dynamic stochastic blockmodels for time-evolving social networks
Venue: arXiv cs.SI 2014
Year: 2014

Significant efforts have gone into the development of statistical models for analyzing data in the form of networks, such as social networks. Most existing work has focused on modeling static networks, which represent either a single time snapshot or an aggregate view over time. There has been recent interest in statistical modeling of dynamic networks, which are observed at multiple points in time and offer a richer representation of many complex phenomena. In this paper, we present a state-space model for dynamic networks that extends the well-known stochastic blockmodel for static networks to the dynamic setting. We fit the model in a near-optimal manner using an extended Kalman filter (EKF) augmented with a local search. We demonstrate that the EKF-based algorithm performs competitively with a state-of-the-art algorithm based on Markov chain Monte Carlo sampling but is significantly less computationally demanding.
Artificial Neuron Modelling Based on Wave Shape
Venue: arXiv cs.NE 2014
Year: 2014

This paper describes a new model for an artificial neural network processing unit or neuron. It is slightly different to a traditional feedforward network by the fact that it favours a mechanism of trying to match the wave-like 'shape' of the input with the shape of the output against specific value error corrections. The expectation is then that a best fit shape can be transposed into the desired output values more easily. This allows for notions of reinforcement through resonance and also the construction of synapses.
Matrix Methods for Solving Algebraic Systems
Venue: arXiv cs.MS 2014
Year: 2014

We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining an overconstrained system and constructing a Sylvester-type matrix of its sparse resultant. Third, C code for a Sylvester-type matrix of the sparse resultant and a superset of all common roots of the initial well-constrained system by computing the eigen-decomposition of a square matrix obtained from the resultant matrix. We conclude with experiments in computing molecular conformations.
Latent Semantic Word Sense Disambiguation Using Global Co-occurrence Information
Venue: arXiv cs.CL 2014
Year: 2014

In this paper, I propose a novel word sense disambiguation method based on the global co-occurrence information using NMF. When I calculate the dependency relation matrix, the existing method tends to produce very sparse co-occurrence matrix from a small training set. Therefore, the NMF algorithm sometimes does not converge to desired solutions. To obtain a large number of co-occurrence relations, I propose to use co-occurrence frequencies of dependency relations between word features in the whole training set. This enables us to solve data sparseness problem and induce more effective latent features. To evaluate the efficiency of the method of word sense disambiguation, I make some experiments to compare with the result of the two baseline methods. The results of the experiments show this method is effective for word sense disambiguation in comparison with the all baseline methods. Moreover, the proposed method is effective for obtaining a stable effect by analyzing the global co-occurrence information.
Cyclic Orbit Codes and Stabilizer Subfields
Venue: arXiv cs.IT 2014
Year: 2014

Cyclic orbit codes are constant dimension subspace codes that arise as the orbit of a cyclic subgroup of the general linear group acting on subspaces in the given ambient space. With the aid of the largest subfield over which the given subspace is a vector space, the cardinality of the orbit code can be determined, and estimates for its distance can be found. This subfield is closely related to the stabilizer of the generating subspace. Finally, with a linkage construction larger, and longer, constant dimension codes can be derived from cyclic orbit codes without compromising the distance.
Hardware software co-design of the Aho-Corasick algorithm: Scalable for protein identification?
Venue: arXiv cs.CE 2014
Year: 2014

Pattern matching is commonly required in many application areas and bioinformatics is a major area of interest that requires both exact and approximate pattern matching. Much work has been done in this area, yet there is still a significant space for improvement in efficiency, flexibility, and throughput. This paper presents a hardware software co-design of Aho-Corasick algorithm in Nios II soft-processor and a study on its scalability for a pattern matching application. A software only approach is used to compare the throughput and the scalability of the hardware software co-design approach. According to the results we obtained, we conclude that the hardware software co-design implementation shows a maximum of 10 times speed up for pattern size of 1200 peptides compared to the software only implementation. The results also show that the hardware software co-design approach scales well for increasing data size compared to the software only approach.
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions
Venue: arXiv cs.DS 2014
Year: 2014

Generalizing many well-known and natural scheduling problems, scheduling with job-specific cost functions has gained a lot of attention recently. In this setting, each job incurs a cost depending on its completion time, given by a private cost function, and one seeks to schedule the jobs to minimize the total sum of these costs. The framework captures many important scheduling objectives such as weighted flow time or weighted tardiness. Still, the general case as well as the mentioned special cases are far from being very well understood yet, even for only one machine. Aiming for better general understanding of this problem, in this paper we focus on the case of uniform job release dates on one machine for which the state of the art is a 4-approximation algorithm. This is true even for a special case that is equivalent to the covering version of the well-studied and prominent unsplittable flow on a path problem, which is interesting in its own right. For that covering problem, we present a quasi-polynomial time $(1+ε)$-approximation algorithm that yields an $(e+ε)$-approximation for the above scheduling problem. Moreover, for the latter we devise the best possible resource augmentation result regarding speed: a polynomial time algorithm which computes a solution with \emph{optimal }cost at $1+ε$ speedup. Finally, we present an elegant QPTAS for the special case where the cost functions of the jobs fall into at most $\log n$ many classes. This algorithm allows the jobs even to have up to $\log n$ many distinct release dates.
Non-singular assembly mode changing trajectories in the workspace for the 3-RPS parallel robot
Venue: arXiv cs.RO 2014
Year: 2014

Having non-singular assembly modes changing trajectories for the 3-RPS parallel robot is a well-known feature. The only known solution for defining such trajectory is to encircle a cusp point in the joint space. In this paper, the aspects and the characteristic surfaces are computed for each operation mode to define the uniqueness of the domains. Thus, we can easily see in the workspace that at least three assembly modes can be reached for each operation mode. To validate this property, the mathematical analysis of the determinant of the Jacobian is done. The image of these trajectories in the joint space is depicted with the curves associated with the cusp points.
Sparse DOA Estimation of Wideband Sound Sources Using Circular Harmonics
Venue: arXiv cs.SD 2014
Year: 2014

Sparse signal models are in the focus of recent developments in narrowband DOA estimation. Applying these methods to localizing audio sources, however, is challenging due to the wideband nature of the signals. The common approach of processing all frequency bands separately and fusing the results is costly and can introduce errors in the solution. We show how these problems can be overcome by decomposing the wavefield of a circular microphone array and using circular harmonic coefficients instead of time-frequency data for sparse DOA estimation. As a result, we present the super-resolution localization method WASCHL (Wideband Audio Sparse Circular Harmonics Localizer) that is inherently frequency-coherent and highly efficient from a computational point of view.
Approximation Models of Combat in StarCraft 2
Venue: arXiv cs.AI 2014
Year: 2014

Real-time strategy (RTS) games make heavy use of artificial intelligence (AI), especially in the design of computerized opponents. Because of the computational complexity involved in managing all aspects of these games, many AI opponents are designed to optimize only a few areas of playing style. In games like StarCraft 2, a very popular and recently released RTS, most AI strategies revolve around economic and building efficiency: AI opponents try to gather and spend all resources as quickly and effectively as possible while ensuring that no units are idle. The aim of this work was to help address the need for AI combat strategies that are not computationally intensive. Our goal was to produce a computationally efficient model that is accurate at predicting the results of complex battles between diverse armies, including which army will win and how many units will remain. Our results suggest it may be possible to develop a relatively simple approximation model of combat that can accurately predict many battles that do not involve micromanagement. Future designs of AI opponents may be able to incorporate such an approximation model into their decision and planning systems to provide a challenge that is strategically balanced across all aspects of play.
A Novel Method for Comparative Analysis of DNA Sequences by Ramanujan-Fourier Transform
Venue: arXiv cs.CE 2014
Year: 2014

Alignment-free sequence analysis approaches provide important alternatives over multiple sequence alignment (MSA) in biological sequence analysis because alignment-free approaches have low computation complexity and are not dependent on high level of sequence identity, however, most of the existing alignment-free methods do not employ true full information content of sequences and thus can not accurately reveal similarities and differences among DNA sequences. We present a novel alignment-free computational method for sequence analysis based on Ramanujan-Fourier transform (RFT), in which complete information of DNA sequences is retained. We represent DNA sequences as four binary indicator sequences and apply RFT on the indicator sequences to convert them into frequency domain. The Euclidean distance of the complete RFT coefficients of DNA sequences are used as similarity measure. To address the different lengths in Euclidean space of RFT coefficients, we pad zeros to short DNA binary sequences so that the binary sequences equal the longest length in the comparison sequence data. Thus, the DNA sequences are compared in the same dimensional frequency space without information loss. We demonstrate the usefulness of the proposed method by presenting experimental results on hierarchical clustering of genes and genomes. The proposed method opens a new channel to biological sequence analysis, classification, and structural module identification.
Aligned Image Sets under Channel Uncertainty: Settling a Conjecture by Lapidoth, Shamai and Wigger on the Collapse of Degrees of Freedom under Finite Precision CSIT
Venue: arXiv cs.IT 2014
Year: 2014

A conjecture made by Lapidoth, Shamai and Wigger at Allerton 2005 (also an open problem presented at ITA 2006) states that the DoF of a 2 user broadcast channel, where the transmitter is equipped with 2 antennas and each user is equipped with 1 antenna, must collapse under finite precision CSIT. In this work we prove that the conjecture is true in all non-degenerate settings (e.g., where the probability density function of unknown channel coefficients exists and is bounded). The DoF collapse even when perfect channel knowledge for one user is available to the transmitter. This also settles a related recent conjecture by Tandon et al. The key to our proof is a bound on the number of codewords that can cast the same image (within noise distortion) at the undesired receiver whose channel is subject to finite precision CSIT, while remaining resolvable at the desired receiver whose channel is precisely known by the transmitter. We are also able to generalize the result along two directions. First, if the peak of the probability density function is allowed to scale as O(P^(α/2)), representing the concentration of probability density (improving CSIT) due to, e.g., quantized feedback at rate (α/2)\log(P), then the DoF are bounded above by 1+α, which is also achievable under quantized feedback. Second, we generalize the result to the K user broadcast channel with K antennas at the transmitter and a single antenna at each receiver. Here also the DoF collapse under non-degenerate channel uncertainty. The result directly implies a collapse of DoF to unity under non-degenerate channel uncertainty for the general K-user interference and MxN user X networks as well.
Design a Persian Automated Plagiarism Detector (AMZPPD)
Venue: arXiv cs.AI 2014
Year: 2014

Currently there are lots of plagiarism detection approaches. But few of them implemented and adapted for Persian languages. In this paper, our work on designing and implementation of a plagiarism detection system based on pre-processing and NLP technics will be described. And the results of testing on a corpus will be presented.
LTLf satisfiability checking
Venue: arXiv cs.LO 2014
Year: 2014

We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here a novel direct approach to LTLf satisfiability checking, where we take advantage of the difference in the semantics between LTL and LTLf. While LTL satisfiability checking requires finding a \emph{fair cycle} in an appropriate transition system, here we need to search only for a finite trace. This enables us to introduce specialized heuristics, where we also exploit recent progress in Boolean SAT solving. We have implemented our approach in a prototype tool and experiments show that our approach outperforms existing approaches.
Methods of executable code protection
Venue: arXiv cs.PL 2014
Year: 2014

The article deals with the problems in constructing a protection system of executable code. The techniques of breaking the integrity of executable code and ways to eliminate them are described. The adoption of virtual machine technology in the context of executable code protection from analysis is considered. The substantiation of the application of virtual machines as the best way to oppose the analysis of executable code is made. The protection of executable code by transferring the protected code in a virtual execution environment is considered. An efficient implementation of the method is proposed.
Verification of A Security Adaptive Protocol Suite Using SPIN
Venue: arXiv cs.NI 2014
Year: 2014

The advancement of mobile and wireless communication technologies in recent years introduced various adaptive protocols to adapt the need for secured communications. Security is a crucial success factor for any communication protocols, especially in mobile environment due to its ad hoc behavior. Formal verification plays an important role in development and application of safety critical systems. Formalized exhausted verification techniques to analyze the security and the safety properties of communications protocols increase and confirm the protocol confidence. SPIN is a powerful model checker that verifies the correctness of distributed communication models in a rigorous and automated fashion. This short paper proposes a SPIN based formal verification approach of a security adaptive protocol suite. The protocol suite includes a neighbor discovery mechanism and routing protocol. Both parts of the protocol suite are modeled into SPIN and exhaustively checked various temporal properties which ensure the applicability of the protocol suite in real-life applications.