Feature subset selection based on fuzzy entropy measures for handling classification problems

In this paper, we present a new method for dealing with feature subset selection based on fuzzy entropy measures for handling classification problems. First, we discretize numeric features to construct the membership function of each fuzzy set of a feature. Then, we select the feature subset based on the proposed fuzzy entropy measure focusing on boundary samples. The proposed method can select relevant features to get higher average classification accuracy rates than the ones selected by the MIFS method (Battiti, R. in IEEE Trans. Neural Netw. 5(4):537–550, 1994), the FQI method (De, R.K., et al. in Neural Netw. 12(10):1429–1455, 1999), the OFEI method, Dong-and-Kothari’s method (Dong, M., Kothari, R. in Pattern Recognit. Lett. 24(9):1215–1225, 2003) and the OFFSS method (Tsang, E.C.C., et al. in IEEE Trans. Fuzzy Syst. 11(2):202–213, 2003).

Invariant Signatures of Closed Planar Curves

We prove that any subset of ℝ² parametrized by a C ¹ periodic function and its derivative is the Euclidean invariant signature of a closed planar curve. This solves a problem posed by Calabi et al. (Int. J. Comput. Vis. 26:107–135, 1998). Based on the proof of this result, we then develop some cautionary examples concerning the application of signature curves for object recognition and symmetry detection as proposed by Calabi et al.

Approximate schemas,source-consistency and query answering

We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ε-close if every word (tree) of one language is ε-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421–430, 2006), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within ε by only looking at a constant fraction of the input.

Numerical study on gas–liquid nano-flows with pseudo-particle modeling and soft-particle molecular dynamics simulation

We couple pseudo-particle modeling (PPM, Ge and Li in Chem Eng Sci 58(8):1565–1585, 2003), a variant of hard-particle molecular dynamics, with standard soft-particle molecular dynamics (MD) to study an idealized gas–liquid flow in nano-channels. The coupling helps to keep sharp contrast between gas and liquid behaviors and the simulations conducted provide a reference frame for exploring more complex and realistic gas–liquid nano-flows. The qualitative nature and general flow patterns of the flow under such extreme conditions are found to be consistent with its macro-scale counterpart.

Dynamic voltage scaling under EDF revisited

Basic algorithms have been proposed in the field of low-power (Yao, F., et al. in Proceedings of lEEE annual foundations of computer science, pp. 374–382, 1995) which compute the minimum energy-schedule for a set of non-recurrent tasks (or jobs) scheduled under EDF on a dynamically variable voltage processor. In this study, we propose improvements upon existing algorithms with lower average and worst-case complexities. They are based on a new EDF feasibility test that helps to identify the “critical intervals”. The complexity of this feasibility test depends on structural characteristics of the set of jobs. More precisely, it depends on how tasks are included one in the other. The first step of the algorithm is to construct the Hasse diagram of the set of tasks where the partial order is defined by the inclusion relation on the tasks. Then, the algorithm constructs the shortest path in a geometrical representation at each level of the Hasse diagram. The optimal processor speed is chosen according to the maximal slope of each path.

An Improved LOT Model for Image Restoration

Some second order PDE-based image restoration models such as total variation (TV) minimization or ROF model of Rudin et al. (Physica D 60, 259–268, 1992) can easily give rise to staircase effect, which may produce undesirable blocky image. LOT model proposed by Laysker, Osher and Tai (IEEE Trans. Image Process. 13(10), 1345–1357, 2004) has alleviated the staircase effect successfully, but the algorithms are complicated due to three nonlinear second-order PDEs to be computed, besides, when we have no information about the noise, the model cannot preserve edges or textures well. In this paper, we propose an improved LOT model for image restoration. First, we smooth the angle θ rather than the unit normal vector n, where n=(cos θ,sin θ). Second, we add an edge indicator function in order to preserve fine structures such as edges and textures well. And then the dual formulation of TV-norm and TV _g -norm are used in the numerical algorithms. Finally, some numerical experiments prove our proposed model and algorithms to be effective.

