OpenRaiser/Intern-Atlas huggingface dataset:
An Authentication Scheme for Subspace Codes over Network Based on Linear Codes
Venue: arXiv cs.CR 2013
Year: 2013

Network coding provides the advantage of maximizing the usage of network resources, and has great application prospects in future network communications. However, the properties of network coding also make the pollution attack more serious. In this paper, we give an unconditional secure authentication scheme for network coding based on a linear code $C$. Safavi-Naini and Wang gave an authentication code for multi-receivers and multiple messages. We notice that the scheme of Safavi-Naini and Wang is essentially constructed with Reed-Solomon codes. And we modify their construction slightly to make it serve for authenticating subspace codes over linear network. Also, we generalize the construction with linear codes. The generalization to linear codes has the similar advantages as generalizing Shamir's secret sharing scheme to linear secret sharing sceme based on linear codes. One advantage of this generalization is that for a fixed message space, our scheme allows arbitrarily many receivers to check the integrity of their own messages, while the scheme with Reed-Solomon codes has a constraint on the number of verifying receivers. Another advantage is that we introduce access structure in the generalized scheme. Massey characterized the access structure of linear secret sharing scheme by minimal codewords in the dual code whose first component is 1. We slightly modify the definition of minimal codewords. Let $C$ be a $[V,k]$ linear code. For any coordinate $i\in \{1,2,\cdots,V\}$, a codeword $\vec{c}$ in $C$ is called minimal respect to $i$ if the codeword $\vec{c}$ has component 1 at the $i$-th coordinate and there is no other codeword whose $i$-th component is 1 with support strictly contained in that of $\vec{c}$. Then the security of receiver $R_i$ in our authentication scheme is characterized by the minimal codewords respect to $i$ in the dual code $C^\bot$.
Decomposability in Input Output Conformance Testing
Venue: arXiv cs.SE 2013
Year: 2013

We study the problem of deriving a specification for a third-party component, based on the specification of the system and the environment in which the component is supposed to reside. Particularly, we are interested in using component specifications for conformance testing of black-box components, using the theory of input-output conformance (ioco) testing. We propose and prove sufficient criteria for decompositionality, i.e., that components conforming to the derived specification will always compose to produce a correct system with respect to the system specification. We also study the criteria for strong decomposability, by which we can ensure that only those components conforming to the derived specification can lead to a correct system.
Space-Efficient Las Vegas Algorithms for K-SUM
Venue: arXiv cs.DS 2013
Year: 2013

Using hashing techniques, this paper develops a family of space-efficient Las Vegas randomized algorithms for $k$-SUM problems. This family includes an algorithm that can solve 3-SUM in $O(n^2)$ time and $O(\sqrt{n})$ space. It also establishes a new time-space upper bound for SUBSET-SUM, which can be solved by a Las Vegas algorithm in $O^*(2^{(1-\sqrt{\8/9β})n})$ time and $O^*(2^{βn})$ space, for any $β\in [0, \9/32]$.
Cloud Computing -- An Approach with Modern Cryptography
Venue: arXiv cs.CR 2013
Year: 2013

In this paper we are proposing an algorithm which uses AES technique of 128/192/256 bit cipher key in encryption and decryption of data. AES provides high security as compared to other encryption techniques along with RSA. Cloud computing provides the customer with the requested services. It refers to applications and services that run on distributed network using virtualized resources and accessed by common IP and network standard. While providing data services it is becoming important to provide security for data. In cloud computing keeping data secure is an important issue to be focused. Even though AES was designed for military purposes, now a days it is been commercially adopted worldwide as it can encrypt most confidential document, as well as it can work in most restricted areas, and offers good defense against various attack techniques, and security level to protect data for next 2-3 decades.
Multi-Pair Amplify-and-Forward Relaying with Very Large Antenna Arrays
Venue: arXiv cs.IT 2013
Year: 2013

