Search

Many organizations are stuck in the cloudify or not to cloudify limbo, mainly due to concerns related to the security of enterprise sensitive data. Removing this barrier is a key pre-condition to fully unleash the tremendous potential of cloud computing. In this paper, we provide a comprehensive analysis of the main threats that hamper cloud computing adoption on a wide scale, and a right to the point review of the solutions that are currently being provided by the major vendors. The paper also presents the (near) future directions of cloud security research, by taking a snapshot of the main research trends and most accredited approaches. The study is done on a best of breed selection of proprietary and Open Source cloud offerings. The paper is thus a useful navigation tool, that can be used by the IT personnel to gain more insight into the security risks related to the use of cloud computing, as well as to quickly weigh the pros and cons of state of the art solutions. [ABSTRACT FROM AUTHOR]

Modern businesses benefit significantly from advances in computer vision technology, one of the important sectors of artificially intelligent and computer science research. Advanced computer vision issues like image processing, object recognition, and biometric authentication can benefit from using deep learning methods. As smart devices and facilities advance rapidly, current networks such as 4 G and the forthcoming 5 G networks may not adapt to the rapidly increasing demand. Classification of images, object classification, and facial recognition software are some of the most difficult computer vision problems that can be solved using deep learning methods. As a new paradigm for 6Core network design and analysis, artificial intelligence (AI) has recently been used. Therefore, in this paper, the 6 G wireless network is used along with Deep Learning to solve the above challenges by introducing a new methodology named Optimizing Computer Vision with AI-enabled technology (OCV-AI). This research uses deep learning – efficiency algorithms (DL-EA) for computer vision to address the issues mentioned and improve the system's outcome. Therefore, deep learning 6 G proposed frameworks (Dl-6 G) are suggested in this paper to recognize pattern recognition and intelligent management systems and provide driven methodology planned to be provisioned automatically. For Advanced analytics wise, 6 G networks can summarize the significant areas for future research and potential solutions, including image enhancement, machine vision, and access control. [ABSTRACT FROM AUTHOR]

This survey paper attempts to study the existence, importance and impact of the notion of context in modern humanistic computing. Given its inherent diversity, the term is nowadays widely acknowledged among computer science tasks and has become a major topic of interest in several of its sub-fields, ranging from contextual semantics to social networks, social media and recently emerged innovative applications, such as travel routing. We start by presenting a brief review of contextual semantics as nowadays they are considered suitable for most common content analysis problems. Focus is also given within the next survey sections on the impact of context within the social networks and media field that came into sight over the last years. A short, closing discussion on the identified challenges and potential future research directions concludes this survey. [ABSTRACT FROM AUTHOR]

Abstract: This paper reports our experience in the deployment of the Hust_Bio_Grid platform, which is a grid sub-platform that is specifically tailored towards the needs of bioinformatics. It enables the collaboration of multiple research institutes and facilitates the sharing of resources such as hardware, database software tools, etc. In particular, this paper presents a case study that addresses the deployment and reuse of services and applications through a standardized easy to use interface. It discusses the deployment of services including the requirements, the interface and the deployment process as a whole. Selected example services are discussed and relevant performance evaluations are presented. Through this scheme, all users including domain specific experts as well as generic software developers can contribute and deploy their own applications to the grid platform in a simple and efficient way. Thus, the actual functionality of the overall platform and the usability thereof is defined through the actual consumers and their specific needs. [Copyright &y& Elsevier]

