OpenRaiser/Intern-Atlas huggingface dataset:
Classical Encryption and Authentication under Quantum Attacks
Venue: arXiv cs.CR 2013
Year: 2013

Post-quantum cryptography studies the security of classical, i.e. non-quantum cryptographic protocols against quantum attacks. Until recently, the considered adversaries were assumed to use quantum computers and behave like classical adversaries otherwise. A more conservative approach is to assume that also the communication between the honest parties and the adversary is (partly) quantum. We discuss several options to define secure encryption and authentication against these stronger adversaries who can carry out 'superposition attacks'. We re-prove a recent result of Boneh and Zhandry, stating that a uniformly random function (and hence also a quantum-secure pseudorandom function) can serve as a message-authentication code which is secure, even if the adversary can evaluate this function in superposition.
Self-Interference Cancellation with Nonlinear Distortion Suppression for Full-Duplex Systems
Venue: arXiv cs.IT 2013
Year: 2013

In full-duplex systems, due to the strong self-interference signal, system nonlinearities become a significant limiting factor that bounds the possible cancellable self-interference power. In this paper, a self-interference cancellation scheme for full-duplex orthogonal frequency division multiplexing systems is proposed. The proposed scheme increases the amount of cancellable self-interference power by suppressing the distortion caused by the transmitter and receiver nonlinearities. An iterative technique is used to jointly estimate the self-interference channel and the nonlinearity coefficients required to suppress the distortion signal. The performance is numerically investigated showing that the proposed scheme achieves a performance that is less than 0.5dB off the performance of a linear full-duplex system.
Bicriteria data compression
Venue: arXiv cs.IT 2013
Year: 2013

The advent of massive datasets (and the consequent design of high-performing distributed storage systems) have reignited the interest of the scientific and engineering community towards the design of lossless data compressors which achieve effective compression ratio and very efficient decompression speed. Lempel-Ziv's LZ77 algorithm is the de facto choice in this scenario because of its decompression speed and its flexibility in trading decompression speed versus compressed-space efficiency. Each of the existing implementations offers a trade-off between space occupancy and decompression speed, so software engineers have to content themselves by picking the one which comes closer to the requirements of the application in their hands. Starting from these premises, and for the first time in the literature, we address in this paper the problem of trading optimally, and in a principled way, the consumption of these two resources by introducing the Bicriteria LZ77-Parsing problem, which formalizes in a principled way what data-compressors have traditionally approached by means of heuristics. The goal is to determine an LZ77 parsing which minimizes the space occupancy in bits of the compressed file, provided that the decompression time is bounded by a fixed amount (or vice-versa). This way, the software engineer can set its space (or time) requirements and then derive the LZ77 parsing which optimizes the decompression speed (or the space occupancy, respectively). We solve this problem efficiently in O(n log^2 n) time and optimal linear space within a small, additive approximation, by proving and deploying some specific structural properties of the weighted graph derived from the possible LZ77-parsings of the input file. The preliminary set of experiments shows that our novel proposal dominates all the highly engineered competitors, hence offering a win-win situation in theory&practice.
Dictionary Adaptation in Sparse Recovery Based on Different Types of Coherence
Venue: arXiv cs.IT 2013
Year: 2013

In sparse recovery, the unique sparsest solution to an under-determined system of linear equations is of main interest. This scheme is commonly proposed to be applied to signal acquisition. In most cases, the signals are not sparse themselves, and therefore, they need to be sparsely represented with the help of a so-called dictionary being specific to the corresponding signal family. The dictionaries cannot be used for optimization of the resulting under-determined system because they are fixed by the given signal family. However, the measurement matrix is available for optimization and can be adapted to the dictionary. Multiple properties of the resulting linear system have been proposed which can be used as objective functions for optimization. This paper discusses two of them which are both related to the coherence of vectors. One property aims for having incoherent measurements, while the other aims for insuring the successful reconstruction. In the following, the influences of both criteria are compared with different reconstruction approaches.
The Effects of Technology and Innovation on Society
Venue: arXiv cs.CY 2013
Year: 2013