We consider a multi-pair relay channel where multiple sources simultaneously communicate with destinations using a relay. Each source or destination has only a single antenna, while the relay is equipped with a very large antenna array. We investigate the power efficiency of this system when maximum ratio combining/maximal ratio transmission (MRC/MRT) or zero-forcing (ZF) processing is used at the relay. Using a very large array, the transmit power of each source or relay (or both) can be made inversely proportional to the number of relay antennas while maintaining a given quality-of-service. At the same time, the achievable sum rate can be increased by a factor of the number of source-destination pairs. We show that when the number of antennas grows to infinity, the asymptotic achievable rates of MRC/MRT and ZF are the same if we scale the power at the sources. Depending on the large scale fading effect, MRC/MRT can outperform ZF or vice versa if we scale the power at the relay.
Japanese-Spanish Thesaurus Construction Using English as a Pivot
Venue: arXiv cs.CL 2013
Year: 2013

We present the results of research with the goal of automatically creating a multilingual thesaurus based on the freely available resources of Wikipedia and WordNet. Our goal is to increase resources for natural language processing tasks such as machine translation targeting the Japanese-Spanish language pair. Given the scarcity of resources, we use existing English resources as a pivot for creating a trilingual Japanese-Spanish-English thesaurus. Our approach consists of extracting the translation tuples from Wikipedia, disambiguating them by mapping them to WordNet word senses. We present results comparing two methods of disambiguation, the first using VSM on Wikipedia article texts and WordNet definitions, and the second using categorical information extracted from Wikipedia, We find that mixing the two methods produces favorable results. Using the proposed method, we have constructed a multilingual Spanish-Japanese-English thesaurus consisting of 25,375 entries. The same method can be applied to any pair of languages that are linked to English in Wikipedia.
Fuzzy Petri Nets for Human Behavior Verification and Validation
Venue: arXiv cs.CY 2013
Year: 2013

Regarding the rapid growth of the size and complexity of simulation applications, designing applicable and affordable verification and validation (V&V) structures is an important problem. On the other hand, nowadays human behavior models are principles to make decision in many simulations and in order to have valid decisions based on a reliable human decision model, first the model must pass the validation and verification criteria. Usually human behavior models are represented as fuzzy rule bases. In all the recent works, V&V process is applied on a ready given rule-base. In this work, we are first supposed to construct a fuzzy rule-base and then apply the V&V process on it. Considering the professor-student interaction as the case-study, in order to construct the rule base, a questionnaire is designed in a special way to be transformed to a hierarchical fuzzy rule-base. The constructed fuzzy rule base is then mapped to a fuzzy Petri net and then within the verification (generating and searching the reachability graph) and validation (reasoning the Petri net) process is searched for probable structural and semantic errors.
Verifying a platform for digital imaging: a multi-tool strategy
Venue: arXiv cs.SE 2013
Year: 2013

Fiji is a Java platform widely used by biologists and other experimental scientists to process digital images. In particular, in our research - made together with a biologists team; we use Fiji in some pre-processing steps before undertaking a homological digital processing of images. In a previous work, we have formalised the correctness of the programs which use homological techniques to analyse digital images. However, the verification of Fiji's pre-processing step was missed. In this paper, we present a multi-tool approach filling this gap, based on the combination of Why/Krakatoa, Coq and ACL2.
A fuzzy relation-based extension of Reggia's relational model for diagnosis handling uncertain and incomplete information
Venue: arXiv cs.AI 2013
Year: 2013

Relational models for diagnosis are based on a direct description of the association between disorders and manifestations. This type of model has been specially used and developed by Reggia and his co-workers in the late eighties as a basic starting point for approaching diagnosis problems. The paper proposes a new relational model which includes Reggia's model as a particular case and which allows for a more expressive representation of the observations and of the manifestations associated with disorders. The model distinguishes, i) between manifestations which are certainly absent and those which are not (yet) observed, and ii) between manifestations which cannot be caused by a given disorder and manifestations for which we do not know if they can or cannot be caused by this disorder. This new model, which can handle uncertainty in a non-probabilistic way, is based on possibility theory and so-called twofold fuzzy sets, previously introduced by the authors.
Mixtures of Gaussians and Minimum Relative Entropy Techniques for Modeling Continuous Uncertainties
Venue: arXiv cs.AI 2013
Year: 2013

