We give a development of universal lossy data compression based on a lossy version of the Kraft inequality. As an application, we evaluate the performance of universal mixture codebooks.
We give a development of universal lossy data compression based on a lossy version of the Kraft inequality. As an application, we evaluate the performance of universal mixture codebooks.
A stochastic method is used to optimize white all-semiconductor lamps composed of tree, four, and five primary light-emitting diodes (LEDs) with Gaussian spectra and realistic line widths typical of AlGaInP and AlGaIn...
详细信息
A stochastic method is used to optimize white all-semiconductor lamps composed of tree, four, and five primary light-emitting diodes (LEDs) with Gaussian spectra and realistic line widths typical of AlGaInP and AlGaInP LEDs. Within an optimal set of central wavelengths and relative powers, a trade-off between luminous efficacy and the general color rendering index can be performed. The quadrichromatic all-semiconductor lamp is shown to meet most needs of deluxe general lighting. However, practical implementation of this lamp requires substantial improvement of LEDs in the yellow-green region (∼570 nm).
We propose a method for characterizing a set of training colors, based on sample color pixels captured with a camera. The system tries to detect the training colors on test pixels within images captured under illumina...
详细信息
We propose a method for characterizing a set of training colors, based on sample color pixels captured with a camera. The system tries to detect the training colors on test pixels within images captured under illumination level conditions different from those used in the training process. The training color characterization is based on Smith's perceptual color model, but using only hue and saturation components. Both, training and classification processes make use of fuzzy techniques to assume vagueness involved within training and test data.
For a class of continuous-time nonlinear system, a novel robust adaptive fuzzy controller is proposed by using the Lyapunov method. It is proved that the control algorithm is globally stable, the output tracking-error...
详细信息
For a class of continuous-time nonlinear system, a novel robust adaptive fuzzy controller is proposed by using the Lyapunov method. It is proved that the control algorithm is globally stable, the output tracking-error of the system can convergence to a domain of zero under the assumptions. As a result, the system controlled has stronger robustness against the disturbance and modeling error.
Ripple down rules (RDR) is an incremental knowledge acquisition (KA) methodology, where a knowledge base (KB) is constructed as a collection of rules with exceptions. Nested ripple down rules (NRDR) is an extension of...
详细信息
Ripple down rules (RDR) is an incremental knowledge acquisition (KA) methodology, where a knowledge base (KB) is constructed as a collection of rules with exceptions. Nested ripple down rules (NRDR) is an extension of this methodology which allows the expert to enter her/his own domain concepts and later refine these concepts hierarchically. In this paper we show similarities between incremental knowledge acquisition and database schema evolution, and propose to use the F2 object-oriented database management system (OODBMS) to implement an NRDR knowledge based system. We use the existing non-standard features of F2 and show how multiple instantiation and object migration (known as multiobjects feature in F2), and schema evolution capabilities in F2 easily accommodate all the update mechanisms required to incrementally build an NRDR KB. We illustrate our approach with a KA session.
The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet si...
详细信息
The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex. Hence, it is critical for peers to convey this routing information to each other. The problem was formalized by Harchol-Balter et al. (1999). The routing information needed for a vertex to reach another peer is that peer's identifier (e.g., IP address). A logical directed edge represents the fact that the peer at the tail of the edge knows the IP address of the one at its head. A number of algorithms were developed by Harchol-Balter et al. for this problem in the model of a synchronous network over a weakly connected directed graph. The best of these algorithms was randomized. Subsequently, a deterministic algorithm for the problem on synchronous networks with improved complexity was presented by Kutten et al. (2001). The current paper extends this deterministic algorithm to the environment of asynchronous networks, maintaining similar complexities (translated to the asynchronous model). These are lower than the complexities that would be needed to synchronize the system. The main technical difficulty in a directed, weakly connected system is to ensure that vertices take consistent steps, even if their knowledge about each other is not symmetric, and even if there is no timeout mechanism (which does exist in synchronous systems) to assist in that.
We present a combinatorial theorem which generalizes an identity of Feller and applies it to the study of returns to the origin for the symmetric random walk on ℤ.
We present a combinatorial theorem which generalizes an identity of Feller and applies it to the study of returns to the origin for the symmetric random walk on ℤ.
In comparison to PI and PID controllers, a higher order “advanced” controller is shown to improve the performance of an experimental robot for speed and position control applications. The advanced controller attains...
详细信息
In comparison to PI and PID controllers, a higher order “advanced” controller is shown to improve the performance of an experimental robot for speed and position control applications. The advanced controller attains a higher bandwidth, lower settling time and better disturbance rejection, while the increased performance costs little in sensor noise amplification.
On the basis of Ref.\, the M x/G(M/G)/1 repairable queueing system with single delay vacation is discussed again. The following reliability problems of the service station are studied: (a) The probability that it fai...
详细信息
On the basis of Ref.\, the M x/G(M/G)/1 repairable queueing system with single delay vacation is discussed again. The following reliability problems of the service station are studied: (a) The probability that it fails at time t , i.e. its unavailability; (b) The expected failure number during the time interval (0,t\];; (c) The expected failure number during the ″server busy period″; (d) The expected downtime during the time interval (0,t\]. Some reliability results of the service station are obtained. These results would be interest to reliability analysts.
In this paper we show that any two-party functionality canbe securely computed in a constant number of rounds, where security isobtained against malicious adversaries that may arbitrarily deviate fromthe protocol spec...
详细信息
暂无评论