Various models of the information society have been developed so far and they are so different from country to country that it would be rather unwise to look for a single, allencompassing definition. In our time a number of profound socioeconomic changes are underway. The application of these theories and schools on ICT is problematic in many respects. First, as we stated above, there is not a single, widely used paradigm which has synthesised the various schools and theories dealing with technology and society. Second, these fragmented approaches do not have a fully fledged mode of application to the relationship of ICT and (information) society. Third, SCOT, ANT, the evolutionary or the systems approach to the history of technology when dealing with information society does not take into account the results of approaches studying the very essence of the information age: information, communication and knowledge. The list of unnoticed or partially incorporated sciences, which focuses on the role of ICT in human information processing and other cognitive activities, is much longer.
Impact of mobility models on clustering based routing protocols in mobile WSNs
Venue: arXiv cs.NI 2013
Year: 2013

This paper presents comparison of different hierarchical (position and non-position based) protocols with respect to different mobility models. Previous work mainly focuses on static networks or at most a single mobility model. Using only one mobility model may not predict the behavior of routing protocol accurately. Simulation results show that mobility has large impact on the behavior of WSN routing protocols. Also, position based routing protocols performs better in terms of packet delivery compared to non position based routing protocols.
Wireless Physical Layer Security with Imperfect Channel State Information: A Survey
Venue: arXiv cs.IT 2013
Year: 2013

Physical layer security is an emerging technique to improve the wireless communication security, which is widely regarded as a complement to cryptographic technologies. To design physical layer security techniques under practical scenarios, the uncertainty and imperfections in the channel knowledge need to be taken into consideration. This paper provides a survey of recent research and development in physical layer security considering the imperfect channel state information (CSI) at communication nodes. We first present an overview of the main information-theoretic measures of the secrecy performance with imperfect CSI. Then, we describe several signal processing enhancements in secure transmission designs, such as secure on-off transmission, beamforming with artificial noise, and secure communication assisted by relay nodes or in cognitive radio systems. The recent studies of physical layer security in large-scale decentralized wireless networks are also summarized. Finally, the open problems for the on-going and future research are discussed.
Efficient Mixed-Norm Regularization: Algorithms and Safe Screening Methods
Venue: arXiv cs.LG 2013
Year: 2013

Sparse learning has recently received increasing attention in many areas including machine learning, statistics, and applied mathematics. The mixed-norm regularization based on the l1q norm with q>1 is attractive in many applications of regression and classification in that it facilitates group sparsity in the model. The resulting optimization problem is, however, challenging to solve due to the inherent structure of the mixed-norm regularization. Existing work deals with special cases with q=1, 2, infinity, and they cannot be easily extended to the general case. In this paper, we propose an efficient algorithm based on the accelerated gradient method for solving the general l1q-regularized problem. One key building block of the proposed algorithm is the l1q-regularized Euclidean projection (EP_1q). Our theoretical analysis reveals the key properties of EP_1q and illustrates why EP_1q for the general q is significantly more challenging to solve than the special cases. Based on our theoretical analysis, we develop an efficient algorithm for EP_1q by solving two zero finding problems. To further improve the efficiency of solving large dimensional mixed-norm regularized problems, we propose a screening method which is able to quickly identify the inactive groups, i.e., groups that have 0 components in the solution. This may lead to substantial reduction in the number of groups to be entered to the optimization. An appealing feature of our screening method is that the data set needs to be scanned only once to run the screening. Compared to that of solving the mixed-norm regularized problems, the computational cost of our screening test is negligible. The key of the proposed screening method is an accurate sensitivity analysis of the dual optimal solution when the regularization parameter varies. Experimental results demonstrate the efficiency of the proposed algorithm.
An Optimum Multilevel Dynamic Round Robin Scheduling Algorithm
Venue: arXiv cs.OS 2013
Year: 2013

The main objective of this paper is to improve the Round Robin scheduling algorithm using the dynamic time slice concept. CPU scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. CPU scheduling has strong effect on resource utilization as well as overall performance of the system. Round Robin algorithm performs optimally in time-shared systems, but it is not suitable for soft real time systems, because it gives more number of context switches, larger waiting time and larger response time. In this paper, a new CPU scheduling algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling Algorithm is proposed, which calculates intelligent time slice and changes after every round of execution. The suggested algorithm was evaluated on some CPU scheduling objectives and it was observed that this algorithm gave good performance as compared to the other existing CPU scheduling algorithms.
Complexity and Approximation of the Continuous Network Design Problem
Venue: arXiv cs.GT 2013
Year: 2013