Efficient implementation of tight response-times for tasks with offsets

Earlier approximate response time analysis (RTA) methods for tasks with offsets (transactional task model) exhibit two major deficiencies: (i) They overestimate the calculated response times resulting in an overly pessimistic result. (ii) They suffer from time complexity problems resulting in an RTA method that may not be applicable in practice. This paper shows how these two problems can be alleviated and combined in one single fast-and-tight RTA method that combines the best of worlds, high precision response times and a fast approximate RTA method. Simulation studies, on randomly generated task sets, show that the response time improvement is significant, typically about 15% tighter response times in 50% of the cases, resulting in about 12% higher admission probability for low priority tasks subjected to admission control. Simulation studies also show that speedups of more than two orders of magnitude, for realistically sized tasks sets, compared to earlier RTA analysis techniques, can be obtained. Other improvements such as Palencia Gutiérrez, González Harbour (Proceedings of the 20th IEEE real-time systems symposium (RTSS), pp. 328–339, 1999), Redell (Technical Report TRITA-MMK 2003:4, Dept. of Machine Design, KTH, 2003) are orthogonal and complementary which means that our method can easily be incorporated also in those methods. Hence, we conclude that the fast-and-tight RTA method presented is the preferred analysis technique when tight response-time estimates are needed, and that we do not need to sacrifice precision for analysis speed; both are obtained with one single method.

Zero-Automatic Networks

We continue the study of zero-automatic queues first introduced in Dao-Thi and Mairesse (Adv Appl Probab 39(2):429–461, 2007). These queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The simple M/M/1 queue and Gelenbe’s G-queue with positive and negative customers are the two simplest 0-automatic queues. All stable 0-automatic queues have an explicit “multiplicative” stationary distribution and a Poisson departure process (Dao-Thi and Mairesse, Adv Appl Probab 39(2):429–461, 2007). In this paper, we introduce and study networks of 0-automatic queues. We consider two types of networks, with either a Jackson-like or a Kelly-like routing mechanism. In both cases, and under the stability condition, we prove that the stationary distribution of the buffer contents has a “product-form” and can be explicitly determined. Furthermore, the departure process out of the network is Poisson.

U-multimedia framework: a secure and intelligent multimedia service framework based on context information in U-home

In the last few years, intelligent secured multimedia services play a vital role along with ubiquitous home environment (Park et al. in Lecture Notes in Computer Science, vol. 4097, pp. 660–670, [2006]; Lecture Notes in Computer Science, vol. 4159, pp. 893–901, [2006]; IEICE Trans. Inf. Syst. E89-D(12):2831–2837, [2006]; Lecture Notes in Artificial Intelligence, vol. 4252, pp. 777–784, [2006]; Lecture Notes in Artificial Intelligence, vol. 3801, pp. 313–320, [2005]). There are certain constrains and limitations in providing effective and efficient services in U-home. The mechanism and applications are integrated to realize such services. Three different kinds of ubiquitous multimedia services are proposed in the framework. Based on the temporal and spatial context information, the surrounding situations are recognized. The contexts are collected and well analyzed with the preconditions to provide the final services. The proposed framework provides efficient services in the multimedia based deices based on the current context information.

Supporting scenario evolution

Scenarios have been shown to be very helpful in identifying and communicating requirements for computer-based systems (CBSs). However, they appear not to be applicable to the rest of the CBS development process. Making scenarios more useful for the entire software development lifecycle requires integrating scenarios to other representations used during CBS development. This integration is achieved with tracing technology. Having integrated scenarios into the entire software development lifecycle creates the necessity to maintain scenarios through the inevitable changes that they and other documents undergo and to subject them to configuration management. We have prototyped automated support for full-lifecycle scenario management and have applied it to some non-trivial systems.This paper is an amalgamation and extension of the conference papers numbered 8, 9, 10, and 11 in the bibliography of this paper.

---

Efficient Detection of Patterns in 2D Trajectories of Moving Points

