A cyber world (CW) is a digitized world created on cyberspaces inside computers interconnected by networks including the Internet. Following ubiquitous computers, sensors, e-tags, networks, information, services, etc., is a road towards a smart world (SW) created on both cyberspaces and real spaces. It is mainly characterized by ubiquitous intelligence or computational intelligence pervasion in the physical world filled with smart things. In recent years, many novel and imaginative researches have been conducted to try and experiment a variety of smart things including characteristic smart objects and specific smart spaces or environments as well as smart systems. The next research phase to emerge, we believe, is to coordinate these diverse smart objects and integrate these isolated smart spaces together into a higher level of spaces known as smart hyperspace or hyper-environments, and eventually create the smart world. In this paper, we discuss the potential trends and related challenges toward the smart world and ubiquitous intelligence from smart things to smart spaces and then to smart hyperspaces. Likewise, we show our efforts in developing a smart hyperspace of ubiquitous care for kids, called UbicKids.

No abstract

No abstract

Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency) and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.

Knowledge of positions of sensor nodes in Wireless Sensor Networks (WSNs) will make possible many applications such as asset monitoring, object tracking and routing. In WSNs, the errors may happen in the measurement of distances and angles between pairs of nodes in WSN and these errors will be propagated to different nodes, the estimation of positions of sensor nodes can be difficult and have huge errors. In this paper, we will propose localization algorithm based on both distance and angle to landmark. So, we introduce a method of incident angle to landmark and the algorithm to exchange physical data such as distances and incident angles and update the position of a node by utilizing multiple landmarks and multiple paths to landmarks.