3D Surface Reconstruction of Noisy Point Clouds Using Growing Neural Gas: 3D Object/Scene Reconstruction

With the advent of low-cost 3D sensors and 3D printers, scene and object 3D surface reconstruction has become an important research topic in the last years. In this work, we propose an automatic (unsupervised) method for 3D surface reconstruction from raw unorganized point clouds acquired using low-cost 3D sensors. We have modified the growing neural gas network, which is a suitable model because of its flexibility, rapid adaptation and excellent quality of representation, to perform 3D surface reconstruction of different real-world objects and scenes. Some improvements have been made on the original algorithm considering colour and surface normal information of input data during the learning stage and creating complete triangular meshes instead of basic wire-frame representations. The proposed method is able to successfully create 3D faces online, whereas existing 3D reconstruction methods based on self-organizing maps required post-processing steps to close gaps and holes produced during the 3D reconstruction process. A set of quantitative and qualitative experiments were carried out to validate the proposed method. The method has been implemented and tested on real data, and has been found to be effective at reconstructing noisy point clouds obtained using low-cost 3D sensors.     

Parallel simulation of Population Dynamics P systems: updates and roadmap

Population Dynamics P systems are a type of multienvironment P systems that serve as a formal modeling framework for real ecosystems. The accurate simulation of these probabilistic models, e.g. with Direct distribution based on Consistent Blocks Algorithm, entails large run times. Hence, parallel platforms such as GPUs have been employed to speedup the simulation. In 2012, the first GPU simulator of PDP systems was presented. However, it was able to run only randomly generated PDP systems. In this paper, we present current updates made on this simulator, involving an input modu le for binary files and an output module for CSV files. Finally, the simulator has been experimentally validated with a real ecosystem model, and its performance has been tested with two high-end GPUs: Tesla C1060 and K40.     

Design complexity control in truss optimization

Truss optimization based on the ground structure approach often leads to designs that are too complex for practical purposes. In this paper we present an approach for design complexity control in truss optimization. The approach is based on design complexity measures related to the number of bars (similar to Asadpoure et al. Struct Multidisc Optim 51(2):385–396 2015) and a novel complexity measure related to the number of nodes of the structure. Both complexity measures are continuously differentiable and thus can be used together with gradient based optimization algorithms. The numerical examples show that the proposed approach is able to reduce design complexity, leading to solutions that are more fit for engineering practice. Besides, the examples also indicate that in some cases it is possible to significantly reduce design complexity with little impact on structural performance. Since the complexity measures are non convex, a global gradient based optimization algorithm is employed. Finally, a detailed comparison to a classical approach is presented.     

Twister: the development of a peer-to-peer microblogging platform

This paper proposes a new microblogging architecture based on peer-to-peer networks overlays. The proposed platform comprises three mostly independent overlay networks. The first provides distributed user registration and authentication and is based on the Bitcoin protocol. The second one is a Distributed Hash Table (DHT) overlay network providing key/value storage for user resources and tracker location for the third network. The last network is a collection of possibly disjoint ‘swarms’ of followers, based on the BitTorrent protocol, which can be used for efficient near-instant notification delivery to many users. By leveraging existing and proven technologies, twister provides a new microblogging platform offering security, scalability and privacy features. A built-in mechanism provides incentive for entities that contribute processing time to run the user registration network, rewarding such entities with the privilege of sending a single unsolicited (‘promoted’) message to the entire network. The number of unsolicited messages per day is defined in order to not upset users. Security and scalability assumptions have been confirmed in a real-world deployment.     

Critical stress and load conditions for pitting calculations of involute spur and helical gear teeth

Calculation methods of spur and helical gear drives for preliminary designs or standardization purposes available in technical literature, use the Hertz equation to evaluate the contact stress, assuming the load to be uniformly distributed along the line of contact. However, this model presents some discrepancies with experimental results because the changing rigidity of the pair of teeth along the path of contact produces a non-uniform load distribution, which implies that some load distribution factors are required to compute the contact stress. In this paper, a non-uniform model of load distribution along the line of contact, recently developed, obtained from the minimum elastic potential criterion, has been used. This model combined with the Hertz equation yields more accurate values of the contact stress. As the load per unit of length at any point of the line of contact and any position of the meshing cycle has been described by a very simple analytic equation, a complete study of the location and value of the critical contact stress has been carried out. From this study, a recommendation for the calculation of the pitting load capacity of spur and helical gears is proposed.     

Modeling collaboration protocols for collaborative modeling tools: Experiences and applications

Over the last two decades, Collaborative Systems have become increasingly popular thanks to the many advances made in networks, communications and software tools. Within this field, Collaborative Modeling Systems apply the collaborative paradigm to the construction of (often visual) models, where users build diagrams from building blocks and the relationships between them. In these kinds of applications, the work is usually arranged into sessions, with the definition of some kind of time organization between those sessions. This organization is known as a collaboration protocol. Unfortunately, it is not usually easy to define these protocols, and many applications do not allow users to make any use of them.In an effort to overcome these difficulties, in this paper we propose a visual language for defining collaboration protocols for these systems. As such, in our language, sessions, artifacts and the transformations between them can be specified visually, and different coordination relationships (such as fork and join) can be defined. The visual language is included in a development method for collaborative systems that take advantage of the Eclipse platform in order to develop model-driven graphical editors that are enhanced with collaboration capabilities.     

Managing Citizen Profiles in the Domain of e-Government: The cPortfolio Project

The provision of support for holistic operations in the scope of a horizontal digital administration requires the fulfillment of a number of previous steps that guarantee the viability of services in the domain. One of these tasks is the proper management of documents. Documents are a key element of any democratic administration and their digital management is a clear pre-requisite for the arrival of digital government. This article tackles how this service can be provided using the support of semantics as a technological cornerstone. The implementation of such a tool is made through the so-called cPortfolio. This platform is deeply discussed and details about its design and implementation are provided. This system is designed to manage both the personal information from the citizen and the documents they possess. Tests on the prototype showed interesting features regarding the simplicity of use and the interoperability support provided to third party agents.     

A constant-time dynamic storage allocator for real-time systems

Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with a very large bound. In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation. Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred by the allocators has been also included in order to provide a global view of the behaviour of the allocators. The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused by the best existing allocators.