Beginning Database-Driven Application Development in Java™ EE
Using GlassFish™
Page
%P
77 Result(s)
within
Yuli **e
Computer Science
-
Chapter and Conference Paper
A theory for rule triggering systems
We define and study the family of RTS's, each appearing in the form of a relational database extended with a set of production-like rules with forward-chained operational semantics.
-
Chapter and Conference Paper
Domain theory for nonmonotonic functions
We prove several lattice theoretical fixpoint theorems based on the classical theorem of Knaster and Tarski. These theorems give sufficient conditions for a system of generally nonmonotonic functions on a comp...
-
Article
Stability of general neural networks with reaction-diffusion
By constructing average Lyapunov functions, general neural networks (Cohen-Grossberg’s model) with reaction-diffusion are analyzed. A series of constructively algebraic criteria are presented. And, the existin...
-
Chapter and Conference Paper
Salient Objects: Semantic Building Blocks for Image Concept Interpretation
Interpreting semantic image concepts via their dominant compounds is a promising approach to achieve effective image retrieval via keywords. In this paper, a novel framework is proposed by using the salient ob...
-
Chapter and Conference Paper
Multimodal Salient Objects: General Building Blocks of Semantic Video Concepts
In this paper, we propose a novel video content representation framework to achieve a middle-level understanding of video contents by using multimodal salient objects. Specifically, this framework includes: (a) A...
-
Article
Stabilization of stochastic Hopfield neural network with distributed parameters
In this paper, the stability of stochastic Hopfield neural network with distributed parameters is studied. To discuss the stability of systems, the main idea is to integrate the solution to systems in the spac...
-
Chapter and Conference Paper
A Novel Approach for Underdetermined Blind Sources Separation in Frequency Domain
In this paper, we discussed the separation of n sources from m linear mixture when the underlying system is underdetermined, that is, when m < n. The underdetermined blind sources separation has two steps. In mat...
-
Chapter and Conference Paper
FIR Convolutive BSS Based on Sparse Representation
Based on sparse representation, this paper discusses convolutive BSS of sparse sources and presents a FIR convolutive BSS algorithm that works in the frequency domain. This algorithm does not require that sour...
-
Article
On the new results of global attractive set and positive invariant set of the Lorenz chaotic system and the applications to chaos control and synchronization
Constructing a family of generalized Lyapunov functions, a new method is proposed to obtain new global attractive set and positive invariant set of the Lorenz chaotic system. The method we proposed greatly sim...
-
Article
Sparse representation and blind source separation of ill-posed mixtures
Bofill et al. discussed blind source separation (BSS) of sparse signals in the case of two sensors. However, as Bofill et al. pointed out, this method has some limitation. The potential function they introduced i...
-
Chapter
A Novel Framework for Semantic Image Classification and Benchmark Via Salient Objects
Interpreting semantic image concepts via their dominant compounds is a promising approach to achieve effective image retrieval via key words. In this chapter, a novel framework is proposed by using the salient...
-
Chapter and Conference Paper
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (in some locally optimal manner) o...
-
Chapter and Conference Paper
Fluorescence Model of 3-SAT in DNA Computing
DNA computing has been proposed to solve the famous “SAT” problem of computer science since Adleman shows that DNA strands can be used to solve an instance of the NP-complete Hamiltonian path problem (HPP). Ba...
-
Article
Searching-and-averaging method of underdetermined blind speech signal separation in time domain
Underdetermined blind signal separation (BSS) (with fewer observed mixtures than sources) is discussed. A novel searching-and-averaging method in time domain (SAMTD) is proposed. It can solve a kind of problem...
-
Book
-
Chapter and Conference Paper
A Novel Approach for Filtering Junk Images from Google Search Results
Keyword-based image search engines such as Google Images are now very popular for accessing large amount of images on the Internet. Because only the text information that are directly or indirectly linked to t...
-
Chapter and Conference Paper
New Approach for Hierarchical Classifier Training and Multi-level Image Annotation
In this paper, we have proposed a novel algorithm to achieve automatic multi-level image annotation by incorporating concept ontology and multi-task learning for hierarchical image classifier training. To achi...
-
Article
Globally exponentially attractive sets of the family of Lorenz systems
In this paper, the concept of globally exponentially attractive set is proposed and used to consider the ultimate bounds of the family of Lorenz systems with varying parameters. Explicit estimations of the ult...
-
Article
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
In this paper we address the problem of efficiently computing all the eigenvalues of a large N×N Hermitian matrix modified by a possibly non Hermitian perturbation of low rank. Previously proposed fast adaptation...
-
Article
Adaptive blind separation of underdetermined mixtures based on sparse component analysis
The independence priori is very often used in the conventional blind source separation (BSS). Naturally, independent component analysis (ICA) is also employed to perform BSS very often. However, ICA is difficult ...
