To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Several different algebraic systems will often share common structural properties. Accordingly, it is efficient and productive to gather together all algebraic systems with a similar structure, and to study them collectively as a single category. Any properties that follow directly from the common structure will hold for all algebraic systems with that same structure, and these properties can be developed and studied for a given category, and then applied to all algebraic systems in that same category.
The three most important algebraic categories are the category of groups, the category of rings, and the category of fields. We will discuss each of these in turn. Each of these algebraic categories plays a different but powerful role in the development of the subject of cryptography.
The most familiar example of a group is the set of integers Z under the usual operation of addition. The set of integers is a group with an infinite number of elements. An example of a group with a finite number of elements is the group of nonnegative integers smaller than n with addition modulo n, and denoted Zn.
The most familiar example of a ring is again the set of integers Z, but now with two operations. These are the two usual operations of addition and multiplication of integers. Many other rings are also important. Much of the mathematical structure of the ring of integers is mimicked by a similar mathematical structure within the ring of univariate polynomials over a field F.
Many cryptographic systems use exponentiation in an appropriate finite group as the critical part of the method of encryption. The security of any such system depends on the mathematical intractability of the computational problem of inverting the operation of exponentiation in that group, a problem known as the discrete-log problem. The difficulty or intractability of the discrete-log problem may – and will – depend on the specfic group. The discrete-log problem is dificult in some groups and is easy in other groups. The belief in the intractability of this computational problem in many groups is based on anecdotal evidence rather than on mathematical proof. This means that a public-key cryptosystem based on exponentiation always entails the risk that the underlying inverse computational problem is actually easy. Indeed, that computational problem may already have been solved by a secluded and secretive cryptanalyst.
Diffie-Hellman key exchange
The Diffie–Hellman key exchange (or, more descriptively, the Diffie–Hellman key agreement or key creation) is a method by which two parties with no prior communication establish a secret key by messages sent over a clear public two-way channel. No key is actually exchanged despite the terminology. More correctly, a key is created by both parties working together. The two parties, between them, establish a common secret key even though all of their communication takes place on a public channel. It is believed that no eavesdropper is able to determine the secret key even though the eavesdropper has access to all communications.
Information and the communication of that information comprise the nerve system of civilization, and civilization depends on the availability of reliable methods for the protection of information from intruders and adversaries. There are many ways the collection and communication of information needs to be protected and made trustworthy. The requirements are central to the orderly functioning of society and may include secrecy, integrity, nonrepudiation, authentication, covertness, copy resistance, certification, authorization, and ownership protection. These various topics can be regarded as more or less distinct requirements, although of course there are considerable overlaps. Together they form the topic of secure communications. At the center of these various topics, as well as at the heart of this book, is the classical topic of cryptography.
Communication and cryptography are closely related topics in the general field of telecommunication. Communication is the process of exchanging data and messages. By itself, the term communication carries an active, positive tone and suggests cooperation and openness. Yet the process of communication does have its competitive, defensive side. The nature of social and economic interaction can impose a great variety of subtle requirements on the structure of a communication system to ensure various forms of security, privacy, and trustworthiness.
Secrecy and authentication are complementary functions in a communication system. Secrecy is the function that ensures that a message cannot be understood by an eavesdropper. Authentication is the function that ensures that the message originated with the indicated source of that message.
A block cipher is a symmetric-key cipher that breaks a plaintext message into segments of fixed length. Each segment, called a plaintext block, consists of a fixed number of plaintext symbols. Using a secret key k known to both encryptor and decryptor, each plaintext block is encrypted independently into a ciphertext block of blocklength n. In many common block ciphers, but not all, the length n of the ciphertext block is equal to the length of the plaintext block. The ciphertext blocks are concatenated to form the ciphertext message, which is then sent to the decryptor. The decryptor receives the ciphertext message, then breaks it into the sequence of ciphertext blocks of length n and, using a corresponding key k, decrypts each ciphertext block of length n independently into the corresponding plaintext block. The plaintext blocks leaving the decryptor are concatenated to reform the plaintext message, which is then sent to the user.
The encryption function and the key k can remain the same from block to block, but the encryption of the lth block does not depend on the data within other blocks. Each block is encrypted independently. A symmetric-key block cipher requires that, for the same block, the encryptor and the decryptor use the same key. This means that a secure method of distributing this key to both the encryptor and decryptor, or of exchanging this key between them, is required. Any method of key distribution, including public-key cryptography, can be used.
Despite the hundreds of Mobile-Assisted Language Learning (MALL) publications over the past twenty years, statistically reliable measures of learning outcomes are few and far between. In part, this is due to the fact that well over half of all MALL-related studies report no objectively quantifiable learning outcomes, either because they did not involve MALL implementation projects, or if they did, learning gains were only based on subjective teacher assessments and/or student self-evaluations. Even more so, the paucity of statistically reliable learning outcome data stems from the short duration of projects and small numbers of students involved. Of the 291 distinct studies examined in this review only 35 meet minimal conditions of duration and sample size, i.e., ten experimental subjects over a period of at least a month. Sixteen of these suffer from serious design shortcomings, leaving only nineteen MALL studies that can reliably serve as a basis for determining the learning outcomes of mobile-based language applications. Of these studies, fifteen can be considered to report unequivocal positive results, with those focusing on reading, listening and speaking without exception evidencing a MALL application advantage. Four studies, all focusing on vocabulary, reported no significant differences.
As a fatigable part of industrial products, cable is a valuable research topic to predict the product lifetime. Since the cable fatigue is related to the bending radius in motion, this paper presents a cable motion capture and bending radius calculation method based on optical tracking system. In particular, a marker sorting algorithm is developed for further spline interpolation in cable motion tracking. The cable bending radius calculation precision is analysed as well. The Results show that the proposed method can successfully track cable motion with an acceptable error for cable lifetime prediction.
In this paper, a novel control scheme is proposed to guarantee position and force tracking in nonlinear teleoperation systems subject to varying communication delays. Stability and tracking performance of the teleoperation system are proved using a proposed Lyapunov–Krasovskii functional. To show its effectiveness, the teleoperation controller is simulated on a pair of planar 2-DOF (degree of freedom) robots and experimented on a pair of 3-DOF PHANToM Premium 1.5A robots connected via a communication channel with time-varying delays. Both the planar robots in simulations and the PHANToM robots in experiments possess nonlinear dynamics.
Teleoperated grasping requires the abilities to follow the intended trajectory from the user and autonomously search for a suitable pre-grasp pose relative to the object of interest. Challenges include dealing with uncertainty due to the noise of the teleoperator, human elements and calibration errors in the sensors. To address these challenges, an effective and robust algorithm is introduced to assist grasping during teleoperation. Although without premature object contact or regrasping strategies, the algorithm enables the robot to perform online adjustments to reach a pre-grasp pose before final grasping. We use three infrared (IR) sensors that are mounted on the robot hand, and design an algorithm that controls the robot hand to grasp objects using the information from the sensors' readings and the interface component. Finally, a series of experiments demonstrate that the system is robust when grasping a wide range of objects and tracking slow-moving mobile objects. Empirical data from a five-subject user study allows us to tune the relative contributions from the IR sensors and the interface component so as to achieve a balance of grasp assistance and teleoperation.
As Web Services and the Semantic Web become more important, enabling technologies such as Web service ontologies will grow larger. At the same time, use of mobile devices to access Web services has doubled in the last year. The ability of these resource-constrained devices to download and reason across ontologies to support service discovery are severely limited. Since concrete agents typically only needs a subset of what is described in a Web service ontology to complete their task, a reduced ontology can be created. Measuring the quality of a reduced ontology, in both knowledge content and performance, is a nontrivial task. Expert analysis of the ontologies is time-consuming and unreliable. We propose two measures of knowledge content and performance. Mean average recall (MAR) with respect to the original ontology compares the data returned from a series of queries related to a particular concept of interest. Mean average performance (MAP) compares the download and reasoning speedup of the reduced ontology with respect to the original ontology. Neither of these values can be computed easily, therefore we propose a set of ontology metrics to predict these values. In this paper, we develop two prediction models for MAR and MAP based on these metrics. These models are based on analysis of 23 ontologies from five domains. To compute MAR, a specific set of queries for each domain was applied to each candidate reduced ontology along with the original ontology. To compute MAP, a simulated mobile device will download and process of each ontology along with the original ontology. We believe this model allows a speedy selection of a reduced ontology that contains the knowledge content and performance speedup needed by a mobile device for service discovery.
Optimal path planning of a closed loop cable robot, between two predefined points in presence of obstacles is the goal of this paper. This target is met by proposing a new method of optimal regulation for non linear systems while Dynamic Load Carrying Capacity (DLCC) of the robot is supposed as the related cost function. Feedback linearization is used to linearize the system while Linear Quadratic Regulator (LQR) is employed to optimize the DLCC of the system based on torque and error constraints. Obstacle avoidance for both the end-effector and cables is also considered by the aid of designing an adaptive local obstacle avoidance controller. As a result of linearized nature of the proposed optimal regulation and obstacle avoidance, fast calculation for real time applications is possible. Therefore, formulation of the optimal feedback linearization, together with calculating the DLCC of the robot based on the presented constraints is derived. Finally, a simulation study is performed to study the optimal dynamics and also the maximum DLCC of the cable robot in presence of obstacles. Simulation results are eventually compared with experimental tests conducted on IUST Cable Suspended Robot (ICaSbot) to verify the validity and efficiency of the proposed optimal controllers.
There is an increasing trend in moving desktop applications to web browsers, even when the web server is running on the same desktop machine. In this paper, we go further in this direction and show how to combine a web server, a web application framework (enhanced to support desktop-like Model–View–Controller interaction) and a context-aware architecture to develop web-based mobile context-aware applications. By using this approach we take advantage of the well-established web paradigm to design the graphical user interfaces (GUIs) and the inherent ability of the web to mash up applications with external components (such as Google Maps). On top of that, since the web server runs on the device itself, the application can access local resources (such as disk space or sensing devices, which are indispensable for context-aware systems) avoiding the sandbox model of the web browsers. To illustrate our approach we show how a mobile hypermedia system has been built on top of our platform.
Pipeline grids of various size and material are pervasive in today's modern society. The frequent inspection and maintenance of such pipeline grids have presented a tremendous challenge. It is advocated that only advanced robot design embedded with intelligent electronics and control algorithms could perform the job. Given the ever increasing demands for intelligent in-pipe robots, various in-pipe drive mechanisms have been reported. One of the simplest is helical wheel drives that have only one degree of freedom. All previously reported in-pipe helical drives are based on independent passive wheels that are tilted an angle. One of the major problems of current helical wheel drives is their unstable traction force. In this paper, instead of allowing the wheels to rotate independently, they are synchronized by adding a timing belt. This small change will result in significant improvement which will be highlighted in this paper. In the proposed driving method, tracking force is analyzed together with a comprehensive set of traction force measurement experiments. Both analysis and experiments have shown that the proposed mechanism has great potential for in-pipe robot drive design.
The Web search has special characteristics against the desktop search when realized from mobile devices. To establish an improvement within this paradigm, an option is to take into account the context from which the search is developed. To conceptualize the mobile context, we propose the use of ontologies, which will include the device characteristics, environmental conditions and user preferences, among other term conceptualizations. This context definition would be used to determinate the behavior of a word recommendation when searching from mobile devices. As an essential process of creating this context ontology, we have made a real user's evaluation of the ontology terms by means of a survey. This paper shows a brief introduction to the project and focuses mainly on the results obtained in this concept's evaluation.
Traditional Route Search aims at finding the path that goes through geographical entities that are relevant to the provided search terms from the start point to the end point. Without constraints, traditional Route Search visiting multiple locations is unreliable because locations may close after a specified time. In this paper, time constraint (operating hours of each location) is drawn into Route Search query in order to make the query more realistic. Two methods are proposed in this paper, namely Route Search for fixed locations (RFix) and Route Search for flexible locations (RFlex). These two queries are different from the existing Route Search query because (1) the end point is not pre-defined and (2) time constraint is involved. Our two proposal queries consider whether the locations are specifically pre-defined by the user or only the location types are specified. In each method, two propositions are presented for pruning expansion branches, which highly improves the performance. Our experiments verified the applicability of RFix and RFlex to solve Route Search queries with time constraint queries.
Information services facilitate users to exploit applications over the network and access them from the remote system at the client side. In this paper, we describe the design and development of information services for novelty mining, which allows users to access the novel yet relevant information of a given topic. Several methodologies regarding novelty mining such as novelty scoring, novelty threshold, novelty feedback, and document-to-sentence technique are described. In addition to Web services, mobile information services are also described. Modelling and implementing information services for novelty mining are especially useful for users to reduce their information overload. We describe the challenging issue of decomposing the complex novelty mining application into several smaller and simpler modules, which are later implemented as services on the Web as well as mobile devices. After deploying our information services for novelty mining, test cases are provided to demonstrate the system. Our information services for novelty mining are confirmed to be helpful in increasing the efficiency of enterprise users in gathering novel information from incoming text. By studying the design and development of information services for novelty mining, we can benefit other developers in investigating effective techniques for developing enterprise services for other real-world applications.
This paper discusses a goal-based approach for the engineering of capacity-driven Web services. In this approach, goals are established to first, define the roles that these Web services will play in implementing business applications, second, frame the requirements that will be put on these Web services, and third, identify the processes in terms of business logics that these Web services will carry out. Because of the nature of capacity-driven Web services compared with regular (i.e. mono-capacity) Web services, their engineering in terms of design, development, and deployment takes place in a different way. A Web service that is empowered with several capacities, which are basically separate groups of operations to execute, has to choose one capacity for triggering at run-time. To this end, the Web service takes into account different types of requirements like data and privacy that are put on each capacity that empowers this Web service.
Lack of sufficient semantic description in the content of Web services makes it difficult to find and compose suitable Web services during analysis, search, and matching processes. Semantic Web Services are Web services that have been enhanced with formal semantic description, which provides well-defined meaning. Due to insertion of semantics, meeting user demands will be made possible through logical deductions achieving resolutions automatically. We have developed an inference-based semantic business process composition agent (SCA) that employs inference techniques. The semantic composition agent system is responsible for the synthesis of new services from existing ones in a semi-automatic fashion. SCA System composes available Web Ontology Language for Web services atomic processes utilizing Revised Armstrong's Axioms (RAAs) in inferring functional dependencies. RAAs are embedded in the knowledge base ontologies of SCA System. Experiments show that the proposed SCA System produces process sequences as a composition plan that satisfies user's requirement for a complex task. The novelty of the SCA System is that for the first time Armstrong's Axioms are revised and used for semantic-based planning and inferencing of Web services.
The increasing importance of computational models for the design of complex mechanical systems raises a discussion on defining some criteria for the selection of adequate modelling methods. This paper aims to contribute to such discussion from an educational point of view. By choosing the Delta parallel mechanism as a typical representative of multi-body mechanical systems, four approaches – one based on the Principle of Virtual Work, two based on Lagrange's formalism, and one based on Kane's formalism – are analysed from the perspective of modelling procedures. Finally, inverse dynamic simulations are carried out along with qualitative comparisons of the considered approaches.