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.
This paper presents a novel scheme for achieving attitude control of a tumbling combination system in the post-capture phase of a tethered space robot (TSR). Given the combination rotation characteristics, tether force is applied to provide greater control torques for stabilising the attitude. The proposed control scheme involves two attitude controllers, which coordinate the controller of the tether force and thruster force and the controller of single thruster force. The numerical simulations include a comparison between this coordinated control and the traditional thruster control and a sensitivity analysis on initial values of parameters. Simulation results validate the feasibility of the attitude control scheme for a tumbling combination system, and fuel consumption of the attitude control is efficiently reduced using the coordinated control strategies.
In this paper a rolling robot resembling the shape of a triangular-bipyramid is proposed. The robot has three degrees of freedom and is formed by connecting two tripod mechanisms with three spherical joints. By kinematic analysis, the robot can be viewed as a planar four-bar linkage. Further, its dynamic rolling ability is discussed by Zero Moment Point (ZMP) analysis. We show that the robot has the capability to roll, adjust its step length, and switch rolling directions. These functions are verified by a series of simulations with a CAD (computer-aided design) model and experiments with a prototype.
In this paper, we analyze the end-to-end delay performance of a tandem queueing system with mobile queues. Due to state-space explosion, there is no hope for a numerical exact analysis for the joint-queue-length distribution. For this reason, we present an analytical approximation that is based on queue-length analysis. Through extensive numerical validation, we find that the queue-length approximation exhibits excellent performance for light traffic load.
This paper reports a Spanish-American telecollaborative project through which students used Twitter, blogs and podcasts for intercultural exchange over the course of one semester. The paper outlines the methodology for the project including pedagogical objectives, task design, selection of web tools and implementation. Using qualitative and quantitative data collection, the study explored how the application of Web 2.0 facilitated cross-cultural communication. How the use of digital technology affected the way in which the students viewed intercultural learning and peer feedback was examined. The findings showed that students viewed the online exchange as a superb venue for intercultural communication with native speakers. Through social engagements, students not only gained cultural knowledge but also became more aware of their own beliefs and attitudes toward their own culture. In addition, discussions on topics of tangible and intangible cultures afforded the opportunity to raise students’ awareness of cultural norms and practices. Peer feedback helped learners increase lexical knowledge, prevent language fossilization, and acquire native-sounding discourse. The study suggests that allocating sufficient time to complete each task and making personal commitment to online contributions are essential to successful intercultural exchanges.
We present an algorithm for offsetting the workspace obstacles of a circular robot. Our method has two major steps: It finds the raw offset curve for both lines and circular arcs, and then removes the global invalid loops to find the final offset. To generate the raw offset curve and remove global invalid loops, O(n) and O((n+k)log m) computational times are needed respectively, where n is the number of vertices in the original polygon, k is the number of self-intersections and m is the number of segments in the raw offset curve, where m ≤ n. Any local invalid loops are removed before generating the raw offset curve by invoking a pair-wise intersection detection test (PIDT). In the PIDT, two intersecting entities are checked immediately after they are computed, and if the test is positive, portions of the intersecting segments are removed. Our method works for conventional polygons as well as the polygons that contain circular arcs. Our algorithm is simple and very fast, as each sub-process of the algorithm can be completed in linear time except the last one, which is nearly linear. Therefore, the overall complexity of the algorithm is nearly linear. By applying our simple and efficient approach, offsetting obstacles of any shape make it possible to construct a configuration space that ensures optimized motion planning.
Named after the French–Belgian mathematician Eugène Charles Catalan, Catalan's numbers arise in various combinatorial problems [12]. Catalan's triangle, a triangular array of numbers somewhat similar to Pascal's triangle, extends the combinatorial meaning of Catalan's numbers and generalizes them [1,5,11]. A need for a generalization of Catalan's triangle itself arose while conducting a probabilistic analysis of the Asymmetric Simple Inclusion Process (ASIP) — a model for a tandem array of queues with unlimited batch service [7–10]. In this paper, we introduce Catalan's trapezoids, a countable set of trapezoids whose first element is Catalan's triangle. An iterative scheme for the construction of these trapezoids is presented, and a closed-form formula for the calculation of their entries is derived. We further discuss the combinatorial interpretations and applications of Catalan's trapezoids.
In Section 4.3.3 of Chapter 4, we introduced the notion of modular multiplicative inverses: for a modulus m, two integers a and b are mod-m multiplicative inverses if a · b ≡ 1 (mod m). In Section 4.3.4, we demonstrated a method for finding mod-m multiplicative inverses: write down the mod-m multiplication table for all mod-m representatives, and search for ones in the table. In Section 4.3.5, we observed that, for the modulus 6, some integers don't have multiplicative inverses, even integers that are not congruent mod-6 to 0. The method we present in this chapter will explain this phenomenon.
In this chapter, we describe a good algorithm for calculating modular multiplicative inverses. The algorithm is an extension of one attributed to the classical mathematician Euclid, who supposedly lived around 300 B.C. He is known primarily for his contribution to and systematization of geometry, but his famous book Elements also addressed number theory.
The measuring puzzle
Suppose you are given two containers and told how many cups of water each one can hold. You are also given an empty basin that can hold an unlimited amount of water. What is the smallest positive number of cups you can leave in the basin by using these two containers? The rules of the puzzle allow you to fill either container with water either from the tap or the basin, and to pour the water from the container either down the drain or into the basin.
The key agreement protocol provides a way for previously unacquainted parties to agree on a secret key. However, there are times when one party wants to unilaterally send a private message to another party without first interacting with the other party. Public-key encryption, first proposed by Diffie and Hellman in the early 1970s, provides a way to accomplish this.
In traditional (one-key) cryptography, the same key is used to encrypt a message as to decrypt it. Public-key cryptography discards this convention, and allows one (public) key to be used for encryption and another (the secret key) for decryption.
The set-up for public key cryptography is as follows. Every person intending to receive encrypted messages privately chooses a secret key and calculates a corresponding public key. All the public keys are made publically available. If I want to send an encrypted message to someone, I look up her public key and use it to encrypt a message to her; only she is able to decrypt it.
The idea of having different keys for encryption and decryption seems simple, but it represented a startling break with the past. It is worth considering why the discovery was so late in coming; after all, traditional cryptography has been used for a few thousand years. Why did the idea of two different keys not arise earlier?
It should be clear from Chapter 6 that perfect secrecy is useful in encryption. However, the idea can be useful in constructing other cryptographic building blocks. In this chapter, we discuss two examples.
Secret-sharing and perfect secrecy
The idea of perfect secrecy can be used to cryptographically “split” a secret into two parts. Each part can be given to a different person. Either person on her own learns nothing about the secret by receiving her part; together the two people can reconstruct the secret.
Imagine, for example, that the bank president wants to give her two vice presidents the combination to the safe (in case the safe needs to be opened on a day the president is incommunicado), but wants them to have only joint access. She can use secret-sharing to split the combination between the two vice-presidents.
Let f (plain, key) be the encryption function for a perfectly secure cryptosystem. We will use this cryptosystem to split the secret. The choice of cryptosystem is not intended to be secret; we assume this choice is known to all. The choice of cryptosystem restricts the choice of secret to be shared; the secret must be one of the cryptosystem's possible plaintexts.
In his autobiography, A Mathematician's Apology, the number theorist and pacifist G. H. Hardy wrote
… both Gauss and lesser mathematicians may be justified in rejoicing that there is one science [number theory] at any rate … whose very remoteness from ordinary human activities should keep it gentle and clean.
Hardy's book was published in 1940, toward the end of his career. If he had postponed his judgment for another 30 years, he might have come to a different conclusion, for number theory became the basis for an important technology long associated with war: cryptography, the use of secret codes.
Cryptography has been in use for at least several thousand years. It is listed in the Kama Sutra as one of the 64 arts to be mastered by women. One well-known elementary cryptosystem is attributed to Julius Caesar. Numerous anecdotes attest to the importance of cryptography in war and diplomacy over the years – and to that of cryptanalysis, the cracking of codes. For example, Britain's interception and deciphering of the Zimmerman telegram, a message from Germany's foreign minister to the government of Mexico (via the ambassador), helped speed the United States' entry into World War I, for the message promised Texas, New Mexico, and Arizona to Mexico in return for its help against the United States.
In this study, we analyze the influence of passive joint viscous friction (PJVF) on modal space decoupling for a class of symmetric spatial parallel mechanisms (SSPM). The Jacobian matrix relating the platform movements to each passive joint velocity is first gained by vector analysis and the passive joint damping matrix is then derived by applying the Kane method. Next, an analytic formula index measuring the degree of coupling effects between the damping terms in the modal coordinates is proposed using classical modal analysis of dynamic equations in task space. Based on the index, a new optimal design method is found which establishes the kinematics parameters for minimizing the coupling degree of damping and achieves optimal fault tolerance for modal space decoupling when all struts have identical damping and stiffness coefficients in their axial directions. To illustrate the effectiveness of the theory, the new method was used to redesign two configurations of a specific manipulator.
A two-place relation is a way of pairing up members of one set with members of another set. We can use a diagram to represent a relation; there is an arrow for each pair, going from the first item in the pair to the second. Thus all the figures in this chapter, starting with Figure 4.1, represent two-place relations.
If there is an arrow x → y in the relation, we say that “x maps to y” and that “y is the image of x” under the relation. Thus in the relation depicted by Figure 4.1, the elements 1, 4, and 5 all map to 96, 1 also maps to 94, the element 2 maps to 100, and finally 3 maps to 99. Another way to say the same thing is that 96 is the image of 1 and is also the image of 4 and of 5, and so forth.
A one-input function is a special kind of two-place relation, one for which each item in the first set has exactly one outgoing arrow, that is, each such item maps to exactly one element of the second set. Thus Figure 4.2 represents a one-input function, but Figure 4.1 does not. In fact, there are two ways in which the relation depicted in Figure 4.1 fails to be a function. There are elements of the first set (namely 1) that maps to two things, and there are elements (namely 6) that map to no elements.
Skellam's name is traditionally attached to the distribution of the difference of two independent Poisson random variables. Many bivariate extensions of this distribution are possible, e.g., through copulas. In this paper, the authors focus on a probabilistic construction in which two Skellam random variables are affected by a common shock. Two different bivariate extensions of the Skellam distribution stem from this construction, depending on whether the shock follows a Poisson or a Skellam distribution. The models are nested, easy to interpret, and yield positive quadrant-dependent distributions, which share the convolution closure property of the univariate Skellam distribution. The models can also be adapted readily to account for negative dependence. Closed form expressions for Pearson's correlation between the components make it simple to estimate the para-meters via the method of moments. More complex formulas for Kendall's tau and Spearman's rho are also provided.
A crucial problem is the risk that a manipulator arm would be damaged by twisting or bending during and after contacting a target satellite. This paper presents a solution to minimize the risk of damage to the arm and thereby enhance contact performance. First, a hand-eye servo controller is proposed as a method for accurately tracking and capturing a target satellite. Next, a motion planning strategy is employed to obtain the best-fit contacting moments. Also, an impedance control law is implemented to increase protection during operation and to ensure more accurate compliance. Finally, to overcome the challenge of verifying algorithms for a space manipulator while on the ground, a novel experimental system with a 6-DOF (degree of freedom) manipulator on a chaser field robot is presented and implemented to capture a target field robot; the proposed methods are then validated using the experimental platform.