Frequently cutting restriction enzymes: Clearing the fog to see the ends

Telomeres, which are found at the ends of eukaryotic chromosomes, are composed of tandem arrays of repetitive sequences and safeguard genomic stability. Previous studies have revealed that telomeric repeats are also present at internal chromosomal loci in many eukaryotes. However, the biological role of these interstitial telomeric sequences (ITSs) remains unknown. The integrity of telomeric length and chromatin structure is required for telomere stability. However, the study of these telomeric features can be impeded by the presence of ITSs. Frequently cutting restriction enzymes have been revealed to be very useful tools for the study of the length and chromatin structure of telomeres independent of the presence of ITSs.

Oral mucositis induced by risperidone:rare side effect of a frequently prescribed medication

Risperidone is a safe second-generation antipsychotic which is rarely associated with the emergence of a few adverse effects,such as oral lesions and stomatitis.We report the case of a 77-year-old woman affected by a neurocognitive disorder with psychotic features and treated with risperidone 2 mg/day.After 1 week,she showed a burning mouth syndrome with oral lesions and risperidone was discontinued.Antipsychotic-induced oral ulcerations may be caused by the reduction of saliva protection with minor adverse effects related to oral movement disorders or impairment of the bacterial flora of saliva.

THE THEOREM OF THE STABILITY OF LINEAR NONAUTONOMOUS SYSTEMS UNDER THE FREQUENTLY-ACTING PERTURBATION AND ITS APPLICATION IN THE STABILITY ANALYSIS OF ROBOT

The necessary and sufficient condition of the stability of linear nonautonomous system under the frequently-acting perturbation has been given and proved on the basis of[1] and [2], and the theorem of the equivalence on the uniform and asymptotical stability in the sense of Liapunov ami the stability under the frequently-acting perturbation of linear nonautonomous system has been given in this paper. Besides, the analysis of the dynamic stabilitv of robot has been presented by applying the theorem in this paper, which is closer to reality

THE THEOREM OF THE STABILITY OF NONLINEAR NONAUTONOMOUS SYSTEMS UNDER THE FREQUENTLY-ACTING PERTURBATION—LIAPUNOV’S INDIRECT METHOD

In this paper the stability of nonlinear nonautonomous systems under the frequently-acting perturbation is studied. This study is a forward development of the study of the stability in the Liapunov sense; furthermore, it is of significance in practice since perturbations are often not single in the time domain. Malkin proved a general theorem about thesubject. To apply the theorem, however, the user has to construct a Liapunov function which satisfies specified conditions and it is difficult to find such a function for nonlinear nonautonomous systems. In the light of the principle of Liapunov's indirect method, which is an effective method to decide the stability of nonlinear systems in the Liapunov sense, the authors have achieved several important conclusions expressed in the form of theorems to determine the stability of nonlinear nonautonomous systems under the frequently-acting perturbation.

Frequently Asked Questions About Ancient Olympics

1.Where did the Olympic gamescome from?There are many different stories about the be-ginning of the Olympics.One myth says that the guardians of the infantgod Zeus held the first footrace,or that Zeus himselfstarted the Games to celebrate his victory over his fa-ther Cronus for control of the world.Another tradi-tion states that after the Greek hero Pelops won achariot race against King Oenomaus to marry Oeno-

A related degree-based frequent pattern mining algorithm for railway fault data

It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm.However,high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale up.In the context of such needs,we propose a related degree-based frequent pattern mining algorithm,named Related High Utility Quantitative Item set Mining(RHUQI-Miner),to enable the effective mining of railway fault data.The algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees,reducing redundancy and invalid frequent patterns.Subsequently,it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the algorithm.The experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process,thus providing data support for differentiated and precise maintenance strategies.

New algorithm of mining frequent closed itemsets

A new algorithm based on an FC-tree （frequent closed pattern tree） and a max-FCIA （maximal frequent closed itemsets algorithm） is presented, which is used to mine the frequent closed itemsets for solving memory and time consuming problems. This algorithm maps the transaction database by using a Hash table,gets the support of all frequent itemsets through operating the Hash table and forms a lexicographic subset tree including the frequent itemsets.Efficient pruning methods are used to get the FC-tree including all the minimum frequent closed itemsets through processing the lexicographic subset tree.Finally,frequent closed itemsets are generated from minimum frequent closed itemsets.The experimental results show that the mapping transaction database is introduced in the algorithm to reduce time consumption and to improve the efficiency of the program.Furthermore,the effective pruning strategy restrains the number of candidates,which saves space.The results show that the algorithm is effective.

