In this paper we present an approach to symbol anchoring that is based on mapping sequences of distance measurements from simple sensors. The sensory space of the mobile robot is pre-structured according to its experiences when it first moves around in unexplored environments. Such pre-structuring depends not only on environmental features, but also on the type of behaviour the robot exhibits. ...

Blind adaptive space-time processing techniques are developed for both uplink reception and downlink transmission in multiuser TDD DS-CDMA systems to overcome multipath fading effect and multiple access interference. The system consists of a spacetime array, a decorrelator, and a weight-adapter. For uplink reception, a hybrid combination of constant modulus algorithm and decisiondirected algori...

The following study aims to present an innovative approach for Design. Participatory Design is the model of direct involvement of different social groups in the design from functional tools to environments, social institutions and businesses. Diverse collection of practices has been developed to support this direct involvement by Participatory Design. People are invited to participate during di...

When approaching a novel visual recognition problem in a specialized image domain, a common strategy is to start with a pre-trained deep neural network and fine-tune it to the specialized domain. If the target domain covers a smaller visual space than the source domain used for pre-training (e.g. ImageNet), the fine-tuned network is likely to be overparameterized. However, applying network prun...

The pre-image problem is a challenging research subject pursued by many researchers in machine learning. Kernel-based machines seek some relevant feature in a reproducing kernel Hilbert space (RKHS), optimized in a given sense, such as kernel-PCA algorithms. Operating the latter for denoising requires solving the pre-image problem, i.e. estimating a pattern in the input space whose image in the...

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachable goal state. Such programs motivate the development of methods to prove the absence of a solution. Considering the definite program and the query ← Q as clauses of a first order theory, one can apply model generator...

In this paper, we describe a method for the determination of a subspace of the feature space in kernel methods, which is suited to large-scale learning problems. Linear model learning in the obtained space corresponds to a nonlinear model learning process in the input space. Since the obtained feature space is determined only by exploiting properties of the training data, this approach can be u...