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.
With NLP services now widely available via cloud APIs, tasks like named entity recognition and sentiment analysis are virtually commodities. We look at what's on offer, and make some suggestions for how to get rich.
Ontologising is the task of associating terms, in text, with an ontological representation of their meaning, in an ontology. In this article, we revisit algorithms that have previously been used to ontologise the arguments of semantic relations in a relationless thesaurus, resulting in a wordnet. For increased flexibility, the algorithms do not use the extraction context when selecting the most adequate synsets for each term argument. Instead, they exploit a term-based lexical network which can be established by knowledge extracted automatically, or obtained from the resource the relations are being ontologised to. On the latter idea, we made several experiments to conclude that the algorithms can be used both for wordnet creation and for their enrichment. Besides describing the algorithms with some detail, the aforementioned experiments, which target both English and Portuguese, and their results are reported and discussed.
An underactuated mechanism is presented as a new finger design for improving grasp adaptability of LARM Hand fingers. Underactuation is discussed as a feasible solution through several design structures for finger adaptability to shape and size of objects to be grasped. The proposed underactuated solution for a new LARM finger is characterized through simulation results in ADAMS environment for operation feasibility and performance.
Large rotational angles about two axes for parallel mechanisms (PMs) with two rotational and three translational (2R3T) degrees of freedom (DOFs) or two rotational and two translational (2R2T) DOFs are demanded in some industries, such as parallel machine tools and multi-axis 3D printing. To address the problem, this paper focuses on the structural synthesis of new 2R3T and 2R2T PMs with high rotational capability. First, two new moving platforms are proposed based on the concepts of decoupled and configurable design. By means of the proposed platforms and Lie group theory, a series of 2R2T and 2R3T PMs are synthesized. Then the inverse kinematics and velocity relationship of one of the synthesized 2R3T PMs are presented. Finally, the rotational capability of the same 2R3T PM is analyzed. The result shows that by means of actuation redundancy, the studied 2R3T PM indeed possesses the high rotational capability about two axes, even though interferences and singularities are taken into consideration.
This paper presents a novel control algorithm for electrically driven robot manipulators. The proposed control law is simple and model-free based on the voltage control strategy with the decentralized structure and only joint position feedback. It works for both repetitive and non-repetitive tasks. Recently, some control approaches based on the uncertainty estimation using the Fourier series have been presented. However, the proper value for the fundamental period duration has been left as an open problem. This paper addresses this issue and intuitively shows that in order to perform repetitive tasks; the least common multiple (LCM) of fundamental period durations of the desired trajectories of the joints is a proper value for the fundamental period duration of the Fourier series expansion. Selecting the LCM results in the least tracking error. Moreover, the truncation error is compensated by the proposed control law to make the tracking error as small as possible. Adaptation laws for determining the Fourier series coefficients are derived according to the stability analysis. The case study is an SCARA robot manipulator driven by permanent magnet DC motors. Simulation results and comparisons with a voltage-based controller using adaptive neuro-fuzzy systems show the effectiveness of the proposed control approach in tracking various periodic trajectories. Moreover, the experimental results on a real SCARA robot manipulator verify the successful practical implementation of the proposed controller.
We study logic in the light of the Kantian distinction between analytic (untyped, meaningless, locative) answers and synthetic (typed, meaningful, spiritual) questions. Which is specially relevant to proof-theory: in a proof-net, the upper part is locative, whereas the lower part is spiritual: a posteriori (explicit) as far as correctness is concerned, a priori (implicit) for questions dealing with consequence, typically cut-elimination. The divides locative/spiritual and explicit/implicit give rise to four blocks which are enough to explain the whole logical activity.
We are very proud and honoured to dedicate this volume to Corrado Böhm, who has been for us a teacher, mentor, colleague, and friend. But most of all, he was a brilliant role-model to follow.
In this paper, we carry out stochastic comparisons of the largest order statistics arising from multiple-outlier gamma models with different both shape and scale parameters in the sense of various stochastic orderings including the likelihood ratio order, star order and dispersive order. It is proved, among others, that the weak majorization order between the scale parameter vectors along with the majorization order between the shape parameter vectors imply the likelihood ratio order between the largest order statistics. A quite general sufficient condition for the star order is presented. The new results established here strengthen and generalize some of the results known in the literature. Numerical examples and applications are also provided to explicate the theoretical results.