Mobile digcovery: discovering and interacting with the world through the Internet of things

The application of Internet-enabled devices in the real world for the development of Smart Cities, environmental monitoring, bus tracking, and parking requires scalability, extensibility, and integration of emerging resources to reach a suitable ecosystem for data acquisition and interaction with citizens. Internet of things needs to offer efficient support for global communications and access to services and information. It needs to enable homogeneous and seamless machine-to-machine communication for different solutions and applications. This work presents an homogeneous and suitable mechanism for global resource discovery, device access for deployed smart objects in different scenarios, and sensors and devices from end users (participative sensing). The integration of legacy and sensors already available from smart buildings and smart objects is presented. For this purpose, a resolution infrastructure called “digcovery” is defined for maximizing efficiency and sustainability of deployments. Digcovery architecture offers the framework to allow users to register/include their own sensors into a common infrastructure and access/discover the available resources through mobile digcovery. Mobile digcovery exploits the context-awareness, geo-location, and identification technologies available in mobile platforms such as smartphones to discover, interact, and access the resources through its ElasticSearch engine.     

Runge Kutta Type Methods for Isodynamical Matrix Flows: Applications to Balanced Realizations

Recently several numerical methods have been proposed for solving isospectral problems which are matrix differential systems whose solutions preserve the spectrum during the evolution. In this paper we consider matrix differential systems called isodynamical flows in which only a component of the matrix solution preserves the eigenvalues during the evolution and we propose procedures for their numerical solution. Applications of such numerical procedures may be found in systems theory, in particular in balancing realization problems. Several numerical tests will be reported. Received April 27, 2001; revised October 25, 2001 Published online February 18, 2002     

Dynamic Control of Walking Cycle with Initiation Process for Humanoid Robot

This paper focuses on numerical method to solve the dynamic equilibrium of a humanoid robot during the walking cycle with the gait initiation process. It is based on a multi-chain strategy and a dynamic control/command architecture previously developed by Gorce. The strategy is based on correction of the trunk center of mass acceleration and force distribution of the forces exerced by the limbs on the trunk. This latter is performed by mean of a Linear Programming (LP) method. We study the gait initiation process when a subject, initially in quiet erect stance posture, performs a walking cycle. In this paper, we propose to adjust the method for the multiphases (from double support to single support) and multicriteria features of the studied movement. This is done by adapting some specific constraints and criteria in order to ensure the global stability of the humanoid robot along the task execution. For that, we use a Real-Time Criteria and Constraints Adaptation method. Simulation results are presented to demonstrate criteria and constraints influences on the dynamic stability.     

On the deployment of a real scalable delegation service

This paper explains the evolution of the concept of delegation since its first references in the context of distributed authorization to the actual use as a fundamental part of a privilege management architecture. The work reviews some of the earliest contributions that pointed out the relevance of delegation when dealing with distributed authorization, in particular we comment on PolicyMaker and KeyNote, and also on SDSI/SPKI. Then, we elaborate on Federation as a particular case of delegation, and remark the importance given to Federation by the industry. Finally, the paper discusses about Privilege Management Infrastructures, introducing a new mechanism to extend their functionality using advanced delegation services.     

Monte Carlo techniques for phrase-based translation

Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative approach of sampling from the posterior distribution defined by a translation model. We define a novel Gibbs sampler for sampling translations given a source sentence and show that it effectively explores this posterior distribution. In doing so we overcome the limitations of heuristic beam search and obtain theoretically sound solutions to inference problems such as finding the maximum probability translation and minimum risk training and decoding.     

Online collaboration: Collaborative behavior patterns and factors affecting globally distributed team performance

Studying the collaborative behavior of online learning teams and how this behavior is related to communication mode and task type is a complex process. Research about small group learning suggests that a higher percentage of social interactions occur in synchronous rather than asynchronous mode, and that students spend more time in task-oriented interaction in asynchronous discussions than in synchronous mode. This study analyzed the collaborative interaction patterns of global software development learning teams composed of students from Turkey, US, and Panama. Data collected from students’ chat histories and forum discussions from three global software development projects were collected and compared. Both qualitative and quantitative analysis methods were used to determine the differences between a group’s communication patterns in asynchronous versus synchronous communication mode. K-means clustering with the Ward method was used to investigate the patterns of behaviors in distributed teams. The results show that communication patterns are related to communication mode, the nature of the task, and the experience level of the leader. The paper also includes recommendations for building effective online collaborative teams and describes future research possibilities.     

Separating adaptable persistence attributes through computational reflection

To receive persistence capabilities, applications usually must explicitly access database management systems, such as object-oriented databases or object-relational mapping products. The usual way of building an application is tangling its functional code with explicit structured query language (SQL) or object query language (OQL) persistence statements. This tangling has several drawbacks: deficiencies in source code legibility, maintainability, and portability; lack of persistence functionality reuse; and low adaptability of persistence attributes. Separating crosscutting concerns such as persistence from the main application code can reduce software complexity and facilitate concerns reuse. A prototype persistence system shows how to use computational reflection to completely separate and adapt application persistence attribute at runtime.     

Effective Evolutionary Algorithms for Many-Specifications Attainment: Application to Air Traffic Control Tracking Filters

This paper addresses a real-world engineering design requiring the application of effective and global optimization techniques. The problem it deals with is the design of nonlinear tracking filters under up to several hundreds of performance specifications. The suitability of different evolutionary computation techniques for solving multiobjective problems is explored, contrasting the performance achieved with recent multiobjective evolutionary algorithm (MOEAs) proposals and different aggregation schemes. In particular, a new scheme is proposed to build a fitness function based on an operator that selects worst cases of multiple specifications in different situations. They have been evaluated in the design of an air traffic control (ATC) tracking filter that should accomplish a specific normative with 264 specifications. Results show their performance in terms of effectiveness and computational load, comparing their capability to scale the problem with respect to problem size.     

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.