Let G be a profinite group. The coprime commutators γj⁎ and δj⁎ are defined as follows. Every element of is both γ1⁎-value δ0⁎-value. For j≥2, let X the set all elements that powers γj−1⁎-values. An γj⁎-value if there exist x∈X g∈G such a=[x,g] (|x|,|g|)=1. j≥1, Y δj−1⁎-values. δj⁎-value x,y∈Y a=[x,y] (|x|,|y|)=1. In this paper we establish following results. A group finite-by-pronilpotent only...

AMD’s Advanced Synchronization Facility (ASF) has been evaluated in earlier work in the context of hardware and hybrid transactional memory, software transactional memory, and lock-free programming. In this work, we describe an extension to ASF for applying it in the area of lock elision (LE), which is now a well established concept in academia, but has not found its way into mainstream micro-p...

This paper presents a new method for solving the following problem: Given a polygonal model of some geometric object generate several more and more approximative representations of this object containing less and less polygons. The idea behind the method is that small detail in the model is represented by many spatially close points. A hierarchical clustering algorithm is used to generate a hie...

The present study will focus on occurrence of fully voiced, devoiced and elided high vowels in Japanese. High vowels elision in Japanese is supported by clear acoustic evidences, even though it is not globally accepted by scholars in the field. Elided vowels, hence, are considered here to have their own status. Moreover, this study is conceived in order to state differences and analogies among ...

Each synchronization point represents a point of serialization, and thereby can easily hurt parallel scalability. As demonstrated by recent studies, approximating, i.e., relaxing synchronization by eliminating a subset of synchronization points spatio-temporally can help improve parallel scalability, as long as approximation incurred violations of basic execution semantics remain predictable an...

In this short paper we show that hardware-based transactional lock elision can provide benefit by reducing the incidence of lock holder preemption, decreasing lock hold times and promoting improved scalability.

This paper introduces a new b-rep (boundary representation) data structure, called AIF (Adjacency and Incidence Framework). It is concise and enables fast access to topological information. Its conciseness results from the fact that it is an orientable, but not an oriented, data structure, i.e. an orientation can be topologically induced as necessary in many applications. It is an optimal 9 4 C...