Double-layer Bayesian Classifier Ensembles Based on Frequent Itemsets

Numerous models have been proposed to reduce the classification error of Naive Bayes by weakening its attribute independence assumption and some have demonstrated remarkable error performance. Considering that ensemble learning is an effective method of reducing the classifmation error of the classifier, this paper proposes a double-layer Bayesian classifier ensembles （DLBCE） algorithm based on frequent itemsets. DLBCE constructs a double-layer Bayesian classifier （DLBC） for each frequent itemset the new instance contained and finally ensembles all the classifiers by assigning different weight to different classifier according to the conditional mutual information. The experimental results show that the proposed algorithm outperforms other outstanding algorithms.

Accurate querying of frequent subgraphs in power grid graph data

With the development of information technology, the amount of power grid topology data has gradually increased. Therefore, accurate querying of this data has become particularly important. Several researchers have chosen different indexing methods in the filtering stage to obtain more optimized query results because currently there is no uniform and efficient indexing mechanism that achieves good query results. In the traditional algorithm, the hash table for index storage is prone to "collision" problems, which decrease the index construction efficiency. Aiming at the problem of quick index entry, based on the construction of frequent subgraph indexes, a method of serialized storage optimization based on multiple hash tables is proposed. This method mainly uses the exploration sequence to make the keywords evenly distributed; it avoids conflicts of the stored procedure and performs a quick search of the index. The proposed algorithm mainly adopts the "filterverify" mechanism; in the filtering stage, the index is first established offline, and then the frequent subgraphs are found using the "contains logic" rule to obtain the candidate set. Experimental results show that this method can reduce the time and scale of candidate set generation and improve query efficiency.

A New Algorithm for Mining Frequent Pattern

Mining frequent pattern in transaction database, time series databases, and many other kinds of databases have been studied popularly in data mining research. Most of the previous studies adopt Apriori like candidate set generation and test approach. However, candidate set generation is very costly. Han J. proposed a novel algorithm FP growth that could generate frequent pattern without candidate set. Based on the analysis of the algorithm FP growth, this paper proposes a concept of equivalent FP tree and proposes an improved algorithm, denoted as FP growth * , which is much faster in speed, and easy to realize. FP growth * adopts a modified structure of FP tree and header table, and only generates a header table in each recursive operation and projects the tree to the original FP tree. The two algorithms get the same frequent pattern set in the same transaction database, but the performance study on computer shows that the speed of the improved algorithm, FP growth * , is at least two times as fast as that of FP growth.

An Efficient Hybrid Algorithm for Mining Web Frequent Access Patterns

We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database. Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree. The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency.

Model test and numerical simulation on the dynamic stability of the bedding rock slope under frequent microseisms

Shake table testing was performed to investigate the dynamic stability of a mid-dip bedding rock slope under frequent earthquakes. Then, numerical modelling was established to further study the slope dynamic stability under purely microseisms and the influence of five factors, including seismic amplitude, slope height, slope angle, strata inclination and strata thickness, were considered. The experimental results show that the natural frequency of the slope decreases and damping ratio increases as the earthquake loading times increase. The dynamic strength reduction method is adopted for the stability evaluation of the bedding rock slope in numerical simulation, and the slope stability decreases with the increase of seismic amplitude, increase of slope height, reduction of strata thickness and increase of slope angle. The failure mode of a mid-dip bedding rock slope in the shaking table test is integral slipping along the bedding surface with dipping tensile cracks at the slope rear edge going through the bedding surfaces. In the numerical simulation, the long-term stability of a mid-dip bedding slope is worst under frequent microseisms and the slope is at risk of integral sliding instability, whereas the slope rock mass is more broken than shown in the shaking table test. The research results are of practical significance to better understand the formation mechanism of reservoir landslides and prevent future landslide disasters.

On-site stormwater detention for Australian development projects: Does it meet frequent flow management objectives?