Abstract: This paper presents a testability enhancement technique suited for AND–EXOR based logic networks that facilitates easy detection of stuck-at and bridging faults by a universal test set. Both cascaded and tree implementations of the EXOR-part are considered. The AND–EXOR based circuit implemented with a cascaded EXOR-part requires a universal test set of size (2n +6) for an n-variable function implementation. For Generalized Reed–Muller (GRM) implementation, this test set detects all single stuck-at and bridging faults (both OR-type and AND-type) and also large number of multiple bridging faults. For an Exclusive-OR Sum-of-Products (ESOP) implementation, a few single bridging faults may remain untested under this test set, occurrence of which can be minimized by employing an appropriate design and layout technique. Next, it is shown that an AND–EXOR network with a tree-based EXOR-part can be tested for similar faults by a universal test set of size (2n +8). This paper also solves an open problem of designing a universal test for a tree-based AND–EXOR circuit. Since the EXOR-tree has depth of (), where s is the number of product terms in the given AND–EXOR expression, this tree-based design reduces the circuit delay significantly compared to cascaded EXOR implementation. In both the cases, the test set can be stored in a ROM on-chip for built-in self-test (BIST) purposes. For several benchmark circuits, the universal test set is found to be much smaller in size than the ATPG-generated test sets. [Copyright &y& Elsevier]

Abstract: In this paper we have addressed the problem of finding a path through a maze of a given size. The traditional ways of finding a path through a maze employ recursive algorithms in which unwanted or non-paths are eliminated in a recursive manner. Neural networks with their parallel and distributed nature of processing seem to provide a natural solution to this problem. We present a biologically inspired solution using a two level hierarchical neural network for the mapping of the maze as also the generation of the path if it exists. For a maze of size S the amount of time it takes would be a function of S (O(S)) and a shortest path (if more than one path exists) could be found in around S cycles where each cycle involves all the neurons doing their processing in a parallel manner. The solution presented in this paper finds all valid paths and a simple technique for finding the shortest path amongst them is also given. The results are very encouraging and more applications of the network setup used in this report are currently being investigated. These include synthetic modeling of biological neural mechanisms, traversal of decision trees, modeling of associative neural networks (as in relating visual and auditory stimuli of a given phenomenon) and surgical micro-robot trajectory planning and execution. [Copyright &y& Elsevier]

Orthogonal frequency division multiplexing (OFDM) has been adopted in various high-speed wireless communication systems. OFDM systems using direct-conversion transceivers are gaining much interest because of low cost and power. However, such systems can suffer from carrier frequency offset (CFO) and transmitter (TX)/receiver (RX) in-phase/quadrature-phase (I/Q) imbalances. These impairments may have a tremendous impact on the performance and cannot be efficiently eliminated in the analog domain. In this paper, we propose an efficient joint estimator for CFO and TX/RX I/Q imbalances in the digital baseband domain. The proposed method designs a training sequence at the transmitter that isolates the estimation of TX I/Q imbalance from the other parameters. At the receiver, we form a sinusoidal sequence from the received signal, which is used to jointly estimate the CFO and RX I/Q imbalance iteratively through the maximum likelihood estimation (MLE). Then we estimate the TX I/Q imbalance using the ratio of the estimated sequences just before CFO and RX I/Q imbalance with previously estimated parameters. Simulation results confirm the advantages of the proposed method over existing algorithms in terms of efficiency and estimation accuracy. [ABSTRACT FROM AUTHOR]

Abstract: The semantic web services (SWSs) discovery is the process of finding a service that can possibly satisfy the user requirements, choosing between several services, and composing services to form a single service. The matchmaking between the user request and SWSs is the main task of any SWSs discovery mechanism. In this paper, a semantic distance-based matchmaking algorithm (SDMA) is introduced. The idea behind SDMA is to use the measurement of the semantic distance between the user request and the tested service as an indicator of the degree of relevance between them. In addition to many proposals, a new concepts tree is proposed to perform the process of computing the semantic distance between two concepts. SDMA bases on many concept-to-concept semantic distance measures that are modified and adapted. A deep evaluation process is performed to validate the great impact of using semantic distance measures in the field of SWSs matchmaking. [Copyright &y& Elsevier]

Abstract: Churn is a basic and inherent problem in P2P networks. A lot of relevant studies have been carried out, but all lack versatility. In this paper, a general solution is proposed which makes a peer-to-peer (P2P) network need not pay much attention to churn problem by introducing a logic layer named Dechurn, and most of churn could be eliminated in the Dechurn layer. For utilizing the complementary nature of node joining and leaving, a network scheme, named Constellation, for handling churn is designed on the Dechurn layer through which the resources cached in a node for its spouse node who has left network would be succeeded by a node in latent period. The simulation results indicate that the proposed solution is effective and efficient in handling churn and easy to put into practice. [Copyright &y& Elsevier]

