A panoramic view and swot analysis of artificial intelligence for achieving the sustainable development goals by 2030: progress and prospects

Applied Intelligence - The17 Sustainable Development Goals (SDGs) established by the United Nations Agenda 2030 constitute a global blueprint agenda and instrument for peace and prosperity...     

Automatic verification of concurrent stochastic systems

Formal Methods in System Design - Automated verification techniques for stochastic games allow formal reasoning about systems that feature competitive or collaborative behaviour among rational...     

Correction to: “SPOCU”: scaled polynomial constant unit activation function

Neural Computing and Applications - Addendum on SPOCU fitting and Erratum.     

Does maintainability relate to the energy consumption of software? A case study

Software Quality Journal - Energy consumption of software has been becoming increasingly significant, since it can vary according to how the software has been developed. In recent years, developers...     

Security flaws in a recent RFID delegation protocol

Radio frequency identification (RFID) tag delegation enables a centralized back-end server to delegate the right to identify and authenticate a tag to specified readers. This should be used to mitigate the computational load on the server side and also to solve the issues in terms of latency and dependency on network connectivity. In this study, we describe a basic RFID delegation architecture and then under this model, we investigate the security of an RFID delegation protocol: Song Mitchell delegation (SMD), which is recently proposed by Song and Mitchell. We point out security flaws that have gone unnoticed in the design and present two attacks namely, a tag impersonation attack and a desynchronization attack against it. We also discover a subtle flaw by which a delegated entity can still keep its delegation rights after the expire of them—this infringes security policy of the scheme. More precisely, we show that the protocol will be still vulnerable to previously mentioned attacks, even if the back-end server ends the delegation right of a delegated reader and update the secrets of the delegated tags. To counteract such flaws, we improve the SMD protocol with a stateful variant so that it provides the claimed security properties.     

Adding sense to the Internet of Things

The Internet of Things (IoT) concept is being widely presented as the next revolution toward massively distributed information, where any real-world object can automatically participate in the Internet and thus be globally discovered and queried. Despite the consensus on the great potential of the concept and the significant progress in a number of enabling technologies, there is a general lack of an integrated vision on how to realize it. This paper examines the technologies that will be fundamental for realizing the IoT and proposes an architecture that integrates them into a single platform. The architecture introduces the use of the Smart Object framework to encapsulate radio-frequency identification (RFID), sensor technologies, embedded object logic, object ad-hoc networking, and Internet-based information infrastructure. We evaluate the architecture against a number of energy-based performance measures, and also show that it outperforms existing industry standards in metrics such as network throughput, delivery ratio, or routing distance. Finally, we demonstrate the feasibility and flexibility of the architecture by detailing an implementation using Wireless Sensor Networks and Web Services, and describe a prototype for the real-time monitoring of goods flowing through a supply chain.     

Tracking control and robustness analysis for planar vertical takeoff and landing aircraft under bounded feedbacks

We study feedback tracking problems for the planar vertical takeoff and landing (PVTOL) aircraft dynamics, which is a benchmark model in aerospace engineering. We provide a survey of the literature on the model. Then we construct new feedback stabilizers for the PVTOL tracking dynamics. The novelty of our work is in the boundedness of our feedback controllers and their applicability to cases where the velocity measurements may not be available, coupled with the uniform global asymptotic stability and uniform local exponential stability of the closed‐loop tracking dynamics and the input‐to‐state stable performance of the closed‐loop tracking dynamics with respect to actuator errors. Our proofs are based on a new bounded backstepping result. We illustrate our work in a tracking problem along a circle. Copyright © 2011 John Wiley & Sons, Ltd.     

Least-squares linear estimators using measurements transmitted by different sensors with packet dropouts

The least-squares linear estimation problem (including prediction, filtering and fixed-point smoothing) from measurements transmitted by different sensors subject to random packet dropouts is addressed. For each sensor, a different Bernoulli sequence is used to model the packet dropout process. Under the assumption that the signal evolution model is unknown, recursive estimation algorithms are derived by an innovation approach, requiring only information about the covariances of the processes involved in the observation equation, as well as the knowledge of the dropout probabilities at each sensor.     

Query language-based inverses of schema mappings: semantics, computation, and closure properties

The inversion of schema mappings has been identified as one of the fundamental operators for the development of a general framework for metadata management. During the last few years, three alternative notions of inversion for schema mappings have been proposed (Fagin-inverse (Fagin, TODS 32(4), 25:1–25:53, 2007), quasi-inverse (Fagin et?al., TODS 33(2), 11:1–11:52, 2008), and maximum recovery (Arenas et?al., TODS 34(4), 22:1–22:48, 2009)). However, these notions lack some fundamental properties that limit their practical applicability: most of them are expressed in languages including features that are difficult to use in practice, some of these inverses are not guaranteed to exist for mappings specified with source-to-target tuple-generating dependencies (st-tgds), and it has been futile to search for a meaningful mapping language that is closed under any of these notions of inverse. In this paper, we develop a framework for the inversion of schema mappings that fulfills all of the above requirements. It is based on the notion of ${\mathcal{C}}$ -maximum recovery, for a query language ${\mathcal{C}}$ , a notion designed to generate inverse mappings that recover back only the information that can be retrieved with queries in ${\mathcal{C}}$ . By focusing on the language of conjunctive queries (CQ), we are able to find a mapping language that contains the class of st-tgds, is closed under CQ-maximum recovery, and for which the chase procedure can be used to exchange data efficiently. Furthermore, we show that our choices of inverse notion and mapping language are optimal, in the sense that choosing a more expressive inverse operator or mapping language causes the loss of these properties.     

A neuron membrane mesh representation for visualization of electrophysiological simulations

We present a process to automatically generate three-dimensional mesh representations of the complex, arborized cell membrane surface of cortical neurons (the principal information processing cells of the brain) from nonuniform morphological measurements. Starting from manually sampled morphological points (3D points and diameters) from neurons in a brain slice preparation, we construct a polygonal mesh representation that realistically represents the continuous membrane surface, closely matching the original experimental data. A mapping between the original morphological points and the newly generated mesh enables simulations of electrophysiolgical activity to be visualized on this new membrane representation. We compare the new mesh representation with the state of the art and present a series of use cases and applications of this technique to visualize simulations of single neurons and networks of multiple neurons.