Problems of probabilistic inference and decision making under uncertainty commonly involve continuous random variables. Often these are discretized to a few points, to simplify assessments and computations. An alternative approximation is to fit analytically tractable continuous probability distributions. This approach has potential simplicity and accuracy advantages, especially if variables can be transformed first. This paper shows how a minimum relative entropy criterion can drive both transformation and fitting, illustrating with a power and logarithm family of transformations and mixtures of Gaussian (normal) distributions, which allow use of efficient influence diagram methods. The fitting procedure in this case is the well-known EM algorithm. The selection of the number of components in a fitted mixture distribution is automated with an objective that trades off accuracy and computational cost.
Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams
Venue: arXiv cs.AI 2013
Year: 2013

To determine the value of perfect information in an influence diagram, one needs first to modify the diagram to reflect the change in information availability, and then to compute the optimal expected values of both the original diagram and the modified diagram. The value of perfect information is the difference between the two optimal expected values. This paper is about how to speed up the computation of the optimal expected value of the modified diagram by making use of the intermediate computation results obtained when computing the optimal expected value of the original diagram.
Argumentation as a General Framework for Uncertain Reasoning
Venue: arXiv cs.AI 2013
Year: 2013

Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled as a labelled deductive system, in which propositions are doubly labelled with the grounds on which they are based and a representation of the confidence attached to the argument. Argument construction is captured by a generalized argument consequence relation based on the ^,--fragment of minimal logic. Arguments can be aggregated by a variety of numeric and symbolic flattening functions. This approach appears to shed light on the common logical structure of a variety of quantitative, qualitative and defeasible uncertainty calculi.
Qualitative Measures of Ambiguity
Venue: arXiv cs.AI 2013
Year: 2013

This paper introduces a qualitative measure of ambiguity and analyses its relationship with other measures of uncertainty. Probability measures relative likelihoods, while ambiguity measures vagueness surrounding those judgments. Ambiguity is an important representation of uncertain knowledge. It deals with a different, type of uncertainty modeled by subjective probability or belief.
Possibilistic decreasing persistence
Venue: arXiv cs.AI 2013
Year: 2013

A key issue in the handling of temporal data is the treatment of persistence; in most approaches it consists in inferring defeasible confusions by extrapolating from the actual knowledge of the history of the world; we propose here a gradual modelling of persistence, following the idea that persistence is decreasing (the further we are from the last time point where a fluent is known to be true, the less certainly true the fluent is); it is based on possibility theory, which has strong relations with other well-known ordering-based approaches to nonmonotonic reasoning. We compare our approach with Dean and Kanazawa's probabilistic projection. We give a formal modelling of the decreasing persistence problem. Lastly, we show how to infer nonmonotonic conclusions using the principle of decreasing persistence.
Belief Revision in Probability Theory
Venue: arXiv cs.AI 2013
Year: 2013