Abstract: Non-malleability is an important property in commitment schemes, which can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability of ID-based trapdoor commitment. We first point out some weakness of the definition for Fischlin’s ID-based trapdoor commitments, which we call the partial ID-based trapdoor commitments. Moreover, we present the formal definition for the full ID-based trapdoor commitment and give a concrete construction based on the computational Diffie–Hellman (CDH) assumption. Finally, we use the idea of multi-trapdoor commitments and the technique of non-malleability to propose two efficient interactive full ID-based non-malleable trapdoor commitments in discrete logarithm (DL) system, with/without random oracle respectively. [Copyright &y& Elsevier]

Abstract: Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In 2009, Yu et al. proposed an identity-based signcryption scheme in the standard model. In 2010, Jin et al. pointed out that Yu et al.’s scheme cannot achieve the semantic security and proposed an improved identity-based signcryption scheme. They proved that the improved scheme is semantically secure in the standard model. Recently, Li et al. showed that the Jin-et al.’s scheme cannot achieve the semantic security and existential unforgeability. To remedy the weaknesses of the Jin-et al.’s scheme, we give a further improvement in this paper. Our scheme satisfies semantic security and existential unforgeability. [Copyright &y& Elsevier]

Abstract: Fault-tolerant scheduling is an important issue for computational grid systems, as grids typically consist of strongly varying and geographically distributed resources. The main scheduling strategy of most fault-tolerant scheduling systems depends on the response time and fault index when selecting a resource to execute a certain job. In this paper, a scheduling system is presented that depends on a new factor called scheduling indicator in selecting resources. This factor comprises of the response time and the failure rate of grid resources. Whenever a grid scheduler has jobs to schedule on grid resources, it uses the scheduling indicator to generate the scheduling decisions. The main scheduling strategy of the system is to select resources that have the lowest tendency to fail. Extensive simulation experiments are conducted to quantify the performance of the proposed system. Experiments have shown that the proposed system can considerably improve grid performance in terms of throughput, unavailability, turnaround time, and fail tendency. [Copyright &y& Elsevier]

Abstract: This paper proposes a probability formulation that unifies both single-image deblurring and multi-image denoising using variational inference. The proposed formulation is based on a theoretical analysis that compares denoising and deblurring in the same probabilistic framework, and supported by a practical approach that deal with general motion that creates HDR images in the presence of spatially varying motion. Based on this formulation, a new algorithm for deblurring a noisy and blurry image pair is presented. Besides, we provide also an approach that combines existing optical flow and image denoising techniques for High Dynamic Range imaging. [Copyright &y& Elsevier]

Abstract: A new construction adder based on Chinese abacus algorithm is presented in this paper. There are two kinds of beads used in this construction. Each column element has three higher beads with a weight of four and three lower beads with a weight of one. The proposed 32-bit adder contains eight column elements. The construction was simulated by the technology of TSMC 0.18μm CMOS process. Layout was also made by the same technology. The maximum delay of the 32-bit abacus adder is 0.91ns and 14% less than that of Carry Look-ahead Adders for 0.18μm technology. The power consumption of the abacus adder is 3.1mW and 28% less than that of Carry Look-ahead Adders for 0.18μm technology. Recent researches are compared with the proposed adder. The construction was also simulated by Predictive Technology Model. The PTM results also presented. The use of Chinese abacus approach offers a competitive technique with respect to other adders. [Copyright &y& Elsevier]

Abstract: To deal with the file pollution problem in structured P2P networks, this paper proposes an anti-pollution strategy based on the immune approach and the file propagation-chain tracing technique. With the characteristics of the structured P2P networks, we establish a biological immune model and a file propagation tracing mechanism, based on which the mechanisms for alarms collection, propagation-chain tracing, immune response and antibody memorizing are designed. The proposed immune strategy can not only eliminate the polluted clusters and indices effectively but also prevent the reviving of the old pollution. In addition, the node permission is employed to control the ability to request files. The experimental results show that our strategy can curb the propagationsof the polluted files effectively and efficiently even in the severely polluted structured P2P networks. [Copyright &y& Elsevier]

