20501265
Efficient symplectic Runge-Kutta methods
The present paper continues the research in [H.Y. Liu, G. Sun, Symplectic RK methods and symplectic PRK methods with real eigenvalues, J. Comput. Math. 22(5) (2004) 769-776] on symplectic Runge-Kutta (RK) methods with real eigenvalues. In a general setting, a new but simple proof of the main result in [H.Y. Liu, G. Sun, Symplectic RK methods and symplectic PRK methods with real eigenvalues, J. Comput. Math. 22(5) (2004) 769-776] is given that an s-stage, pth order such method must have that p=
34797702
Implicit Runge–Kutta methods based on Lobatto quadrature formula
Using W-transformation of Hairre and Wanner, high-order implicit Runge–Kutta (RK) methods based on Lobatto quadrature are studied. Methods constructed and presented include and extend the existing Lobatto III type RK methods. Two to four stages general Lobatto III methods with three parameters α, β, γ are constructed, and a particular one-parameter family Lobatto III C(γ) method is also presented.
16336933
Adaptive Video Watermarking Scheme
In this paper, a new adaptive watermarking scheme for uncompressed and compressed video is presented. The proposed method embeds the watermark in DC components by quantizing DC coefficients to reference values, instead of embedding the watermark in AC components. To increase robustness and perceptual invisibility, adaptive quantization control strategy (AQCS) and error compensation strategy (ECS) are introduced. Experimental results demonstrate the proposed watermarking scheme is robust and invisible, and is feasible for real time system implementation.
9665104
What would they think?: a computational model of attitudes
A key to improving at any task is frequent feedback from people whose opinions we care about: our family, friends, mentors, and the experts. However, such input is not usually available from the right people at the time it is needed most, and attaining a deep understanding of someone else's perspective requires immense effort. This paper introduces a technological solution.We present a novel method for automatically modeling a person's attitudes and opinions, and a proactive interface called "What Would They Think?" which offers the just-in-time perspectives of people whose opinions we care about, based on whatever the user happens to be reading or writing. In the application, each person is represented by a "digital persona," generated from an automated analysis of personal texts (e.g. weblogs and papers written by the person being modeled) using natural language processing and commonsense-based textual-affect sensing.In user studies, participants using our application were able to grasp the personalities and opinions of a panel of strangers more quickly and deeply than with either of two baseline methods. We discuss the theoretical and pragmatic implications of this research to intelligent user interfaces.
14573187
Feature Selection for Classification
Feature selection has been the focus of interest for quite some time and much work has been done. With the creation of huge databases and the consequent requirements for good machine learning techniques, new problems arise and novel approaches to feature selection are in demand. This survey is a comprehensive overview of many existing methods from the 1970's to the present. It identifies four steps of a typical feature selection method, and categorizes the different existing methods in terms of generation procedures and evaluation functions, and reveals hitherto unattempted combinations of generation procedures and evaluation functions. Representative methods are chosen from each category for detailed explanation and discussion via example. Benchmark datasets with different characteristics are used for comparative study. The strengths and weaknesses of different methods are explained. Guidelines for applying feature selection methods are given based on data types and domain characteristics. This survey identifies the future research areas in feature selection, introduces newcomers to this field, and paves the way for practitioners who search for suitable methods for solving domain-specific real-world applications.
207609303
Discretization: An Enabling Technique
Discrete values have important roles in data mining and knowledge discovery. They are about intervals of numbers which are more concise to represent and specify, easier to use and comprehend as they are closer to a knowledge-level representation than continuous values. Many studies show induction tasks can benefit from discretization: rules with discrete values are normally shorter and more understandable and discretization can lead to improved predictive accuracy. Furthermore, many induction algorithms found in the literature require discrete features. All these prompt researchers and practitioners to discretize continuous features before or during a machine learning or data mining task. There are numerous discretization methods available in the literature. It is time for us to examine these seemingly different methods for discretization and find out how different they really are, what are the key components of a discretization process, how we can improve the current level of research for new development as well as the use of existing methods. This paper aims at a systematic study of discretization methods with their history of development, effect on classification, and trade-off between speed and accuracy. Contributions of this paper are an abstract description summarizing existing discretization methods, a hierarchical framework to categorize the existing methods and pave the way for further development, concise discussions of representative discretization methods, extensive experiments and their analysis, and some guidelines as to how to choose a discretization method under various circumstances. We also identify some issues yet to solve and future research for discretization.
13995613
DNAFSMiner: a web-based software toolbox to recognize two types of functional sites in DNA sequences
UNLABELLED
DNAFSMiner (DNA Functional Sites Miner) is a web-based software toolbox to recognize functional sites in nucleic acid sequences. Currently in this toolbox, we provide two software: TIS Miner and Poly(A) Signal Miner. The TIS Miner can be used to predict translation initiation sites in vertebrate DNA/mRNA/cDNA sequences, and the Poly(A) Signal Miner can be used to predict polyadenylation [poly(A)] signals in human DNA sequences. The prediction results are better than those by literature methods on two benchmark applications. This good performance is mainly attributable to our unique learning method. DNAFSMiner is available free of charge for academic and non-profit organizations.


AVAILABILITY
http://research.i2r.a-star.edu.sg/DNAFSMiner/


CONTACT
huiqing@i2r.a-star.edu.sg.