In a probability-based reasoning system, Bayes' theorem and its variations are often used to revise the system's beliefs. However, if the explicit conditions and the implicit conditions of probability assignments `me properly distinguished, it follows that Bayes' theorem is not a generally applicable revision rule. Upon properly distinguishing belief revision from belief updating, we see that Jeffrey's rule and its variations are not revision rules, either. Without these distinctions, the limitation of the Bayesian approach is often ignored or underestimated. Revision, in its general form, cannot be done in the Bayesian approach, because a probability distribution function alone does not contain the information needed by the operation.
The Assumptions Behind Dempster's Rule
Venue: arXiv cs.AI 2013
Year: 2013

This paper examines the concept of a combination rule for belief functions. It is shown that two fairly simple and apparently reasonable assumptions determine Dempster's rule, giving a new justification for it.
$d$-COS-R is FPT via Interval Deletion
Venue: arXiv cs.DS 2013
Year: 2013

A binary matrix $M$ has the Consecutive Ones Property (COP) if there exists a permutation of columns that arranges the ones consecutively in all the rows. Given a matrix, the $d$-COS-R problem is to determine if there exists a set of at most $d$ rows whose deletion results in a matrix with COP. We consider the parameterized complexity of this problem with respect to the number $d$ of rows to be deleted as the parameter. The closely related Interval Deletion problem has recently shown to be FPT [Y. Cao and D. Marx, Interval Deletion is Fixed-Parameter Tractable, arXiv:1211.5933 [cs.DS],2012]. In this work, we describe a recursive depth-bounded search tree algorithm in which the problems at the leaf-level are solved as instances of Interval Deletion. The running time of the algorithm is dominated by the running time of Interval Deletion, and therefore we show that $d$-COS-R is fixed-parameter tractable and has a run-time of $O^*(10^d)$.
Joint Wireless Information and Energy Transfer in a Two-User MIMO Interference Channel
Venue: arXiv cs.IT 2013
Year: 2013

This paper investigates joint wireless information and energy transfer in a two-user MIMO interference channel, in which each receiver either decodes the incoming information data (information decoding, ID) or harvests the RF energy (energy harvesting, EH) to operate with a potentially perpetual energy supply. In the two-user interference channel, we have four different scenarios according to the receiver mode -- ($ID_1$, $ID_2$), ($EH_1$, $EH_2$), ($EH_1$, $ID_2$), and ($ID_1$, $EH_2$). While the maximum information bit rate is unknown and finding the optimal transmission strategy is still open for ($ID_1$, $ID_2$), we have derived the optimal transmission strategy achieving the maximum harvested energy for ($EH_1$, $EH_2$). For ($EH_1$, $ID_2$), and ($ID_1$, $EH_2$), we find a necessary condition of the optimal transmission strategy and, accordingly, identify the achievable rate-energy (R-E) tradeoff region for two transmission strategies that satisfy the necessary condition - maximum energy beamforming (MEB) and minimum leakage beamforming (MLB). Furthermore, a new transmission strategy satisfying the necessary condition - signal-to-leakage-and-energy ratio (SLER) maximization beamforming - is proposed and shown to exhibit a better R-E region than the MEB and the MLB strategies. Finally, we propose a mode scheduling method to switch between ($EH_1$, $ID_2$) and ($ID_1$, $EH_2$) based on the SLER.
Efficient Compressive Sampling of Spatially Sparse Fields in Wireless Sensor Networks
Venue: arXiv cs.IT 2013
Year: 2013

Wireless sensor networks (WSN), i.e. networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields. In this paper, we present a novel bandwidth/energy efficient CS scheme for acquisition of spatially sparse fields in a WSN. The paper contribution is twofold. Firstly, we introduce a sparse, structured CS matrix and we analytically show that it allows accurate reconstruction of bidimensional spatially sparse signals, such as those occurring in several surveillance application. Secondly, we analytically evaluate the energy and bandwidth consumption of our CS scheme when it is applied to data acquisition in a WSN. Numerical results demonstrate that our CS scheme achieves significant energy and bandwidth savings wrt state-of-the-art approaches when employed for sensing a spatially sparse field by means of a WSN.
Improving Automatic Emotion Recognition from speech using Rhythm and Temporal feature
Venue: arXiv cs.CV 2013
Year: 2013

This paper is devoted to improve automatic emotion recognition from speech by incorporating rhythm and temporal features. Research on automatic emotion recognition so far has mostly been based on applying features like MFCCs, pitch and energy or intensity. The idea focuses on borrowing rhythm features from linguistic and phonetic analysis and applying them to the speech signal on the basis of acoustic knowledge only. In addition to this we exploit a set of temporal and loudness features. A segmentation unit is employed in starting to separate the voiced/unvoiced and silence parts and features are explored on different segments. Thereafter different classifiers are used for classification. After selecting the top features using an IGR filter we are able to achieve a recognition rate of 80.60 % on the Berlin Emotion Database for the speaker dependent framework.
An Overview of Wireless Local Area Network (WLAN)
Venue: arXiv cs.NI 2013
Year: 2013

Wireless Communication is an application of science and technology that has come to be vital for modern existence. From the early radio and telephone to current devices such as mobile phones and laptops, accessing the global network has become the most essential and indispensable part of our lifestyle. Wireless communication is an ever developing field, and the future holds many possibilities in this area. One expectation for the future in this field is that, the devices can be developed to support communication with higher data rates and more security. Research in this area suggests that a dominant means of supporting such communication capabilities will be through the use of Wireless LANs. As the deployment of Wireless LAN increases well around the globe, it is increasingly important for us to understand different technologies and to select the most appropriate one. This paper provides a detailed study of the available wireless LAN technologies and the concerned issues, will give a brief description of what wireless LANs are, the need of Wireless LAN, History of wireless LAN, advantages of Wireless Networks, with summarizing the related work on WLAN in academic area, Wireless LAN technologies, some risks attacks against wireless technologies, suggesting some recommendations to protect wireless LAN network from attack, Finally we propose some research issues should be focused on in the future.
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
Venue: arXiv cs.DS 2013
Year: 2013

We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective of minimizing the makespan. For any number of identical parallel or uniformly related machines, we provide a competitive-ratio approximation scheme that computes an online algorithm whose competitive ratio is arbitrarily close to the best possible competitive ratio. We also determine this value up to any desired accuracy. This is the first application of competitive-ratio approximation schemes in the online-list model. The result proves the applicability of the concept in different online models. We expect that it fosters further research on other online problems.
Spatially Selective Artificial-Noise Aided Transmit Optimization for MISO Multi-Eves Secrecy Rate Maximization
Venue: arXiv cs.IT 2013
Year: 2013

Consider an MISO channel overheard by multiple eavesdroppers. Our goal is to design an artificial noise (AN)-aided transmit strategy, such that the achievable secrecy rate is maximized subject to the sum power constraint. AN-aided secure transmission has recently been found to be a promising approach for blocking eavesdropping attempts. In many existing studies, the confidential information transmit covariance and the AN covariance are not simultaneously optimized. In particular, for design convenience, it is common to prefix the AN covariance as a specific kind of spatially isotropic covariance. This paper considers joint optimization of the transmit and AN covariances for secrecy rate maximization (SRM), with a design flexibility that the AN can take any spatial pattern. Hence, the proposed design has potential in jamming the eavesdroppers more effectively, based upon the channel state information (CSI). We derive an optimization approach to the SRM problem through both analysis and convex conic optimization machinery. We show that the SRM problem can be recast as a single-variable optimization problem, and that resultant problem can be efficiently handled by solving a sequence of semidefinite programs. Our framework deals with a general setup of multiple multi-antenna eavesdroppers, and can cater for additional constraints arising from specific application scenarios, such as interference temperature constraints in interference networks. We also generalize the framework to an imperfect CSI case where a worst-case robust SRM formulation is considered. A suboptimal but safe solution to the outage-constrained robust SRM design is also investigated. Simulation results show that the proposed AN-aided SRM design yields significant secrecy rate gains over an optimal no-AN design and the isotropic AN design, especially when there are more eavesdroppers.
Towards the Fully Automatic Merging of Lexical Resources: A Step Forward
Venue: arXiv cs.CL 2013
Year: 2013

This article reports on the results of the research done towards the fully automatically merging of lexical resources. Our main goal is to show the generality of the proposed approach, which have been previously applied to merge Spanish Subcategorization Frames lexica. In this work we extend and apply the same technique to perform the merging of morphosyntactic lexica encoded in LMF. The experiments showed that the technique is general enough to obtain good results in these two different tasks which is an important step towards performing the merging of lexical resources fully automatically.