Abstract: Secret handshake scheme, as a relatively new cryptographic application, allows the members of a certain organization to secretly authenticate each other. In this paper, we present a new generic framework for transforming any ID-based message recovery signature to a secret handshake scheme, whose provability can be determined by the security of underlying signature. Based on our new generic framework, two concrete secret handshake schemes are elaborated, which originate from two different ID-based message recovery signatures and are provably secure against the chosen-message attack in the random oracle model. [Copyright &y& Elsevier]

Abstract: A hardware-based performance comparison of lightweight block ciphers is conducted in this paper. The DESL, DESXL, CURUPIRA-1, CURUPIRA-2, HIGHT, PUFFIN, PRESENT and XTEA block ciphers have been employed in this comparison. Our objective is to survey what ciphers are suitable for security in Radio Frequency Identification (RFID) and other security applications with demanding area restrictions. A general architecture option has been followed for the implementation of all ciphers. Specifically, a loop architecture has been used, where one basic round is used iteratively. The basic performance metrics are the area, power consumption and hardware resource cost associated with the implementation resulting throughput of each cipher. The most compact cipher is the 80-bit PRESENT block cipher with a count of 1704GEs and 206.4Kbps, while the largest in area cipher is the CURUPIRA-1. The CURUPIRA-1 cipher consumes the highest power of 118.1μW, while the PRESENT cipher consumes the lowest power of 20μW. All measurements have been taken at a 100kHz clock frequency. [Copyright &y& Elsevier]

Abstract: We consider the problem of artifacts in electroencephalography (EEG) data. In a practical motor imagery based brain–computer interface (BCI) system, EEG signals are usually contaminated by misleading trials caused by artifacts, measurement inaccuracies, or improper imagination of a movement. As a result, the performance of a BCI system can be degraded. In this paper, we introduce a novel algorithm combining Gaussian mixture model (GMM) and genetic algorithm (GA) to detect the abnormal EEG samples. In addition, this algorithm can be also integrated with other data-driven feature exaction method (e.g., common spatial pattern (CSP)) so that a more reliable analysis can be obtained by pruning the potential outliers and noisy samples, and consequently the performance of a BCI system can be improved. Experimental results demonstrate significant improvement in comparison with the conventional mixture model. [Copyright &y& Elsevier]

Abstract: This paper presents an approach for acquiring digitized ECG samples in a personal computer using an offline communication technique. For this, two standalone embedded modules are placed at the two ends of the communication link. The transmit end module collects ECG samples from the source and stores them in a RAM. Finally it converts each data byte into a bi-phase encoded bit stream for transmission using a standard telephone set through post office telephone line. The receive-end module, coupled with the telephone receiver decodes the ECG data, and then delivers them to a desktop computer through the serial port. An application software in the computer is used to store these samples for visual inspection. The detailed architecture and test results are discussed with synthetic ECG data available from PTB diagnostic ECG database (ptb-db) under Physionet. [Copyright &y& Elsevier]

Abstract: Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the key exposure problem of chameleon hashing. This creates a strong disincentive for the recipient to compute hash collisions, partially undermining the concept of non-transferability. Recently, some constructions of discrete logarithm based chameleon hashing and signatures without key exposure are presented, while in the setting of gap Diffie–Hellman groups with pairings. In this paper, we propose the first key-exposure free chameleon hash and signature scheme based on discrete logarithm systems, without using the gap Diffie–Hellman groups. This provides more flexible constructions of efficient key-exposure free chameleon hash and signature schemes. Moreover, one distinguishing advantage of the resulting chameleon signature scheme is that the property of “message hiding” or “message recovery” can be achieved freely by the signer, i.e., the signer can efficiently prove which message was the original one if he desires. [Copyright &y& Elsevier]