On-site stormwater detention (OSD) is a conventional component of urban drainage systems, designed with the intention of mitigating the increase to peak discharge of stormwater runoff that inevitably results from urbanization. In Australia, singular temporal patterns for design storms have governed the inputs of hydrograph generation and in turn the design process of OSD for the last three decades. This paper raises the concern that many existing OSD systems designed using the singular temporal pattern for design storms may not be achieving their stated objectives when they are assessed against a variety of alternative temporal patterns. The performance of twenty real OSD systems was investigated using two methods:(1) ensembles of design temporal patterns prescribed in the latest version of Australian Rainfall and Runoff, and (2) real recorded rainfall data taken from pluviograph stations modeled with continuous simulation. It is shown conclusively that the use of singular temporal patterns is ineffective in providing assurance that an OSD will mitigate the increase to peak discharge for all possible storm events. Ensemble analysis is shown to provide improved results. However, it also falls short of providing any guarantee in the face of naturally occurring rainfall.

A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining

Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a novel algorithm updating for global frequent patterns-IPARUC. A rapid clustering method is introduced to divide database into n parts in IPARUC firstly, where the data are similar in the same part. Then, the nodes in the tree are adjusted dynamically in inserting process by ＂pruning and laying back＂ to keep the frequency descending order so that they can be shared to approaching optimization. Finally local frequent itemsets mined from each local dataset are merged into global frequent itemsets. The results of experimental study are very encouraging. It is obvious from experiment that IPARUC is more effective and efficient than other two contrastive methods. Furthermore, there is significant application potential to a prototype of Web log Analyzer in web usage mining that can help us to discover useful knowledge effectively, even help managers making decision.

A novel algorithm for frequent itemset mining in data warehouses

Current technology for frequent itemset mining mostly applies to the data stored in a single transaction database. This paper presents a novel algorithm MultiClose for frequent itemset mining in data warehouses. MultiClose respectively computes the results in single dimension tables and merges the results with a very efficient approach. Close itemsets technique is used to improve the performance of the algorithm. The authors propose an efficient implementation for star schemas in which their al- gorithm outperforms state-of-the-art single-table algorithms.

Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization

A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset(BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial particles was designed to ensure the reasonable initial fitness, and then, the dynamically dimensionality cutting of dataset was built to decrease the search space. Based on four high-dimensional datasets, BPSO-HD was compared with Apriori to test its reliability, and was compared with the ordinary BPSO and quantum swarm evolutionary(QSE) to prove its advantages. The experiments show that the results given by BPSO-HD is reliable and better than the results generated by BPSO and QSE.

Mining Maximal Frequent Patterns in a Unidirectional FP-tree

Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model only finds out the maximal frequent patterns, which can generate all frequent patterns. FP-growth algorithm is one of the most efficient frequent-pattern mining methods published so far. However, because FP-tree and conditional FP-trees must be two-way traversable, a great deal memory is needed in process of mining. This paper proposes an efficient algorithm Unid_FP-Max for mining maximal frequent patterns based on unidirectional FP-tree. Because of generation method of unidirectional FP-tree and conditional unidirectional FP-trees, the algorithm reduces the space consumption to the fullest extent. With the development of two techniques: single path pruning and header table pruning which can cut down many conditional unidirectional FP-trees generated recursively in mining process, Unid_FP-Max further lowers the expense of time and space.

Frequent Itemset Mining of User’s Multi-Attribute under Local Differential Privacy

Frequent itemset mining is an essential problem in data mining and plays a key role in many data mining applications.However,users’personal privacy will be leaked in the mining process.In recent years,application of local differential privacy protection models to mine frequent itemsets is a relatively reliable and secure protection method.Local differential privacy means that users first perturb the original data and then send these data to the aggregator,preventing the aggregator from revealing the user’s private information.We propose a novel framework that implements frequent itemset mining under local differential privacy and is applicable to user’s multi-attribute.The main technique has bitmap encoding for converting the user’s original data into a binary string.It also includes how to choose the best perturbation algorithm for varying user attributes,and uses the frequent pattern tree(FP-tree)algorithm to mine frequent itemsets.Finally,we incorporate the threshold random response(TRR)algorithm in the framework and compare it with the existing algorithms,and demonstrate that the TRR algorithm has higher accuracy for mining frequent itemsets.

GTK:A Hybrid-Search Algorithm of Top-Rank-k Frequent Patterns Based on Greedy Strategy

Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining efficiency.Aiming at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this paper.In this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long patterns.The short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been joined.On the basis of the short patterns satisfying specific conditions,the long patterns are extracted through level-wise-search.To reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of candidates.This algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational speed.Real datasets and synthetic datasets are adopted in experiments to evaluate the proposed algorithm.The experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.