Showing papers in "Journal of Computer and System Sciences in 2014"

TL;DR: An overview of the most exploited vulnerabilities in existing hardware, software, and network layers is presented and critiques of existing state-of-the-art mitigation techniques as why they do or don't work are described.

TL;DR: This paper categorizes various types of malicious attacks against trust models and analyzes whether the existing trust models can resist these attacks or not, and lists several trust best practices that are essential for developing a robust trust model for WSNs.

TL;DR: A lightweight dynamic pseudonym identity based authentication and key agreement protocol for multi-server architecture that provides not only the declared security features in Li et [email protected]?s paper, but also some other security features, such as traceability and identity protection.

TL;DR: CONCLUDE (COmplex Network CLUster DEtection), a new clustering method that couples the accuracy of global approaches with the scalability of local methods, is proposed.

TL;DR: The ordered weighted average operator and hybrid weightedAverage operator for IVIFNs are defined based on the Karnik-Mendel algorithms and employed to solve multi-attribute group decision making problems with IVIFNNs.

TL;DR: This work proposes an implementation of a specific inference attack called the de-anonymization attack, by which an adversary tries to infer the identity of a particular individual behind a set of mobility traces, based on a mobility model called Mobility Markov Chain.

TL;DR: A new local-based classification method that incrementally trains a multi-layer perceptron for each level of the classification hierarchy, and obtains competitive results to a robust global method regarding both precision and recall evaluation measures.

TL;DR: TP2010, a Facebook application, is developed with the goal of inferring personality from the analysis of user interactions within social networks, and the results show that the classifiers have a high level of accuracy, making the proposed approach a reliable method for predicting the user personality.

TL;DR: This work proposes a new security model for G-Hadoop, based on several security solutions such as public key cryptography and the SSL protocol, that simplifies the users authentication and job submission process of the current G- Hadoop implementation with a single-sign-on approach.

TL;DR: A new 8-bit full adder is designed based on the majority gate in the QCA, with the minimum number of cells and area which combines both designs to implement an8-bit adder/subtractor in theQCA, which has the minimum delay and complexity.

TL;DR: This paper proposes a hybrid approach that combines TDS and BUG together for efficient sub-tree anonymization over big data and designs MapReduce algorithms for the two components (TDS andBUG) to gain high scalability.

TL;DR: Two approaches to detect and mitigate sinkhole attack in WSNs are proposed and a centralized approach to detect suspicious regions in the network using geostatistical hazard model and a distributed monitoring approach to explore every neighborhood in thenetwork to detect malicious behaviors are proposed.

TL;DR: A novel technique for effectively processing big graph data on Cloud with spatiotemporal compression and a novel data driven scheduling is developed for data processing optimisation.

TL;DR: A complexity dichotomy theorem for the most general form of Boolean #CSP where every constraint function takes values in the field of complex numbers C is proved.

TL;DR: Evaluated the accuracy of RF fingerprinting employing low-end receivers and suggests that receiver impairment effectively decreases the success rate of impersonation attack onRF fingerprinting.

TL;DR: A subexponential-time parameterized algorithm that in time decides whether G can be transformed into a cluster graph with exactly p cliques by changing at most k adjacencies.

TL;DR: This work introduces two novel realistic adversary models, the vanishing and the persistent adversary, characterized by different compromising capability, and proposes two distributed, efficient, and cooperative protocols to detect replicas: History Information-exchange Protocol (HIP) and its optimized version (HOP).

TL;DR: A purpose-based access control model in distributed computing environment for privacy preserving policies and mechanisms is proposed, and algorithms for policy conflicting problems are described.

TL;DR: A framework is introduced, in which manipulators can see the past votes but not the future ones, to model online coalitional manipulation of sequential elections, and it is shown that here manipulation can be extremely complex even for election systems with simple winner problems.

TL;DR: These characterizations not only give generic explanations for the existence of many known polynomial kernels for problems like q-Coloring, Odd Cycle Transversal, Chordal Deletion, @h-Transversal or Long Path, parameterized by the size of a vertex cover, but also imply new polynometric kernels for Problems like F-Minor-Free Deletions.

TL;DR: In this article, a general approach to define new revision operators derived from known operators, such that the result of the revision remains in the fragment under consideration, is presented, which is not limited to the Horn case but applicable to any fragment of propositional logic where the models of the formulas are closed under a Boolean function.

TL;DR: It is shown that these two problems related to selecting an optimal subset of columns from a matrix are NP-hard assuming UGC and unique Games Conjecture implies that there is no PTAS.

TL;DR: A semi-supervised approach for accurate Internet traffic clustering, which is motivated by the observation of widely existing partial equivalence relationships among Internet traffic flows, is proposed using a Gaussian Mixture Model with set-based equivalence constraint and a constrained Expectation Maximization algorithm for clustering.

TL;DR: A new multiple attribute decision making approach for dealing with 2-Tuple linguistic information, called the 2-tuple linguistic induced generalized ordered weighted averaging distance (2LIGOWAD) operator, is developed and an application is presented to a group decision making problem about selection of strategies.

TL;DR: This work developed a multi-objective evolutionary algorithm for mining quantitative association rules to deal with the reconstruction of gene association networks from gene expression profiles and applied it to well-known microarray data of yeast cell cycle.

TL;DR: An efficient broadcast encryption scheme for key distribution in MANET that can not only meet security demands but is also efficient in terms of computation and communication.

TL;DR: OPAL and JPAL are presented, two alternative justification counterparts of Gerbrandy–Groeneveld's public announcement logic PAL (K), and it is shown that PAL ( K) is the forgetful projection of both OPAL ( K ) and JPAl ( K ).

TL;DR: This paper considers a generalization of the Firefighter problem, where at each time step b⩽1b⩾1 firefighters can be deployed, and shows that this problem is W[1]-hard when parameterized by the number of saved vertices, protected Vertices, and burned vertices.

TL;DR: The problem of recognizing a square shuffle is NP-complete via a many-one reduction from 3-Partition, and remains complete over finite alphabets of size 7.