Search

Geographic information sharing and service plays an important role in the implement of Digital City. The traditional development model that is based on common geographic information system can not accommodate for the geographic information sharing and service in distributed web environment. In this article, we firstly introduce the requirement of the distributed geographic information sharing and service and the character of service-oriented software architecture. Then the principle of the service-oriented architecture and the service-oriented geographic information sharing and service software architecture for digital city is put forward which includes GIS service, called VGS (Virtual GIS Services) and AGS(Application GIS Services) which reflects the operation service upper the VGS. At last, the web service based model integration in SOA is introduced. And an application example is stated to demonstrate the advantage and application model of the service-oriented geographic information sharing and service software architecture, which is the ocean current numerical simulation model call based on web service. The development and deployment of the model services example was used in Xiamen City, China. [ABSTRACT FROM AUTHOR]

The adaptive disparity filter is refined, along with the monocular feature filter designed based on neuron dynamics, and a new stereopsis model is set up in this study. The disparities of the matched binocular features in stereo image pair are detected by the adaptive disparity filter, and removed by the monocular feature filter, only leaving those unmatched monocular features to be added to all depth planes determined by the disparities of the matched binocular features. Finally, visible surface perception is generated by the closed boundaries in the corresponding depth plane during the filling-in processing. By the above mechanism, the depth perception of surfaces in the occluded scenic images is realized, also, the figure-ground segmentation. Keywords: Neuron Dynamics, Stereo Vision, Occlude, Disparity Filter, Monocular Feature Filter, FACADE Theory. [ABSTRACT FROM AUTHOR]

This paper proposed a fault monitoring policy for hierarchical network with multi-manager. It can be used to monitor the network in real time and lightened the burden of the network monitoring management. With the application of the multi-agent Markov Decision Processes in the network management, an appropriate policy model of SNMP polling with the reinforcement learning is given. The simulations results show that the reinforcement-learning model can provide effective fault localization meanwhile decrease the overhead of network management remarkably. [ABSTRACT FROM AUTHOR]

In our continuing work on "Blind Signal Separation" this paper focuses on extending our previous work [1] by creating a data set that can successfully perform blind separation of polyphonic signals containing similar instruments playing similar notes in a noisy environment. Upon isolating and subtracting the dominant signal from a base signal containing varying types and amounts of noise, even though we purposefully excluded any identical matches in the dataset, the signal separation system successfully built a resulting foreign set of synthesized sounds that the classifier correctly recognized. Herein, this paper presents a system that classifies and separates two harmonic signals with added noise. This novel methodology incorporates Knowledge Discovery, MPEG7-based segmentation and Inverse Fourier Transforms. [ABSTRACT FROM AUTHOR]

A large number of J2EE applications use entity beans as their application persistence mechanism, while current J2EE scheduling to entity beans is still a simple First-Come First-Served (FCFS) policy. Due to this simple policy, the scheduling does not distinguish the key transactions from the trivial ones. A task-type aware scheduling algorithm should be adopted to provide better service for key transactions. However, some characteristics of J2EE middleware transaction processing, such as the absence of necessary scheduling information and the interactive executing model, made it impossible to apply the traditional priority-driven scheduling algorithms. This paper puts forward a scheduling algorithm named TMPBP, which offers a new dynamic priority assignment algorithm HRS that can recognize the key tasks at runtime heuristically. Additionally, TMPBP add some extra techniques to the traditional concurrency control policies according to the features of J2EE. The algorithm is proven to be safe and will not produce starvation or priority inversion. The experimental evaluations indicated that TMPBP improves the Quality of Service (QoS) of key tasks effectively, especially when the server is under a heavy load. [ABSTRACT FROM AUTHOR]

In recent years, a few researchers have challenged past dogma and suggested methods (such as the IC algorithm) for inferring causal relationship among variables using steady state observations. In this paper, we present a modified IC (mIC) algorithm that uses entropy to test conditional independence and combines the steady state data with partial prior knowledge of topological ordering in gene regulatory network, for jointly learning the causal relationship among genes. We evaluate our mIC algorithm using the simulated data. The results show that the precision and recall rates are significantly improved compared with using IC algorithm. Finally, we apply the mIC algorithm to microarray data for melanoma. The algorithm identified the important causal relations associated with WNT5A, a gene playing an important role in melanoma, verified by the literatures. [ABSTRACT FROM AUTHOR]

An algorithm for alternate pattern fill on arbitrary line segments, circular arcs and elliptical arcs is proposed in this paper. The algorithm creates an external loop which is a minimal loop that contains a given point. And then, all loops that delimit the nested regions for the alternate pattern fill inside the external loop are built. The loop detection is based on a new method for searching the leftmost edges. It requires only values of positions, tangent vectors, curvature radii, and the first derivatives of curvature radii at intersection points and areas of circles and ellipses. After all necessary loops are built, the given pattern is filled in the nested loops inside the external loop. Filling the given pattern in this paper is simplified into filling line segment patterns on some parallel lines. [ABSTRACT FROM AUTHOR]

Complementary DNA (cDNA) library construction is a foundational technique for various organism genome projects and molecular biological approaches. Numerous methods for generating a cDNA library have been applied for different purposes. To profile the gene expression of a given tissue or cells, the researchers often used an oligo-(dT) primed and directional cloned strategy for generating cDNA libraries, and then DNA sequencing to characterize novel genes from those libraries (1-6). The cDNA library derived from the strategy may contain more abundance gene species without significant bias because polymerase chain reaction (PCR) is not usually used for amplifying the double-strain cDNA. However, the strategy needs more sample and abundant message RNA. If there is only a little mRNA, the PCR-based method must been adopted in cDNA library construction. Recently, some researchers utilized cap structure at the 5′ end of eukaryotic mRNA to design novel methods for PCR-based cDNA library construction (7-11). Moreover, the strategy has been applied to identifying gene expression and isolating full-length cDNA (12-14). In our laboratory, the conventional and PCR-based strategies have been utilized for generating some libraries from massive sample (human liver cancer, hypothalamus, pituitary, adrenal gland) and a small amount of RNA (human CD34+ cells), respectively. [ABSTRACT FROM AUTHOR]