We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge depends on the ratio of the edge flow and the capacity installed. The goal is to find an optimal investment in edge capacities so as to minimize the sum of the routing cost of the induced Wardrop equilibrium and the investment cost. While this problem is considered as challenging in the literature, its complexity status was still unknown. We close this gap showing that CNDP is strongly NP-complete and APX-hard, both on directed and undirected networks and even for instances with affine latencies. As for the approximation of the problem, we first provide a detailed analysis for a heuristic studied by Marcotte for the special case of monomial latency functions (Mathematical Programming, Vol.~34, 1986). Specifically, we derive a closed form expression of its approximation guarantee for arbitrary sets S of allowed latency functions. Second, we propose a different approximation algorithm and show that it has the same approximation guarantee. As our final -- and arguably most interesting -- result regarding approximation, we show that using the better of the two approximation algorithms results in a strictly improved approximation guarantee for which we give a closed form expression. For affine latencies, e.g., this algorithm achieves a 1.195-approximation which improves on the 5/4 that has been shown before by Marcotte. We finally discuss the case of hard budget constraints on the capacity investment.
Part of Speech Tagging of Marathi Text Using Trigram Method
Venue: arXiv cs.CL 2013
Year: 2013

In this paper we present a Marathi part of speech tagger. It is a morphologically rich language. It is spoken by the native people of Maharashtra. The general approach used for development of tagger is statistical using trigram Method. The main concept of trigram is to explore the most likely POS for a token based on given information of previous two tags by calculating probabilities to determine which is the best sequence of a tag. In this paper we show the development of the tagger. Moreover we have also shown the evaluation done.
H Index of scientific Nursing journals according to Google Scholar Metrics (2007-2011)
Venue: arXiv cs.DL 2013
Year: 2013

The aim of this report is to present a ranking of Nursing journals covered in Google Scholar Metrics (GSM), a Google product launched in 2012 to assess the impact of scientific journals from citation counts this receive on Google Scholar. Google has chosen to include only those journals that have published at least 100 papers and have at least one citation in a period of five years (2007-2011). Journal rankings are sorted by languages (showing the 100 papers with the greatest impact). This tool allows to sort by subject areas and disciplines, but only in the case of journals in English. In this case, it only shows the 20 journals with the highest h index. This option is not available for journals in the other nine languages present in Google (Chinese, Portuguese, German, Spanish, French, Korean, Japanese, Dutch and Italian). Google Scholar Metrics doesnt currently allow to group and sort all journals belonging to a scientific discipline. In the case of Nursing, in the ten listings displayed by GSM we can only locate 34 journals. Therefore, in an attempt to overcome this limitation, we have used the diversity of search procedures allowed by GSM to identify the greatest number of scientific journals of Nursing with h index calculated by this bibliometric tool. Bibliographic searches were conducted between 10th and 30th May 2013. The result is a ranking of 337 nursing journals sorted by the same h index, and mean as discriminating value. Journals are also grouped by quartiles.
A Smart Wizard System Suitable for Use With Internet Mobile Devices to Adjust Personal Information Privacy Settings
Venue: arXiv cs.CY 2013
Year: 2013

The privacy of personal information is an important issue affecting the confidence of internet users. The widespread adoption of online social networks and access to these platforms using mobile devices has encouraged developers to make the systems and interfaces acceptable to users who seek privacy. The aim of this study is to test a wizard that allows users to control the sharing of personal information with others. We also assess the concerns of users in terms of such sharing such as whether to hide personal data in current online social network accounts. Survey results showed the wizard worked very well and that females concealed more personal information than did males. In addition, most users who were concerned about misuse of personal information hid those items. The results can be used to upgrade current privacy systems or to design new systems that work on mobile internet devices. The system can also be used to save time when setting personal privacy settings and makes users more aware of items that will be shared with others.
Modulation Classification of MIMO-OFDM Signals by Independent Component Analysis and Support Vector Machines
Venue: arXiv cs.IT 2013
Year: 2013

A modulation classification (MC) scheme based on Independent Component Analysis (ICA) in conjunction with either maximum likelihood (ML) or Support Vector Machines (SVM) is proposed for MIMO-OFDM signals over frequency selective, time varying channels. The method is blind in the sense that it is assumed that the receiver has no information about the channel and transmitted signals other than that the spatial streams of signals are statistically independent. The processing consists of separation of the MIMO streams followed by modulation classification of the separated signals. While in general, blind separation of signals over frequency selective channels is a difficult problem, the non-frequency selective nature of the channel experienced by individual symbols in a MIMO-OFDM system enables the application of well-known ICA algorithms. Modulation classification is implemented by maximum likelihood and by an SVM-based modulation classification method relying on pre-selected modulation-dependent features. To improve performance in time varying channels, the invariance of the channel is exploited across the coherence bandwidth and the time coherence. The proposed method is shown to perform with high probability of correct classification over realistic ITU pedestrian and vehicular channels. An upper bound on the probability of correct classification is developed based on the Cramer Rao bound of channel estimation.
Usage habits of business information system in Hungary
Venue: arXiv cs.CY 2013
Year: 2013

