Reconfiguring Older Bodies in the Prison Time Machine

It is by mapping an area that the geographer comes to understand the contours and formations of a place. The “place” in this case is the prison world. This article serves to map moments in prison demonstrating how “old” female bodies are performed under the prison gaze. In this article I will illustrate how older women subvert, negotiate, or invoke discourse as a means of reinscribing the normalizing discourses that serve to confine and define older women's experiences in prison. Female elders in prison become defined and confined by regimes of femininity and ageism. They have to endure symbolic and actual intrusions of physical privacy, which serve to remind them of what they were, where they are, and what they have become. This article will critically explore the complexity and contradictions of time use in prison and how they impact on embodied identities. By incorporating the voices of elders, I hope to draw out the contradictions and dilemmas which they experience, thereby illustrating the relationship between time, their involvement in doing time, and the performance of time in a total institution (see Goffman, 1961), and the relationship between temporality and existence. The stories of the women show how their identities are caught within the movement and motion of time and space, both in terms of the time of “the real” on the outside and within prison time. This is the in-between space of carceral time within which women live and which they negotiate. It is by being caught in this network of carceral time that they are constantly being “remade” as their body/performance of identities alters within it. While only a small percentage of the female prison population in the United Kingdom are in later life, one has to question why criminological and gerontological literature fail to address the needs of a growing significant minority.

Support vector machine classification for large data sets via minimum enclosing ball clustering

Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitable for classification of large data sets, because the training complexity of SVM is highly dependent on the size of data set. This paper presents a novel SVM classification approach for large data sets by using minimum enclosing ball clustering. After the training data are partitioned by the proposed clustering method, the centers of the clusters are used for the first time SVM classification. Then we use the clusters whose centers are support vectors or those clusters which have different classes to perform the second time SVM classification. In this stage most data are removed. Several experimental results show that the approach proposed in this paper has good classification accuracy compared with classic SVM while the training is significantly faster than several other SVM classifiers.

A hierarchical multiclass support vector machine incorporated with holistic triple learning units

This paper proposes a new hierarchical learning structure, namely the holistic triple learning (HTL), for extending the binary support vector machine (SVM) to multi-classification problems. For an N-class problem, a HTL constructs a decision tree up to a depth of A leaf node of the decision tree is allowed to be placed with a holistic triple learning unit whose generalisation abilities are assessed and approved. Meanwhile, the remaining nodes in the decision tree each accommodate a standard binary SVM classifier. The holistic triple classifier is a regression model trained on three classes, whose training algorithm is originated from a recently proposed implementation technique, namely the least-squares support vector machine (LS-SVM). A major novelty with the holistic triple classifier is the reduced number of support vectors in the solution. For the resultant HTL-SVM, an upper bound of the generalisation error can be obtained. The time complexity of training the HTL-SVM is analysed, and is shown to be comparable to that of training the one-versus-one (1-vs.-1) SVM, particularly on small-scale datasets. Empirical studies show that the proposed HTL-SVM achieves competitive classification accuracy with a reduced number of support vectors compared to the popular 1-vs-1 alternative.

Kinematic modeling of Exechon parallel kinematic machine

The studies on PKMs have attracted a great attention to robotics community. By deploying a parallel kinematic structure, a parallel kinematic machine (PKM) is expected to possess the advantages of heavier working load, higher speed, and higher precision. Hundreds of new PKMs have been proposed. However, due to the considerable gaps between the desired and actual performances, the majorities of the developed PKMs were the prototypes in research laboratories and only a few of them have been practically applied for various applications; among the successful PKMs, the Exechon machine tool is recently developed. The Exechon adopts unique over-constrained structure, and it has been improved based on the success of the Tricept parallel kinematic machine. Note that the quantifiable theoretical studies have yet been conducted to validate its superior performances, and its kinematic model is not publically available. In this paper, the kinematic characteristics of this new machine tool is investigated, the concise models of forward and inverse kinematics have been developed. These models can be used to evaluate the performances of an existing Exechon machine tool and to optimize new structures of an Exechon machine to accomplish some specific tasks.