32974423
OSNET - A Language for Domain Modeling
$EVWUDFW 'RPDLQ DQDO\VLV DQG GRPDLQ PRGHOLQJ KDV EHHQ SURYHG WR EH DQ LPSRUWDQW WHFKQLTXH IRU DFFHOHUDWLQJ DSSOLFDWLRQ GHYHORSPHQW 7KH PDMRU VWHS LQ WKLV SURFHVV LV WR FRQYHUW UHTXLUHPHQW VSHFLILFDWLRQ LQWR DQ DSSURSULDWH FRQFHSWXDO PRGHO RI WKH ZDQWHG DSSOLFDWLRQ VRIWZDUH 7KH IRUPHU LV XVXDOO\ JLYHQ LQ VRPH IRUP RI QDWXUDO ODQJXDJH RU SVHXGR QDWXUDO ODQJXDJH 7KH ODWWHU FDQ EH UHSUHVHQWHG LQ RQH RI YDULRXV FRQFHSWXDO PRGHOLQJ ODQJXDJHV HLWKHU JUDSKLF RU V\PEROLF 2QH RI WKH PDMRU SUREOHPV RQH HQFRXQWHUV LQ WKLV SURFHVV LV WKH ELJ JDS EHWZHHQ WKH IRUPDW RI UHTXLUHPHQW VSHFLILFDWLRQ DQG WKDW RI FRQFHSWXDO PRGHOLQJ ,Q RUGHU WR HDV\ WKLV WUDQVIRUP SURFHVV ZH SURSRVH LQ WKLV SDSHU D QHZ W\SH RI FRQFHSWXDO PRGHOLQJ ODQJXDJH 261(7 ZKLFK FRPELQHV WKH VHPDQWLF QHWZRUN UHSUHVHQWDWLRQ ZLWK 2EMHFW 2ULHQWHG SDUDGLJP 7KXV LW KDV ERWK DGYDQWDJHV RI UHSUHVHQWLQJ QDWXUDO ODQJXDJH VW\OH VSHFLILFDWLRQ DQG 2EMHFW 2ULHQWHG VW\OH LPSOHPHQWDWLRQ 261(7 KDV EHHQ LPSOHPHQWHG DQG XVHG LQ RXU SURMHFWV IRU GHYHORSLQJ NQRZOHGJH EDVHG VRIWZDUH SURWRW\SLQJ WRROV .H\ZRUGV 2EMHFW 2ULHQWHG NQRZOHGJH UHSUHVHQWDWLRQ VHPDQWLF QHWZRUN UHSUHVHQWDWLRQ
116588251
On-line evolutionary exponential family mixture
This paper deals with evolutionary clustering, which refers to the problem of clustering data with distribution drifting along time. Starting from a density estimation view to clustering problems, we propose two general on-line frameworks. In the first framework, i.e., historical data dependent (HDD), current model distribution is designed to approximate both current and historical data distributions. In the second framework, i.e., historical model dependent (HMD), current model distribution is designed to approximate both current data distribution and historical model distribution. Both frameworks are based on the general exponential family mixture (EFM) model. As a result, all conventional clustering algorithms based on EFMs can be extended to evolutionary setting under the two frameworks. Empirical results validate the two frameworks.
26669443
Bottom-up discovery of frequent rooted unordered subtrees
In the past decade, XML has emerged as the standard language for information exchanging over the Internet. Due to its tree-structure paradigm, XML is superior for its capability of storing, querying, and manipulating complex data. Therefore, discovering frequent tree patterns over tree-structured data has become an interesting topic for XML data management. In this paper, we propose a tree mining algorithm, named BUXMiner, for finding a special class of frequent trees, called rooted unordered trees, from a tree-structured database. BUXMiner employs an efficient bottom-up approach to enumerate all candidate trees over a compact global tree guide and computes the frequent trees based on the tree guide. In addition to BUXMiner, we also propose a mining approach called BUMXMiner to discover the maximal frequent rooted unordered trees. We compare BUXMiner with previous tree-structure mining algorithms, namely XQPMinerTID and FastXMiner, which were also proposed to discover rooted unordered trees. The experimental results show that our algorithm outperforms XQPMinerTID and FastXMiner in terms of efficiency. The performance results from real-world applications also indicate the usefulness of our proposed tree mining algorithms in a variety of web applications, such as analysis of web page access patterns and mining frequent XML query patterns for caching.
8340253
UGE4B: An Universal Grid Environment for Bioinformatics Research
Recent years, grid technology has been used widely in the fields of scientific research. In this paper, we present a universal grid environment for bioinformatics research (UGE4B). Although there have been several similar projects successfully constructed in the world, we need to meet some unique requirements from bioinformatics research in China. UGE4B consists of 6 components, including portal, task management, data management, information server, security and computing node. As a national-wide bioinformatics research platform, UGE4B is built through interconnecting multiple sub grids provided by each bioinformatics institutes. Besides provides a universal portal to end users for bioinformatics computing and data accessing, UGE4B also supported some special bioinformatics applications
8051159
A Web-based Framework For On-line Collaborative Learning
This paper presents a framework for design of online courses and collaborative learning based on Web technologies. It provides the following features: construction of structured learning materials in a distributed environment; personalization of course contents in the run-time that adapts to the progress of individual students; it can supply relevant Web resources to the students by analyzing the learning history dynamically; students in a group could exchange their learning experiences and discover relevant knowledge via the communication channels provided by the framework. The proposed techniques could be deployed to a variety of online computer-assisted modules to improve the effectiveness of Web-based e-learning
5747087
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis where smooth and natural motion sequences are often required to be generated from existing motion sequences. We first address this problem by defining it as a problem of l-e-join over two time series. Given two time series, the goal of l-e-join is to find those non-trivial matching subsequences by detecting maximal l-connections from the e-matching matrix of the two time series. Given a querying motion sequence, the l-e-join can be applied to retrieve all connectable motion sequences from a database of motion sequences. To support efficient l-e-join of time series, we propose a two-step filter-and-refine algorithm, called Warping Time Series Join (WTSJ) algorithm. The filtering step serves to prune those sparse regions of the e-matching matrix where there are no maximal l-connections without incurring costly computation. The refinement step serves to detect closed l-connections within regions that cannot be pruned by the filtering step. To speed up the computation of e-matching matrix, we propose a block-based time series summarization method, based on which the block-wise e-matching matrix is first computed. Lots of pairwise distance computation of elements can then be avoided by applying the filtering algorithm on the block-wise e-matching matrix.Extensive experiments on l-e-join of motion capture sequences are conducted. The results confirm the efficiency and effectiveness of our proposed algorithm in processing l-e-join of motion capture time series.
16070632
Prototyping system of codec for novel 2-D continuous barcode
To address the limits of capacity and the disadvantages of motional scanning capability of traditional two-dimensional (2-D) barcodes, a novel 2- D continuous barcode (2-D CoBe) with improving the structure of traditional 2-D barcodes is proposed. The novel barcode not only enable to store a large mount of data with indefinitive capacity, but also support realtime decoding. Furthermore, a prototyping system of codec including encoding sub-system and decoding sub-system is examined and implemented. In this codec system, 2-D CoBe can be generated and printed on papers by encoding software sub-system. Besides, it can be recognized and decoded by a hand-held device with decoding sub-system in real-time. Based on the experimental results of encoding binary voice data into 2-D CoBe and decoding it with a hand-held device, it is verified that the codec system for 2-D CoBe is practical and effective.
1048322
Soundness of Coercion in the Calculus of Constructions
A coercive subtyping system for the Calculus of Constructions is presented. The proposed system λC≤co is obtained essentially by adding coercions and η-conversion to λC≤, which is a subtyping extension to the Calculus of Constructions without coercions. We proved that a coercion c:A ≤ B is semantically sound. That is, (1) c is a term of type A → B; (2) c behaves like an identity function. This development follows the spirit of semantical interpretation of subtyping.
30192317
Modeling and Simulation of Continuous Time-Invariant Systems in Simulation Based Learning Environments
Simulation based learning environments are widely used in elementary and secondary science education. However, a large number of these learning environments are domain-dependent so that they are only useful in some special domains. In this paper, we put forward a new method of simulating continuous time-invariant systems by using frame based knowledge representation and interpretive structural modeling. This method is helpful to realize the separation of knowledge representation and simulation program, and promotes the reusability of a simulation based learning environment.
15892947
Torsional Pile Subjected to Transient Loading in Viscoelastic Poroelastic Medium
Considering viscoelastic saturated soil, The transient dynamic response of an elastic pile is studied. The pile-soil system is divided into thin layers, the control equations of the soil are solved respectively by using Laplace transform. Considering the mixed boundary-value conditions at the interface of pile and soil, expression is derived to describe the relationship between the inner force and the displacement of the pile segment. Then the expressions of all pile segments are integrated to form the stiffness matrix of pile. Considering the transient torsional loading at the pile head, the pile displacement in time domain is calculated by numerical method, with the result showing the influence of various pile parameters.
33123759
Assessment of Color Video Quality Based on Quaternion Singular Value Decomposition
Measurement of visual quality is of fundamental importance for numerous video processing applications. In this paper, we proposed a full-reference color video quality assessment based on quaternion singular value decomposition(QSVD), which takes into account the luminance, chrominance and gradient information of each pixel and treats them as a whole. The algorithm is tested on the video quality experts group (VQEG) Phase I FR-TV test dataset. Experiments show that it has good correlation with perceived video quality.