This paper presents a new programming approach based on a proposed hardware and control architecture for the reconfigurable manufacturing tool machine. A new CAM is described based on virtual machining algorithm that optimizes feedrate scheduling based on geometric simulation and aims to improve the efficiency of cutting process developed using a reconfigurable machine, configured as lathe with...

Current peer-to-peer (P2P) file sharing methods in mobile ad hoc networks (MANETs) can be classified into three groups: floodingbased, advertisement-based, and social contact-based. The first two groups of methods can easily have high overhead and low scalability. They are mainly developed for connected MANETs, in which end-to-end connectivity among nodes is ensured. The third group of methods ...

On-line keyword searching from documents in Chinese tends to use inverted indexing as the main technique, which has its difficulties. Suffix Array is widely used for processing text in Western languages. However, it fails to get widely used in Chinese processing because of the speciality of Chinese. Suffix Array is a powerful tool. However it costs too much space. That is the major bottleneck o...

Random walks represent fundamental search strategies for both animal and robots, especially when there are no environmental cues that can drive motion, or when the cognitive abilities of the searching agent do not support complex localisation and mapping behaviours. In swarm robotics, random walks are basic building blocks for the individual behaviour and support the emergent collective pattern...

In this paper, we propose a searching service optimized for highly dynamic mobile ad-hoc networks based on a flooding approach. MANETs unreliability and routing costs prevent the use of central servers or global infra-structured services on top of a priori defined virtual overlay networks. A flooding approach over a virtual overlay network created on-demand performs better. Flooding is supporte...

In this paper we tackle the practical challenges of searching encrypted multimodal data (i.e. data containing multiple media formats), stored in public cloud servers, with minimal information leakage. To this end we propose MuSE, a Multimodal Searchable Encryption scheme that, by combining only standard cryptographic primitives and symmetric-key block ciphers, allows cloud-backed applications t...

In this paper, we focus on similarity searching for similar acoustic data over unstructured decentralised P2P networks. Similarity is measured in terms of time warping, which can cope with distortion that is naturally present when ‘query by content’ is performed. We propose a novel framework, which takes advantage of the absence of overhead in unstructured P2P networks and minimises the require...

In this paper, we focus on similarity searching for similar acoustic data over unstructured decentralised P2P networks. Similarity is measured in terms of time warping, which can cope with distortion that is naturally present when query-by-content is performed. We propose a novel framework, which takes advantage of the absence of overhead in unstructured P2P networks and minimises the required ...

The purpose of this paper is to study a stochastic model which assesses the effect of mutual interference on the searching efficiency in populations of insect parasites. By looking carefully at the assumptions which govern the model, I shall explain why the searching efficiency is of the same order as the total number, N, in the population, a conclusion which is consistent with the predictions ...

This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searc...