Moving point object data can be analyzed through the discovery of patterns in trajectories. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock, leadership, convergence, and encounter, as defined by Laube et al., Finding REMO—detecting relative motion patterns in geospatial lifelines, 201–214, (2004). These patterns are large enough subgroups of the moving point objects that exhibit similar movement in the sense of direction, heading for the same location, and/or proximity. By the use of techniques from computational geometry, including approximation algorithms, we improve the running time bounds of existing algorithms to detect these patterns.

Emergence and Adaptation

I investigate the relationship between adaptation, as defined in evolutionary theory through natural selection, and the concept of emergence. I argue that there is an essential correlation between the former, and “emergence” defined in the field of algorithmic simulations. I first show that the computational concept of emergence (in terms of incompressible simulation) can be correlated with a causal criterion of emergence (in terms of the specificity of the explanation of global patterns). On this ground, I argue that emergence in general involves some sort of selective processes. Finally, I show that a second criterion, concerning novel explanatory regularities following the emergence of a pattern, captures the robustness of emergence displayed by some cases of emergence (according to the first criterion). Emergent processes fulfilling both criteria are therefore exemplified in evolutionary biology by some so-called “innovations”, and mostly by the new units of fitness or new kinds of adaptations (like sexual reproduction, multicellular organisms, cells, societies) sometimes called “major transitions in evolution”, that recent research programs (Maynard-Smith and Szathmary 1995; Michod 1999) aims at explaining.

Sensation seeking and e-shoppers

The concept of sensation seeking has been extensively researched. However, a few studies have been carried out on the relationship between sensation seeking and e-commerce. More specifically, it studied the purchase of leisure products, which usually have a higher frequency of purchase on the Internet. With this in mind, the Brief Sensation Seeking Scale (BSSS) created by Hoyle et al. (Pers. Individ. Differ. 32:401–414, 2002) is used, which adapts items from the SSS-V (Zuckerman et al., J. Consult. Clin. Psychol. 46:139–149, 1978). The results, based on a sample of 393 participants, explain that significant differences exist between e-shoppers and non-e-shoppers of leisure products with respect to the subscale of thrill and adventure seeking. Also, it is observed that there are significant differences between shoppers and non-shoppers only with women.

A unifying framework for robot control with redundant DOFs

Recently, Udwadia (Proc. R. Soc. Lond. A 2003:1783–1800, 2003) suggested to derive tracking controllers for mechanical systems with redundant degrees-of-freedom (DOFs) using a generalization of Gauss’ principle of least constraint. This method allows reformulating control problems as a special class of optimal controllers. In this paper, we take this line of reasoning one step further and demonstrate that several well-known and also novel nonlinear robot control laws can be derived from this generic methodology. We show experimental verifications on a Sarcos Master Arm robot for some of the derived controllers. The suggested approach offers a promising unification and simplification of nonlinear control law design for robots obeying rigid body dynamics equations, both with or without external constraints, with over-actuation or underactuation, as well as open-chain and closed-chain kinematics.

Improving utilization of reconfigurable resources using two-dimensional compaction

Partial reconfiguration allows parts of the reconfigurable chip area to be configured without affecting the rest of the chip. This allows placement of tasks at run time on the reconfigurable chip. Area management is a very important issue which highly affect the utilization of the chip and hence the performance. This paper focuses on a major aspect of moving running tasks to free space for new incoming tasks (compaction). We study the effect of compacting running tasks to free more contiguous space on the system performance. First, we introduce a straightforward compaction strategy called Blind compaction. We use its performance as a reference to measure the performance of other compaction algorithms. Then we propose a two-dimensional compaction algorithm called one-corner compaction. This algorithm runs with respect to one chip corner. We further extend this algorithm to the four corners of the chip and introduce the four-corners compaction algorithm. Finally, we compare the performance of these algorithms with some existing compaction strategies: Brebner, G. and Diessel, O. (Proceedings of the 11th international workshop on field programmable gate arrays (FPL), pp. 182–191, 2001); Diesel, O. and ElGindy, H. (Proceedings of the 5th Australasian conference on parallel and real-time systems (PART), pp. 191–200, 1998); Diesel, O., et al. (IEE proceedings on computers and digital techniques, vol. 147, pp. 181–188, 2000). The simulation results show improvement in average task allocation time when using the four-corners compaction algorithm by 15% and in chip utilization by 16% over the Blind compaction. These results outperform the existing strategies.