Abstract: In 2010, Vo et al. (2010) proposed an enhancement of authenticated multiple key exchange protocol based on Lee et al.’s protocol. In this paper, we will show that Vo et al.’s multiple key exchange protocol cannot resist reflection attack. It means that their protocol fails to provide mutual authentication. Furthermore, we propose an improvement of Vo et al.’s protocol. Our proposed protocol with reflection attack resilience can really provide mutual authentication. [Copyright &y& Elsevier]

Abstract: Optical interconnections attract many engineers and scientists’ attention due to their potential for gigahertz transfer rates and concurrent access to the bus in a pipelined fashion. These unique characteristics of optical interconnections give us the opportunity to reconsider traditional algorithms designed for ideal parallel computing models, such as PRAMs. Since the PRAM model is far from practice, not all algorithms designed on this model can be implemented on a realistic parallel computing system. From this point of view, we study Cole’s pipelined merge sort [Cole R. Parallel merge sort. SIAM J Comput 1988;14:770–85] on the CREW PRAM and extend it in an innovative way to an optical interconnection model, the LARPBS (Linear Array with Reconfigurable Pipelined Bus System) model [Pan Y, Li K. Linear array with a reconfigurable pipelined bus system—concepts and applications. J Inform Sci 1998;106;237–58]. Although Cole’s algorithm is optimal, communication details have not been provided due to the fact that it is designed for a PRAM. We close this gap in our sorting algorithm on the LARPBS model and obtain an O(log N)-time optimal sorting algorithm using O(N) processors. This is a substantial improvement over the previous best sorting algorithm on the LARPBS model that runs in O(log N loglog N) worst-case time using N processors [Datta A, Soundaralakshmi S, Owens R. Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans Parallel Distribut Syst 2002;13(3):212–22]. Our solution allows efficiently assign and reuse processors. We also discover two new properties of Cole’s sorting algorithm that are presented as lemmas in this paper. [Copyright &y& Elsevier]

Abstract: Generalized honeycomb torus (GHT) is recognized as an attractive alternative to existing torus interconnection networks in parallel computing systems. Assume that m and d are integers with m ⩾2 and d ⩾8. This paper addresses the fault-tolerant hamiltonicity of GHT(m, 2d, d) with fault set F ={(w, y), (x, y)}, where w < x, w + y is even and x + y is odd. We show that such a faulty GHT is hamiltonian by presenting a systematic method for constructing a fault-free hamiltonian cycle. This result reveals another appealing feature of GHTs. [Copyright &y& Elsevier]

Abstract: Thresholding method based on transition region is a newly developed approach for image segmentation in recent years. In this paper, a novel transition region extraction and thresholding method based on gray level difference is proposed by analyzing properties of transition region. The gray level difference can effectively represent the essence of transition region. Hence, the proposed algorithm can accurately extract transition region of an image and get ideal segmentation result. The proposed algorithm was compared with two classic transition region-based methods on a variety of synthetic and real world images, and the experimental results show the effectiveness and efficiency of the algorithm. [Copyright &y& Elsevier]

Abstract: The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every two vertices which are in distinct partite sets. A bipartite graph G is strongly Hamiltonian laceable if it is Hamiltonian laceable and there exists a path of length N − 2 joining each pair of vertices in the same partite set, where N =|V(G)|. We prove that the k-ary n-cube is strongly Hamiltonian laceable for k is even and n ⩾2. [Copyright &y& Elsevier]

Abstract: Current adaptive transmission schemes all assume independent block fading. However, in slow fading channels, it is highly possible for consecutive block transmissions to be correlated. In this paper, we propose a cross-layer adaptive transmission scheme, which is an optimum combination of modulation format and packet size, combined with selective repeat automatic repeat request (SR-ARQ) to improve the throughput in correlated slow fading channels. We apply a multi-state Markov system model to analyze the system performance and to optimize the selection of modulation levels at the physical layer and packet sizes at the data link layer in a correlated slow fading channel, which is also described by a finite-state Markov chain. A general closed-form expression of the average throughput for this cross-layer adaptive transmission scheme is presented. Simulation results show that our adaptive transmission scheme combined with SR-ARQ can obtain a good performance in correlated slow fading channels. [Copyright &y& Elsevier]