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

TL;DR: An efficient decentralized public key infrastructure (PKI) using the concepts of Bayesian Coalition Game (BCG) and Learning Automata (LA) and the results obtained prove the superiority of the proposed scheme.

TL;DR: This paper proposes an incremental algorithm based on singular value decomposition (SVD) with good scalability, which combines the Incremental SVD algorithm with the Approximating the Singular Value Decomposition (ApproSVD).

TL;DR: A new technique for Privacy Preserving Collaborative Filtering (PPCF) based on microaggregation is proposed, which provides accurate recommendations estimated from perturbed data whilst guaranteeing user k -anonymity.

TL;DR: The results emphasize the significance of factorizations that provide from-below approximations of the input matrix that help measure the possibly different significance of different matrix entries and suggest where to focus when computing factors.

TL;DR: This work proposes an ARM-compliant IoT security framework and its application on smart buildings scenarios, integrating contextual data as fundamental component in order to drive the building management and security behavior of indoor services accordingly.

TL;DR: This paper constructs here two new bounded occurrence CSP reductions which improve these bounds to 123/122 and 75/74, respectively, the first improvement in more than a decade for the case of the asymmetric TSP.

TL;DR: An innovative software development that utilises Quality of Service (QoS) and parallel technologies in Cisco Catalyst Switches to increase the analytical performance of a Network Intrusion Detection and Protection System (NIDPS) when deployed in high-speed networks is outlined.

TL;DR: An automatic malware detection system is developed by training an SVM classifier based on behavioural signatures and the experimental results reveal that the classification error decreases as the sizing of testing data is increased.

TL;DR: Experiments show that the proposed HUIT recommendation approach significantly outperforms state-of-the-art recommendation algorithms in terms of recommendation accuracy and coverage, as well as significantly alleviating data sparsity, cold-start user andcold-start item problems.

TL;DR: It is shown that fallback voting, an election system proposed by Brams and Sanver to combine Bucklin with approval voting, displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem.

TL;DR: Two kinds of index for keyword search were proposed, where keyword privacy and content privacy are protected in the constructions, where the integrity of the uploaded files could be verified by the users after downloading and decryption without any other traditional integrity auditing mechanisms.

TL;DR: The proposed approach includes a strategy to circumvent issues related to unbalanced dataset, and uses Information Gain and Mutual Information as a feature selection strategy and Support Vector Machine (SVM) for classification.

TL;DR: An analytic energy model for secure communication among multi-mode terminals is introduced, which describes the energy consumption of mobile terminals operating within a dynamic network scenario, considering both their interconnection and secure data exchange issues, in order to develop adaptive strategies for energy-efficient secure communications.

TL;DR: This paper develops a systematic study in which the two different views on trace semantics are equivalent, in the examples where both approaches are applicable.

TL;DR: The experimental results indicate that DMTRH improves the scheduling quality of others and is suitable for dynamic real-time scheduling, and made a trade-off between scheduling revenue, stability and energy conservation.

TL;DR: It is shown that there exists an FPTRAS for p-#Induced Subgraph With Property(\Phi) whenever \Phi is monotone and all the minimal graphs satisfying\Phi have bounded treewidth, and this is applied to a counting version of the Graph Motif problem.

TL;DR: The implementation and evaluation of Tabu Search (TS) for the problem of mesh router node placement in WMNs is presented and the efficiency of TS in solving a benchmark of instances is shown.

TL;DR: A new state transition matrix is found for an NFSR, which can be simply computed from the truth table of its feedback function, and is easier to compute and is more explicit than existing results.

TL;DR: This work first study the offline problem and shows that optimal schedules can be computed efficiently in polynomial time, given any convex non-decreasing power function, and extends two algorithms Optimal Available and Average Rate proposed by Yao et al. for the online problem.

TL;DR: A framework for coordinating a changing collection of heterogeneous robots in complex and dynamic environments such as disaster zones is described, which allows a team to reshape to compensate for lost or failed robots, including adding newly-encountered robots or additions from other teams.

TL;DR: Regular expressions with memory (REM), which extend standard regular expressions with limited memory and show that they capture the class of data words defined by register automata, are defined and the following strict hierarchy of expressive power is established: REM is strictly stronger than REWB, and in turn REWB is strictly weaker than REWE.

TL;DR: The Pancake Flipping problem, in its original (unburnt) variant, is NP-hard, thus answering the long-standing question of its computational complexity.

TL;DR: A fault-tolerant and practically stabilizing simulation of an atomic register is presented, which works in asynchronous message-passing systems, and allows a minority of processes to crash.

TL;DR: This work establishes that the language MIX is a mildly context sensitive language and the language O 2 is the group language of a simple presentation of Z 2, and exhibits the first, to the authors' knowledge, non-virtually-free group language that is captured by the IO and OI hierarchies.

TL;DR: It is shown that suffix selection preserves normality, and normality is preserved by suffix selection by finite automata, by complementing Agafonov's theorem for prefix selection, and there are simple two-sided selection rules that do not.

TL;DR: This paper has shown that fallback and Bucklin voting are resistant (in terms of NP-hardness) to almost all of the common types of control, and for the first time tackle NP- hard control problems in an experimental setting.

TL;DR: This research attempts to answer key questions in regards to taking business intelligence to the Cloud, including how will BI be implemented on Cloud and how will the traffic and demand profile look like?

TL;DR: This framework is based on generalizing Wong sequences, a classical method to deal with pairs of matrices to pairs of matrix spaces, to solve the constructive SMR when B is spanned by unknown rank one matrices, answering an open question of Gurvits.

TL;DR: An intelligent agent based system to optimize energy consumption of HVAC system in HEI buildings is presented and the experimental results have shown that the deployment of the system has resulted in 3% reduction in energy consumption.

TL;DR: It is proved that for any relation lifting L that is a lax extension extending the coalgebra functor T and preserving diagonal relations, L-bisimilarity captures behavioral equivalence.