Toward Human Level Machine Intelligence - Is It Achievable? The Need for a Paradigm Shift

Officially, AI was born in 1956. Since then, very impressive progress has been made in many areas - but not in the realm of human level machine intelligence. During much of its early history, AI "was rife "with exaggerated expectations. A headline in an article published in the late forties of last century was headlined, "Electric brain capable of translating foreign languages is being built". Today, more than half a century later, we do have translation software, but nothing that can approach the quality of human translation. Clearly, achievement of human level machine intelligence is a challenge that is hard to meet. A prerequisite to achievement of human level machine intelligence is mechanization of these capabilities and, in particular, mechanization of natural language understanding. To make significant progress toward achievement of human level machine intelligence, a paradigm shift is needed. More specifically, what is needed is an addition to the armamentarium of AI of two methodologies: (a) a nontraditional methodology of computing with words (CW) or more generally, NL-Computation; and (b) a countertraditional methodology "which involves a progression from computing with numbers to computing with words. The centerpiece of these methodologies is the concept of precisiation of meaning. Addition of these methodologies to AI would be an important step toward the achievement of human level machine intelligence and its applications in decision-making, pattern recognition, analysis of evidence, diagnosis, and assessment of causality. Such applications have a position of centrality in our infocentric society.     

Learning user preferences of route choice behaviour for adaptive route guidance

As the use of navigation systems becomes more widespread, the demand for advanced functions of navigation systems also increases. In the light of user satisfaction, personalisation of route guidance by incorporating user preferences is one of the most desired features. A user model applied to personalised route guidance is presented. The user model adaptively updates route selection rules when it discovers the predicted choice differs from the actual choice of the driver. This study employs a decision tree learning algorithm, the C4.5 algorithm, which has advantages over other data mining methods in terms of its comprehensible model structure. Simulation experiments with a real-world network were conducted to analyse the applicability of the model to adaptive route guidance and the accuracy of its prediction     

QoS assessment of 3G video-phone calls by tracing watermarking exploiting the new colour space `YST?

Tracing watermarking has been recently proposed as a technique to provide a blind measure of the quality of service of the communication link, focusing on multimedia communication scenarios. 3G communication scenarios, where each customer transmits both voice and MPEG-4 video sequences in real time, have been considered. Typical video-phone call consists of close shots of speakers, framing their face in the foreground. For such particular application, a novel colour space (YST) is adopted to minimise the perceptual distortions on face coding introduced by watermarking. In the YST space, the luminance component (Y) is the same as in conventional YUV space, whereas the vectors S and T lie within the chrominance (UV) plane. The S (skin) component is a linear combination of U and V obtained as the 'average' chrominance estimated from an assorted set human faces to achieve a reasonable generalisation. The third component, T, is defined as orthogonal to the YS plane. The results show the benefits obtained in digital watermarking by the new representation against the conventional approach. In fact, the sensitivity of the YST representation outperforms the conventional one in terms of objective (mean square error, peak signal-to-noise ratio) and subjective (video-quality metrics) indicators.     

Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition

Problems of the maximum and the minimum satisfiability on the basis of the integer linear programming and L-partition are studied. The L-structure of polyhedrons of the problems is investigated. Families are set up of unweighted problems of the maximum and the minimum satisfiability, the powers of L-coverings of which grow exponentially with an increase in the number of variables in a formula.     

A quantitative study of firewall configuration errors

The protection that firewalls provide is only as good as the policy they are configured to implement. Analysis of real configuration data show that corporate firewalls are often enforcing rule sets that violate well established security guidelines. Firewalls are the cornerstone of corporate intranet security. Once a company acquires a firewall, a systems administrator must configure and manage it according to a security policy that meets the company's needs. Configuration is a crucial task, probably the most important factor in the security a firewall provides.     

Power management in networked devices

Networks are one of the most significant developments in computing and a hallmark of modern society. However, along with increasing efficiency and productivity, both at home and in the workplace, networks have costs. One cost is the additional energy that electronic devices consume when attached to networks. Power management, a standard feature of modern PCs, was primarily developed to increase battery lifetime in laptop PCs, which historically were not network-connected when using battery power. Today, however, many laptops are connected to a network - typically a Wi-Fi network - as are the majority of desktop computers. Three key drivers of energy use are induced consumption by devices prevented by network connections from entering low-power states, increasing link data rates that inherently consume more energy for the network interfaces, and proliferation of network-connected displays that actively update and display data when no one is present.     

Evaluating software reuse alternatives: a model and its application to an industrial case study

We propose a model that enables software developers to systematically evaluate and compare all possible alternative reuse scenarios. The model supports the clear identification of the basic operations involved and associates a cost component with each basic operation in a focused and precise way. The model is a practical tool that assists developers to weigh and evaluate different reuse scenarios, based on accumulated organizational data, and then to decide which option to select in a given situation. The model is currently being used at six different companies for cost-benefit analysis of alternative reuse scenarios; we give a case study that illustrates how it has been used in practice.     

Input-output feedback linearization of time-delay systems

In this note, the input-output linearization problem (IOLP) for a class of single-input-single-output nonlinear systems with multiple delays in the input, the output, and the state is studied. The problem is solved by means of various static or dynamic compensators, including state and output feedback. The mathematical setting is based on some noncommutative algebraic tools and the introduction of a nonlinear version of the so-called Roesser models for this class of systems. These are claimed to be the cornerstones for studying nonlinear time-delay systems. Necessary and sufficient conditions are given for the existence of a static or pure shift output feedback which solves the IOLP. Sufficient conditions for the existence of a dynamic state feedback solution are included as well.     

A new method for singular value loop shaping in design of multiple-channel controllers

In this note, simple symmetric interval bounds on the singular values of a matrix based on its Gershgorin disks are proposed. This allows the Gershgorin theorem to be used not only to provide information about the location of the eigenvalues of a matrix but also its singular values. This is utilized for the proposition of a new design technique for singular value loop shaping based on the diagonal dominance methodology for design of linear multivariable plants. In return, this allows multiple-channel simply structured controllers to be designed with a view to robustness and to meet constraints and specifications on the behavior of its singular values. A design example is given demonstrating the effectiveness of this approach.