scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
TL;DR: This work establishes optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives, and designs heuristics to deal with the exponential complexity.

73 citations



Journal ArticleDOI
TL;DR: The proposed traceback scheme does not take into account the trust of node which leads to the low effectiveness, so the security and the network lifetime can be improved in TAPM scheme.

61 citations


Journal ArticleDOI
TL;DR: The collaboration reputation is built on a Web service collaboration network consisting of two metrics, which can be calculated according to other service's recommendation and assessed by the interaction frequency among Web services, and a trustworthy Web service selection method is presented.

59 citations


Journal ArticleDOI
TL;DR: This work addresses scheduling independent and precedence constrained parallel tasks on multiple homogeneous processors in a data center with dynamically variable voltage and speed as combinatorial optimization problems by adopting a two-level energy/time/power allocation scheme.

56 citations


Journal ArticleDOI
TL;DR: It is shown that general integer factoring is reducible in randomized polynomial time to a PPA problem and to the problem WeakPigeon ?

56 citations


Journal ArticleDOI
TL;DR: This article delivers automatic test data generation framework by effectively utilizing soft computing technique with Apache Hadoop MapReduce as the parallelization framework and significantly outperforms other existing cloud-based testing models.

51 citations


Journal ArticleDOI
TL;DR: A secure and efficient message dissemination scheme (SEMD) with policy enforcement in VANET is proposed, and an outsourcing decryption of ciphertext-policy attribute-based encryption (CP-ABE) to provide differentiated access control services, which makes the vehicles delegate most of the decryption computation to nearest roadside unit (RSU).

39 citations


Journal ArticleDOI
TL;DR: It is proved that it is BIS-hard to approximate the partition function of any 2-spin system on bipartite graphs supporting these two notions, nearly-independent phase-correlated spins and unary symmetry breaking.

33 citations


Journal ArticleDOI
TL;DR: A user popularity-based packet scheduling scheme for congestion control in ASNETs called Pop-aware, which exploits social popularity of sender nodes to prioritize all incoming flows and provides fairness of service received by each flow.

32 citations


Journal ArticleDOI
TL;DR: An adaptive virtual machine placement and consolidation approach to improve energy efficiency of a cloud datacenter; accounting for server heterogeneity, server processor low-power SLEEP state, state transition latency and integrated thermal controls to maintaindatacenter within operational temperature is presented.

Journal ArticleDOI
TL;DR: The results show that Cypher is a good query language in terms of code readability and has a moderate overhead for most queries, however, it has to be supplemented with "stored procedures" to make up for some performance deficits in pattern matching queries.

Journal ArticleDOI
TL;DR: A short elementary proof of the dichotomy theorem for conservative CSPs is given and it is shown that the conservative constraint satisfaction problems are NP-complete.

Journal ArticleDOI
TL;DR: In this article, a new family of d-light graphs, called Erdos-Renyi graphs, is introduced, which includes graphs of constant bounded degree and Erdos Renyi graphs.

Journal ArticleDOI
TL;DR: A methodology foundation for analyzing medical contexts is presented, that is, five representative medical diagnosis schemes for personal healthcare application are formalized.

Journal ArticleDOI
TL;DR: New properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks, and shed understanding on how sorting networks sort.

Journal ArticleDOI
TL;DR: This work gives fast state-optimal deterministic algorithms for the first non-trivial case f = 1 and gives a thorough experimental comparison of the two SAT-based synthesis techniques.

Journal ArticleDOI
TL;DR: The Gradient-based Visit Extractor (GVE) algorithm is presented, capable of extracting periods of low mobility from geospatial data, while maintaining resilience to noise, and addressing the drawbacks of existing techniques.

Journal ArticleDOI
TL;DR: In this paper, the authors present meta-theorems that provide polynomial kernels for large classes of graph problems parameterized by a structural parameter of the input graph, such as the C-cover number.

Journal ArticleDOI
TL;DR: A model based on time-driven microscopic simulation to evaluate train timetable from the viewpoint of big passengers' data on rail transit lines and assesses the drawbacks of scheduled timetables is presented.

Journal ArticleDOI
TL;DR: It is shown that the general implication of keys and unary independence atoms and of unary keys and general independence atoms is decidable in polynomial time, and tractable conditions that are sufficient for certain classes of Keys and independence atoms not to interact are established.

Journal ArticleDOI
TL;DR: This work presents a time-free uniform solution to SAT problem by P systems with proteins on membranes in the sense that the correctness of the solution is irrelevant to the times associated with the involved rules, and the P systems are constructed from the sizes of instances.

Journal ArticleDOI
TL;DR: Two kernelization algorithms for Hybridization Number are shown and an n f ( k ) t -time algorithm, with n = | X | and f some computable function of k is presented, which studies constructing a network displaying a given collection of phylogenetic trees.

Journal ArticleDOI
TL;DR: This work introduces a storage scheme that allows the representation and management of the evolving hierarchical structure of a multi-version ontology in a temporal relational database, aimed at supporting ontology-based personalization and temporal access to large collections of resources stored in a dynamic environment.

Journal ArticleDOI
TL;DR: Subgraph-based solutions for graph queries "Why Empty?" and "Why So Many?" that give an answer about which part of a graph query is responsible for an unexpected result are introduced.

Journal ArticleDOI
TL;DR: Three new graph classes are presented that have bounded clique-width and one of their two forbidden induced subgraphs is the diamond (the graph obtained from a clique on four vertices by deleting one edge).

Journal ArticleDOI
TL;DR: This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting of 24 comparators, hence showing that the 25-comparator sorting network found by Floyd in 1964 is optimal, and as a corollary, the 29-comparable network foundBy Waksman in 1969 is optimal when sorting 10 inputs.

Journal ArticleDOI
TL;DR: This work shows that a powerful technique for computing representative families leads to a unified approach for substantially improving the running times of parameterized algorithms for some classic problems, including k-Partial Cover, k-Internal Out-Branching, and Long Directed Cycle.

Journal ArticleDOI
TL;DR: This work targets the storage infrastructure in a cloud system and introduces several energy efficient storage node allocation methods by exploiting the metadata heterogeneity of cloud users to preserve load balance on demand and switch inactive nodes into low-energy modes to save energy.

Journal ArticleDOI
TL;DR: It is proved that most neural models under consideration are strictly more powerful than Muller Turing machines.