Ethical regulations on robotics in Europe

There are only a few ethical regulations that deal explicitly with robots, in contrast to a vast number of regulations, which may be applied. We will focus on ethical issues with regard to “responsibility and autonomous robots”, “machines as a replacement for humans”, and “tele-presence”. Furthermore we will examine examples from special fields of application (medicine and healthcare, armed forces, and entertainment). We do not claim to present a complete list of ethical issue nor of regulations in the field of robotics, but we will demonstrate that there are legal challenges with regard to these issues.

---

Uniqueness of the Perfect Fusion Grid on ℤ d

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency relation on ℤ ^d which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only such graph whatever the dimension d.

Shaping the drivers’ interaction: how the new vehicle systems match the technological requirements and the human needs

Although it is not always possible to derive from statistics the causes of an accident, data clearly show that they are mostly due to a lack of driver’s perception, with high direct and indirect social costs for society (Hutchinson in Road accidents statistics, Rumsby Scientific Publishing, 1987; Kawai in Convergence 1994, Conference Proceedings, 1994; Boussuge in Bilan et perspectives, Revue Gen. des Routes et des Aerodromes, N. 726, 1995). Therefore, a strong integration among all the actors involved (i.e., the drivers, the vehicle or technical system in general and the driving environment) is quite necessary. From the beginning of 1980s, there has been a shift in system concept design, moving from a technological approach towards a human-centred design approach (Norman and Draper 1986; Rouse 1991). Firstly this approach was applied to the human–computer interaction domain, and has also been extended towards complex and automated technological systems (Sheridan in Telerobotics, automation, and human supervisory control, MIT Press, 1992; Scerbo in Human performance in automated systems: theory and applications, Lawrence Erlbaum Associates, 1996) in several domains as, among the others, automotive (Michon in Generic intelligent driver support, Taylor & Francis, 1994) and industrial plants (Cacciabue in Giuseppe mantovani ergonomia, II Mulino, 2000). According to these perspectives, the role of user’s needs in the design process of a certain system becomes crucial; nevertheless, the technological requirements, i.e., the so-called “machine needs” should maintain a role of which the designer should be totally aware. Otherwise, the risk is to fail the design process making a system incoherent and ineffective. Thus, this paper aims at presenting such types of needs, the mutual interaction between machine and users, as well as the interaction of both with the surrounding environment. The work is based on several experiences conducted in the automotive domain.

Managing Next Generation Networks and Services: A Report on APNOMS 2007

This article presents a report on APNOMS 2007, which was held October 10–12, 2007 in Sapporo, Japan. The theme of APNOMS 2007 was “Managing the Next Generation Networks and Services.”

Partial Partitions,Partial Connections and Connective Segmentation

In connective segmentation (Serra in J. Math. Imaging Vis. 24(1):83–130, [2006]), each image determines subsets of the space on which it is “homogeneous”, in such a way that this family of subsets always constitutes a connection (connectivity class); then the segmentation of the image is the partition of space into its connected components according to that connection. Several concrete examples of connective segmentations or of connections on sets, indicate that the space covering requirement of the partition should be relaxed. Furthermore, morphological operations on partitions require the consideration of wider framework. We study thus partial partitions (families of mutually disjoint non-void subsets of the space) and partial connections (where connected components of a set are mutually disjoint but do not necessarily cover the set). We describe some methods for generating partial connections. We investigate the links between the two lattices of partial connections and of partial partitions. We generalize Serra’s characterization of connective segmentation and discuss its relevance. Finally we give some ideas on how the theory of partial connections could lead to improved segmentation algorithms.