The IT functions of the companies can be executed in different ways inhouse solution, outsourcing, in sourcing, formation a spinoff company. Predominantly this function is provided within the company in Hungary. The larger a company is; it is more likely that a separate IT manager will be entrusted for the supervision of IT functions. Only a very small number of smallsized enterprises said that they paid special attention to formulating an IT strategy, while it was not considered important by microenterprises at all.
Alternating-time temporal logic with finite-memory strategies
Venue: arXiv cs.GT 2013
Year: 2013

Model-checking the alternating-time temporal logics ATL and ATL* with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed is bounded and one where the memory size is unbounded (but must be finite). This is motivated by the high complexity of model-checking with perfect recall semantics and the severe limitations of memoryless strategies. We show that both types of semantics introduced are different from perfect recall and memoryless semantics and next focus on the decidability and complexity of model-checking in both complete and incomplete information games for ATL/ATL*. In particular, we show that the complexity of model-checking with bounded-memory semantics is Delta_2p-complete for ATL and PSPACE-complete for ATL* in incomplete information games just as in the memoryless case. We also present a proof that ATL and ATL* model-checking is undecidable for n >= 3 players with finite-memory semantics in incomplete information games.
Model checking coalitional games in shortage resource scenarios
Venue: arXiv cs.LO 2013
Year: 2013

Verification of multi-agents systems (MAS) has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL), whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula) to a semantic one (part of the model). This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions.
Superprocesses as models for information dissemination in the Future Internet
Venue: arXiv cs.NI 2013
Year: 2013

Future Internet will be composed by a tremendous number of potentially interconnected people and devices, offering a variety of services, applications and communication opportunities. In particular, short-range wireless communications, which are available on almost all portable devices, will enable the formation of the largest cloud of interconnected, smart computing devices mankind has ever dreamed about: the Proximate Internet. In this paper, we consider superprocesses, more specifically super Brownian motion, as a suitable mathematical model to analyse a basic problem of information dissemination arising in the context of Proximate Internet. The proposed model provides a promising analytical framework to both study theoretical properties related to the information dissemination process and to devise efficient and reliable simulation schemes for very large systems.
Complete Solutions for a Combinatorial Puzzle in Linear Time
Venue: arXiv cs.DS 2013
Year: 2013

In this paper we study a single player game consisting of $n$ black checkers and $m$ white checkers, called shifting the checkers. We have proved that the minimum number of steps needed to play the game for general $n$ and $m$ is $nm + n + m$. We have also presented an optimal algorithm to generate an optimal move sequence of the game consisting of $n$ black checkers and $m$ white checkers, and finally, we present an explicit solution for the general game.
Experimenting with X10 for Parallel Constraint-Based Local Search
Venue: arXiv cs.PL 2013
Year: 2013

In this study, we have investigated the adequacy of the PGAS parallel language X10 to implement a Constraint-Based Local Search solver. We decided to code in this language to benefit from the ease of use and architectural independence from parallel resources which it offers. We present the implementation strategy, in search of different sources of parallelism in the context of an implementation of the Adaptive Search algorithm. We extensively discuss the algorithm and its implementation. The performance evaluation on a representative set of benchmarks shows close to linear speed-ups, in all the problems treated.
Interning Ground Terms in XSB
Venue: arXiv cs.PL 2013
Year: 2013

This paper presents an implementation of interning of ground terms in the XSB Tabled Prolog system. This is related to the idea of hash-consing. I describe the concept of interning atoms and discuss the issues around interning ground structured terms, motivating why tabling Prolog systems may change the cost-benefit tradeoffs from those of traditional Prolog systems. I describe the details of the implementation of interning ground terms in the XSB Tabled Prolog System and show some of its performance properties. This implementation achieves the effects of that of Zhou and Have but is tuned for XSB's representations and is arguably simpler.