Mining Maximal Frequent Patterns in a Unidirectional FP-tree
SONG Jing-jing; LIU Rui-xin; WANG Yan; JIANG Bao-qing
2006-01-01
Becausemining 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.
Xu, Xin
2017-06-01
Numerous fuzzy pattern mining methods have been proposed to address the uncertainty and incompleteness of quantitative data. Traditional fuzzy pattern mining methods generally have to transform the original quantitative values into either crystal items or fuzzy regions first, which is hard to apply without comprehensive domain knowledge. In addition, existing numerical pattern mining methods generally suffer high computational cost. Inspired by the above problems, we put forward an efficient maximal approximate numerical frequent pattern mining (MANFPM) method without fuzzy item or region specification. Experimental results have validated its scalability and effectiveness for application in emitter entity resolution.
Maximal Frequent Itemset Generation Using Segmentation Apporach
M.Rajalakshmi
2011-09-01
Full Text Available Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining.Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequentitemsets. When the length of frequent itemsets to be found is large, the traditional algorithms find all thefrequent itemsets from 1-length to n-length, which is a difficult process. This problem can be solved bymining only the Maximal Frequent Itemsets (MFS. Maximal Frequent Itemsets are frequent itemsets whichhave no proper frequent superset. Thus, the generation of only maximal frequent itemsets reduces thenumber of itemsets and also time needed for the generation of all frequent itemsets as each maximal itemsetof length m implies the presence of 2m-2 frequent itemsets. Furthermore, mining only maximal frequentitemset is sufficient in many data mining applications like minimal key discovery and theory extraction. Inthis paper, we suggest a novel method for finding the maximal frequent itemset from huge data sourcesusing the concept of segmentation of data source and prioritization of segments. Empirical evaluationshows that this method outperforms various other known methods.
An Efficient Algorithm for Mining Maximal Frequent Item Sets
A. M.J.M.Z. Rahman
2008-01-01
Full Text Available Problem Statement: In today's life, the mining of frequent patterns is a basic problem in data mining applications. The algorithms which are used to generate these frequent patterns must perform efficiently. The objective was to propose an effective algorithm which generates frequent patterns in less time. Approach: We proposed an algorithm which was based on hashing technique and combines a vertical tidset representation of the database with effective pruning mechanisms. It removes all the non-maximal frequent item-sets to get exact set of MFI directly. It worked efficiently when the number of item-sets and tid-sets is more. Results: The performance of our algorithm had been compared with recently developed MAFIA algorithm and the results show how our algorithm gives better performance. Conclusions: Hence, the proposed algorithm performs effectively and generates frequent patterns faster.
Efficient Frequent Pattern Tree Construction
D.Bujji Babu
2014-03-01
Full Text Available Association rule learning is a popular and well researched technique for discovering interesting relations between variables in large databases in the area of data mining. The association rules are a part of intelligent systems. Association rules are usually required to satisfy a user-specified minimum support and a user-specified minimum confidence at the same time. Apriori and FP-Growth algorithms are very familiar algorithms for association rule mining. In this paper we are more concentrated on the Construction of efficient frequent pattern trees. Here, we present the novel frequent pattern trees and the performance issues. The proposed trees are fast and efficient trees helps to extract the frequent patterns. This paper provides the major advantages in the FP-Growth algorithm for association rule mining with using the newly proposed approach.
Fault Tolerant Frequent Pattern Mining
Shohdy, Sameh; Vishnu, Abhinav; Agrawal, Gagan
2016-12-19
FP-Growth algorithm is a Frequent Pattern Mining (FPM) algorithm that has been extensively used to study correlations and patterns in large scale datasets. While several researchers have designed distributed memory FP-Growth algorithms, it is pivotal to consider fault tolerant FP-Growth, which can address the increasing fault rates in large scale systems. In this work, we propose a novel parallel, algorithm-level fault-tolerant FP-Growth algorithm. We leverage algorithmic properties and MPI advanced features to guarantee an O(1) space complexity, achieved by using the dataset memory space itself for checkpointing. We also propose a recovery algorithm that can use in-memory and disk-based checkpointing, though in many cases the recovery can be completed without any disk access, and incurring no memory overhead for checkpointing. We evaluate our FT algorithm on a large scale InfiniBand cluster with several large datasets using up to 2K cores. Our evaluation demonstrates excellent efficiency for checkpointing and recovery in comparison to the disk-based approach. We have also observed 20x average speed-up in comparison to Spark, establishing that a well designed algorithm can easily outperform a solution based on a general fault-tolerant programming model.
2013-01-01
为了动态、准确、高效地描述用户的访问行为，实现对不同应用层分布式拒绝服务(Application-layer Distributed Denial of Service, App-DDoS)攻击行为的透明检测，该文提出基于最大频繁序列模式挖掘的ADA_MFSP(App-DDoS Detection Algorithm based on Maximal Frequent Sequential Pattern mining)检测模型。该模型在对正常Web访问序列数据库(Web Access Sequence Database, WASD)及待检测WASD进行最大频繁序列模式挖掘的基础上，引入序列比对平均异常度，联合浏览时间平均异常度、请求循环平均异常度等有效检测属性，最终实现攻击行为的异常检测。实验证明：ADA_MFSP模型不仅能有效检测各类App-DDoS攻击，且有良好的检测灵敏度。%In order to describe the user’s access behavior dynamically, efficiently and accurately, a novel detection model for Application-layer Distributed Denial of Service (App-DDoS) attack based on maximal frequent sequential pattern mining is proposed, named App-DDoS Detection Algorithm based on Maximal Frequent Sequential Pattern mining (ADA_MFSP). After mining maximal frequent sequential patterns of trained and detected Web Access Sequence Database (WASD), the model introduces sequence alignment, view time and request circulation abnormality to describe the behaviour of App-DDoS attacks, finally achieves the purpose of attack detection. It is proved with experiments that the ADA_MFSP model can not only detect kinds of App-DDoS attacks, but also has good detection sensitivity.
How to find frequent patterns?
W.H.L.M. Pijls (Wim); W.A. Koster
2005-01-01
textabstractAn improved version of DF, the depth-first implementation of Apriori, is presented. Given a database of (e.g., supermarket) transactions, the DF algorithm builds a so-called trie that contains all frequent itemsets, i.e., all itemsets that are contained in at least `minsup' transacti
Frequent Pattern Mining Algorithms for Data Clustering
Zimek, Arthur; Assent, Ira; Vreeken, Jilles
2014-01-01
that frequent pattern mining was at the cradle of subspace clustering—yet, it quickly developed into an independent research field. In this chapter, we discuss how frequent pattern mining algorithms have been extended and generalized towards the discovery of local clusters in high-dimensional data......Discovering clusters in subspaces, or subspace clustering and related clustering paradigms, is a research field where we find many frequent pattern mining related influences. In fact, as the first algorithms for subspace clustering were based on frequent pattern mining algorithms, it is fair to say....... In particular, we discuss several example algorithms for subspace clustering or projected clustering as well as point out recent research questions and open topics in this area relevant to researchers in either clustering or pattern mining...
K Sumathi; S Kannan; K Nagarajan
2013-01-01
.... In this paper, an efficient method for discovering the maximal frequent itemsets is proposed. This method employs Association array technique and depth first search technique to mine Maximal Frequent Itemset...
Parallel Frequent Pattern Discovery: Challenges and Methodology
无
2007-01-01
Parallel frequent pattern discovery algorithms exploit parallel and distributed computing resources to relieve the sequential bottlenecks of current frequent pattern mining (FPM) algorithms. Thus, parallel FPM algorithms achieve better scalability and performance, so they are attracting much attention in the data mining research community. This paper presents a comprehensive survey of the state-of-the-art parallel and distributed frequent pattern mining algorithms with more emphasis on pattern discovery from complex data (e.g., sequences and graphs) on various platforms. A review of typical parallel FPM algorithms uncovers the major challenges, methodologies, and research problems in the field of parallel frequent pattern discovery,such as work-load balancing, finding good data layouts, and data decomposition. This survey also indicates a dramatic shift of the research interest in the field from the simple parallel frequent itemset mining on traditional parallel and distributed platforms to parallel pattern mining of more complex data on emerging architectures, such as multi-core systems and the increasingly mature grid infrastructure.
Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach
Alnatsheh, Rami
2012-01-01
A problem that has been the focus of much recent research in privacy preserving data-mining is the frequent itemset hiding (FIH) problem. Identifying itemsets that appear together frequently in customer transactions is a common task in association rule mining. Organizations that share data with business partners may consider some of the frequent…
Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach
Alnatsheh, Rami
2012-01-01
A problem that has been the focus of much recent research in privacy preserving data-mining is the frequent itemset hiding (FIH) problem. Identifying itemsets that appear together frequently in customer transactions is a common task in association rule mining. Organizations that share data with business partners may consider some of the frequent…
Discovering More Accurate Frequent Web Usage Patterns
Bayir, Murat Ali; Cosar, Ahmet; Fidan, Guven
2008-01-01
Web usage mining is a type of web mining, which exploits data mining techniques to discover valuable information from navigation behavior of World Wide Web users. As in classical data mining, data preparation and pattern discovery are the main issues in web usage mining. The first phase of web usage mining is the data processing phase, which includes the session reconstruction operation from server logs. Session reconstruction success directly affects the quality of the frequent patterns discovered in the next phase. In reactive web usage mining techniques, the source data is web server logs and the topology of the web pages served by the web server domain. Other kinds of information collected during the interactive browsing of web site by user, such as cookies or web logs containing similar information, are not used. The next phase of web usage mining is discovering frequent user navigation patterns. In this phase, pattern discovery methods are applied on the reconstructed sessions obtained in the first phas...
A New Algorithm for Mining Frequent Pattern
李力; 靳蕃
2002-01-01
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.
Fast Discovering Frequent Patterns for Incremental XML Queries
PENG Dun-lu; QIU Yang
2004-01-01
It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequent query patterns but also generate some new frequent query patterns.In this paper, two incremental updating algorithms, FUXQMiner and FUFXQMiner, are proposed for efficient maintenance of discovered frequent query patterns and generation the new frequent query patterns when new XML queries are added into the database.Experimental results from our implementation show that the proposed algorithms have good performance.
On finding frequent patterns in event sequences
Campagna, Andrea; Pagh, Rasmus
2010-01-01
on the size of the graph, and on the frequency $\\varepsilon$ of the most frequent traces. In addition, we apply techniques from streaming algorithms to achieve space usage that depends only on $\\varepsilon$, and not on the number of distinct traces. The abstract problem considered models a variety of tasks...
Classification and Target Group Selection Based Upon Frequent Patterns
W.H.L.M. Pijls (Wim); R. Potharst (Rob)
2000-01-01
textabstractIn this technical report , two new algorithms based upon frequent patterns are proposed. One algorithm is a classification method. The other one is an algorithm for target group selection. In both algorithms, first of all, the collection of frequent patterns in the training set is constr
Frequent Trajectory Patterns Mining for Intelligent Visual Surveillance System
QU Lin; CHEN Yao-wu
2009-01-01
A frequent trajectory patterns mining algorithm is proposed to learn the object activities and classify the trajectories in intelligent visual surveillance system. The distribution patterns of the trajectories were generated by an Apriori based frequent patterns mining algorithm and the trajectories were classified by the frequent trajectory patterns generated. In addition, a fuzzy c-mcans (FCM) based learning algorithm and a mean shift based clustering procedure were used to construct the representation of trajectories. The algorithm can be further used to describe activities and identify anomalies. The experiments on two real scenes show that the algorithm is effective.
Constructing Projection Frequent Pattern Tree for Efficient Mining
XiangJian-wen; HeYan-xiang; KokichiFutatsugi; KongWei-qiang
2003-01-01
Frequent Pattern mining plays an essential role in data mining.Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. In this study, we introduce a novel frequent pattern growth (FP-growth)method, which is efficient and scalable for mining both long and short frequent patterns without candidate generation. And build a new projection frequent pattern tree (PFP-tree) algorithm on this study, which not only heirs all the advantages in the FP-growth method, but also avoids it's bottleneck in database size dependence when constructing the frequent pattern tree (FP-tree). Efficiency of mining is achieved by introducing the projection technique, which avoid serial scan each frequent item in the database, the cost is mainly related to the depth of the tree, namely the number of frequent items of the longest transaction in the database, not the sum of all the frequent items in the database,which hugely shortens the time of tree-construction. Our performance study shows that the PFP-tree method is efficient and scalable for mining large databases or data warehouses, and is even about an order of magnitude faster than the FP-growth method.
Constructing Projection Frequent Pattern Tree for Efficient Mining
Xiang Jian-wen; He Yan-xiang; Kokichi Futatsugi; Kong Wei-qiang
2003-01-01
Frequent Pattern mining plays an essential role in data mining.Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.In this study, we introduce a novel frequent pattern growth (FP-growth)method, which is efficient and scalable for mining both long and short frequent patterns without candidate generation. And build a new projection frequent pat-tern tree (PFP-tree) algorithm on this study, which not only heirs all the ad-vantages in the FP-growth method, but also avoids it's bottleneck in database size dependence when constructing the frequent pattern tree (FP-tree). Effi-ciency of mining is achieved by introducing the projection technique, which avoid serial scan each frequent item in the database, the cost is mainly related to the depth of the tree, namely the number of frequent items of the longest trans-action in the database, not the sum of all the frequent items in the database,which hugely shortens the time of tree-construction. Our performance study shows that the PFP-tree method is efficient and scalable for mining large databas-es or data warehouses, and is even about an order of magnitude faster than the FP-growth method.
Incremental Mining for Regular Frequent Patterns in Vertical Format
Vijay Kumar G
2013-04-01
Full Text Available In the real world database updates continuously in several online applications like super market, network monitoring, web administration, stock market etc. Frequent pattern mining is afundamental and essential area in data mining research. Not only occurrence frequency of a pattern but also occurrence behaviour of a pattern may be treated as important criteria to measure the interestingness of a pattern. A frequent pattern is said to be regular frequent if the occurrence behaviour is less than or equal to the user given regularity threshold. In incremental transactional databases the occurrence frequency and the occurrence behaviour of a pattern changes whenever a small set of new transactions are added to the database. It is undesirable to mine regular frequent patterns from the scratch. Thus proposes a new algorithm called RFPID (Regular Frequent Pattern Mining in Incremental Databases to mine regular frequent patterns in incremental transactional databases using vertical data format which requires only one database scan. The experimental results show our algorithm is efficient in both memory utilization and execution.
Efficient Mining of Frequent Closed XML Query Pattern
Jian-Hua Feng; Qian Qian; Jian-Yong Wang; Li-Zhu Zhou
2007-01-01
Previous research works have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent but only the closed ones because the latter leads to not only more compact yet complete result set but also better efficiency. Upon discovery of frequent closed XML query patterns, indexing and caching can be effectively adopted for query performance enhancement. Most of the previous algorithms for finding frequent patterns basically introduced a straightforward generate-and-test strategy. In this paper, we present SOLARIA*, an efficient algorithm for mining frequent closed XML query patterns without candidate maintenance and costly tree-containment checking. Efficient algorithm of sequence mining is involved in discovering frequent tree-structured patterns, which aims at replacing expensive containment testing with cheap parent-child checking in sequences. SOLARIA* deeply prunes unrelated search space for frequent pattern enumeration by parent-child relationship constraint. By a thorough experimental study on various real-life data, we demonstrate the efficiency and scalability of SOLARIA* over the previous known alternative. SOLARIA* is also linearly scalable in terms of XML queries' size.
Efficient Incremental Maintenance of Frequent Patterns with FP-Tree
Xiu-Li Ma; Yun-Hai Tong; Shi-Wei Tang; Dong-Qing Yang
2004-01-01
Mining frequent patterns has been studied popularly in data mining area. However, little work has been done on mining patterns when the database has an influx of fresh data constantly. In these dynamic scenarios, efficient maintenance of the discovered patterns is crucial. Most existing methods need to scan the entire database repeatedly, which is an obvious disadvantage. In this paper, an efficient incremental mining algorithm, Incremental-Mining (IM), is proposed for maintenance of the frequent patterns when new incremental data come. Based on the frequent pattern tree (FP-tree) structure, IM gives a way to make the most of the things from the previous mining process, and requires scanning the original data once at most. Furthermore, IM can identify directly the differential set of frequent patterns, which may be more informative to users. Moreover, IM can deal with changing thresholds as well as changing data, thus provide a full maintenance scheme. IM has been implemented and the performance study shows it outperforms three other incremental algorithms: FUP, DB-tree and re-running frequent pattern growth (FP-growth).
A Frame Work for Frequent Pattern Mining Using Dynamic Function
Sunil Joshi
2011-05-01
Full Text Available Discovering frequent objects (item sets, sequential patterns is one of the most vital fields in data mining. It is well understood that it require running time and memory for defining candidates and this is the motivation for developing large number of algorithm. Frequent patterns mining is the paying attention research issue in association rules analysis. Apriori algorithm is a standard algorithm of association rules mining. Plenty of algorithms for mining association rules and their mutations are projected on the foundation of Apriori Algorithm. Most of the earlier studies adopted Apriori-like algorithms which are based on generate-and-test candidates theme and improving algorithm approach and formation but no one give attention to the structure of database. Several modifications on apriori algorithms are focused on algorithm Strategy but no one-algorithm emphasis on least transaction and more attribute representation of database. We presented a new research trend on frequent pattern mining in which generate Transaction pair to lighten current methods from the traditional blockage, providing scalability to massive data sets and improving response time. In order to mine patterns in database with more columns than rows, we proposed a complete framework for the frequent pattern mining. A simple approach is if we generate pair of transaction instead of item id where attributes are much larger then transaction so result is very fast. Newly, different works anticipated a new way to mine patterns in transposed databases where there is a database with thousands of attributes but merely tens of stuff. We suggest a novel dynamic algorithm for frequent pattern mining in which generate transaction pair and for generating frequent pattern we find out by longest common subsequence using dynamic function. Our solutions give result more rapidly. A quantitative investigation of these tradeoffs is conducted through a wide investigational study on artificial and
Significant Interval and Frequent Pattern Discovery in Web Log Data
Saxena, Kanak
2010-01-01
There is a considerable body of work on sequence mining of Web Log Data. We are using One Pass frequent Episode discovery (or FED) algorithm, takes a different approach than the traditional apriori class of pattern detection algorithms. In this approach significant intervals for each Website are computed first (independently) and these interval used for detecting frequent patterns/Episode and then the Analysis is performed on Significant Intervals and frequent patterns That can be used to forecast the user's behavior using previous trends and this can be also used for advertising purpose. This type of applications predicts the Website interest. In this approach, time-series data are folded over a periodicity (day, week, etc.) Which are used to form the Interval? Significant intervals are discovered from these time points that satisfy the criteria of minimum confidence and maximum interval length specified by the user.
An Efficient Hybrid Algorithm for Mining Web Frequent Access Patterns
ZHAN Li-qiang; LIU Da-xin
2004-01-01
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.
Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases
Keshavamurthy, B N; Toshniwal, Durga; 10.5121/ijdms.2010.2205
2010-01-01
There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which we progressively discover the sequential patterns in period of interest. Period of interest is a sliding window continuously advancing as the time goes by. As the focus of sliding window changes, the new items are added to the dataset of interest and obsolete items are removed from it and become up to date. In general, the existing proposals do not fully explore the real world scenario, such as items associated with support in data stream applications such as market basket analysis. Thus mining important knowledge from supported frequent items becomes a non trivial research issue. Our proposed novel approach efficiently mines frequent sequential pattern coupled with support using progressive mining tree.
Injury patterns in children with frequent emergency department visits
Laursen, B
2006-01-01
OBJECTIVES: To compare injury patterns in children with many and few emergency department (ED) visits in order to reveal the causes for the frequent visits. METHODS: Three cohorts of Danish children (total 579 721 children) were followed for three years when their ages were 0-2, 6-8, and 12...
Handling Dynamic Weights in Weighted Frequent Pattern Mining
Ahmed, Chowdhury Farhan; Tanbeer, Syed Khairuzzaman; Jeong, Byeong-Soo; Lee, Young-Koo
Even though weighted frequent pattern (WFP) mining is more effective than traditional frequent pattern mining because it can consider different semantic significances (weights) of items, existing WFP algorithms assume that each item has a fixed weight. But in real world scenarios, the weight (price or significance) of an item can vary with time. Reflecting these changes in item weight is necessary in several mining applications, such as retail market data analysis and web click stream analysis. In this paper, we introduce the concept of a dynamic weight for each item, and propose an algorithm, DWFPM (dynamic weighted frequent pattern mining), that makes use of this concept. Our algorithm can address situations where the weight (price or significance) of an item varies dynamically. It exploits a pattern growth mining technique to avoid the level-wise candidate set generation-and-test methodology. Furthermore, it requires only one database scan, so it is eligible for use in stream data mining. An extensive performance analysis shows that our algorithm is efficient and scalable for WFP mining using dynamic weights.
Reducing Attributes in Rough Set Theory with the Viewpoint of Mining Frequent Patterns
Thanh-Trung Nguyen
2013-05-01
Full Text Available The main objective of the Attribute Reduction problem in Rough Set Theory is to find and retain the set of attributes whose values vary most between objects in an Information System or Decision System. Besides, Mining Frequent Patterns aims finding items that the number of times they appear together in transactions exceeds a given threshold as much as possible. Therefore, the two problems have similarities. From that, an idea formed is to solve the problem of Attribute Reduction from the viewpoint and method of Mining Frequent Patterns. The main difficulty of the Attribute Reduction problem is the time consuming for execution, NP-hard. This article proposes two new algorithms for Attribute Reduction: one has linear complexity, and one has global optimum with concepts of Maximal Random Prior Set and Maximal Set
Graph Based New Approach for Frequent Pattern Mining
Anurag Choubey
2012-03-01
Full Text Available Association rule mining is a function of data mining research domain and frequent pattern mining is anessential part of it. Most of the previous studies on mining frequent patterns based on an Apriori approach, which required more number of database scans and operations for counting pattern supports in the database. Since the size of each set of transaction may be massive that it makes difficult to perform traditional data mining tasks. This research intends to propose a graph structure that captures only those itemsets that needs to define a sufficiently immense dataset into a submatrix representing important weights and does not give any chance to outliers. We have devised a strategy that covers significant facts of data by drilling down the large data into a succinct form of an Adjacency Matrix at different stages of mining process. The graph structure is so designed that it can be easily maintained and the trade off in compressing the large data values is reduced. Experimental results show the effectiveness of our graphbased approach.
Smartphone gaming and frequent use pattern associated with smartphone addiction
Liu, Chun-Hao; Lin, Sheng-Hsuan; Pan, Yuan-Chien; Lin, Yu-Hsuan
2016-01-01
Abstract The aim of this study was to investigate the risk factors of smartphone addiction in high school students. A total of 880 adolescents were recruited from a vocational high school in Taiwan in January 2014 to complete a set of questionnaires, including the 10-item Smartphone Addiction Inventory, Chen Internet Addiction Scale, and a survey of content and patterns of personal smartphone use. Of those recruited, 689 students (646 male) aged 14 to 21 and who owned a smartphone completed the questionnaire. Multiple linear regression models were used to determine the variables associated with smartphone addiction. Smartphone gaming and frequent smartphone use were associated with smartphone addiction. Furthermore, both the smartphone gaming-predominant and gaming with multiple-applications groups showed a similar association with smartphone addiction. Gender, duration of owning a smartphone, and substance use were not associated with smartphone addiction. Our findings suggest that smartphone use patterns should be part of specific measures to prevent and intervene in cases of excessive smartphone use. PMID:27428191
Smartphone gaming and frequent use pattern associated with smartphone addiction.
Liu, Chun-Hao; Lin, Sheng-Hsuan; Pan, Yuan-Chien; Lin, Yu-Hsuan
2016-07-01
The aim of this study was to investigate the risk factors of smartphone addiction in high school students.A total of 880 adolescents were recruited from a vocational high school in Taiwan in January 2014 to complete a set of questionnaires, including the 10-item Smartphone Addiction Inventory, Chen Internet Addiction Scale, and a survey of content and patterns of personal smartphone use. Of those recruited, 689 students (646 male) aged 14 to 21 and who owned a smartphone completed the questionnaire. Multiple linear regression models were used to determine the variables associated with smartphone addiction.Smartphone gaming and frequent smartphone use were associated with smartphone addiction. Furthermore, both the smartphone gaming-predominant and gaming with multiple-applications groups showed a similar association with smartphone addiction. Gender, duration of owning a smartphone, and substance use were not associated with smartphone addiction.Our findings suggest that smartphone use patterns should be part of specific measures to prevent and intervene in cases of excessive smartphone use.
Smartphone gaming and frequent use pattern associated with smartphone addiction
Liu, Chun-Hao; Lin, Sheng-Hsuan; Pan, Yuan-Chien; Lin,Yu-Hsuan
2016-01-01
Abstract The aim of this study was to investigate the risk factors of smartphone addiction in high school students. A total of 880 adolescents were recruited from a vocational high school in Taiwan in January 2014 to complete a set of questionnaires, including the 10-item Smartphone Addiction Inventory, Chen Internet Addiction Scale, and a survey of content and patterns of personal smartphone use. Of those recruited, 689 students (646 male) aged 14 to 21 and who owned a smartphone completed t...
Determining frequent patterns of copy number alterations in cancer.
Franck Rapaport
Full Text Available Cancer progression is often driven by an accumulation of genetic changes but also accompanied by increasing genomic instability. These processes lead to a complicated landscape of copy number alterations (CNAs within individual tumors and great diversity across tumor samples. High resolution array-based comparative genomic hybridization (aCGH is being used to profile CNAs of ever larger tumor collections, and better computational methods for processing these data sets and identifying potential driver CNAs are needed. Typical studies of aCGH data sets take a pipeline approach, starting with segmentation of profiles, calls of gains and losses, and finally determination of frequent CNAs across samples. A drawback of pipelines is that choices at each step may produce different results, and biases are propagated forward. We present a mathematically robust new method that exploits probe-level correlations in aCGH data to discover subsets of samples that display common CNAs. Our algorithm is related to recent work on maximum-margin clustering. It does not require pre-segmentation of the data and also provides grouping of recurrent CNAs into clusters. We tested our approach on a large cohort of glioblastoma aCGH samples from The Cancer Genome Atlas and recovered almost all CNAs reported in the initial study. We also found additional significant CNAs missed by the original analysis but supported by earlier studies, and we identified significant correlations between CNAs.
Apriori Versions Based on MapReduce for Mining Frequent Patterns on Big Data.
Luna, Jose Maria; Padillo, Francisco; Pechenizkiy, Mykola; Ventura, Sebastian
2017-09-27
Pattern mining is one of the most important tasks to extract meaningful and useful information from raw data. This task aims to extract item-sets that represent any type of homogeneity and regularity in data. Although many efficient algorithms have been developed in this regard, the growing interest in data has caused the performance of existing pattern mining techniques to be dropped. The goal of this paper is to propose new efficient pattern mining algorithms to work in big data. To this aim, a series of algorithms based on the MapReduce framework and the Hadoop open-source implementation have been proposed. The proposed algorithms can be divided into three main groups. First, two algorithms [Apriori MapReduce (AprioriMR) and iterative AprioriMR] with no pruning strategy are proposed, which extract any existing item-set in data. Second, two algorithms (space pruning AprioriMR and top AprioriMR) that prune the search space by means of the well-known anti-monotone property are proposed. Finally, a last algorithm (maximal AprioriMR) is also proposed for mining condensed representations of frequent patterns. To test the performance of the proposed algorithms, a varied collection of big data datasets have been considered, comprising up to 3 · 10#x00B9;⁸ transactions and more than 5 million of distinct single-items. The experimental stage includes comparisons against highly efficient and well-known pattern mining algorithms. Results reveal the interest of applying MapReduce versions when complex problems are considered, and also the unsuitability of this paradigm when dealing with small data.
Mining Spatial Maximal Co-Location Patterns%空间极大co-location模式挖掘研究
胡新; 王丽珍; 周丽华; 温佛生
2014-01-01
空间co-location模式代表了一组空间特征的子集，它们的实例在空间中频繁地关联。挖掘空间co-location模式的研究已经有很多，但是针对极大co-location模式挖掘的研究非常少。提出了一种新颖的空间极大co-location模式挖掘算法。首先扫描数据集得到二阶频繁模式，然后将二阶频繁模式转换为图，再通过极大团算法求解得到空间特征极大团，最后使用二阶频繁模式的表实例验证极大团得到空间极大co-location频繁模式。实验表明，该算法能够很好地挖掘空间极大co-location频繁模式。%A spatial co-location pattern is a group of spatial features whose instances are frequently located in the same region. The mining spatial co-location pattern problem had been investigated in the past, but a little for mining spatial maximal co-location patterns. This paper proposes a novel algorithm for mining spatial maximal co-location patterns. Firstly, the size2 co-location frequent patterns are generated based on the data sets, and then the size2 co-location frequent patterns are converted into a graph. Secondly, the maximal cliques in the graph are found through a maximal clique algorithm. Finally, spatial maximal co-location frequent patterns are obtained by verifying the maximal cliques based on table instances of size2 frequent patterns. The extensive experiments demonstrate that this algorithm is effective and efficient in mining spatial maximal co-location frequent patterns.
Maximal Frequent Itemsets Mining Based on Iceberg Concept Lattice%基于Iceberg概念格的最大频繁项集挖掘
薛安荣; 王富强; 李明
2011-01-01
Some existing algorithms for mining Maximal Frequent Itemset(MFI) limit in scanning data sets frequently and tremendous candidate set size, etc. Based on Iceberg concept lattice model, this paper presents a maximal frequent itemsets mining algorithm Iceberg Concept Lattice Maxmal Frequent Itemset Algorithm(1CMFIA) in the Iceberg concept lattice. The algorithm builds the Iceberg concept lattice through .scanning the data sets at a time, by using the coverage relationship between frequent concepts in the Iceberg concept lattice, it can quickly calculate the maximum frequent concepts corresponding to the maximum frequent itemsets. The intension of all maximal frequent concepts is the set of all maximal frequent itemsets. Experimental results show that ICMFIA algorithm outperforms other existing algorithms in the number of scan data sets and mining efficiency.%最大频繁项集挖掘算法存在扫描数据集次数多和候选集规模过大等局限.基于Iceberg概念格模型,提出一种在Iceberg概念格上挖掘最大频繁项集的算法ICMFIA.该算法通过一次扫描数据集构建Iceberg概念格,利用Iceberg概念格中频繁概念之间良好的覆盖关系能快速计算出最大频繁项集所对应的最大频繁概念,所有最大频繁概念的内涵就是所求的最大频繁项集的集合.实验结果表明,该算法具有扫描数据集次数少和挖掘效率高的优点.
频繁模式溯源%Tracking Provenance of Frequent Patterns
王斌; 刘向宇; 杨晓春; 王国仁
2012-01-01
Data provenance studies the processes of data generation, transformation and update. Based on properties and features of frequent patterns (FP), this paper proposes an FP+ tree to store sources of frequent patterns. Then, it gives the related theories and proofs for tracking provenances of frequent patterns, proposes three tracking methods for frequent patterns based on different lineage tracing mechanism, and deduces the correctness and theoretical cost of each method. While mining frequent patterns, the lineages of frequent patterns can be traced without extra cost. According to the structure of conditional FP + tree and properties of frequent patterns, the paper also proposes a-pruning for efficiently projecting conditional FP+ tree and improving the efficiency of lineage tracing. Experimental results show that the FP+ tree based tracking provenance of frequent patterns can get sources of frequent patterns efficiently, and a-pruning for conditional FP+ tree is efficient.%数据起源是关于数据来源、转换和更新过程的研究.基于频繁模式挖掘的性质和特点,提出了FP+树来记录频繁模式来源.给出了频繁模式溯源的相关理论和证明,根据不同追溯机制提出了三种频繁模式溯源方法,并对方法的正确性和执行代价给出了理论证明和推导.在进行频繁模式挖掘时,在不增加额外负担的情况下实现了频繁模式溯源.针对条件FP+树结构特点和频繁模式性质,提出了采用α-剪枝求解条件FP+树的投影操作,加快了频繁模式挖掘和数据溯源的执行效率.买验结果显示,采用基于FP+树的频繁模式溯源方法,可以高效地实现频繁模式溯源,并且条件FP+树的α-剪枝策略的有效性得到验证.
Frequent visitors to psychiatric emergency services: staff attitudes and temporal patterns.
Arfken, Cynthia; Zeman, Lori Lackman; Yeager, Lindsay; Mischel, Edward; Amirsadri, Alireza
2002-11-01
Providing quality psychiatric emergency services is becoming more difficult as utilization rates soar, especially by individuals who are frequent visitors. To address this issue, a staff survey and analysis of admission patterns were conducted. Staff were more likely to believe that frequent visitors sought care because they had difficulty accessing alternative services, had basic needs unmet, were substance abusers, wanted inpatient admission, and were noncompliant with treatment plans. The 1999 temporal admission pattern documented that frequent visitors' admissions were higher during the first week of the month and inclement weather. Surprisingly, the infrequent visitors' admissions also were higher during the first week of the month. Together, these findings suggest that, in this urban location, frequent visitors are disadvantaged individuals lacking support and alternative treatment settings who use psychiatric emergency services to meet basic needs.
Integrating Entropy and Closed Frequent Pattern Mining for Social Network Modelling and Analysis
Adnan, Muhaimenul; Alhajj, Reda; Rokne, Jon
The recent increase in the explicitly available social networks has attracted the attention of the research community to investigate how it would be possible to benefit from such a powerful model in producing effective solutions for problems in other domains where the social network is implicit; we argue that social networks do exist around us but the key issue is how to realize and analyze them. This chapter presents a novel approach for constructing a social network model by an integrated framework that first preparing the data to be analyzed and then applies entropy and frequent closed patterns mining for network construction. For a given problem, we first prepare the data by identifying items and transactions, which arc the basic ingredients for frequent closed patterns mining. Items arc main objects in the problem and a transaction is a set of items that could exist together at one time (e.g., items purchased in one visit to the supermarket). Transactions could be analyzed to discover frequent closed patterns using any of the well-known techniques. Frequent closed patterns have the advantage that they successfully grab the inherent information content of the dataset and is applicable to a broader set of domains. Entropies of the frequent closed patterns arc used to keep the dimensionality of the feature vectors to a reasonable size; it is a kind of feature reduction process. Finally, we analyze the dynamic behavior of the constructed social network. Experiments were conducted on a synthetic dataset and on the Enron corpus email dataset. The results presented in the chapter show that social networks extracted from a feature set as frequent closed patterns successfully carry the community structure information. Moreover, for the Enron email dataset, we present an analysis to dynamically indicate the deviations from each user's individual and community profile. These indications of deviations can be very useful to identify unusual events.
GraMi: Generalized Frequent Pattern Mining in a Single Large Graph
Saeedy, Mohammed El
2011-11-01
Mining frequent subgraphs is an important operation on graphs. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs or protein-protein interaction in bioinformatics, are modeled as a single large graph. Interesting interactions in such applications may be transitive (e.g., friend of a friend). Existing methods, however, search for frequent isomorphic (i.e., exact match) subgraphs and cannot discover many useful patterns. In this paper the authors propose GRAMI, a framework that generalizes frequent subgraph mining in a large single graph. GRAMI discovers frequent patterns. A pattern is a graph where edges are generalized to distance-constrained paths. Depending on the definition of the distance function, many instantiations of the framework are possible. Both directed and undirected graphs, as well as multiple labels per vertex, are supported. The authors developed an efficient implementation of the framework that models the frequency resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. The authors also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI, an approximate version that supports very large graphs. The experiments on real data demonstrate that the authors framework is up to 3 orders of magnitude faster and discovers more interesting patterns than existing approaches.
Maximal translational equivalence classes of musical patterns in point-set representations
Collins, Tom; Meredith, David
2013-01-01
Representing musical notes as points in pitch-time space causes repeated motives and themes to appear as translationally related patterns that often correspond to maximal translatable patterns (MTPs). However, an MTP is also often the union of a salient pattern with one or two temporally isolated...... notes. This has been called the problem of isolated membership. Examining the MTPs in musical works reveals that salient patterns may correspond more often to the intersections of MTPs than to the MTPs themselves. We therefore explore patterns that are maximal with respect to their translational...
AN ENHANCED FREQUENT PATTERN GROWTH BASED ON MAPREDUCE FOR MINING ASSOCIATION RULES
ARKAN A. G. AL-HAMODI
2016-03-01
Full Text Available In mining frequent itemsets, one of most important algorithm is FP-growth. FP-growth proposes an algorithm to compress information needed for mining frequent itemsets in FP-tree and recursively constructs FP-trees to find all frequent itemsets. In this paper, we propose the EFP-growth (enhanced FPgrowth algorithm to achieve the quality of FP-growth. Our proposed method implemented the EFPGrowth based on MapReduce framework using Hadoop approach. New method has high achieving performance compared with the basic FP-Growth. The EFP-growth it can work with the large datasets to discovery frequent patterns in a transaction database. Based on our method, the execution time under different minimum supports is decreased..
Frequent Pattern Mining of Eye-Tracking Records Partitioned into Cognitive Chunks
Noriyuki Matsuda
2014-01-01
Full Text Available Assuming that scenes would be visually scanned by chunking information, we partitioned fixation sequences of web page viewers into chunks using isolate gaze point(s as the delimiter. Fixations were coded in terms of the segments in a 5×5 mesh imposed on the screen. The identified chunks were mostly short, consisting of one or two fixations. These were analyzed with respect to the within- and between-chunk distances in the overall records and the patterns (i.e., subsequences frequently shared among the records. Although the two types of distances were both dominated by zero- and one-block shifts, the primacy of the modal shifts was less prominent between chunks than within them. The lower primacy was compensated by the longer shifts. The patterns frequently extracted at three threshold levels were mostly simple, consisting of one or two chunks. The patterns revealed interesting properties as to segment differentiation and the directionality of the attentional shifts.
Incremental frequent tree-structured pattern mining from semi-structured data
Chen Enhong; Lin Le; Wu Gongqing; Wang Shu
2005-01-01
The paper studies the problem of incremental pattern mining from semi-structrued data. When a new dataset is added into the original dataset, it is difficult for existing pattern mining algorithms to incrementally update the mined results. To solve the problem, an incremental pattern mining algorithm based on the rightmost expansion technique is proposed here to improve the mining performance by utilizing the original mining results and information obtained in the previous mining process. To improve the efficiency, the algorithm adopts a pruning technique by using the frequent pattern expansion forest obtained in mining processes. Comparative experiments with different volume of initial datasets, incremental datasets and different minimum support thresholds demonstrate that the algorithm has a great improvement in the efficiency compared with that of non-incremental pattern mining algorithm.
GRAMI: Frequent subgraph and pattern mining in a single large graph
Elseidy, M.
2014-01-01
Mining frequent subgraphs is an important operation on graphs; it is defined as finding all subgraphs that appear frequently in a database according to a given frequency threshold. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs, or proteinprotein interactions in bioinformatics, are modeled as a single large graph. In this paper we present GRAMI, a novel framework for frequent subgraph mining in a single large graph. GRAMI undertakes a novel approach that only finds the minimal set of instances to satisfy the frequency threshold and avoids the costly enumeration of all instances required by previous approaches. We accompany our approach with a heuristic and optimizations that significantly improve performance. Additionally, we present an extension of GRAMI that mines frequent patterns. Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Finally, we present CGRAMI, a version supporting structural and semantic constraints, and AGRAMI, an approximate version producing results with no false positives. Our experiments on real data demonstrate that our framework is up to 2 orders of magnitude faster and discovers more interesting patterns than existing approaches. 2014 VLDB Endowment.
A Frequent Pattern Mining Algorithm for Feature Extraction of Customer Reviews
Seyed Hamid Ghorashi
2012-07-01
Full Text Available Online shoppers often have different idea about the same product. They look for the product features that are consistent with their goal. Sometimes a feature might be interesting for one, while it does not make that impression for someone else. Unfortunately, identifying the target product with particular features is a tough task which is not achievable with existing functionality provided by common websites. In this paper, we present a frequent pattern mining algorithm to mine a bunch of reviews and extract product features. Our experimental results indicate that the algorithm outperforms the old pattern mining techniques used by previous researchers.
A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining
DONG Yihong; ZHUANG Yueting; TAI Xiaoying
2007-01-01
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.
On Enumerating Frequent Closed Patterns with Key in Multi-relational Data
Seki, Hirohisa; Honda, Yuya; Nagano, Shinya
We study the problem of mining closed patterns in multi-relational databases. Garriga et al. (IJCAI'07) proposed an algorithm RelLCM2 for mining closed patterns (i.e., conjunctions of literals) in multi-relational data, which is an extension of LCM, an efficient enumeration algorithm for frequent closed itemsets mining proposed in the seminal paper by Uno et al. (DS'04). We assume that a database considered contains a special predicate called key (or target), which determines the entities of interest and what is to be counted. We introduce a notion of closed patterns with key (key-closedness for short), where variables in a pattern other than the one in a key predicate are considered to be existentially quantified, and they are linked to a given target object. We then define a closure operation (key-closure) for computing key-closed patterns, and show that the difference between the semantics of key-closed patterns and that of the closed patterns in RelLCM2 implies different properties of the closure operations; in particular, the uniqueness of closure does not hold for key-closure. Nevertheless, we show that we can enumerate key-closed patterns using the technique of ppc-extensions à la LCM, thereby making the enumeration possible without storage space for previously generated patterns. We also propose a literal order designed for mining key-closed patterns, which will require less search space. The correctness of our algorithm is shown, and its computational complexity is discussed. Some preliminary experimental results are also given.
2014-01-01
Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism
Application of frequent itemsets mining to analyze patterns of one-stop visits in Taiwan.
Chun-Yi Tu
Full Text Available BACKGROUND: The free choice of health care facilities without limitations on frequency of visits within the National Health Insurance in Taiwan gives rise to not only a high number of annual ambulatory visits per capita but also a unique "one-stop shopping"phenomenon, which refers to a patient' visits to several specialties of the same healthcare facility in one day. The visits to multiple physicians would increase the potential risk of polypharmacy. The aim of this study was to analyze the frequency and patterns of one-stop visits in Taiwan. METHODOLOGY/PRINCIPAL FINDINGS: The claims datasets of 1 million nationally representative people within Taiwan's National Health Insurance in 2005 were used to calculate the number of patients with one-stop visits. The frequent itemsets mining was applied to compute the combination patterns of specialties in the one-stop visits. Among the total 13,682,469 ambulatory care visits in 2005, one-stop visits occurred 144,132 times and involved 296,822 visits (2.2% of all visits by 66,294 (6.6% persons. People tended to have this behavior with age and the percentage reached 27.5% (5,662 in 20,579 in the age group ≥80 years. In general, women were more likely to have one-stop visits than men (7.2% vs. 6.0%. Internal medicine plus ophthalmology was the most frequent combination with a visited frequency of 3,552 times (2.5%, followed by cardiology plus neurology with 3,183 times (2.2%. The most frequent three-specialty combination, cardiology plus neurology and gastroenterology, occurred only 111 times. CONCLUSIONS/SIGNIFICANCE: Without the novel computational technique, it would be hardly possible to analyze the extremely diverse combination patterns of specialties in one-stop visits. The results of the study could provide useful information either for the hospital manager to set up integrated services or for the policymaker to rebuild the health care system.
Construction of Learning Path Using Ant Colony Optimization from a Frequent Pattern Graph
Souvik Sengupta
2011-11-01
Full Text Available In an e-Learning system a learner may come across multiple unknown terms, which are generally hyperlinked, while reading a text definition or theory on any topic. It becomes even harder when one tries to understand those unknown terms through further such links and they again find some new terms that have new links. As a consequence they get confused where to initiate from and what are the prerequisites. So it is very obvious for the learner to make a choice of what should be learnt before what. In this paper we have taken the data mining based frequent pattern graph model to define the association and sequencing between the words and then adopted the Ant Colony Optimization, an artificial intelligence approach, to derive a searching technique to obtain an efficient and optimized learning path to reach to a unknown term.
Stellar spectra association rule mining method based on the weighted frequent pattern tree
Jiang-Hui Cai; Xu-Jun Zhao; Shi-Wei Sun; Ji-Fu Zhang; Hai-Feng Yang
2013-01-01
Effective extraction of data association rules can provide a reliable basis for classification of stellar spectra.The concept of stellar spectrum weighted itemsets and stellar spectrum weighted association rules are introduced,and the weight of a single property in the stellar spectrum is determined by information entropy.On that basis,a method is presented to mine the association rules of a stellar spectrum based on the weighted frequent pattern tree.Important properties of the spectral line are highlighted using this method.At the same time,the waveform of the whole spectrum is taken into account.The experimental results show that the data association rules of a stellar spectrum mined with this method are consistent with the main features of stellar spectral types.
Discovering Patterns in Multi-neuronal Spike Trains using the Frequent Episode Method
Unnikrishnan, K P; Sastry, P S
2007-01-01
Discovering the 'Neural Code' from multi-neuronal spike trains is an important task in neuroscience. For such an analysis, it is important to unearth interesting regularities in the spiking patterns. In this report, we present an efficient method for automatically discovering synchrony, synfire chains, and more general sequences of neuronal firings. We use the Frequent Episode Discovery framework of Laxman, Sastry, and Unnikrishnan (2005), in which the episodes are represented and recognized using finite-state automata. Many aspects of functional connectivity between neuronal populations can be inferred from the episodes. We demonstrate these using simulated multi-neuronal data from a Poisson model. We also present a method to assess the statistical significance of the discovered episodes. Since the Temporal Data Mining (TDM) methods used in this report can analyze data from hundreds and potentially thousands of neurons, we argue that this framework is appropriate for discovering the `Neural Code'.
Austin, R E; Aldea, G S; Coggins, D L; Flynn, A E; Hoffman, J I
1990-08-01
We examined the ability of individual regions of the canine left ventricle to increase blood flow relative to baseline rates of perfusion. Regional coronary flow was measured by injecting radioactive microspheres over 90 seconds in seven anesthetized mongrel dogs. Preliminary experiments demonstrated a correlation between the regional distributions of blood flow during asphyxia and pharmacological vasodilatation with adenosine (mean r = 0.75; 192 regions in each of two dogs), both of which resulted in increased coronary flow. Subsequent experiments, during which coronary perfusion pressure was held constant at 80 mm Hg, examined the pattern of blood flow in 384 regions (mean weight, 106 mg) of the left ventricular free wall during resting flow and during maximal coronary flow effected by intracoronary adenosine infusion. We found that resting and maximal flow patterns were completely uncorrelated to each other in a given dog (mean r = 0.06, p = NS; n = 3 dogs). Furthermore, regional coronary reserve, defined as the ratio of maximal to resting flow, ranged from 1.75 (i.e., resting flow was 57% of maximum) to 21.9 (resting flow was 4.5% of maximum). Thus, coronary reserve is spatially heterogeneous and determined by two distinct perfusion patterns: the resting (control) pattern and the maximal perfusion pattern. Normal hearts, therefore, contain small regions that may be relatively more vulnerable to ischemia. This may explain the patchy nature of infarction with hypoxia and at reduced perfusion pressures as well as the difficulty of using global parameters to predict regional ischemia. Despite the wide dispersion of coronary reserve, we found, by autocorrelation analysis, that reserve in neighboring regions (even when separated by a distance of several tissue samples) was significantly correlated. This also applied to patterns of resting myocardial flow. Thus, both resting coronary blood flow and reserve appear to be locally continuous and may define functional
Foxall, Gordon R; Oliveira-Castro, Jorge M; Schrezenmaier, Teresa C
2004-06-30
Purchasers of fast-moving consumer goods generally exhibit multi-brand choice, selecting apparently randomly among a small subset or "repertoire" of tried and trusted brands. Their behavior shows both matching and maximization, though it is not clear just what the majority of buyers are maximizing. Each brand attracts, however, a small percentage of consumers who are 100%-loyal to it during the period of observation. Some of these are exclusively buyers of premium-priced brands who are presumably maximizing informational reinforcement because their demand for the brand is relatively price-insensitive or inelastic. Others buy exclusively the cheapest brands available and can be assumed to maximize utilitarian reinforcement since their behavior is particularly price-sensitive or elastic. Between them are the majority of consumers whose multi-brand buying takes the form of selecting a mixture of economy -- and premium-priced brands. Based on the analysis of buying patterns of 80 consumers for 9 product categories, the paper examines the continuum of consumers so defined and seeks to relate their buying behavior to the question of how and what consumers maximize.
ACME: A scalable parallel system for extracting frequent patterns from a very long sequence
Sahli, Majed
2014-10-02
Modern applications, including bioinformatics, time series, and web log analysis, require the extraction of frequent patterns, called motifs, from one very long (i.e., several gigabytes) sequence. Existing approaches are either heuristics that are error-prone, or exact (also called combinatorial) methods that are extremely slow, therefore, applicable only to very small sequences (i.e., in the order of megabytes). This paper presents ACME, a combinatorial approach that scales to gigabyte-long sequences and is the first to support supermaximal motifs. ACME is a versatile parallel system that can be deployed on desktop multi-core systems, or on thousands of CPUs in the cloud. However, merely using more compute nodes does not guarantee efficiency, because of the related overheads. To this end, ACME introduces an automatic tuning mechanism that suggests the appropriate number of CPUs to utilize, in order to meet the user constraints in terms of run time, while minimizing the financial cost of cloud resources. Our experiments show that, compared to the state of the art, ACME supports three orders of magnitude longer sequences (e.g., DNA for the entire human genome); handles large alphabets (e.g., English alphabet for Wikipedia); scales out to 16,384 CPUs on a supercomputer; and supports elastic deployment in the cloud.
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.
Huan-Kai Peng
Full Text Available In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.
Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu
2016-01-01
In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.
Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report)
Bernecker, Thomas; Renz, Matthias; Verhein, Florian; Züfle, Andreas
2010-01-01
Frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on standard (certain) transaction databases. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional techniques inapplicable. In this paper, we tackle the problem of finding probabilistic frequent itemsets based on possible world semantics. In this context, an itemset X is called frequent if the probability that X occurs in at least minSup transactions is above a given threshold. We make the following contributions: We propose the first probabilistic FP-Growth algorithm (ProFP-Growth) and associated probabilistic FP-Tree (ProFP-Tree), which we use to mine all probabilistic frequent itemsets in uncertain transaction databases without candidate generation. In addition, we propose an efficient technique to compute the support probability distribution of an itemset in linear time using the concep...
Preeti Khare
2012-09-01
Full Text Available The importance of data mining is increasing exponentially since last decade and in recent time where there is very tough competition in the market where the quality of information and information on time play a very crucial role in decision making of policy has attracted a great deal of attention in the information industry and in society as a whole. In this approach we also use density minimum support so that we reduce the execution time. A frequent superset means it contains more transactions then the minimum support. It utilize the concept that if the item set is not frequent but the superset may be frequent which is consider for the further data mining task. By this approach we can store the transaction on the daily basis, then we provide three different density zone based on the transaction and minimum support which is low (L, Medium (M, High (H. Based on this approach we categorize the item set for pruning. Our approach is based on apriori algorithm but provides better reduction in time because of the prior separation in the data, which is useful for selecting according to the density wise distribution in India. Our algorithm provides the flexibility for improved association and dynamic support. Comparative result shows the effectiveness of our algorithm.
Wolfgang Tränkenschuh
Full Text Available BACKGROUND: Gene silencing due to aberrant DNA methylation is a frequent event in hepatocellular carcinoma (HCC and also in hepatocellular adenoma (HCA. However, very little is known about epigenetic defects in fibrolamellar carcinoma (FLC, a rare variant of hepatocellular carcinoma that displays distinct clinical and morphological features. METHODOLOGY/PRINCIPAL FINDINGS: We analyzed the methylation status of the APC, CDH1, cyclinD2, GSTπ1, hsa-mir-9-1, hsa-mir-9-2, and RASSF1A gene in a series of 15 FLC and paired normal liver tissue specimens by quantitative high-resolution pyrosequencing. Results were compared with common HCC arising in non-cirrhotic liver (n = 10. Frequent aberrant hypermethylation was found for the cyclinD2 (19% and the RASSF1A (38% gene as well as for the microRNA genes mir-9-1 (13% and mir-9-2 (33%. In contrast to common HCC the APC and CDH1 (E-cadherin genes were found devoid of any DNA methylation in FLC, whereas the GSTπ1 gene showed comparable DNA methylation in tumor and surrounding tissue at a moderate level. Changes in global DNA methylation level were measured by analyzing methylation status of the highly repetitive LINE-1 sequences. No evidence of global hypomethylation could be found in FLCs, whereas HCCs without cirrhosis showed a significant reduction in global methylation level as described previously. CONCLUSIONS: FLCs display frequent and distinct gene-specific hypermethylation in the absence of significant global hypomethylation indicating that these two epigenetic aberrations are induced by different pathways and that full-blown malignancy can develop in the absence of global loss of DNA methylation. Only quantitative DNA methylation detection methodology was able to identify these differences.
Turdukulov, U.; Calderon Romero, A.O.; Huisman, O.; Retsios, V.
2014-01-01
The popularity of tracking devices continues to contribute to increasing volumes of spatio-temporal data about moving objects. Current approaches in analysing these data are unable to capture collective behaviour and correlations among moving objects. An example of these types of patterns is moving
Doherty, Aoife; McInerney, James O
2013-10-01
Synonymous codon usage patterns are shaped by a balance between mutation, drift, and natural selection. To date, detection of translational selection in vertebrates has proven to be a challenging task, obscured by small long-term effective population sizes in larger animals and the existence of isochores in some species. The consensus is that, in such species, natural selection is either completely ineffective at overcoming mutational pressures and genetic drift or perhaps is effective but so weak that it is not detectable. The aim of this research is to understand the interplay between mutation, selection, and genetic drift in vertebrates. We observe that although variation in mutational bias is undoubtedly the dominant force influencing codon usage, translational selection acts as a weak additional factor influencing synonymous codon usage. These observations indicate that translational selection is a widespread phenomenon in vertebrates and is not limited to a few species.
Analysing visual pattern of skin temperature during submaximal and maximal exercises
Balci, Gorkem Aybars; Basaran, Tahsin; Colakoglu, Muzaffer
2016-01-01
Aims of this study were to examine our hypotheses assuming that (a) skin temperature patterns would differ between submaximal exercise (SE) and graded maximal exercise test (GXT) and (b) thermal kinetics of Tskin occurring in SE and GXT might be similar in a homogenous cohort. Core temperature (Tcore) also observed in order to evaluate thermoregulatory responses to SE and GXT. Eleven moderately to well-trained male athletes were volunteered for the study (age: 22.2 ± 3.7 years; body mass: 73.8 ± 6.9 kg; height: 181 ± 6.3 cm; body surface area 1.93 ± 0.1 m2; body fat: 12.6% ± 4.2%; V ˙ O2max: 54 ± 9.9 mL min-1 kg-1). Under stabilized environmental conditions in climatic chamber, GXT to volitional exhaustion and 20-min SE at 60% of VO2max were performed on cycle ergometer. Thermal analyses were conducted in 2-min intervals throughout exercise tests. Tskin was monitored by a thermal camera, while Tcore was recorded via an ingestible telemetric temperature sensor. Thermal kinetic analyses showed that Tskin gradually decreased till the 7.58 ± 1.03th minutes, and then initiated to increase till the end of SE (Rsqr = 0.97), while Tskin gradually decreased throughout the GXT (Rsqr = 0.89). Decrease in the level of Tskin during the GXT was significantly below from the SE [F (4, 40) = 2.67, p = 0.07, ηp2 = 0.211]. In the meantime, Tcore continuously increased throughout the SE and GXT (p 0.05). However, total heat energies were calculated as 261.5 kJ/m2 and 416 kJ/m2 for GXT and SE, respectively (p < 0.05). Thus, it seems that SE may be more advantageous than GXT in thermoregulation. In conclusion, Tcore gradually increased throughout maximal and submaximal exercises as expected. Tskin curves patterns found to be associated amongst participants at both GXT and SE. Therefore, Tskin kinetics may ensure an important data for monitoring thermoregulation in exercise.
Efficient Frequent Pattern Mining Techniques of Semi Structured data: a Survey
Leena A Deshpande, R.S. Prasad
2013-03-01
Full Text Available Semi-structured data are a huge amount of complexand heterogeneous data sets.Such models capturedata that are not intentionally structured, but arestructured heterogeneously. These databasesevolve so quickly like run time report generated byERPs, World-Wide Web with its HTML pages, textfiles, bibliographies, various logs generated etc.These huge and varied becomedifficultto retrieverelevant information User is often interestedinintegrating various formats (like in biomedical datatext, image or structured that are generally realizedas files, and also wants to access them in anintegrated fashion.Users not only query the data tofind a particular piece ofinformation, but he is alsokeen in knowing better understanding of the query.Because of this variety, semi-structured DBs do notcome with a conceptual schema. To make thesedatabases more accessible to users a rich conceptualmodel is needed. Traditional retrieving techniquesare not directly applied on these databases.Unfortunately the tools and methodologies used forRDBMS do not give efficient results and so fail tobridge the gap. Henceefficient andscalablemethods for mining the semi-structured data isneeded, via discovering rule or patterns from thehuge semi-structured databases. These databasesare modelled by trees and graphs.
Aggarwal, Charu C
2014-01-01
Proposes numerous methods to solve some of the most fundamental problems in data mining and machine learning Presents various simplified perspectives, providing a range of information to benefit both students and practitioners Includes surveys on key research content, case studies and future research directions
Tobias Warnecke
Full Text Available Nucleosomes, the basic repeat units of eukaryotic chromatin, have been suggested to influence the evolution of eukaryotic genomes, both by altering the propensity of DNA to mutate and by selection acting to maintain or exclude nucleosomes in particular locations. Contrary to the popular idea that nucleosomes are unique to eukaryotes, histone proteins have also been discovered in some archaeal genomes. Archaeal nucleosomes, however, are quite unlike their eukaryotic counterparts in many respects, including their assembly into tetramers (rather than octamers from histone proteins that lack N- and C-terminal tails. Here, we show that despite these fundamental differences the association between nucleosome footprints and sequence evolution is strikingly conserved between humans and the model archaeon Haloferax volcanii. In light of this finding we examine whether selection or mutation can explain concordant substitution patterns in the two kingdoms. Unexpectedly, we find that neither the mutation nor the selection model are sufficient to explain the observed association between nucleosomes and sequence divergence. Instead, we demonstrate that nucleosome-associated substitution patterns are more consistent with a third model where sequence divergence results in frequent repositioning of nucleosomes during evolution. Indeed, we show that nucleosome repositioning is both necessary and largely sufficient to explain the association between current nucleosome positions and biased substitution patterns. This finding highlights the importance of considering the direction of causality between genetic and epigenetic change.
Singh, Manu Pratap; Rajput, Balwant S.
2017-04-01
New set of maximally entangled states (Singh-Rajput MES), constituting orthonormal eigen bases, has been revisited and its superiority and suitability in pattern-association (Quantum Associative Memory, QuAM) have been demonstrated. Using these MES as memory states in the evolutionary process of pattern storage in a two-qubit system, it has been shown that the first two states of Singh-Rajput MES are useful for storing the pattern |11> and the last two of these MES are useful in storing the pattern |10> Recall operations of quantum associate memory (QuAM) have been conducted through evolutionary process in terms of unitary operators by separately choosing Singh-Rajput MES and Bell's MES as memory states and it has been shown that Singh-Rajput MES as valid memory states for recalling the patterns in a two-qubit system are much more suitable than Bell's MES.
José M. Cancela
2009-11-01
Full Text Available The purpose of this study is to provide a tool, based on the knowledge of technical errors, which helps to improve the teaching and learning process of the Uki Goshi technique. With this aim, we set out to determine the most frequent errors made by 44 students when performing this technique and how these mistakes relate. In order to do so, an observational analysis was carried out using the OSJUDO-UKG instrument and the data were registered using Match Vision Studio (Castellano, Perea, Alday and Hernández, 2008. The results, analyzed through descriptive statistics, show that the absence of a correct initial unbalancing movement (45,5%, the lack of proper right-arm pull (56,8%, not blocking the faller's body (Uke against the thrower's hip -Tori- (54,5% and throwing the Uke through the Tori's side are the most usual mistakes (72,7%. Through the sequencial analysis of T-Patterns obtained with the THÈME program (Magnusson, 1996, 2000 we have concluded that not blocking the body with the Tori's hip provokes the Uke's throw through the Tori's side during the final phase of the technique (95,8%, and positioning the right arm on the dorsal region of the Uke's back during the Tsukuri entails the absence of a subsequent pull of the Uke's body (73,3%.
Stygar, A H; Dolecheck, K A; Kristensen, A R
2017-07-24
Frequent BW monitoring of growing pigs can be useful for identifying production (e.g. feeding), health and welfare problems. However, in order to construct a tool which will properly recognize abnormalities in pigs' growth a precise description of the growth process should be used. In this study we proposed a new model of pig growth accounting for daily fluctuations in BW. Body weight measurements of 1710 pigs (865 gilts and 843 barrows) originating from five consecutive batches from a Danish commercial farm were collected. Pigs were inserted into a large pen (maximum capacity=400) between November 2014 and September 2015. On average, each pig was observed for 42 days and weighed 3.6 times a day when passing from the resting to feeding area. Altogether, 243,160 BW measurements were recorded. A multilevel model of pig growth was constructed and fitted to available data. The BW of pigs was modeled as a quadratic function of time. A diurnal pattern was incorporated into the model by a cosine wave with known length (24 h). The model included pig effect which was defined as a random autoregressive process with exponential correlation. Variance of within-pigs error was assumed to increase with time. Because only five batches were observed, it was not possible to obtain the random effect for batch. However, in order to account for the batch effect the model included interactions between batch and fixed parameters: intercept, time, square value of time and cosine wave. The gender effect was not significant and was removed from the final model. For all batches, morning and afternoon peaks in the frequency of visits to the feeding area could be distinguished. According to results, pigs were lighter in the morning and heavier in the evening (minimum BW was reached around 1000 h and maximum around 2200 h). However, the exact time of obtaining maximum and minimum BW during the day differed between batches. Pigs had access to natural light and, therefore, existing differences
廖福蓉; 王成良
2012-01-01
频繁项集的挖掘受到大量候选频繁项集和较高计算花费的限制,只挖掘最大长度频繁项集已满足很多应用.提出一种基于有序FP-tree结构挖掘最大长度频繁项集的算法.即对有序FP-tree的头表进行改造,增加一个max-level域,记录该项在有序FP-tree中的最大高度.挖掘时仅对max-level大于等于已有最大长度频繁项集长度的项进行遍历,不产生条件模式基,无需递归构造条件FP-tree,且计算出最大长度频繁项集的支持度.实验结果表明该算法挖掘效率高、速度快.%The mining of frequent itemsets has been limited by the large number of resulting itemsets as well as the high computational cost. In many application domains, however, it is often sufficient to mine maximum length frequent itemsets. An order FP-tree-based algorithm is proposed for the mining problem. A field max-level is added in head-table to record the greatest height of item. In the mining process, only the item which max-level value is equal or greater than the length of existing maximum length frequent itemsets is traversed. Neither producing conditional pattern base nor constructing conditional frequent pattern tree recursively is needed, and the support of maximum length frequent itemsets is calculated. The experimental results show that the algorithm accelerates the speed to traverse the tree and improves the mining efficiency.
Sein eSchmidt
2013-06-01
Full Text Available Brain stimulation is having remarkable impact on clinical neurology. Brain stimulation can modulate neuronal activity in functionally segregated circumscribed regions of the human brain. Polarity-, frequency and noise specific stimulation can induce specific manipulations on neural activity.. In contrast to neocortical stimulation, deep-brain stimulation has become a tool that can dramatically improve the impact clinicians can possibly have on movement disorders. In contrast, neocortical brain stimulation is proving to be remarkably susceptible to intrinsic brain-states. Although evidence is accumulating that brain stimulation can facilitate recovery processes in patients with cerebral stroke, the high variability of results impedes successful clinical implementation. Interestingly, recent data in healthy subjects suggests that brain-state dependent patterned stimulation might help resolve some of the intrinsic variability found in previous studies. In parallel, other studies suggest that noisy stochastic resonance -like processes are a non-negligible component in NBS studies.The hypothesis developed in this manuscript is that stimulation patterning with noisy and oscillatory components will help patients recover from stroke related deficits more reliably. To address this hypothesis we focus on two factors common to both neural computation (intrinsic variables as well as brain stimulation (extrinsic variables: noise and oscillation. We review diverse theoretical and experimental evidence that demonstrates that subject-function specific brain-states are associated with specific oscillatory activity patterns. These states are transient and can be maintained by noisy processes. The resulting control procedures can resemble homeostatic or stochastic resonance processes. In this context we try to extend awareness for inter-individual differences and the use of individualized stimulation in the recovery maximization of stroke patients.
基于改进的FP-tree的频繁模式挖掘算法%Frequent pattern mining algorithm based on improved FP-tree
李也白; 唐辉; 张淳; 贺玉明
2011-01-01
FP-growth is an efficient frequent pattern mining algorithm based on the data structure of FP-tree, which does not generate candidate sets. Constructing frequent pattern tree TP-tree requires to scanning data twice. What's more,transactions which only contain non-frequent items are also scanned during the second scanning. In order to solve this problem, after analyzing particularity of FP-tree deeply, this paper improved construction process of FP-tree and employed an auxiliary storage structure that bases on hash table, which saves time of searching items and enhances mining efficiency.%FP-growth算法是一种基于FP-tree数据结构的高效的频繁模式挖掘算法,它不产生候选集.构造频繁模式树FP-tree需扫描数据库两次,在第二遍扫描中还扫描了那些仅包含了非频繁项的事务,针对此问题,在深入分析了FP-tree特性的基础上,改进了FP-tree构造过程,同时用一种基于Hash表的辅助存储结构,节省了项目查找时间,提高了挖掘效率.
Distributed Parallel Algorithm of Mining Frequent Pattern on Data Stream%分布式并行化数据流频繁模式挖掘算法
马可; 李玲娟; 孙杜靖
2016-01-01
为了提高数据流频繁模式挖掘的效率,文中基于经典的数据流频繁模式挖掘算法FP-Stream和分布式并行计算原理,设计了一种分布式并行化数据流频繁模式挖掘算法—DPFP-Stream ( Distributed Parallel Algorithm of Mining Frequent Pattern on Data Stream)。该算法将建立频繁模式树的任务分为local和global两部分,并设置了参数“当前时间”；将到达的流数据平均分配到多个不同的local节点,各local节点使用FP-Growth算法产生该单位时间内本节点的候选频繁项集,并按照单位时间将候选频繁项集及其支持度计数打包发送至global节点；global节点按“当前时间”合并各local节点的中间结果并更新模式树Pattern-Tree。在分布式数据流计算平台Storm上进行的算法实现和性能测试结果表明,DPFP-Stream算法的计算效率能够随着local节点或local bolt线程的增加而提高,适用于高效挖掘数据流中的频繁模式。%In order to improve the efficiency of mining frequent pattern on data stream,a Distributed Parallel Algorithm of Mining Fre-quent Pattern on Data Stream,named DPFP-Stream,is designed in this paper based on the ideas of classical FP-Stream and the distribu-ted parallel computing. It divides the task of building frequent pattern tree into two parts:local and global,and introduces a new parameter“current time”. The arrival data will be equally distributed into different local nodes. Then every local node uses FP-Growth algorithm to produce candidate frequent items,and packages them with relevant support count according to unit time,and sends them to the global node. The global node combines the results produced by local nodes according to the“current time” and updates the global Pattern-Tree. The results of implementing DPFP-Stream algorithm and testing its performance on Storm,a distribution data stream computing platform, show that the computing efficiency of DPFP-Stream can
稀疏数据源频繁模式挖掘并行算法%Parallel Algorithms of Mining Frequent Patterns from Sparse Data Source
郑晓艳; 孙济洲
2011-01-01
针对频繁模式挖掘中一类特殊的稀疏数据源,设计了一种链表结构体FI-list,并据此提出一个并行搜索频繁项集(PMFSD)的算法.该方法基于一个分布式共享内存系统--面向视图的分布式集群计算(VODCA)而设计.详细描述了链表结构体FI-list的设计和构建过程,论述了在VODCA上挖掘稀疏数据源频繁模式的问题中,视图的划分依据及划分结果,讨论了算法实现的动态任务分配策略.实验结果证明了PMFSD算法的正确性和有效性.%Concerning mining frequent patterns from a special kind of sparse data sources, a linked-list structure,named FI-list was designed, and accordingly a parallel algorithm PMFSD (parallel mining frequent itemsets from sparse data source) was proposed for searching frequent itemsets.PMFSD is based on a distributed shared memory system, called view-oriented, distributed, cluster-based approach (VODCA) to parallel computing.The design and construction process of the FI-list was described in detail.It disserted the views division in mining frequent patterns from the sparse data source on VODCA, and discussed the dynamic task allocation strategy of the algorithm.The experimental results have proved the correctness and effectiveness of PMFSD algorithm.
面向对象数据库中的频繁模式发现%Frequent pattern discovery in object-oriented database
李琳娜; 张志平
2011-01-01
The paper presents an algorithm for discovering frequent patterns in object-oriented databases based on higher-order inductive logic programming. The algorithm adopts the higher-order logic programming language Escher to represent data and patterns. As the higher-order logic programming language not only can describe complex structured data but also can represent complex patterns, and the typed syntax of Escher can effectively reduce the huge search space of patterns caused by the stronger representation ability of the higher-order logic programming language, the proposed algorithm can take full advantage of rich semantic infonnation of object-oriented databases to guide the process of search and find complex frequent patterns. The experiments show that the algorithm is superior to the WARMAR (a typical algorithm) in both the quality of frequent patterns and the efficiency.%提出了基于高阶归纳逻辑编程发现面向对象数据库中的频繁模式的算法.此算法使用高阶逻辑编程语言Escher作为数据及模式表示语言.由于高阶逻辑编程语言不仅能描述复杂结构的数据而且还能描述复杂的模式,以及Escher语言的强类型语法能有效缩小由于高阶逻辑编程语言较强表达能力所带来的较大的模式搜索空间,故此算法能充分利用面向对象数据库中丰富的语义信息引导频繁模式搜索过程且能发现复杂频繁模式.实验证明,此算法在效率和发现的频繁模式质量上都优于经典的WARMAR算法.
基于频繁模式的KPI异常检测研究%Research on anomaly detection of KPI based on frequent patterns
纪勇
2016-01-01
Aiming at the current TD-SCDMA network acquisition network key performance indicators (KPIs), this paper used frequent pattern mining method, focused on the analysis of correlation between off rate, wireless call completion rate and congestion rate. Frequent pattern deifnition was considered as the normal mode to carry out anomaly mode detection. This way not only effectively detected unusual combination of network, but also reflected the correlation between parameters, which played an effective guiding role in fast online detection.%文章针对TD-SCDMA现网采集的网络关键绩效指标（Key Performance Indicator，KPI），，利用频繁模式挖掘的方法，重点分析掉话率、无线接通率、拥塞率等之间的关联性。将频繁模式项定义为正常模式，以此进行异常模式检测。这样的方式不仅有效地检测了网络存在的异常组合，也反映了参数之间的关联性，对快速在线检测起到了有效的指导作用。
Brendle, Joerg
2016-01-01
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with countable levels. Our results answer several questions of Campero, Cancino, Hrusak, and Miranda.
Usadel Björn
2007-05-01
Full Text Available Abstract Background Micro- and macroarray technologies help acquire thousands of gene expression patterns covering important biological processes during plant ontogeny. Particularly, faithful visualization methods are beneficial for revealing interesting gene expression patterns and functional relationships of coexpressed genes. Such screening helps to gain deeper insights into regulatory behavior and cellular responses, as will be discussed for expression data of developing barley endosperm tissue. For that purpose, high-throughput multidimensional scaling (HiT-MDS, a recent method for similarity-preserving data embedding, is substantially refined and used for (a assessing the quality and reliability of centroid gene expression patterns, and for (b derivation of functional relationships of coexpressed genes of endosperm tissue during barley grain development (0–26 days after flowering. Results Temporal expression profiles of 4824 genes at 14 time points are faithfully embedded into two-dimensional displays. Thereby, similar shapes of coexpressed genes get closely grouped by a correlation-based similarity measure. As a main result, by using power transformation of correlation terms, a characteristic cloud of points with bipolar sandglass shape is obtained that is inherently connected to expression patterns of pre-storage, intermediate and storage phase of endosperm development. Conclusion The new HiT-MDS-2 method helps to create global views of expression patterns and to validate centroids obtained from clustering programs. Furthermore, functional gene annotation for developing endosperm barley tissue is successfully mapped to the visualization, making easy localization of major centroids of enriched functional categories possible.
Østergaard, Mikkel; Møller Døhn, Uffe; Duer-Jensen, A
2011-01-01
To investigate by magnetic resonance imaging (MRI) which bones in wrists and metacarpophalangeal (MCP) joints most frequently show bone erosions, and which most frequently demonstrate erosive progression, in early and established rheumatoid arthritis (RA).......To investigate by magnetic resonance imaging (MRI) which bones in wrists and metacarpophalangeal (MCP) joints most frequently show bone erosions, and which most frequently demonstrate erosive progression, in early and established rheumatoid arthritis (RA)....
K B Athreya
2009-09-01
It is shown that (i) every probability density is the unique maximizer of relative entropy in an appropriate class and (ii) in the class of all pdf that satisfy $\\int fh_id_=_i$ for $i=1,2,\\ldots,\\ldots k$ the maximizer of entropy is an $f_0$ that is proportional to $\\exp(\\sum c_i h_i)$ for some choice of $c_i$. An extension of this to a continuum of constraints and many examples are presented.
Frequently used, highly appreciated?
Swart, Joëlle; Peters, Chris; Schrøder, Kim Christian
Digitalization has made patterns of news consumption immensely more varied than before, complicating industry attempts to adapt to changing user habits. In such a rapidly changing landscape, it is unclear how news audiences negotiate this environment and what impact this may have on the possible......, gender, region and educational level. It finds that the news media perceived most important to consumers’ everyday lives are not necessarily those consumed most frequently, challenging the notion that frequency of use and appreciation of a medium necessarily relate. In terms of the rise of social media...... news mediums become valuable in everyday life and what factors underlie this sense of value for different members of the public....
Dayger, Catherine A; Lutterschmidt, Deborah I
2017-03-18
Glucocorticoids often rise and fall with a variety of external and internal cues and frequently vary among life-history stages. This suggests that changing glucocorticoids may coordinate life-history transitions. To explore this hypothesis, we asked if the time-course of stress-induced glucocorticoid levels differ between two life-history transitions (i.e., spring and fall migration) in female red-sided garter snakes (Thamnophis sirtalis parietalis). We collected non-migratory females from a communal den and migratory females from a road along the migration route and treated them with 4h of capture stress; plasma corticosterone was measured before, during and after capture stress. During the spring, den-collected females exhibited a stress-induced peak in corticosterone at an earlier sampling time than migrating, road-collected females. Because the pattern of corticosterone responses varied with migratory state, negative feedback on and/or sensitivity of the hypothalamus-pituitaryadrenal (HPA) axis may be linked to spring migration. During the fall, capture stress elicited an increase in corticosterone in den-collected females but not in migrating, road-collected females. Baseline corticosterone was higher and both maximal and integrated corticosterone responses were lower during the fall compared to spring, indicating that stress responses are smaller when baseline corticosterone is elevated, perhaps due to a "ceiling effect". These data suggest that HPA axis regulation changes during seasonal migration, possibly via altering negative feedback, HPA axis sensitivity, or some other mechanism. This study supports the hypothesis that glucocorticoids coordinate life-history events and suggests that examining a suite of stress response characteristics is most informative for understanding the function of HPA modulation.
Maximizing and customer loyalty: Are maximizers less loyal?
Linda Lai
2011-06-01
Full Text Available Despite their efforts to choose the best of all available solutions, maximizers seem to be more inclined than satisficers to regret their choices and to experience post-decisional dissonance. Maximizers may therefore be expected to change their decisions more frequently and hence exhibit lower customer loyalty to providers of products and services compared to satisficers. Findings from the study reported here (N = 1978 support this prediction. Maximizers reported significantly higher intentions to switch to another service provider (television provider than satisficers. Maximizers' intentions to switch appear to be intensified and mediated by higher proneness to regret, increased desire to discuss relevant choices with others, higher levels of perceived knowledge of alternatives, and higher ego involvement in the end product, compared to satisficers. Opportunities for future research are suggested.
Péricault, Youen; Pothier, Catherine; Méger, Nicolas; Trouvé, Emmanuel; Vernier, Flavien; Rigotti, Christophe; Malet, Jean-Philippe
2016-04-01
Image time series acquired with remote sensing methods based on optical terrestrial photogrammetry have great potential for understanding and monitoring the Earth surface dynamics at local scale, and are particularly interesting for landslide monitoring. Image correlation techniques can be applied to calculate the displacement fields, in either the image geometry or the terrain geometry if orthorectification procedures are applied. The resulting products are times series of displacement vectors for each epoch in which knowledge extraction techniques can be applied to discover relevant movement patterns in space and time. We used an unsupervised method (Grouped Frequent Sequential patterns / GFS-patterns) based on the mining of the displacement field. The method was originally developed for the analysis of time series of satellite images. It involves the extraction of trends / sub-trends affecting each pixel covering at least a minimum surface area and sufficiently connected to each other. The results of the mining are presented in spatio-temporal location maps (STL-map) of each GFS-pattern. In these maps, the spatial information is given by the pixel locations and the time information is displayed using a color ramp. The method is tested on a time series of 36 optical terrestrial images of the Sanières/Roche Plombée rockslide (South East French Alps) from 28 of July to 1 September 2014. From this series 35 2D displacement fields were calculated for epochs of three days, and the time series of vector magnitude and direction were analysed with GFS-patterns / STL-map. The method allowed identifying several patterns corresponding to different kinematical behaviour of the rockslide (long-term creep at the top of the slope, surficial movement of the debris at the base of the slope). The unsupervised knowledge extraction method GFS-pattern / STL-map, originally developed to analyse time series of satellite images showed in this study real possibilities of use for
Profit maximization mitigates competition
Dierker, Egbert; Grodal, Birgit
1996-01-01
We consider oligopolistic markets in which the notion of shareholders' utility is well-defined and compare the Bertrand-Nash equilibria in case of utility maximization with those under the usual profit maximization hypothesis. Our main result states that profit maximization leads to less price...... competition than utility maximization. Since profit maximization tends to raise prices, it may be regarded as beneficial for the owners as a whole. Moreover, if profit maximization is a good proxy for utility maximization, then there is no need for a general equilibrium analysis that takes the distribution...... of profits among consumers fully into account and partial equilibrium analysis suffices...
Maximally incompatible quantum observables
Heinosaari, Teiko, E-mail: teiko.heinosaari@utu.fi [Turku Centre for Quantum Physics, Department of Physics and Astronomy, University of Turku, FI-20014 Turku (Finland); Schultz, Jussi, E-mail: jussi.schultz@gmail.com [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Toigo, Alessandro, E-mail: alessandro.toigo@polimi.it [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, I-20133 Milano (Italy); Ziman, Mario, E-mail: ziman@savba.sk [RCQI, Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 84511 Bratislava (Slovakia); Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno (Czech Republic)
2014-05-01
The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.
Hiebert, Laurel S; Maslakova, Svetlana A
2015-04-11
The pilidium larva is a novel body plan that arose within a single clade in the phylum Nemertea - the Pilidiophora. While the sister clade of the Pilidiophora and the basal nemerteans develop directly, pilidiophorans have a long-lived planktotrophic larva with a body plan distinctly different from that of the juvenile. Uniquely, the pilidiophoran juvenile develops inside the larva from several discrete rudiments. The orientation of the juvenile with respect to the larval body varies within the Pilidiophora, which suggests that the larval and juvenile anteroposterior (AP) axes are patterned differently. In order to gain insight into the evolutionary origins of the pilidium larva and the mechanisms underlying this implied axial uncoupling, we examined the expression of the Hox genes during development of the pilidiophoran Micrura alaskensis. We identified sequences of nine Hox genes and the ParaHox gene caudal through a combination of transcriptome analysis and molecular cloning, and determined their expression pattern during development using in situ hybridization in whole-mounted larvae. We found that Hox genes are first expressed long after the pilidium is fully formed and functional. The Hox genes are expressed in apparently overlapping domains along the AP axis of the developing juvenile in a subset of the rudiments that give rise to the juvenile trunk. Hox genes are not expressed in the larval body at any stage of development. While the Hox genes pattern the juvenile pilidiophoran, the pilidial body, which appears to be an evolutionary novelty, must be patterned by some mechanism other than the Hox genes. Although the pilidiophoran juvenile develops from separate rudiments with no obvious relationship to the embryonic formation of the larva, the Hox genes appear to exhibit canonical expression along the juvenile AP axis. This suggests that the Hox patterning system can maintain conserved function even when widely decoupled from early polarity established in the
Reynolds, A. M.
2012-01-01
Optimal foraging theory shows how fitness-maximizing foragers can use information about patch quality to decide how to search within patches. It is amply supported by empirical studies. Nonetheless, the theory largely ignores the fact that foragers may need to search for patches as well as for the targets within them. Here, using an exact but simple mathematical argument, it is shown how foragers can use information about patch quality to facilitate the execution of Lévy walk movement patterns with μ = 2 at inter-patch scales. These movement patterns are advantageous when searching for patches that are not depleted or rejected once visited but instead remain profitable. The analytical results are verified by the results of numerical simulations. The findings bring forth an innovative theoretical synthesis of searching for and within patches and, suggest that foragers' memories may be adaptive under spatially heterogeneous reward schedules. PMID:22258553
Mining Frequent Itemsets in Correlated Uncertain Databases
童咏昕; 陈雷; 佘洁莹
2015-01-01
Recently, with the growing popularity of Internet of Things (IoT) and pervasive computing, a large amount of uncertain data, e.g., RFID data, sensor data, real-time video data, has been collected. As one of the most fundamental issues of uncertain data mining, uncertain frequent pattern mining has attracted much attention in database and data mining communities. Although there have been some solutions for uncertain frequent pattern mining, most of them assume that the data is independent, which is not true in most real-world scenarios. Therefore, current methods that are based on the independent assumption may generate inaccurate results for correlated uncertain data. In this paper, we focus on the problem of mining frequent itemsets over correlated uncertain data, where correlation can exist in any pair of uncertain data objects (transactions). We propose a novel probabilistic model, called Correlated Frequent Probability model (CFP model) to represent the probability distribution of support in a given correlated uncertain dataset. Based on the distribution of support derived from the CFP model, we observe that some probabilistic frequent itemsets are only frequent in several transactions with high positive correlation. In particular, the itemsets, which are global probabilistic frequent, have more significance in eliminating the influence of the existing noise and correlation in data. In order to reduce redundant frequent itemsets, we further propose a new type of patterns, called global probabilistic frequent itemsets, to identify itemsets that are always frequent in each group of transactions if the whole correlated uncertain database is divided into disjoint groups based on their correlation. To speed up the mining process, we also design a dynamic programming solution, as well as two pruning and bounding techniques. Extensive experiments on both real and synthetic datasets verify the effectiveness and eﬃciency of the proposed model and algorithms.
Scalable Frequent Subgraph Mining
Abdelhamid, Ehab
2017-06-19
A graph is a data structure that contains a set of nodes and a set of edges connecting these nodes. Nodes represent objects while edges model relationships among these objects. Graphs are used in various domains due to their ability to model complex relations among several objects. Given an input graph, the Frequent Subgraph Mining (FSM) task finds all subgraphs with frequencies exceeding a given threshold. FSM is crucial for graph analysis, and it is an essential building block in a variety of applications, such as graph clustering and indexing. FSM is computationally expensive, and its existing solutions are extremely slow. Consequently, these solutions are incapable of mining modern large graphs. This slowness is caused by the underlying approaches of these solutions which require finding and storing an excessive amount of subgraph matches. This dissertation proposes a scalable solution for FSM that avoids the limitations of previous work. This solution is composed of four components. The first component is a single-threaded technique which, for each candidate subgraph, needs to find only a minimal number of matches. The second component is a scalable parallel FSM technique that utilizes a novel two-phase approach. The first phase quickly builds an approximate search space, which is then used by the second phase to optimize and balance the workload of the FSM task. The third component focuses on accelerating frequency evaluation, which is a critical step in FSM. To do so, a machine learning model is employed to predict the type of each graph node, and accordingly, an optimized method is selected to evaluate that node. The fourth component focuses on mining dynamic graphs, such as social networks. To this end, an incremental index is maintained during the dynamic updates. Only this index is processed and updated for the majority of graph updates. Consequently, search space is significantly pruned and efficiency is improved. The empirical evaluation shows that the
Parker, Andrew M.; Wandi Bruine de Bruin; Baruch Fischhoff
2007-01-01
Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions...
王洁; 戴清灏; 曾宇; 杨东日
2012-01-01
Aiming at the massive data mining task in cloud manufacturing environment, the reahzatlon ot exastmg parallel frequent pattern growth algorithm and its disadvantages were analyzed. By using key value store system, its counting and grouping parts were optimized. Based on simple, auto-increment and orderly manner of key value store system, the information of counting and grouping was stored on key value database. Through reducing the readwrite of Distributed File System (DFS) and parallel executing the process of counting and grouping, the network and memory cost of storage node was decreased by optimization algorithm. On real datasets, the performance and file system I/O cost of algorithms before and after optimization were compared by experiments.%针对云制造环境下的海量数据挖掘,分析了现有并行频繁模式增长算法的实现和不足。研究了利用键值存储系统对其中的计数和分组部分进行优化。利用键值型数据库存储简单、自动增长且有序的方式,将计数和分组的信息存储在了键值型数据库上。通过减少对分布式文件系统的读写,并将计数过程和排序过程并行化执行,优化后的算法减小了存储节点的网络及内存开销。在真实数据集上,通过实验对比了优化前后算法的性能以及对于文件系统I/O的开销。
Elizabeth P Derryberry
Full Text Available Soundscapes pose both evolutionarily recent and long-standing sources of selection on acoustic communication. We currently know more about the impact of evolutionarily recent human-generated noise on communication than we do about how natural sounds such as pounding surf have shaped communication signals over evolutionary time. Based on signal detection theory, we hypothesized that acoustic phenotypes will vary with both anthropogenic and natural background noise levels and that similar mechanisms of cultural evolution and/or behavioral flexibility may underlie this variation. We studied song characteristics of white-crowned sparrows (Zonotrichia leucophrys nuttalli across a noise gradient that includes both anthropogenic and natural sources of noise in San Francisco and Marin counties, California, USA. Both anthropogenic and natural soundscapes contain high amplitude low frequency noise (traffic or surf, respectively, so we predicted that birds would produce songs with higher minimum frequencies in areas with higher amplitude background noise to avoid auditory masking. We also anticipated that song minimum frequencies would be higher than the projected lower frequency limit of hearing based on site-specific masking profiles. Background noise was a strong predictor of song minimum frequency, both within a local noise gradient of three urban sites with the same song dialect and cultural evolutionary history, and across the regional noise gradient, which encompasses 11 urban and rural sites, several dialects, and several anthropogenic and natural sources of noise. Among rural sites alone, background noise tended to predict song minimum frequency, indicating that urban sites were not solely responsible for driving the regional pattern. These findings support the hypothesis that songs vary with local and regional soundscapes regardless of the source of noise. Song minimum frequency from five core study sites was also higher than the lower frequency
Ming Yi WANG; Guo ZHAO
2005-01-01
A right R-module E over a ring R is said to be maximally injective in case for any maximal right ideal m of R, every R-homomorphism f : m → E can be extended to an R-homomorphism f' : R → E. In this paper, we first construct an example to show that maximal injectivity is a proper generalization of injectivity. Then we prove that any right R-module over a left perfect ring R is maximally injective if and only if it is injective. We also give a partial affirmative answer to Faith's conjecture by further investigating the property of maximally injective rings. Finally, we get an approximation to Faith's conjecture, which asserts that every injective right R-module over any left perfect right self-injective ring R is the injective hull of a projective submodule.
Andrew M. Parker
2007-12-01
Full Text Available Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007. Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002, we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions, more avoidance of decision making, and greater tendency to experience regret. Contrary to predictions, self-reported maximizers were more likely to report spontaneous decision making. However, the relationship between self-reported maximizing and worse life outcomes is largely unaffected by controls for measures of other decision-making styles, decision-making competence, and demographic variables.
Brüstle, Thomas; Pérotin, Matthieu
2012-01-01
Maximal green sequences are particular sequences of quiver mutations which were introduced by Keller in the context of quantum dilogarithm identities and independently by Cecotti-Cordova-Vafa in the context of supersymmetric gauge theory. Our aim is to initiate a systematic study of these sequences from a combinatorial point of view. Interpreting maximal green sequences as paths in various natural posets arising in representation theory, we prove the finiteness of the number of maximal green sequences for cluster finite quivers, affine quivers and acyclic quivers with at most three vertices. We also give results concerning the possible numbers and lengths of these maximal green sequences. Finally we describe an algorithm for computing maximal green sequences for arbitrary valued quivers which we used to obtain numerous explicit examples that we present.
Rudiger Bubner
1998-12-01
Full Text Available Even though the maxims' theory is not at thecenter of Kant's ethics, it is the unavoidable basis of the categoric imperative's formulation. Kant leanson the transmitted representations of modem moral theory. During the last decades, the notion of maxims has deserved more attention, due to the philosophy of language's debates on rules, and due to action theory's interest in this notion. I here by brietly expound my views in these discussions.
佟达; 张燕; 宋魁彦
2012-01-01
以天然林五角槭的木材解剖性质为研究对象，分析其株内木材材质径向变异规律，对幼龄材与成熟材进行初步界定。结果表明：细胞壁厚、壁腔比、胞壁率和径、弦向直径幼龄期波动较大，成熟期波动减弱；木纤维长度符合Pan．shinⅠ模型，幼龄材拟合度较好；组织比量符合Y=acebx变异模型；幼龄材和成熟材的界定年限为28～33a之间。%Taking wood anatomical property, of A. mono Maxim natural forest as research object, its radial variation rules of wood properties was analyzed, which could give an initial confirmation of the boundary between juvenile wood and mature wood. Results show that the fiber wall thickness, cell wall to cavity ratio, fiber wall ratio, radial diameter and tangential diameter of juvenile wood have greater fluctuate than that of mature wood. Wood fiber length belongs to Panshin I Pattern with a high fitting degree in juvenile wood. Tissues radio satisfies the model of y = aebx. The boundary area of juvenile wood and mature wood is between 28a to 33a.
LGM: Mining Frequent Subgraphs from Linear Graphs
Tabei, Yasuo; Hirose, Shuichi; Tsuda, Koji
2011-01-01
A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures and predicate-argument structures. Our algorithm, linear graph miner (LGM), leverages the vertex order for efficient enumeration of frequent subgraphs. Based on the reverse search principle, the pattern space is systematically traversed without expensive duplication checking. Disconnected subgraph patterns are particularly important in linear graphs due to their sequential nature. Unlike conventional graph mining algorithms detecting connected patterns only, LGM can detect disconnected patterns as well. The utility and efficiency of LGM are demonstrated in experiments on protein contact maps.
LGBT Caregiving: Frequently Asked Questions
... FCA - A A + A You are here Home LGBT Caregiving: Frequently Asked Questions Order this publication Printer- ... service or organization is open to working with LGBT families? Kudos to you for managing to “go ...
Frequent Questions About Universal Waste
Frequent questions such as Who is affected by the universal waste regulations? What is “mercury-containing equipment”? How are waste batteries managed under universal waste? How are waste pesticides managed under universal waste?
Climate Leadership Awards Frequent Questions
Provides answers to frequently asked questions regarding the Climate Leadership Awards, sponsored by EPA's Center for Corporate Climate Leadership with co-sponsorship from the Center for Climate and Energy Solutions and The Climate Registry.
Frequently Asked Questions about Pharmacogenomics
... Care Specific Genetic Disorders Frequently Asked Questions About Pharmacogenomics Enlarge What is pharmacogenomics? What might pharmacogenomics mean ... page, you will need Adobe Reader. What is pharmacogenomics? Pharmacogenomics uses information about a person's genetic makeup, ...
Janusz Brzozowski
2014-05-01
Full Text Available The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We introduce a new class of regular languages, called the maximally atomic languages, consisting of all languages meeting these bounds. We prove the following result: If L is a regular language of quotient complexity n and G is the subgroup of permutations in the transition semigroup T of the minimal DFA of L, then L is maximally atomic if and only if G is transitive on k-subsets of 1,...,n for 0 <= k <= n and T contains a transformation of rank n-1.
Andersen, Klaus Ejner
1985-01-01
Guinea pig maximization tests (GPMT) with chlorocresol were performed to ascertain whether the sensitization rate was affected by minor changes in the Freund's complete adjuvant (FCA) emulsion used. Three types of emulsion were evaluated: the oil phase was mixed with propylene glycol, saline with...... to the saline/oil emulsion. Placing of the challenge patches affected the response, as simultaneous chlorocresol challenge on the flank located 2 cm closer to the abdomen than the usual challenge site gave decreased reactions....
Zak, Michail
2008-01-01
A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).
The Most Frequent English Homonyms
Parent, Kevin
2012-01-01
This article distinguishes homonymy, homophony, homography and polysemy, and provides a list of the most frequent homonyms using corpus-derived data. For most of the homonyms, the most common meaning accounts for 90% or more of the total uses of the form. The pedagogical and research implications of these findings are discussed. (Contains 5…
Social group utility maximization
Gong, Xiaowen; Yang, Lei; Zhang, Junshan
2014-01-01
This SpringerBrief explains how to leverage mobile users' social relationships to improve the interactions of mobile devices in mobile networks. It develops a social group utility maximization (SGUM) framework that captures diverse social ties of mobile users and diverse physical coupling of mobile devices. Key topics include random access control, power control, spectrum access, and location privacy.This brief also investigates SGUM-based power control game and random access control game, for which it establishes the socially-aware Nash equilibrium (SNE). It then examines the critical SGUM-b
Brandes, U; Gaertler, M; Goerke, R; Hoefer, M; Nikoloski, Z; Wagner, D
2006-01-01
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to emphasize the plausibility of results, none of these algorithms has been shown to actually compute optimal partitions. We here settle the unknown complexity status of modularity maximization by showing that the corresponding decision version is NP-complete in the strong sense. As a consequence, any efficient, i.e. polynomial-time, algorithm is only heuristic and yields suboptimal partitions on many instances.
Maximizing without difficulty: A modified maximizing scale and its correlates
Linda Lai
2010-01-01
This article presents several studies that replicate and extend previous research on maximizing. A modified scale for measuring individual maximizing tendency is introduced. The scale has adequate psychometric properties and reflects maximizers' aspirations for high standards and their preference for extensive alternative search, but not the decision difficulty aspect included in several previous studies. Based on this scale, maximizing is positively correlated with optimism, need for cogniti...
HEMI: Hyperedge Majority Influence Maximization
Gangal, Varun; Narayanam, Ramasuri
2016-01-01
In this work, we consider the problem of influence maximization on a hypergraph. We first extend the Independent Cascade (IC) model to hypergraphs, and prove that the traditional influence maximization problem remains submodular. We then present a variant of the influence maximization problem (HEMI) where one seeks to maximize the number of hyperedges, a majority of whose nodes are influenced. We prove that HEMI is non-submodular under the diffusion model proposed.
Andersen, Klaus Ejner
1985-01-01
Guinea pig maximization tests (GPMT) with chlorocresol were performed to ascertain whether the sensitization rate was affected by minor changes in the Freund's complete adjuvant (FCA) emulsion used. Three types of emulsion were evaluated: the oil phase was mixed with propylene glycol, saline...... with 30% (v/v) ethanol or saline, respectively. Relative viscosity was used as one measure of physical properties of the emulsion. Higher degrees of sensitization (but not rates) were obtained at the 48 h challenge reading with the oil/propylene glycol and oil/saline + ethanol emulsions compared...... to the saline/oil emulsion. Placing of the challenge patches affected the response, as simultaneous chlorocresol challenge on the flank located 2 cm closer to the abdomen than the usual challenge site gave decreased reactions....
MAXIMS VIOLATIONS IN LITERARY WORK
Widya Hanum Sari Pertiwi
2015-12-01
Full Text Available This study was qualitative research action that focuses to find out the flouting of Gricean maxims and the functions of the flouting in the tales which are included in collection of children literature entitled My Giant Treasury of Stories and Rhymes. The objective of the study is generally to identify the violation of maxims of quantity, quality, relevance, and manner in the data sources and also to analyze the use of the flouting in the tales which are included in the book. Qualitative design using categorizing strategies, specifically coding strategy, was applied. Thus, the researcher as the instrument in this investigation was selecting the tales, reading them, and gathering every item which reflects the violation of Gricean maxims based on some conditions of flouting maxims. On the basis of the data analysis, it was found that the some utterances in the tales, both narration and conversation, flouting the four maxims of conversation, namely maxim of quality, maxim of quantity, maxim of relevance, and maxim of manner. The researcher has also found that the flouting of maxims has one basic function that is to encourage the readers’ imagination toward the tales. This one basic function is developed by six others functions: (1 generating specific situation, (2 developing the plot, (3 enlivening the characters’ utterance, (4 implicating message, (5 indirectly characterizing characters, and (6 creating ambiguous setting. Keywords: children literature, tales, flouting maxims
Swanepoel, Konrad J
2011-01-01
A subset of a normed space X is called equilateral if the distance between any two points is the same. Let m(X) be the smallest possible size of an equilateral subset of X maximal with respect to inclusion. We first observe that Petty's construction of a d-dimensional X of any finite dimension d >= 4 with m(X)=4 can be generalised to show that m(X\\oplus_1\\R)=4 for any X of dimension at least 2 which has a smooth point on its unit sphere. By a construction involving Hadamard matrices we then show that both m(\\ell_p) and m(\\ell_p^d) are finite and bounded above by a function of p, for all 1 1 such that m(X) <= d+1 for all d-dimensional X with Banach-Mazur distance less than c from \\ell_p^d. Using Brouwer's fixed-point theorem we show that m(X) <= d+1 for all d-\\dimensional X with Banach-Mazur distance less than 3/2 from \\ell_\\infty^d. A graph-theoretical argument furthermore shows that m(\\ell_\\infty^d)=d+1. The above results lead us to conjecture that m(X) <= 1+\\dim X.
Unified Maximally Natural Supersymmetry
Huang, Junwu
2016-01-01
Maximally Natural Supersymmetry, an unusual weak-scale supersymmetric extension of the Standard Model based upon the inherently higher-dimensional mechanism of Scherk-Schwarz supersymmetry breaking (SSSB), possesses remarkably good fine tuning given present LHC limits. Here we construct a version with precision $SU(2)_{\\rm L} \\times U(1)_{\\rm Y} $ unification: $\\sin^2 \\theta_W(M_Z) \\simeq 0.231$ is predicted to $\\pm 2\\%$ by unifying $SU(2)_{\\rm L} \\times U(1)_{\\rm Y} $ into a 5D $SU(3)_{\\rm EW}$ theory at a Kaluza-Klein scale of $1/R_5 \\sim 4.4\\,{\\rm TeV}$, where SSSB is simultaneously realised. Full unification with $SU(3)_{\\rm C}$ is accommodated by extending the 5D theory to a $N=4$ supersymmetric $SU(6)$ gauge theory on a 6D rectangular orbifold at $1/R_6 \\sim 40 \\,{\\rm TeV}$. TeV-scale states beyond the SM include exotic charged fermions implied by $SU(3)_{\\rm EW}$ with masses lighter than $\\sim 1.2\\,{\\rm TeV}$, and squarks in the mass range $1.4\\,{\\rm TeV} - 2.3\\,{\\rm TeV}$, providing distinct signature...
Pushing Multiple Convertible Constrains into Frequent Itemsets Mining
SONG Baoli; QIN Zheng
2006-01-01
Constraint pushing techniques have been developed for mining frequent patterns and association rules. However, multiple constraints cannot be handled with existing techniques in frequent pattern mining. In this paper, a new algorithm MCFMC (mining complete set of frequent itemsets with multiple constraints) is introduced. The algorithm takes advantage of the fact that a convertible constraint can be pushed into mining algorithm to reduce mining research spaces. By using a sample database, the algorithm develops techniques which select an optimal method based on a sample database to convert multiple constraints into multiple convertible constraints, disjoined by conjunction and/or, and then partition these constraints into two parts. One part is pushed deep inside the mining process to reduce the research spaces for frequent itemsets, the other part that cannot be pushed in algorithm is used to filter the complete set of frequent itemsets and get the final result. Results from our detailed experiment show the feasibility and effectiveness of the algorithm.
[Osmolality of frequently consumed beverages].
Dini, Elizabeth; De Abreu, Jorge; López, Emeris
2004-12-01
The objective of this work was to determine the osmolality of beverages frequently consumed by children and adolescents due to the scarce information available in our country. The samples were grouped as follows: milks; refreshments; beverages based on fruits, vegetables, cereals, and tubers; sport drinks; energizing drinks; oral rehydrating solutions; reconstituted drinks and infusions. A vapor pressure digital osmometer was used, five samples of each beverage from different lots were analyzed. Four osmolality determinations were made on each sample and the average of such values was calculated. When the variation coefficient of the osmolality measurements of the five samples was higher than 10%, five additional samples were analyzed. As many samples as possible were used with breast milk in the time period of the study. Osmolality averages, standard deviation, and the osmolality confidence intervals (95% reliability) were calculated. The osmolality (mmol/kg) of breast milk and that of cow milk were between 273 and 389; refreshments, white, black and flavored colas, and malts ranged between 479-811; and soda and light drinks: 44-62; fresh fruit and commercial drinks (coconut, peach, apple, orange, pear, pineapple, grape, plum, tamarind): 257-1152 and light juices: 274; sports beverages: 367; energizing drinks: 740; drinks based on vegetables and cereals: 213-516; oral rehydrating solutions: 236-397; reconstituted drinks: 145; infusions: 25. Beverages with adequate osmolality levels for children were: milks, light refreshments, soda, fresh and light juices, oral rehydrating, soy, and reconstituted drinks and infusions.
Maximal subgroups of finite groups
S. Srinivasan
1990-01-01
Full Text Available In finite groups maximal subgroups play a very important role. Results in the literature show that if the maximal subgroup has a very small index in the whole group then it influences the structure of the group itself. In this paper we study the case when the index of the maximal subgroups of the groups have a special type of relation with the Fitting subgroup of the group.
Finding Maximal Quasiperiodicities in Strings
Brodal, Gerth Stølting; Pedersen, Christian N. S.
2000-01-01
of length n in time O(n log n) and space O(n). Our algorithm uses the suffix tree as the fundamental data structure combined with efficient methods for merging and performing multiple searches in search trees. Besides finding all maximal quasiperiodic substrings, our algorithm also marks the nodes......Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log2 n). In this paper we give an algorithm that finds all maximal quasiperiodic substrings in a string...
Maximizing Entropy over Markov Processes
Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis
2013-01-01
computation reduces to finding a model of a specification with highest entropy. Entropy maximization for probabilistic process specifications has not been studied before, even though it is well known in Bayesian inference for discrete distributions. We give a characterization of global entropy of a process...... as a reward function, a polynomial algorithm to verify the existence of an system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...
Maximizing entropy over Markov processes
Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis
2014-01-01
computation reduces to finding a model of a specification with highest entropy. Entropy maximization for probabilistic process specifications has not been studied before, even though it is well known in Bayesian inference for discrete distributions. We give a characterization of global entropy of a process...... as a reward function, a polynomial algorithm to verify the existence of a system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...
The frequent occurrence of MIC
Graff, Matthias [Gesellschaft fuer Technische Mikrobiologie und Hygieneueberwachung - Dr. Graff und Partner, Stadtweg 9, D-38176 Wendeburg (Germany); Neubert, Volkmar [Institut fuer Materialpruefung und Werkstofftechnik Dr. Doelling und Dr. Neubert GmbH, Freiberger Strasse 1, D-38678 Clausthal-Zellerfeld (Germany)
2004-07-01
Microbial induced corrosion (MIC) is not as rare as many materials scientist and corrosion practitioners do believe. It is not an exotic and scarce event, but can be found frequently in many fields of corrosion research, provided that it is looked for. The reason for the relatively few descriptions of MIC cases seems to be the fact, that the microbiological approach is not widely known and applied in the world of materials science. MIC is not so much a corrosion mechanism on its own, but it enhances the corrosion rates of the 'normal' mechanisms to such an extent, that in some cases 'incredible' fast corrosion progress can be observed. The reason is the microorganisms' function as bio-catalysts: Chemical reactions, which are very slow under normal chemical conditions can be highly accelerated by living organisms. Besides that, several microorganisms do produce very corrosive substances which in natural environments do not occur without the activity of microorganisms, e. g. sulfuric or nitric acid. We want to point out, that it can be very worthy to take microbial induced corrosion into account. MIC is not the general answer for all unsolved corrosion problems, but to think about it helps in many corrosion cases as the authors had to experience. The initial indication for the presence of MIC are markedly increased corrosion rates. In the following, some of our 'lessons' are presented as short case studies: Two of them deal with steel corrosion characterized by increased corrosion rates. The third example presents corrosion damage of aluminium structures, where from a technical point of view corrosion was not expected, least of all microbial induced corrosion. (authors)
Finding Frequent Patterns in a Large Sparse Graph
2003-09-25
data.html 4http://vlsicad.cs.ucla.edu/∼ cheese /ispd98.html Table 2: Datasets used in the experiments Dataset Connected Vertices Edges Labels Components...Journal of Applied Intelligence, 4:297–328, 1994. [72] M. J. Zaki and K. Gouda . Fast vertical mining using diffsets. In Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), 2003.
Smartphone gaming and frequent use pattern associated with smartphone addiction
Liu, Chun-Hao; Lin, Sheng-Hsuan; Pan, Yuan-Chien; Lin, Yu-Hsuan
2016-01-01
... students.A total of 880 adolescents were recruited from a vocational high school in Taiwan in January 2014 to complete a set of questionnaires, including the 10-item Smartphone Addiction Inventory, Chen...
Gonzalez-Sanchez, Jon
2010-01-01
Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\\{w (g_1,...,g_n)^{\\pm 1} | g_i \\in G, 1\\leq i\\leq n \\}$ of all $w$-values in $G$. We say that a (finite) group $G$ is $w$-maximal if $|G:w(G)|> |H:w(H)|$ for all proper subgroups $H$ of $G$ and that $G$ is hereditarily $w$-maximal if every subgroup of $G$ is $w$-maximal. In this text we study $w$-maximal and hereditarily $w$-maximal (finite) groups.
Extracting Frequent Connected Subgraphs from Large Graph Sets
Wei Wang; Qing-Qing Yuan; Hao-Feng Zhou; Ming-Sheng Hong; Bai-Le Shi
2004-01-01
Mining frequent patterns from datasets is one of the key success of data mining research. Currently, most of the studies focus on the data sets in which the elements are independent, such as the items in the marketing basket.. However, the objects in the real world often have close relationship with each other. How to extract frequent patterns from these relations is the objective of this paper. The authors use graphs to model the relations, and select a simple type for analysis. Combining the graph theory and algorithms to generate frequent patterns, a new algorithm called Topology, which can mine these graphs efficiently, has been proposed. The performance of the algorithm is evaluated by doing experiments with synthetic datasets and real data. The experimental results show that Topology can do the job well. At the end of this paper, the potential improvement is mentioned.
Maximizing without difficulty: A modified maximizing scale and its correlates
Lai, Linda
2010-01-01
... included in several previous studies. Based on this scale, maximizing is positively correlated with optimism, need for cognition, desire for consistency, risk aversion, intrinsic motivation, self-efficacy and perceived workload, whereas...
Are maximizers really unhappy? The measurement of maximizing tendency,
Dalia L. Diab
2008-06-01
Full Text Available Recent research suggesting that people who maximize are less happy than those who satisfice has received considerable fanfare. The current study investigates whether this conclusion reflects the construct itself or rather how it is measured. We developed an alternative measure of maximizing tendency that is theory-based, has good psychometric properties, and predicts behavioral outcomes. In contrast to the existing maximization measure, our new measure did not correlate with life (dissatisfaction, nor with most maladaptive personality and decision-making traits. We conclude that the interpretation of maximizers as unhappy may be due to poor measurement of the construct. We present a more reliable and valid measure for future researchers to use.
Principles of maximally classical and maximally realistic quantum mechanics
S M Roy
2002-08-01
Recently Auberson, Mahoux, Roy and Singh have proved a long standing conjecture of Roy and Singh: In 2-dimensional phase space, a maximally realistic quantum mechanics can have quantum probabilities of no more than + 1 complete commuting cets (CCS) of observables coexisting as marginals of one positive phase space density. Here I formulate a stationary principle which gives a nonperturbative deﬁnition of a maximally classical as well as maximally realistic phase space density. I show that the maximally classical trajectories are in fact exactly classical in the simple examples of coherent states and bound states of an oscillator and Gaussian free particle states. In contrast, it is known that the de Broglie–Bohm realistic theory gives highly nonclassical trajectories.
Trend of maximal inspiratory pressure in mechanically ventilated patients: predictors
Pedro Caruso
2008-01-01
Full Text Available INTRODUCTION: It is known that mechanical ventilation and many of its features may affect the evolution of inspiratory muscle strength during ventilation. However, this evolution has not been described, nor have its predictors been studied. In addition, a probable parallel between inspiratory and limb muscle strength evolution has not been investigated. OBJECTIVE: To describe the variation over time of maximal inspiratory pressure during mechanical ventilation and its predictors. We also studied the possible relationship between the evolution of maximal inspiratory pressure and limb muscle strength. METHODS: A prospective observational study was performed in consecutive patients submitted to mechanical ventilation for > 72 hours. The maximal inspiratory pressure trend was evaluated by the linear regression of the daily maximal inspiratory pressure and a logistic regression analysis was used to look for independent maximal inspiratory pressure trend predictors. Limb muscle strength was evaluated using the Medical Research Council score. RESULTS: One hundred and sixteen patients were studied, forty-four of whom (37.9% presented a decrease in maximal inspiratory pressure over time. The members of the group in which maximal inspiratory pressure decreased underwent deeper sedation, spent less time in pressure support ventilation and were extubated less frequently. The only independent predictor of the maximal inspiratory pressure trend was the level of sedation (OR=1.55, 95% CI 1.003 - 2.408; p = 0.049. There was no relationship between the maximal inspiratory pressure trend and limb muscle strength. CONCLUSIONS: Around forty percent of the mechanically ventilated patients had a decreased maximal inspiratory pressure during mechanical ventilation, which was independently associated with deeper levels of sedation. There was no relationship between the evolution of maximal inspiratory pressure and the muscular strength of the limb.
Evolution of correlated multiplexity through stability maximization
Dwivedi, Sanjiv K
2016-01-01
Investigating relation between various structural patterns found in real-world networks and stability of underlying systems is crucial to understand importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising of anti-symmetric couplings in one layer, depicting predator-prey relation, and symmetric couplings in the other, depicting mutualistic (or competitive) relation, based on stability maximization through the largest eigenvalue. We find that the correlated multiplexity emerges as evolution progresses. The evolved values of the correlated multiplexity exhibit a dependence on the inter-link coupling strength. Furthermore, the inter-layer coupling strength governs the evolution of disassortativity property in the individual layers. We provide analytical understanding to these findings by considering star like networks in both the layers. The model and tools used here are useful for understanding the principles governing the stability as well as importance of such patterns in ...
GRAMI: Generalized Frequent Subgraph Mining in Large Graphs
El Saeedy, Mohammed El Sayed
2011-07-24
Mining frequent subgraphs is an important operation on graphs. Most existing work assumes a database of many small graphs, but modern applications, such as social networks, citation graphs or protein-protein interaction in bioinformatics, are modeled as a single large graph. Interesting interactions in such applications may be transitive (e.g., friend of a friend). Existing methods, however, search for frequent isomorphic (i.e., exact match) subgraphs and cannot discover many useful patterns. In this paper we propose GRAMI, a framework that generalizes frequent subgraph mining in a large single graph. GRAMI discovers frequent patterns. A pattern is a graph where edges are generalized to distance-constrained paths. Depending on the definition of the distance function, many instantiations of the framework are possible. Both directed and undirected graphs, as well as multiple labels per vertex, are supported. We developed an efficient implementation of the framework that models the frequency resolution phase as a constraint satisfaction problem, in order to avoid the costly enumeration of all instances of each pattern in the graph. We also implemented CGRAMI, a version that supports structural and semantic constraints; and AGRAMI, an approximate version that supports very large graphs. Our experiments on real data demonstrate that our framework is up to 3 orders of magnitude faster and discovers more interesting patterns than existing approaches.
Maximizing ROI with yield management
Neil Snyder
2001-01-01
.... the technology is based on the concept of yield management, which aims to sell the right product to the right customer at the right price and the right time therefore maximizing revenue, or yield...
Are CEOs Expected Utility Maximizers?
John List; Charles Mason
2009-01-01
Are individuals expected utility maximizers? This question represents much more than academic curiosity. In a normative sense, at stake are the fundamental underpinnings of the bulk of the last half-century's models of choice under uncertainty. From a positive perspective, the ubiquitous use of benefit-cost analysis across government agencies renders the expected utility maximization paradigm literally the only game in town. In this study, we advance the literature by exploring CEO's preferen...
Gaussian maximally multipartite entangled states
Facchi, Paolo; Lupo, Cosmo; Mancini, Stefano; Pascazio, Saverio
2009-01-01
We introduce the notion of maximally multipartite entangled states (MMES) in the context of Gaussian continuous variable quantum systems. These are bosonic multipartite states that are maximally entangled over all possible bipartitions of the system. By considering multimode Gaussian states with constrained energy, we show that perfect MMESs, which exhibit the maximum amount of bipartite entanglement for all bipartitions, only exist for systems containing n=2 or 3 modes. We further numerically investigate the structure of MMESs and their frustration for n <= 7.
All maximally entangling unitary operators
Cohen, Scott M. [Department of Physics, Duquesne University, Pittsburgh, Pennsylvania 15282 (United States); Department of Physics, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213 (United States)
2011-11-15
We characterize all maximally entangling bipartite unitary operators, acting on systems A and B of arbitrary finite dimensions d{sub A}{<=}d{sub B}, when ancillary systems are available to both parties. Several useful and interesting consequences of this characterization are discussed, including an understanding of why the entangling and disentangling capacities of a given (maximally entangling) unitary can differ and a proof that these capacities must be equal when d{sub A}=d{sub B}.
Salvio, Alberto; Strumia, Alessandro; Urbano, Alfredo
2016-01-01
Motivated by the 750 GeV diphoton excess found at LHC, we compute the maximal width into $\\gamma\\gamma$ that a neutral scalar can acquire through a loop of charged fermions or scalars as function of the maximal scale at which the theory holds, taking into account vacuum (meta)stability bounds. We show how an extra gauge symmetry can qualitatively weaken such bounds, and explore collider probes and connections with Dark Matter.
Frequently Asked Questions about Bunion Surgery
... A | Print | Share Frequently Asked Questions About Bunion Surgery Here are some frequently asked questions (FAQs) and ... best for you. 5. How can I avoid surgery? Sometimes observation of the bunion is all that ...
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
Daniel Kunkle; Donghui Zhang; Gene Cooperman
2008-01-01
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact and general representations for all frequent patterns and all strong association rules in the generalized environment. Our results fill an important gap among algorithms for frequent patterns and association rules by combining two concepts. First, generalized itemsets employ a taxonomy of items, rather than a fiat list of items. This produces more natural frequent itemsets and associations such as (meat, milk) instead of (beef, milk), (chicken, milk), etc. Second, compact representations of frequent itemsets and strong rules, whose result size is exponentially smaller, can solve a standard dilemma in mining patterns: with small threshold values for support and confidence, the user is overwhelmed by the extraordinary number of identified patterns and associations; but with large threshold values, some interesting patterns and associations fail to be identified. Our algorithms can also expand those max frequent g-itemsets and essential g-rules into the much larger set of ordinary frequent g-itemsets and strong g-rules. While that expansion is not recommended in most practical cases, we do so in order to present a comparison with existing algorithms that only handle ordinary frequent g-itemsets. In this case, the new algorithm is shown to be thousands, and in some cases millions, of the time faster than previous algorithms. Further, the new algorithm succeeds in analyzing deeper taxonomies, with the depths of seven or more. Experimental results for previous algorithms limited themselves to taxonomies with depth at most three or four. In each of the two problems, a straightforward lattice-based approach is briefly discussed and then a classificationbased algorithm is developed. In particular, the two classification-based algorithms are MFGI_class for mining max frequent g-itemsets and EGR
A. Garmroodi Asil
2017-09-01
To further reduce the sulfur dioxide emission of the entire refining process, two scenarios of acid gas or air preheats are investigated when either of them is used simultaneously with the third enrichment scheme. The maximum overall sulfur recovery efficiency and highest combustion chamber temperature is slightly higher for acid gas preheats but air preheat is more favorable because it is more benign. To the best of our knowledge, optimization of the entire GTU + enrichment section and SRU processes has not been addressed previously.
黄东; 唐俊; 汪卫; 施伯乐
2005-01-01
基因组序列拼接的主流方法是将整条序列随机打断成小片段,然后根据片段间重叠关系连接成长序列.由于较多噪音存在,算法复杂度高,加之生物数据的海量增长,序列拼接处理导致巨大的时空开销而无法完成.本文提出一种基于最大频繁序列模式的聚类算法,将整个数据集分成若干个子集,分别高效地处理,实现了一个基因拼接网格系统、透明动态的资源管理,大大扩展了基因拼接计算能力.基于最大频繁序列模式聚类算法及挖掘算法,针对生物数据的特性做出了优化.
Algebraic curves of maximal cyclicity
Caubergh, Magdalena; Dumortier, Freddy
2006-01-01
The paper deals with analytic families of planar vector fields, studying methods to detect the cyclicity of a non-isolated closed orbit, i.e. the maximum number of limit cycles that can locally bifurcate from it. It is known that this multi-parameter problem can be reduced to a single-parameter one, in the sense that there exist analytic curves in parameter space along which the maximal cyclicity can be attained. In that case one speaks about a maximal cyclicity curve (mcc) in case only the number is considered and of a maximal multiplicity curve (mmc) in case the multiplicity is also taken into account. In view of obtaining efficient algorithms for detecting the cyclicity, we investigate whether such mcc or mmc can be algebraic or even linear depending on certain general properties of the families or of their associated Bautin ideal. In any case by well chosen examples we show that prudence is appropriate.
BOUNDEDNESS OF MAXIMAL SINGULAR INTEGRALS
CHEN JIECHENG; ZHU XIANGRONG
2005-01-01
The authors study the singular integrals under the Hormander condition and the measure not satisfying the doubling condition. At first, if the corresponding singular integral is bounded from L2 to itseff, it is proved that the maximal singu lar integral is bounded from L∞ to RBMO except that it is infinite μ-a.e. on Rd. A sufficient condition and a necessary condition such that the maximal singular integral is bounded from L2 to itself are also obtained. There is a small gap between the two conditions.
Understanding maximal repetitions in strings
Crochemore, Maxime
2008-01-01
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach, the stronger result concerning the linearity of the sum of exponents of all runs follows easily.
A Survey of latest Algorithms for Frequent Itemset Mining in Data Stream
U.Chandrasekhar
2013-03-01
Full Text Available Association rule mining and finding frequent patterns in data base has been a very old topic. With the advent of Big Data, the need for stream mining has increased. Hence the paper surveys various latest frequent pattern mining algorithms on data streams to understand various problems to be solved, their short comings and advantages over others.
Note on maximal distance separable codes
YANG Jian-sheng; WANG De-xiu; JIN Qing-fang
2009-01-01
In this paper, the maximal length of maximal distance separable(MDS)codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.
Maximization, learning, and economic behavior.
Erev, Ido; Roth, Alvin E
2014-07-22
The rationality assumption that underlies mainstream economic theory has proved to be a useful approximation, despite the fact that systematic violations to its predictions can be found. That is, the assumption of rational behavior is useful in understanding the ways in which many successful economic institutions function, although it is also true that actual human behavior falls systematically short of perfect rationality. We consider a possible explanation of this apparent inconsistency, suggesting that mechanisms that rest on the rationality assumption are likely to be successful when they create an environment in which the behavior they try to facilitate leads to the best payoff for all agents on average, and most of the time. Review of basic learning research suggests that, under these conditions, people quickly learn to maximize expected return. This review also shows that there are many situations in which experience does not increase maximization. In many cases, experience leads people to underweight rare events. In addition, the current paper suggests that it is convenient to distinguish between two behavioral approaches to improve economic analyses. The first, and more conventional approach among behavioral economists and psychologists interested in judgment and decision making, highlights violations of the rational model and proposes descriptive models that capture these violations. The second approach studies human learning to clarify the conditions under which people quickly learn to maximize expected return. The current review highlights one set of conditions of this type and shows how the understanding of these conditions can facilitate market design.
Discovering Frequent Subtrees from XML Data Using Neural Networks
无
2006-01-01
By rapid progress of network and storage technologies, a huge amount of electronic data such as Web pages and XML has been available on Internet. In this paper, we study a data-mining problem of discovering frequent ordered sub-trees in a large collection of XML data, where both of the patterns and the data are modeled by labeled ordered trees. We present an efficient algorithm of Ordered Subtree Miner(OSTMiner) based on two- layer neural networks with Hebb rule, that computes all ordered sub-trees appearing in a collection of XML trees with frequent above a user-specified threshold using a special structure EM-tree. In this algorithm, EM-tree is used as an extended merging tree to supply scheme information for efficient pruning and mining frequent sub-trees. Experiments results showed that OSTMiner has good response time and scales well.
Viscosity and density dependence during maximal flow in man.
Staats, B A; Wilson, T A; Lai-Fook, S J; Rodarte, J R; Hyatt, R E
1980-02-01
Maximal expiratory flow curves were obtained from ten healthy subjects white breathing air and three other gas mixtures with different densities and viscosities. From these data, the magnitudes of the dependence of maximal flow on gas density and viscosity were obtained. The scaling laws of fluid mechanics, together with a model for the flow-limiting mechanism, were used to obtain a prediction of the relationship between the density dependence and the viscosity dependence of maximal flow. Although the data for individual subjects were too variable to allow a precise comparison with this prediction, the relationship between the mean density dependence and the mean viscosity dependence of all usbjects agreed with the theoretic prediction. This agreement supports the assumption, which is frequently made, that flow resistance rather than tissue visoelasticity is the dominant contributor to peripheral resistance. Information on the relationships between the pressure drop to the flow-limiting segment and flow, gas density and viscosity, and lung volume were also obtained.
Entropy Maximization and the Spatial Distribution of Species
Haegeman, Bart; Etienne, Rampal S.
2010-01-01
Entropy maximization (EM, also known as MaxEnt) is a general inference procedure that originated in statistical mechanics. It has been applied recently to predict ecological patterns, such as species abundance distributions and species-area relationships. It is well known in physics that the EM resu
Entropy Maximization and the Spatial Distribution of Species
Haegeman, Bart; Etienne, Rampal S.
Entropy maximization (EM, also known as MaxEnt) is a general inference procedure that originated in statistical mechanics. It has been applied recently to predict ecological patterns, such as species abundance distributions and species-area relationships. It is well known in physics that the EM
Evolution of correlated multiplexity through stability maximization
Dwivedi, Sanjiv K.; Jalan, Sarika
2017-02-01
Investigating the relation between various structural patterns found in real-world networks and the stability of underlying systems is crucial to understand the importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising antisymmetric couplings in one layer depicting predator-prey relationship and symmetric couplings in the other depicting mutualistic (or competitive) relationship, based on stability maximization through the largest eigenvalue of the corresponding adjacency matrices. We find that there is an emergence of the correlated multiplexity between the mirror nodes as the evolution progresses. Importantly, evolved values of the correlated multiplexity exhibit a dependence on the interlayer coupling strength. Additionally, the interlayer coupling strength governs the evolution of the disassortativity property in the individual layers. We provide analytical understanding to these findings by considering starlike networks representing both the layers. The framework discussed here is useful for understanding principles governing the stability as well as the importance of various patterns in the underlying networks of real-world systems ranging from the brain to ecology which consist of multiple types of interaction behavior.
Frequently Asked Questions on Potassium Iodide (KI)
... Bioterrorism and Drug Preparedness Frequently Asked Questions on Potassium Iodide (KI) Share Tweet Linkedin Pin it More sharing ... Drug Administration (FDA) issued a final Guidance on Potassium Iodide as a Thyroid Blocking Agent in Radiation Emergencies) ( ...
Frequently Asked Questions about Digital Mammography
... Consumer Information (MQSA) Frequently Asked Questions About Digital Mammography Share Tweet Linkedin Pin it More sharing options ... mammography exams, such as DBT? What is digital mammography? Full field digital mammography (FFDM, also known simply ...
Frequently Asked Questions about Genetic Testing
... Care Specific Genetic Disorders Frequently Asked Questions About Genetic Testing What is genetic testing? What can I learn ... find more information about genetic testing? What is genetic testing? Genetic testing uses laboratory methods to look at ...
Frequently Asked Questions about Genetic Counseling
... on this page Frequently Asked Questions About Genetic Counseling What are genetic professionals and what do they ... genetics nurses. Top of page What is genetic counseling and evaluation? Genetic professionals work as members of ...
Asymptotics of robust utility maximization
Knispel, Thomas
2012-01-01
For a stochastic factor model we maximize the long-term growth rate of robust expected power utility with parameter $\\lambda\\in(0,1)$. Using duality methods the problem is reformulated as an infinite time horizon, risk-sensitive control problem. Our results characterize the optimal growth rate, an optimal long-term trading strategy and an asymptotic worst-case model in terms of an ergodic Bellman equation. With these results we propose a duality approach to a "robust large deviations" criterion for optimal long-term investment.
Multivariate residues and maximal unitarity
Søgaard, Mads; Zhang, Yang
2013-12-01
We extend the maximal unitarity method to amplitude contributions whose cuts define multidimensional algebraic varieties. The technique is valid to all orders and is explicitly demonstrated at three loops in gauge theories with any number of fermions and scalars in the adjoint representation. Deca-cuts realized by replacement of real slice integration contours by higher-dimensional tori encircling the global poles are used to factorize the planar triple box onto a product of trees. We apply computational algebraic geometry and multivariate complex analysis to derive unique projectors for all master integral coefficients and obtain compact analytic formulae in terms of tree-level data.
Beeping a Maximal Independent Set
Afek, Yehuda; Alon, Noga; Bar-Joseph, Ziv; Cornejo, Alejandro; Haeupler, Bernhard; Kuhn, Fabian
2012-01-01
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot...
Maximal Congruences on Some Semigroups
Jintana Sanwong; R.P. Sullivan
2007-01-01
In 1976 Howie proved that a finite congruence-free semigroup is a simple group if it has at least three elements but no zero elementInfinite congruence-free semigroups are far more complicated to describe, but some have been constructed using semigroups of transformations (for example, by Howie in 1981 and by Marques in 1983)Here, forcertain semigroups S of numbers and of transformations, we determine all congruences p on S such that S/p is congruence-free, that is, we describe all maximal congruences on such semigroups S.
Knowledge discovery by accuracy maximization.
Cacciatore, Stefano; Luchinat, Claudio; Tenori, Leonardo
2014-04-01
Here we describe KODAMA (knowledge discovery by accuracy maximization), an unsupervised and semisupervised learning algorithm that performs feature extraction from noisy and high-dimensional data. Unlike other data mining methods, the peculiarity of KODAMA is that it is driven by an integrated procedure of cross-validation of the results. The discovery of a local manifold's topology is led by a classifier through a Monte Carlo procedure of maximization of cross-validated predictive accuracy. Briefly, our approach differs from previous methods in that it has an integrated procedure of validation of the results. In this way, the method ensures the highest robustness of the obtained solution. This robustness is demonstrated on experimental datasets of gene expression and metabolomics, where KODAMA compares favorably with other existing feature extraction methods. KODAMA is then applied to an astronomical dataset, revealing unexpected features. Interesting and not easily predictable features are also found in the analysis of the State of the Union speeches by American presidents: KODAMA reveals an abrupt linguistic transition sharply separating all post-Reagan from all pre-Reagan speeches. The transition occurs during Reagan's presidency and not from its beginning.
Inapproximability of maximal strip recovery
Jiang, Minghui
2009-01-01
In comparative genomic, the first step of sequence analysis is usually to decompose two or more genomes into syntenic blocks that are segments of homologous chromosomes. For the reliable recovery of syntenic blocks, noise and ambiguities in the genomic maps need to be removed first. Maximal Strip Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff for reliably recovering syntenic blocks from genomic maps in the midst of noise and ambiguities. Given $d$ genomic maps as sequences of gene markers, the objective of \\msr{d} is to find $d$ subsequences, one subsequence of each genomic map, such that the total length of syntenic blocks in these subsequences is maximized. For any constant $d \\ge 2$, a polynomial-time 2d-approximation for \\msr{d} was previously known. In this paper, we show that for any $d \\ge 2$, \\msr{d} is APX-hard, even for the most basic version of the problem in which all gene markers are distinct and appear in positive orientation in each genomic map. Moreover, we provi...
Maximal right smooth extension chains
Huang, Yun Bao
2010-01-01
If $w=u\\alpha$ for $\\alpha\\in \\Sigma=\\{1,2\\}$ and $u\\in \\Sigma^*$, then $w$ is said to be a \\textit{simple right extension}of $u$ and denoted by $u\\prec w$. Let $k$ be a positive integer and $P^k(\\epsilon)$ denote the set of all $C^\\infty$-words of height $k$. Set $u_{1},\\,u_{2},..., u_{m}\\in P^{k}(\\epsilon)$, if $u_{1}\\prec u_{2}\\prec ...\\prec u_{m}$ and there is no element $v$ of $P^{k}(\\epsilon)$ such that $v\\prec u_{1}\\text{or} u_{m}\\prec v$, then $u_{1}\\prec u_{2}\\prec...\\prec u_{m}$ is said to be a \\textit{maximal right smooth extension (MRSE) chains}of height $k$. In this paper, we show that \\textit{MRSE} chains of height $k$ constitutes a partition of smooth words of height $k$ and give the formula of the number of \\textit{MRSE} chains of height $k$ for each positive integer $k$. Moreover, since there exist the minimal height $h_1$ and maximal height $h_2$ of smooth words of length $n$ for each positive integer $n$, we find that \\textit{MRSE} chains of heights $h_1-1$ and $h_2+1$ are good candidates t...
Performance Evaluation of Frequent Subgraph Discovery Techniques
Saif Ur Rehman
2014-01-01
Full Text Available Due to rapid development of the Internet technology and new scientific advances, the number of applications that model the data as graphs increases, because graphs have highly expressive power to model a complicated structure. Graph mining is a well-explored area of research which is gaining popularity in the data mining community. A graph is a general model to represent data and has been used in many domains such as cheminformatics, web information management system, computer network, and bioinformatics, to name a few. In graph mining the frequent subgraph discovery is a challenging task. Frequent subgraph mining is concerned with discovery of those subgraphs from graph dataset which have frequent or multiple instances within the given graph dataset. In the literature a large number of frequent subgraph mining algorithms have been proposed; these included FSG, AGM, gSpan, CloseGraph, SPIN, Gaston, and Mofa. The objective of this research work is to perform quantitative comparison of the above listed techniques. The performances of these techniques have been evaluated through a number of experiments based on three different state-of-the-art graph datasets. This novel work will provide base for anyone who is working to design a new frequent subgraph discovery technique.
Text Classification Using Sentential Frequent Itemsets
Shi-Zhu Liu; He-Ping Hu
2007-01-01
Text classification techniques mostly rely on single term analysis of the document data set, while more concepts,especially the specific ones, are usually conveyed by set of terms. To achieve more accurate text classifier, more informative feature including frequent co-occurring words in the same sentence and their weights are particularly important in such scenarios. In this paper, we propose a novel approach using sentential frequent itemset, a concept comes from association rule mining, for text classification, which views a sentence rather than a document as a transaction, and uses a variable precision rough set based method to evaluate each sentential frequent itemset's contribution to the classification. Experiments over the Reuters and newsgroup corpus are carried out, which validate the practicability of the proposed system.
Frequently cited journals in forensic psychology.
Black, Steve
2012-02-01
Works cited in six forensic psychology journals published 2008-2010 were counted to identify the most frequently cited journals. The sample of works cited (N = 21,776) was not a definitive ranked list of important journals in forensic psychology, but was large enough to indicate high-impact journals. The list of frequently cited publications included more general psychiatry and psychology journals than titles specific to forensic psychology. The implications of the proportion of general versus specific titles for collections supporting research in forensic psychology were discussed.
Frequent price changes under menu costs
Hansen, Per Svejstrup
1999-01-01
This paper investigates the effect of uncertainty on a single firm's pricing behaviour in a dynamic menu cost model that results in (S,s)-rules where the price is fixed inside a band. It will be demonstrated that even though the band of inaction widens in response to increased uncertainty......, the price may be changed more frequent in the short run, and in the long run it definitely will. Hence, observing frequent price changes is not necessarily inconsistent with a firm operating under menu costs. This paper relies on an article by Dixit (1991), (Review of Economic studies, 58, 141...
The maximal D = 4 supergravities
Wit, Bernard de [Institute for Theoretical Physics and Spinoza Institute, Utrecht University, Postbus 80.195, NL-3508 TD Utrecht (Netherlands); Samtleben, Henning [Laboratoire de Physique, ENS Lyon, 46 allee d' Italie, F-69364 Lyon CEDEX 07 (France); Trigiante, Mario [Dept. of Physics, Politecnico di Torino, Corso Duca degli Abruzzi 24, I-10129 Turin (Italy)
2007-06-15
All maximal supergravities in four space-time dimensions are presented. The ungauged Lagrangians can be encoded in an E{sub 7(7)}-Sp(56; R)/GL(28) matrix associated with the freedom of performing electric/magnetic duality transformations. The gauging is defined in terms of an embedding tensor {theta} which encodes the subgroup of E{sub 7(7)} that is realized as a local invariance. This embedding tensor may imply the presence of magnetic charges which require corresponding dual gauge fields. The latter can be incorporated by using a recently proposed formulation that involves tensor gauge fields in the adjoint representation of E{sub 7(7)}. In this formulation the results take a universal form irrespective of the electric/magnetic duality basis. We present the general class of supersymmetric and gauge invariant Lagrangians and discuss a number of applications.
Maximizing profit using recommender systems
Das, Aparna; Ricketts, Daniel
2009-01-01
Traditional recommendation systems make recommendations based solely on the customer's past purchases, product ratings and demographic data without considering the profitability the items being recommended. In this work we study the question of how a vendor can directly incorporate the profitability of items into its recommender so as to maximize its expected profit while still providing accurate recommendations. Our approach uses the output of any traditional recommender system and adjust them according to item profitabilities. Our approach is parameterized so the vendor can control how much the recommendation incorporating profits can deviate from the traditional recommendation. We study our approach under two settings and show that it achieves approximately 22% more profit than traditional recommendations.
The maximal D=5 supergravities
de Wit, Bernard; Trigiante, M; Wit, Bernard de; Samtleben, Henning; Trigiante, Mario
2007-01-01
The general Lagrangian for maximal supergravity in five spacetime dimensions is presented with vector potentials in the \\bar{27} and tensor fields in the 27 representation of E_6. This novel tensor-vector system is subject to an intricate set of gauge transformations, describing 3(27-t) massless helicity degrees of freedom for the vector fields and 3t massive spin degrees of freedom for the tensor fields, where the (even) value of t depends on the gauging. The kinetic term of the tensor fields is accompanied by a unique Chern-Simons coupling which involves both vector and tensor fields. The Lagrangians are completely encoded in terms of the embedding tensor which defines the E_6 subgroup that is gauged by the vectors. The embedding tensor is subject to two constraints which ensure the consistency of the combined vector-tensor gauge transformations and the supersymmetry of the full Lagrangian. This new formulation encompasses all possible gaugings.
Constraint Propagation as Information Maximization
Abdallah, A Nait
2012-01-01
Dana Scott used the partial order among partial functions for his mathematical model of recursively defined functions. He interpreted the partial order as one of information content. In this paper we elaborate on Scott's suggestion of regarding computation as a process of information maximization by applying it to the solution of constraint satisfaction problems. Here the method of constraint propagation can be interpreted as decreasing uncertainty about the solution -- that is, as gain in information about the solution. As illustrative example we choose numerical constraint satisfaction problems to be solved by interval constraints. To facilitate this approach to constraint solving we formulate constraint satisfaction problems as formulas in predicate logic. This necessitates extending the usual semantics for predicate logic so that meaning is assigned not only to sentences but also to formulas with free variables.
IMS Learning Design Frequently Asked Questions
Tattersall, Colin; Manderveld, Jocelyn; Hummel, Hans; Sloep, Peter; Koper, Rob; De Vries, Fred
2004-01-01
This list of frequently asked questions was composed on the basis of questions asked of the Educational Technology Expertise Centrum. The questions addessed are: Where can I find the IMS Learning Design Specification? What is meant by the phrase “Learning Design”? What is the IMS LD Specification ab
Auditory Training with Frequent Communication Partners
Tye-Murray, Nancy; Spehar, Brent; Sommers, Mitchell; Barcroft, Joe
2016-01-01
Purpose: Individuals with hearing loss engage in auditory training to improve their speech recognition. They typically practice listening to utterances spoken by unfamiliar talkers but never to utterances spoken by their most frequent communication partner (FCP)--speech they most likely desire to recognize--under the assumption that familiarity…
Treatment of Anthrax Disease Frequently Asked Questions
Judd, Kathleen S.; Young, Joan E.; Lesperance, Ann M.; Malone, John D.
2010-05-14
This document provides a summary of Frequently Asked Questions (FAQs) on the treatment of anthrax disease caused by a wide-area release of Bacillus anthracis spores as an act bioterrorism. These FAQs are intended to provide the public health and medical community, as well as others, with guidance and communications to support the response and long-term recovery from an anthrax event.
Research Discovers Frequent Mutations of Chromatin
2011-01-01
With the support of National Natural Science Foundation of China, BGI, the largest genomics organization in the world, and Peking University Shenzhen Hospital, published online in Nature Geneticsics that the study on frequent mutations of chromatin remodeling genes in transitional cell carcinoma （TCC） of thebladder on August 8th, 2011. Their study provides a valuable genetic basis for future studies on TCC,
Chronic frequent headache in the general population
Wiendels, Natalie Janette
2008-01-01
This thesis describes the results of a large questionnaire-based study on the epidemiology of chronic frequent headache (CFH) in the Dutch adult population. It also includes information on triptan (over)use from the Drug Information Project (GIP database) and the results of a withdrawal trial in
Chronic frequent headache in the general population
Wiendels, Natalie Janette
2008-01-01
This thesis describes the results of a large questionnaire-based study on the epidemiology of chronic frequent headache (CFH) in the Dutch adult population. It also includes information on triptan (over)use from the Drug Information Project (GIP database) and the results of a withdrawal trial in Gen
Design Improvements for Frequently Misrecognized Letters
Beier, Sofie; Larson, Kevin
2010-01-01
To enhance typeface legibility we studied how to improve the design of individual letters. Three diff erent fonts were created, each containing several variations of the most frequently misrecognized letters. These variations were tested both with distance and short exposure methodologies. Creati...
Frequent users of the pediatric emergency department.
Seguin, Jade; Osmanlliu, Esli; Zhang, Xun; Clavel, Virginie; Eisman, Harley; Rodrigues, Robert; Oskoui, Maryam
2017-04-06
Emergency department (ED) crowding is associated with increased morbidity and mortality. Its etiology is multifactorial, and frequent ED use (defined as more or equal to five visits per year) is a major contributor to high patient volumes. Our primary objective is to characterize the frequent user population. Our secondary objective is to examine risk factors for frequent emergency use. We conducted a retrospective cohort study of pediatric emergency department (PED) visits at the Montreal Children's Hospital using the Système Informatique Urgence (SIURGE), electronic medical record database. We analysed the relation between patient's characteristics and the number of PED visits over a 1-year period following the index visit. Patients totalling 52,088 accounted for 94,155 visits. Of those, 2,474 (4.7%) patients had five and more recurrent visits and accounted for 16.6% (15,612 visits) of the total PED visits. Lower level of acuity at index visit (odds ratio [OR] 0.85) was associated with a lower number of recurrent visits. Lower socioeconomic status (social deprivation index OR 1.09, material deprivation index OR 1.08) was associated with a higher number of recurrent visits. Asthma (OR 1.57); infectious ear, nose, and sinus disorders (OR 1.33); and other respiratory disorders (OR 1.56) were independently associated with a higher incidence of a recurrent visit within the year following the first visit. Our study is the first Canadian study to assess risk factors of frequent pediatric emergency use. The identified risk factors and diagnoses highlight the need for future evidence-based, targeted innovative research evaluating strategies to minimize ED crowding, to improve health outcomes and to improve patient satisfaction.
Botulism: A Frequently Forgotten Old Malady
Teguh Thajeb
2007-09-01
Full Text Available A frequently forgotten old malady called botulism has been recognized for more than a century. This ailment occurs worldwide, afflicts human of all age groups from infants to elderly and affects Oriental people more often in several regions of China. Occurrence in Taiwan is uncommon, and therefore, it is often overlooked. The outbreaks of human botulism in various regions of the world, the clinical types, the molecular mechanisms, and the electrophysiologic findings will be highlighted.
Beeping a Maximal Independent Set
Afek, Yehuda; Bar-Joseph, Ziv; Cornejo, Alejandro; Haeupler, Bernhard; Kuhn, Fabian
2012-01-01
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one of its neighbors beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and find an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possi...
Maximal switchability of centralized networks
Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu
2016-08-01
We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.
A Maximally Supersymmetric Kondo Model
Harrison, Sarah; Kachru, Shamit; Torroba, Gonzalo; /Stanford U., Phys. Dept. /SLAC
2012-02-17
We study the maximally supersymmetric Kondo model obtained by adding a fermionic impurity to N = 4 supersymmetric Yang-Mills theory. While the original Kondo problem describes a defect interacting with a free Fermi liquid of itinerant electrons, here the ambient theory is an interacting CFT, and this introduces qualitatively new features into the system. The model arises in string theory by considering the intersection of a stack of M D5-branes with a stack of N D3-branes, at a point in the D3 worldvolume. We analyze the theory holographically, and propose a dictionary between the Kondo problem and antisymmetric Wilson loops in N = 4 SYM. We perform an explicit calculation of the D5 fluctuations in the D3 geometry and determine the spectrum of defect operators. This establishes the stability of the Kondo fixed point together with its basic thermodynamic properties. Known supergravity solutions for Wilson loops allow us to go beyond the probe approximation: the D5s disappear and are replaced by three-form flux piercing a new topologically non-trivial S3 in the corrected geometry. This describes the Kondo model in terms of a geometric transition. A dual matrix model reflects the basic properties of the corrected gravity solution in its eigenvalue distribution.
Oncoplastic Breast Reduction: Maximizing Aesthetics and Surgical Margins
Michelle Milee Chang
2012-01-01
Full Text Available Oncoplastic breast reduction combines oncologically sound concepts of cancer removal with aesthetically maximized approaches for breast reduction. Numerous incision patterns and types of pedicles can be used for purposes of oncoplastic reduction, each tailored for size and location of tumor. A team approach between reconstructive and breast surgeons produces positive long-term oncologic results as well as satisfactory cosmetic and functional outcomes, rendering oncoplastic breast reduction a favorable treatment option for certain patients with breast cancer.
Frequent video game players resist perceptual interference.
Aaron V Berard
Full Text Available Playing certain types of video games for a long time can improve a wide range of mental processes, from visual acuity to cognitive control. Frequent gamers have also displayed generalized improvements in perceptual learning. In the Texture Discrimination Task (TDT, a widely used perceptual learning paradigm, participants report the orientation of a target embedded in a field of lines and demonstrate robust over-night improvement. However, changing the orientation of the background lines midway through TDT training interferes with overnight improvements in overall performance on TDT. Interestingly, prior research has suggested that this effect will not occur if a one-hour break is allowed in between the changes. These results have suggested that after training is over, it may take some time for learning to become stabilized and resilient against interference. Here, we tested whether frequent gamers have faster stabilization of perceptual learning compared to non-gamers and examined the effect of daily video game playing on interference of training of TDT with one background orientation on perceptual learning of TDT with a different background orientation. As a result, we found that non-gamers showed overnight performance improvement only on one background orientation, replicating previous results with the interference in TDT. In contrast, frequent gamers demonstrated overnight improvements in performance with both background orientations, suggesting that they are better able to overcome interference in perceptual learning. This resistance to interference suggests that video game playing not only enhances the amplitude and speed of perceptual learning but also leads to faster and/or more robust stabilization of perceptual learning.
Dental Management of Frequent Childhood Hemoglobinopathies
iffet Yazicioglu
2014-06-01
Full Text Available Hemoglobinopaties are important in the context of childhood chronical disease due to their potential of being the most frequent genetical diseases. Abnormal hemoglobins are in general harmless however in some situations oxygen instabillity can occur. Those instabilities can effect dental health negatively or dental helath can stimulate the symptoms of the genetical disease. With the consultation of Medical doctor Dentist with adequit knowledge would apply dental treatment safely and eliminate the inconvinience of children. [Archives Medical Review Journal 2014; 23(3.000: 469-483
Optimal growth of frequently hypercyclic entire functions
Drasin, David
2011-01-01
We solve a problem posed by A. Bonilla and K.-G. Grosse-Erdmann by constructing an entire function $f$ that is frequently hypercyclic with respect to the differentiation operator, and satisfies $M_f(r)\\leq\\displaystyle ce^r r^{-1/4}$, where $c>0$ be chosen arbirarily small. The obtained growth rate is sharp. We also obtain optimal results for the growth when measured in terms of average $L^p$-norms. Among other things, the proof applies Rudin-Shapiro polynomials and heat kernel estimates.
Maximal mixing as a `sum' of small mixings
Chakrabortty, Joydeep; Mehta, Poonam; Vempati, Sudhir K
2009-01-01
In models with two sources of neutrino masses, we look at the possibility of generating maximal/large mixing angles in the total mass matrix, where both the sources have only small mixing angles. We show that in the two generation case, maximal mixing can naturally arise only when the total neutrino mass matrix has a quasi-degenerate pattern. The best way to demonstrate this is by decomposing the quasi-degenerate spectrum in to hierarchial and inverse-hierarchial mass matrices, both with small mixing. Such a decomposition of the quasi-degenerate spectra is in fact very general and can be done irrespective of the mixing present in the mass matrices. With three generations, and two sources, we show that only one or all the three small mixing angles in the total neutrino mass matrix can be converted to maximal/large mixing angles. The decomposition of the degenerate pattern in this case is best realised in to sub-matrices whose dominant eigenvalues have an alternating pattern. On the other hand, it is possible t...
GREWA Scalable Frequent Subgraph Discovery Algorithm
2004-06-22
vlsicad.cs.ucla.edu/∼ cheese /ispd98.html Table 1. Datasets used in the experiments Dataset Vertices Edges Labels Connected Vertex Edge Components Aviation 101,185...Yoshida and H. Motoda. CLIP: Concept learning from in- ference patterns. Artificial Intelligence, 75(1):63–92, 1995. [35] M. J. Zaki and K. Gouda . Fast
Maximal inequalities for demimartingales and their applications
WANG XueJun; HU ShuHe
2009-01-01
In this paper,we establish some maximal inequalities for demimartingales which generalize and improve the results of Christofides.The maximal inequalities for demimartingales are used as key inequalities to establish other results including Doob's type maximal inequality for demimartingales,strong laws of large numbers and growth rate for demimartingales and associated random variables.At last,we give an equivalent condition of uniform integrability for demisubmartingales.
Maximal inequalities for demimartingales and their applications
无
2009-01-01
In this paper, we establish some maximal inequalities for demimartingales which generalize and improve the results of Christofides. The maximal inequalities for demimartingales are used as key inequalities to establish other results including Doob’s type maximal inequality for demimartingales, strong laws of large numbers and growth rate for demimartingales and associated random variables. At last, we give an equivalent condition of uniform integrability for demisubmartingales.
Osteoporosis is less frequent in endometrial cancer survivors with hypertriglyceridemia.
Hirasawa, Akira; Makita, Kazuya; Akahane, Tomoko; Yamagami, Wataru; Makabe, Takeshi; Yokota, Megumi; Horiba, Yuko; Ogawa, Mariko; Yanamoto, Shigehisa; Deshimaru, Rhota; Tominaga, Eiichiro; Banno, Kouji; Susumu, Nobuyuki; Aoki, Daisuke
2015-01-01
We previously reported an association between dyslipidemia and endometrial cancers. Osteoporosis is also reported to relate with some cancers. A common etiologic event has been proposed between dyslipidemia and osteoporosis. However, the pattern of interrelationships among dyslipidemia, osteoporosis and endometrial cancer is not well understood. To improve the quality of life of endometrial cancer survivors, these relationships should be determined. This study included 179 Japanese menopausal women who underwent bilateral salpingo-oophorectomy, including 114 women with incident endometrial cancer and 65 without endometrial cancer. The women were categorized according to dyslipidemia status. Bone mineral density was measured and compared between groups. Osteoporosis was statistically more frequent in women with hypertriglyceridemia who did not have endometrial cancer. In contrast, osteoporosis was statistically less frequent in women with hypertriglyceridemia who had endometrial cancer. In this cross-sectional study in a Japanese population, osteoporosis was associated with hypertriglyceridemia in post-menopausal women without endometrial cancer, but was less frequent in endometrial cancer survivors with hypertriglyceridemia.
Frequent external focus feedback enhances motor learning
Gabriele eWulf
2010-11-01
Full Text Available The present study examined the hypothesis that feedback inducing an external focus of attention enhances motor learning if it is provided frequently (i.e., 100% rather than less frequently. Children (10-12 year olds practiced a soccer throw-in task and were provided feedback about movement form. The feedback statements, provided either after every (100% or every third (33% practice trial, were similar in content but induced either an internal focus (body-movement related or external focus (movement-effect related. The results demonstrated that learning of the movement form was enhanced by external-focus feedback after every trial (100% relative to external-focus feedback after every third trial (33% or internal-focus feedback (100%, 33%, as demonstrated by immediate and delayed transfer tests without feedback. There was no difference between the two internal-focus feedback groups. These findings indicate that the attentional focus induced by feedback is an important factor in determining the effectiveness of different feedback frequencies. We argue that the informational properties of feedback cannot sufficiently account for these and related findings, and suggest that the attentional role of feedback be given greater consideration in future studies.
Frequent MAGE mutations in human melanoma.
Otavia L Caballero
Full Text Available BACKGROUND: Cancer/testis (CT genes are expressed only in the germ line and certain tumors and are most frequently located on the X-chromosome (the CT-X genes. Amongst the best studied CT-X genes are those encoding several MAGE protein families. The function of MAGE proteins is not well understood, but several have been shown to potentially influence the tumorigenic phenotype. METHODOLOGY/PRINCIPAL FINDINGS: We undertook a mutational analysis of coding regions of four CT-X MAGE genes, MAGEA1, MAGEA4, MAGEC1, MAGEC2 and the ubiquitously expressed MAGEE1 in human melanoma samples. We first examined cell lines established from tumors and matching blood samples from 27 melanoma patients. We found that melanoma cell lines from 37% of patients contained at least one mutated MAGE gene. The frequency of mutations in the coding regions of individual MAGE genes varied from 3.7% for MAGEA1 and MAGEA4 to 14.8% for MAGEC2. We also examined 111 fresh melanoma samples collected from 86 patients. In this case, samples from 32% of the patients exhibited mutations in one or more MAGE genes with the frequency of mutations in individual MAGE genes ranging from 6% in MAGEA1 to 16% in MAGEC1. SIGNIFICANCE: These results demonstrate for the first time that the MAGE gene family is frequently mutated in melanoma.
Task-oriented maximally entangled states
Agrawal, Pankaj; Pradhan, B, E-mail: agrawal@iopb.res.i, E-mail: bpradhan@iopb.res.i [Institute of Physics, Sachivalaya Marg, Bhubaneswar, Orissa 751 005 (India)
2010-06-11
We introduce the notion of a task-oriented maximally entangled state (TMES). This notion depends on the task for which a quantum state is used as the resource. TMESs are the states that can be used to carry out the task maximally. This concept may be more useful than that of a general maximally entangled state in the case of a multipartite system. We illustrate this idea by giving an operational definition of maximally entangled states on the basis of communication tasks of teleportation and superdense coding. We also give examples and a procedure to obtain such TMESs for n-qubit systems.
Inflation in maximal gauged supergravities
Kodama, Hideo [Theory Center, KEK,Tsukuba 305-0801 (Japan); Department of Particles and Nuclear Physics,The Graduate University for Advanced Studies,Tsukuba 305-0801 (Japan); Nozawa, Masato [Dipartimento di Fisica, Università di Milano, and INFN, Sezione di Milano,Via Celoria 16, 20133 Milano (Italy)
2015-05-18
We discuss the dynamics of multiple scalar fields and the possibility of realistic inflation in the maximal gauged supergravity. In this paper, we address this problem in the framework of recently discovered 1-parameter deformation of SO(4,4) and SO(5,3) dyonic gaugings, for which the base point of the scalar manifold corresponds to an unstable de Sitter critical point. In the gauge-field frame where the embedding tensor takes the value in the sum of the 36 and 36’ representations of SL(8), we present a scheme that allows us to derive an analytic expression for the scalar potential. With the help of this formalism, we derive the full potential and gauge coupling functions in analytic forms for the SO(3)×SO(3)-invariant subsectors of SO(4,4) and SO(5,3) gaugings, and argue that there exist no new critical points in addition to those discovered so far. For the SO(4,4) gauging, we also study the behavior of 6-dimensional scalar fields in this sector near the Dall’Agata-Inverso de Sitter critical point at which the negative eigenvalue of the scalar mass square with the largest modulus goes to zero as the deformation parameter s approaches a critical value s{sub c}. We find that when the deformation parameter s is taken sufficiently close to the critical value, inflation lasts more than 60 e-folds even if the initial point of the inflaton allows an O(0.1) deviation in Planck units from the Dall’Agata-Inverso critical point. It turns out that the spectral index n{sub s} of the curvature perturbation at the time of the 60 e-folding number is always about 0.96 and within the 1σ range n{sub s}=0.9639±0.0047 obtained by Planck, irrespective of the value of the η parameter at the critical saddle point. The tensor-scalar ratio predicted by this model is around 10{sup −3} and is close to the value in the Starobinsky model.
Time of day has no effect on maximal aerobic and peak power
Sesboüé B
2011-08-01
Full Text Available N Bessot1,3, S Moussay1,2, B Dufour1,2, D Davenne1,2, B Sesboüé1,3, A Gauthier1,21Inserm, ERI27, Caen, France; 2University Caen, Caen, France; 3CHRU Caen, Explorations Fonctionnelles, Caen, FranceBackground: The aim of this study was to explore the effect of time of day on peak power reached during an exercise test and maximal aerobic power achieved when the subject reached maximal oxygen uptake.Methods: Fifteen male competitive endurance cyclists performed a standardized maximal incremental exercise test at 06:00 hours and 18:00 hours. The test began with a 5-minute warmup period at a workload of 150 W. The work rate was then increased by incremental steps of 30 W per minute until the respiratory exchange ratio reached 1.00. Thereafter, workload was increased in steps of 15 W per minute until exhaustion was reached.Results: No significant diurnal variation was detected in physiological parameters (maximal oxygen uptake and maximal heart rate or biomechanical parameters (maximal aerobic power, peak power.Conclusion: Circadian variations classically reported in competitive aerobic performances could be due to fluctuations in maximal aerobic endurance and/or improvement in gestural efficiency (pattern of muscle activity, effective force production, and kinematics.Keywords: chronobiology, maximal aerobic power, peak power, maximal oxygen uptake, maximal incremental test
Frequently asked questions about global modeling
Letellier, Christophe; Aguirre, Luis A.; Freitas, U. S.
2009-06-01
When a global model is attempted from experimental data, some preprocessing might be required. Therefore it is only natural to wonder what kind of effects the preprocessing might have on the modeling procedure. This concern is manifested in the form of recurrent frequently asked questions, such as "how does the preprocessing affect the underlying dynamics?" This paper aims at providing answers to important questions related to (i) data interpolation, (ii) data smoothing, (iii) data-estimated derivatives, (iv) model structure selection, and (v) model validation. The answers provided will hopefully remove some of those doubts and one shall be more confident not only on global modeling but also on various data analyses which may be also dependent on data preprocessing.
Bladder injuries frequently missed in polytrauma patients
Tanweer Karim
2010-05-01
Full Text Available Tanweer Karim, Margaret Topno, Vinod Sharma, Raymond Picardo, Ankur HastirSurgery, MGM Medical College, Kamothe, Navi Mumbai, IndiaAbstract: Bladder injuries are very common in patients who have had road traffic accidents. The method of diagnosis and management of such injuries is well established and accepted. However, trauma to the bladder can be associated with other life-threatening injuries which are frequently missed, and often diagnosed during laparotomy for other reasons. The aim of this study was to diagnose bladder injury in polytrauma patients as early as possible, taking into consideration the fact that these patients are hemodynamically unstable and require rapid evaluation and management. In order to achieve our objective, we used bedside sonography with retrograde instillation of normal saline to diagnose bladder injury in addition to use of the conventional retrograde cystogram.Keywords: bladder injury, bladder rupture, retrograde cystogram
Frequent activation of EGFR in advanced chordomas
Dewaele Barbara
2011-07-01
Full Text Available Abstract Background Chordomas are rare neoplasms, arising from notochordal remnants in the midline skeletal axis, for which the current treatment is limited to surgery and radiotherapy. Recent reports suggest that receptor tyrosine kinases (RTK might be essential for the survival or proliferation of chordoma cells, providing a rationale for RTK targeted therapy. Nevertheless, the reported data are conflicting, most likely due to the assorted tumor specimens used for the studies and the heterogeneous methodological approaches. In the present study, we performed a comprehensive characterization of this rare entity using a wide range of assays in search for relevant therapeutic targets. Methods Histopathological features of 42 chordoma specimens, 21 primary and 21 advanced, were assessed by immunohistochemistry and fluorescent in situ hybridization (FISH using PDGFRB, CSF1R, and EGFR probes. Twenty-two of these cases, for which frozen material was available (nine primary and 13 advanced tumors, were selectively analyzed using the whole-genome 4.3 K TK-CGH-array, phospho-kinase antibody array or Western immunoblotting. The study was supplemented by direct sequencing of KIT, PDGFRB, CSF1R and EGFR. Results We demonstrated that EGFR is frequently and the most significantly activated RTK in chordomas. Furthermore, concurrent to EGFR activation, the tumors commonly reveal co-activation of alternative RTK. The consistent activation of AKT, the frequent loss of the tumor suppressor PTEN allele, the recurrent activation of upstream RTK and of downstream effectors like p70S6K and mTOR, all indicate the PI3K/AKT pathway as an important mediator of transformation in chordomas. Conclusions Given the complexity of the signaling in chordomas, combined treatment regimens targeting multiple RTK and downstream effectors are likely to be the most effective in these tumors. Personalized therapy with careful selection of the patients, based on the molecular profile of
Computing Maximally Supersymmetric Scattering Amplitudes
Stankowicz, James Michael, Jr.
This dissertation reviews work in computing N = 4 super-Yang--Mills (sYM) and N = 8 maximally supersymmetric gravity (mSUGRA) scattering amplitudes in D = 4 spacetime dimensions in novel ways. After a brief introduction and overview in Ch. 1, the various techniques used to construct amplitudes in the remainder of the dissertation are discussed in Ch. 2. This includes several new concepts such as d log and pure integrand bases, as well as how to construct the amplitude using exactly one kinematic point where it vanishes. Also included in this chapter is an outline of the Mathematica package on shell diagrams and numerics.m (osdn) that was developed for the computations herein. The rest of the dissertation is devoted to explicit examples. In Ch. 3, the starting point is tree-level sYM amplitudes that have integral representations with residues that obey amplitude relations. These residues are shown to have corresponding residue numerators that allow a double copy prescription that results in mSUGRA residues. In Ch. 4, the two-loop four-point sYM amplitude is constructed in several ways, showcasing many of the techniques of Ch. 2; this includes an example of how to use osdn. The two-loop five-point amplitude is also presented in a pure integrand representation with comments on how it was constructed from one homogeneous cut of the amplitude. On-going work on the two-loop n-point amplitude is presented at the end of Ch. 4. In Ch. 5, the three-loop four-point amplitude is presented in the d log representation and in the pure integrand representation. In Ch. 6, there are several examples of four- through seven-loop planar diagrams that illustrate how considerations of the singularity structure of the amplitude underpin dual-conformal invariance. Taken with the previous examples, this is additional evidence that the structure known to exist in the planar sector extends to the full theory. At the end of this chapter is a proof that all mSUGRA amplitudes have a pole at
Are all maximally entangled states pure?
Cavalcanti, D; Terra-Cunha, M O
2005-01-01
In this Letter we study if all maximally entangled states are pure through several entanglement monotones. Our conclusions allow us to generalize the idea of monogamy of entanglement. Then we propose a polygamy of entanglement, which express that if a general multipartite state is maximally entangled it is necessarily factorized by any other system.
Sampling and Representation Complexity of Revenue Maximization
Dughmi, Shaddin; Han, Li; Nisan, Noam
2014-01-01
We consider (approximate) revenue maximization in auctions where the distribution on input valuations is given via "black box" access to samples from the distribution. We observe that the number of samples required -- the sample complexity -- is tightly related to the representation complexity of an approximately revenue-maximizing auction. Our main results are upper bounds and an exponential lower bound on these complexities.
Lisonek, Petr
1996-01-01
our classifications confirmthe maximality of previously known sets, the results in E^7 and E^8are new. Their counterpart in dimension larger than 10is a set of unit vectors with only two values of inner products in the Lorentz space R^{d,1}.The maximality of this set again follows from a bound due...
An ethical justification of profit maximization
Koch, Carsten Allan
2010-01-01
In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing b...
Alternative trailer configurations for maximizing payloads
Jason D. Thompson; Dana Mitchell; John Klepac
2017-01-01
In order for harvesting contractors to stay ahead of increasing costs, it is imperative that they employ all options to maximize productivity and efficiency. Transportation can account for half the cost to deliver wood to a mill. Contractors seek to maximize truck payload to increase productivity. The Forest Operations Research Unit, Southern Research Station, USDA...
Cohomology of Weakly Reducible Maximal Triangular Algebras
董浙; 鲁世杰
2000-01-01
In this paper, we introduce the concept of weakly reducible maximal triangular algebras φwhich form a large class of maximal triangular algebras. Let B be a weakly closed algebra containing 5φ, we prove that the cohomology spaces Hn(φ, B) (n≥1) are trivial.
Inclusive fitness maximization: An axiomatic approach.
Okasha, Samir; Weymark, John A; Bossert, Walter
2014-06-07
Kin selection theorists argue that evolution in social contexts will lead organisms to behave as if maximizing their inclusive, as opposed to personal, fitness. The inclusive fitness concept allows biologists to treat organisms as akin to rational agents seeking to maximize a utility function. Here we develop this idea and place it on a firm footing by employing a standard decision-theoretic methodology. We show how the principle of inclusive fitness maximization and a related principle of quasi-inclusive fitness maximization can be derived from axioms on an individual׳s 'as if preferences' (binary choices) for the case in which phenotypic effects are additive. Our results help integrate evolutionary theory and rational choice theory, help draw out the behavioural implications of inclusive fitness maximization, and point to a possible way in which evolution could lead organisms to implement it. Copyright © 2014 Elsevier Ltd. All rights reserved.
Maximal Hypersurfaces in Spacetimes with Translational Symmetry
Bulawa, Andrew
2016-01-01
We consider four-dimensional vacuum spacetimes which admit a free isometric spacelike R-action. Taking a quotient with respect to the R-action produces a three-dimensional quotient spacetime. We establish several results regarding maximal hypersurfaces (spacelike hypersurfaces of zero mean curvature) in quotient spacetimes. First, we show that complete noncompact maximal hypersurfaces must either be flat cylinders S^1 x R or conformal to the Euclidean plane. Second, we establish a positive mass theorem for certain maximal hypersurfaces. Finally, while it is meaningful to use a bounded lapse when adopting the maximal hypersurface gauge condition in the four-dimensional (asymptotically flat) setting, it is shown here that nontrivial quotient spacetimes admit the maximal hypersurface gauge only with an unbounded lapse.
NCL Disorders: Frequent Causes of Childhood Dementia
Alfried KOHLSCHÜTTER
2013-01-01
Full Text Available Dementia in children or young adults is most frequently caused by neuronal ceroidlipofuscinoses (NCL, a group of incurable lysosomal storage disorders linked by the accumulation of a characteristic intracellular storage material and progressive clinical deterioration, usually in combination with visual loss, epilepsy, and motor decline. The clinical characteristics can vary and the age at disease onset ranges from birth to over 30 years. Diagnosis of an NCL is difficult because of genetic heterogeneity with14 NCL forms (CLN1- CLN14 identified and a high phenotype variability. A new classification of the disorders is based on the affected gene and the age at disease onset and allows a precise and practicable delineation of every NCL disease. We present a clear diagnostic algorithm to identify each NCL form. A precise diagnosis is essential for genetic counseling of affected families and for optimizing palliative care. As patient management profits from recognizing characteristic complications, care supported by a specialized team of NCL clinicians is recommended. The development of curative therapies remains difficult as the underlying pathophysiological mechanism remains unclear for all NCL forms.
Frequently asked questions in hypoxia research
Wenger RH
2015-09-01
Full Text Available Roland H Wenger,1,2 Vartan Kurtcuoglu,1,2 Carsten C Scholz,1,2 Hugo H Marti,3 David Hoogewijs1,2,4 1Institute of Physiology and Zurich Center for Human Physiology (ZIHP, University of Zurich, 2National Center of Competence in Research “Kidney.CH”, Zurich, Switzerland; 3Institute of Physiology and Pathophysiology, University of Heidelberg, Heidelberg, 4Institute of Physiology, University of Duisburg-Essen, Essen, Germany Abstract: “What is the O2 concentration in a normoxic cell culture incubator?” This and other frequently asked questions in hypoxia research will be answered in this review. Our intention is to give a simple introduction to the physics of gases that would be helpful for newcomers to the field of hypoxia research. We will provide background knowledge about questions often asked, but without straightforward answers. What is O2 concentration, and what is O2 partial pressure? What is normoxia, and what is hypoxia? How much O2 is experienced by a cell residing in a culture dish in vitro vs in a tissue in vivo? By the way, the O2 concentration in a normoxic incubator is 18.6%, rather than 20.9% or 20%, as commonly stated in research publications. And this is strictly only valid for incubators at sea level. Keywords: gas laws, hypoxia-inducible factor, Krogh tissue cylinder, oxygen diffusion, partial pressure, tissue oxygen levels
Most frequent calf diseases in industrial breeding
Lazić Sava
2004-01-01
Full Text Available It is possible to conduct an analysis of the incidence of viral diseases in calves if these diseases are divided into two basic groups. One group comprises diseases of respiratory organs which are manifested by symptoms of a respiratory syndrome, and the second group comprises diseases of digestive tract organs in the form of a gastrointestinal syndrome. It is considered that viruses have the dominant role in the complex etiology of the respiratory syndrome, primarily the IBR virus or the Bovine Herpes Virus-1 (BHV-1, followed by the parainfluenza 3 virus (RSV, the Bovine Viral Diahrrea Virus (BVDV, the bovine Respiratory Syncytial Virus (RSV, but also other viruses, such as adenoviruses, rhinoviruses, coronaviruses, can also influence the appearance of the respiratory syndrome. The respiratory syndrome is rarely caused by a single viral agent, but most frequently by mixed viruses, but also by bacterial infections. Mixed viral infections often have a lethal outcome. Investigations of the etiology of the gastrointestinal syndrome so far indicate that, in addition to bacteria, viruses can also be a significant etiological factor. Rotaviruses, coronaviruses, adenoviruses parvoviruses, herpesviruses (the IBR virus, pestiviruses (BVDV, can be the causes of a gastrointestinal syndrome. It is believed that viruses can be the cause in about 10% cases in the ethiopathogenesis of this syndrome. The paper describes the etiopathogenesis of calf diseases of viral etiology which are most often found in the local conditions of industrial breeding of calves.
AN EFFICIENT DATA MINING METHOD TO FIND FREQUENT ITEM SETS IN LARGE DATABASE USING TR- FCTM
Saravanan Suba
2016-01-01
Full Text Available Mining association rules in large database is one of most popular data mining techniques for business decision makers. Discovering frequent item set is the core process in association rule mining. Numerous algorithms are available in the literature to find frequent patterns. Apriori and FP-tree are the most common methods for finding frequent items. Apriori finds significant frequent items using candidate generation with more number of data base scans. FP-tree uses two database scans to find significant frequent items without using candidate generation. This proposed TR-FCTM (Transaction Reduction- Frequency Count Table Method discovers significant frequent items by generating full candidates once to form frequency count table with one database scan. Experimental results of TR-FCTM shows that this algorithm outperforms than Apriori and FP-tree.
Are all maximally entangled states pure?
Cavalcanti, D.; Brandão, F. G. S. L.; Terra Cunha, M. O.
2005-10-01
We study if all maximally entangled states are pure through several entanglement monotones. In the bipartite case, we find that the same conditions which lead to the uniqueness of the entropy of entanglement as a measure of entanglement exclude the existence of maximally mixed entangled states. In the multipartite scenario, our conclusions allow us to generalize the idea of the monogamy of entanglement: we establish the polygamy of entanglement, expressing that if a general state is maximally entangled with respect to some kind of multipartite entanglement, then it is necessarily factorized of any other system.
An ethical justification of profit maximization
Koch, Carsten Allan
2010-01-01
In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing...... behaviour. It is argued that some form of consequential ethics must be applied, and that both profit seeking and profit maximization can be defended from a rule-consequential point of view. It is noted, however, that the result does not apply unconditionally, but requires that certain form of profit (and...
Robust utility maximization in a discontinuous filtration
Jeanblanc, Monique; Ngoupeyou, Armand
2012-01-01
We study a problem of utility maximization under model uncertainty with information including jumps. We prove first that the value process of the robust stochastic control problem is described by the solution of a quadratic-exponential backward stochastic differential equation with jumps. Then, we establish a dynamic maximum principle for the optimal control of the maximization problem. The characterization of the optimal model and the optimal control (consumption-investment) is given via a forward-backward system which generalizes the result of Duffie and Skiadas (1994) and El Karoui, Peng and Quenez (2001) in the case of maximization of recursive utilities including model with jumps.
Are running speeds maximized with simple-spring stance mechanics?
Clark, Kenneth P; Weyand, Peter G
2014-09-15
Are the fastest running speeds achieved using the simple-spring stance mechanics predicted by the classic spring-mass model? We hypothesized that a passive, linear-spring model would not account for the running mechanics that maximize ground force application and speed. We tested this hypothesis by comparing patterns of ground force application across athletic specialization (competitive sprinters vs. athlete nonsprinters, n = 7 each) and running speed (top speeds vs. slower ones). Vertical ground reaction forces at 5.0 and 7.0 m/s, and individual top speeds (n = 797 total footfalls) were acquired while subjects ran on a custom, high-speed force treadmill. The goodness of fit between measured vertical force vs. time waveform patterns and the patterns predicted by the spring-mass model were assessed using the R(2) statistic (where an R(2) of 1.00 = perfect fit). As hypothesized, the force application patterns of the competitive sprinters deviated significantly more from the simple-spring pattern than those of the athlete, nonsprinters across the three test speeds (R(2) <0.85 vs. R(2) ≥ 0.91, respectively), and deviated most at top speed (R(2) = 0.78 ± 0.02). Sprinters attained faster top speeds than nonsprinters (10.4 ± 0.3 vs. 8.7 ± 0.3 m/s) by applying greater vertical forces during the first half (2.65 ± 0.05 vs. 2.21 ± 0.05 body wt), but not the second half (1.71 ± 0.04 vs. 1.73 ± 0.04 body wt) of the stance phase. We conclude that a passive, simple-spring model has limited application to sprint running performance because the swiftest runners use an asymmetrical pattern of force application to maximize ground reaction forces and attain faster speeds.
HEALTH INSURANCE: CONTRIBUTIONS AND REIMBURSEMENT MAXIMAL
HR Division
2000-01-01
Affected by both the salary adjustment index on 1.1.2000 and the evolution of the staff members and fellows population, the average reference salary, which is used as an index for fixed contributions and reimbursement maximal, has changed significantly. An adjustment of the amounts of the reimbursement maximal and the fixed contributions is therefore necessary, as from 1 January 2000.Reimbursement maximalThe revised reimbursement maximal will appear on the leaflet summarising the benefits for the year 2000, which will soon be available from the divisional secretariats and from the AUSTRIA office at CERN.Fixed contributionsThe fixed contributions, applicable to some categories of voluntarily insured persons, are set as follows (amounts in CHF for monthly contributions):voluntarily insured member of the personnel, with complete coverage:815,- (was 803,- in 1999)voluntarily insured member of the personnel, with reduced coverage:407,- (was 402,- in 1999)voluntarily insured no longer dependent child:326,- (was 321...
Maximizing throughput by evaluating critical utilization paths
Weeda, P.J.
1991-01-01
Recently the relationship between batch structure, bottleneck machine and maximum throughput has been explored for serial, convergent and divergent process configurations consisting of two machines and three processes. In three of the seven possible configurations a multiple batch structure maximize
Relationship between maximal exercise parameters and individual ...
Relationship between maximal exercise parameters and individual time trial ... It is widely accepted that the ventilatory threshold (VT) is an important ... This study investigated whether the physiological responses during a 20km time trial (TT) ...
Simple technique for maximal thoracic muscle harvest.
Marshall, M Blair; Kaiser, Larry R; Kucharczuk, John C
2004-04-01
We present a modification of technique for standard muscle flap harvest, the placement of cutaneous traction sutures. This technique allows for maximal dissection of the thoracic muscles even through minimal incisions. Through improved exposure and traction, complete dissection of the muscle bed can be performed and the tissue obtained maximized. Because more muscle bulk is obtained with this technique, the need for a second muscle may be prevented.
MAXIMAL POINTS OF A REGULAR TRUTH FUNCTION
Every canonical linearly separable truth function is a regular function, but not every regular truth function is linearly separable. The most...promising method of determining which of the regular truth functions are linearly separable r quires finding their maximal and minimal points. In this...report is developed a quick, systematic method of finding the maximal points of any regular truth function in terms of its arithmetic invariants. (Author)
Maximal Subgroups of Skew Linear Groups
M. Mahdavi-Hezavehi
2002-01-01
Let D be an infinite division algebra of finite dimension over its centre Z(D) = F, and n a positive integer. The structure of maximal subgroups of skew linear groups are investigated. In particular, assume N is a normal subgroup of GLn(D) and M is a maximal subgroup of N containing Z(N). It is shown that if M/Z(N) is finite, then N is central.
Additive Approximation Algorithms for Modularity Maximization
Kawase, Yasushi; Matsui, Tomomi; Miyauchi, Atsushi
2016-01-01
The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph $G=(V,E)$, we are asked to find a partition $\\mathcal{C}$ of $V$ that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical approximation guarantee. Recently, to overcome this issue, the design of modularity max...
Natural selection and the maximization of fitness.
Birch, Jonathan
2016-08-01
The notion that natural selection is a process of fitness maximization gets a bad press in population genetics, yet in other areas of biology the view that organisms behave as if attempting to maximize their fitness remains widespread. Here I critically appraise the prospects for reconciliation. I first distinguish four varieties of fitness maximization. I then examine two recent developments that may appear to vindicate at least one of these varieties. The first is the 'new' interpretation of Fisher's fundamental theorem of natural selection, on which the theorem is exactly true for any evolving population that satisfies some minimal assumptions. The second is the Formal Darwinism project, which forges links between gene frequency change and optimal strategy choice. In both cases, I argue that the results fail to establish a biologically significant maximization principle. I conclude that it may be a mistake to look for universal maximization principles justified by theory alone. A more promising approach may be to find maximization principles that apply conditionally and to show that the conditions were satisfied in the evolution of particular traits.
Frequent gain and loss of functional transcription factor binding sites.
Scott W Doniger
2007-05-01
Full Text Available Cis-regulatory sequences are not always conserved across species. Divergence within cis-regulatory sequences may result from the evolution of species-specific patterns of gene expression or the flexible nature of the cis-regulatory code. The identification of functional divergence in cis-regulatory sequences is therefore important for both understanding the role of gene regulation in evolution and annotating regulatory elements. We have developed an evolutionary model to detect the loss of constraint on individual transcription factor binding sites (TFBSs. We find that a significant fraction of functionally constrained binding sites have been lost in a lineage-specific manner among three closely related yeast species. Binding site loss has previously been explained by turnover, where the concurrent gain and loss of a binding site maintains gene regulation. We estimate that nearly half of all loss events cannot be explained by binding site turnover. Recreating the mutations that led to binding site loss confirms that these sequence changes affect gene expression in some cases. We also estimate that there is a high rate of binding site gain, as more than half of experimentally identified S. cerevisiae binding sites are not conserved across species. The frequent gain and loss of TFBSs implies that cis-regulatory sequences are labile and, in the absence of turnover, may contribute to species-specific patterns of gene expression.
Teeth grinding, oral motor performance and maximal bite force in cerebral palsy children.
Botti Rodrigues Santos, Maria Teresa; Duarte Ferreira, Maria Cristina; de Oliveira Guaré, Renata; Guimarães, Antonio Sergio; Lira Ortega, Adriana
2015-01-01
Identify whether the degree of oral motor performance is related to the presence of teeth grinding and maximal bite force values in children with spastic cerebral palsy. Ninety-five spastic cerebral palsy children with and without teeth grinding, according to caregivers' reports, were submitted to a comprehensive oral motor performance evaluation during the feeding process using the Oral Motor Assessment Scale. Maximal bite force was measured using an electronic gnathodynamometer. The teeth grinding group (n = 42) was younger, used anticonvulsant drugs, and was more frequently classified within the subfunctional oral motor performance category. Teeth grinding subfunctional spastic cerebral palsy children presented lower values of maximal bite force. The functional groups showing the presence or absence of teeth grinding presented higher values of maximal bite force compared with the subfunctional groups. In spastic cerebral palsy children, teeth grinding is associated with the worse oral motor performance. © 2015 Special Care Dentistry Association and Wiley Periodicals, Inc.
Welfare-maximizing and revenue-maximizing tariffs with a few domestic firms
Bruno Larue; Jean-Philippe Gervais
2002-01-01
In this paper we compare the orthodox optimal tariff formula with the appropriate welfare-maximizing tariff when there are a few producing or importing firms. The welfare-maximizing tariff can be very low, voire negative in some cases, while in others it can even exceed the maximum-revenue tariff. The relationship between the welfare-maximizing tariff and the number of firms need not be monotonically increasing, because the tariff is not strictly used to internalize terms of trade externality...
Maximizing Complementary Quantities by Projective Measurements
M. Souza, Leonardo A.; Bernardes, Nadja K.; Rossi, Romeu
2017-04-01
In this work, we study the so-called quantitative complementarity quantities. We focus in the following physical situation: two qubits ( q A and q B ) are initially in a maximally entangled state. One of them ( q B ) interacts with a N-qubit system ( R). After the interaction, projective measurements are performed on each of the qubits of R, in a basis that is chosen after independent optimization procedures: maximization of the visibility, the concurrence, and the predictability. For a specific maximization procedure, we study in detail how each of the complementary quantities behave, conditioned on the intensity of the coupling between q B and the N qubits. We show that, if the coupling is sufficiently "strong," independent of the maximization procedure, the concurrence tends to decay quickly. Interestingly enough, the behavior of the concurrence in this model is similar to the entanglement dynamics of a two qubit system subjected to a thermal reservoir, despite that we consider finite N. However, the visibility shows a different behavior: its maximization is more efficient for stronger coupling constants. Moreover, we investigate how the distinguishability, or the information stored in different parts of the system, is distributed for different couplings.
Polyploidy Induction of Pteroceltis tatarinowii Maxim
Lin ZHANG; Feng WANG; Zhongkui SUN; Cuicui ZHU; Rongwei CHEN
2015-01-01
3%Objective] This study was conducted to obtain tetraploid Pteroceltis tatari-nowi Maxim. with excel ent ornamental traits. [Method] The stem apex growing points of Pteroceltis tatarinowi Maxim. were treated with different concentrations of colchicine solution for different hours to figure out a proper method and obtain poly-ploids. [Result] The most effective induction was obtained by treatment with 0.6%-0.8% colchicine for 72 h with 34.2% mutation rate. Flow cytometry and chromosome observation of the stem apex growing point of P. tatarinowi Maxim. proved that the tetraploid plants were successful y obtained with chromosome number 2n=4x=36. [Conclusion] The result not only fil s the blank of polyploid breeding of P. tatarinowi , but also provides an effective way to broaden the methods of cultivation of fast-growing, high-quality, disease-resilience, new varieties of Pteroceltis.
Quantum theory allows for absolute maximal contextuality
Amaral, Barbara; Cunha, Marcelo Terra; Cabello, Adán
2015-12-01
Contextuality is a fundamental feature of quantum theory and a necessary resource for quantum computation and communication. It is therefore important to investigate how large contextuality can be in quantum theory. Linear contextuality witnesses can be expressed as a sum S of n probabilities, and the independence number α and the Tsirelson-like number ϑ of the corresponding exclusivity graph are, respectively, the maximum of S for noncontextual theories and for the theory under consideration. A theory allows for absolute maximal contextuality if it has scenarios in which ϑ /α approaches n . Here we show that quantum theory allows for absolute maximal contextuality despite what is suggested by the examination of the quantum violations of Bell and noncontextuality inequalities considered in the past. Our proof is not constructive and does not single out explicit scenarios. Nevertheless, we identify scenarios in which quantum theory allows for almost-absolute-maximal contextuality.
The maximal process of nonlinear shot noise
Eliazar, Iddo; Klafter, Joseph
2009-05-01
In the nonlinear shot noise system-model shots’ statistics are governed by general Poisson processes, and shots’ decay-dynamics are governed by general nonlinear differential equations. In this research we consider a nonlinear shot noise system and explore the process tracking, along time, the system’s maximal shot magnitude. This ‘maximal process’ is a stationary Markov process following a decay-surge evolution; it is highly robust, and it is capable of displaying both a wide spectrum of statistical behaviors and a rich variety of random decay-surge sample-path trajectories. A comprehensive analysis of the maximal process is conducted, including its Markovian structure, its decay-surge structure, and its correlation structure. All results are obtained analytically and in closed-form.
Energy Band Calculations for Maximally Even Superlattices
Krantz, Richard; Byrd, Jason
2007-03-01
Superlattices are multiple-well, semiconductor heterostructures that can be described by one-dimensional potential wells separated by potential barriers. We refer to a distribution of wells and barriers based on the theory of maximally even sets as a maximally even superlattice. The prototypical example of a maximally even set is the distribution of white and black keys on a piano keyboard. Black keys may represent wells and the white keys represent barriers. As the number of wells and barriers increase, efficient and stable methods of calculation are necessary to study these structures. We have implemented a finite-element method using the discrete variable representation (FE-DVR) to calculate E versus k for these superlattices. Use of the FE-DVR method greatly reduces the amount of calculation necessary for the eigenvalue problem.
Heterocyst placement strategies to maximize growth of cyanobacterial filaments
Brown, Aidan I
2012-01-01
Under conditions of limited fixed-nitrogen, some filamentous cyanobacteria develop a regular pattern of heterocyst cells that fix nitrogen for the remaining vegetative cells. We examine three different heterocyst placement strategies by quantitatively modelling filament growth while varying both external fixed-nitrogen and leakage from the filament. We find that there is an optimum heterocyst frequency which maximizes the growth rate of the filament; the optimum frequency decreases as the external fixed-nitrogen concentration increases but increases as the leakage increases. In the presence of leakage, filaments implementing a local heterocyst placement strategy grow significantly faster than filaments implementing random heterocyst placement strategies. With no extracellular fixed-nitrogen, consistent with recent experimental studies of Anabaena sp. PCC 7120, the modelled heterocyst spacing distribution using our local heterocyst placement strategy is qualitatively similar to experimentally observed patterns...
Two-Loop SL(2) Form Factors and Maximal Transcendentality
Loebbert, Florian; Wilhelm, Matthias; Yang, Gang
2016-01-01
Form factors of composite operators in the SL(2) sector of N=4 SYM theory are studied up to two loops via the on-shell unitarity method. The non-compactness of this subsector implies the novel feature and technical challenge of an unlimited number of loop momenta in the integrand's numerator. At one loop, we derive the full minimal form factor to all orders in the dimensional regularisation parameter. At two loops, we construct the complete integrand for composite operators with an arbitrary number of covariant derivatives, and we obtain the remainder functions as well as the dilatation operator for composite operators with up to three covariant derivatives. The remainder functions reveal curious patterns suggesting a hidden maximal uniform transcendentality for the full form factor. Finally, we speculate about an extension of these patterns to QCD.
Absence of parasympathetic reactivation after maximal exercise.
de Oliveira, Tiago Peçanha; de Alvarenga Mattos, Raphael; da Silva, Rhenan Bartels Ferreira; Rezende, Rafael Andrade; de Lima, Jorge Roberto Perrout
2013-03-01
The ability of the human organism to recover its autonomic balance soon after physical exercise cessation has an important impact on the individual's health status. Although the dynamics of heart rate recovery after maximal exercise has been studied, little is known about heart rate variability after this type of exercise. The aim of this study is to analyse the dynamics of heart rate and heart rate variability recovery after maximal exercise in healthy young men. Fifteen healthy male subjects (21·7 ± 3·4 years; 24·0 ± 2·1 kg m(-2) ) participated in the study. The experimental protocol consisted of an incremental maximal exercise test on a cycle ergometer, until maximal voluntary exhaustion. After the test, recovery R-R intervals were recorded for 5 min. From the absolute differences between peak heart rate values and the heart rate values at 1 and 5 min of the recovery, the heart rate recovery was calculated. Postexercise heart rate variability was analysed from calculations of the SDNN and RMSSD indexes, in 30-s windows (SDNN(30s) and RMSSD(30s) ) throughout recovery. One and 5 min after maximal exercise cessation, the heart rate recovered 34·7 (±6·6) and 75·5 (±6·1) bpm, respectively. With regard to HRV recovery, while the SDNN(30s) index had a slight increase, RMSSD(30s) index remained totally suppressed throughout the recovery, suggesting an absence of vagal modulation reactivation and, possibly, a discrete sympathetic withdrawal. Therefore, it is possible that the main mechanism associated with the fall of HR after maximal exercise is sympathetic withdrawal or a vagal tone restoration without vagal modulation recovery. © 2012 The Authors Clinical Physiology and Functional Imaging © 2012 Scandinavian Society of Clinical Physiology and Nuclear Medicine.
Maximizing band gaps in plate structures
Halkjær, Søren; Sigmund, Ole; Jensen, Jakob Søndergaard
2006-01-01
Band gaps, i.e., frequency ranges in which waves cannot propagate, can be found in elastic structures for which there is a certain periodic modulation of the material properties or structure. In this paper, we maximize the band gap size for bending waves in a Mindlin plate. We analyze an infinite...... periodic plate using Bloch theory, which conveniently reduces the maximization problem to that of a single base cell. Secondly, we construct a finite periodic plate using a number of the optimized base cells in a postprocessed version. The dynamic properties of the finite plate are investigated...
Maximal and Minimal Congruences on Some Semigroups
Jintana SANWONG; Boorapa SINGHA; R.P.SULLIVAN
2009-01-01
In 2006,Sanwong and Sullivan described the maximal congruences on the semigroup N consisting of all non-negative integers under standard multiplication,and on the semigroup T(X) consisting of all total transformations of an infinite set X under composition. Here,we determine all maximal congruences on the semigroup Zn under multiplication modulo n. And,when Y X,we do the same for the semigroup T(X,Y) consisting of all elements of T(X) whose range is contained in Y. We also characterise the minimal congruences on T(X,Y).
Maximizing oil yields may not optimize economics
1987-03-01
The Los Alamos National Laboratory has used the ASPEN computer code to calculate the economics of different hydroretorting conditions. When the oil yield was maximized and a oil shale plant designed around this process, the costs turned out much higher than expected. However, calculations based on runs of less than maximum yields showed lower cost estimates. It is recommended that future efforts should be concentrated on minimizing production costs rather than maximizing yields. An oil shale plant has been designed around minimum production cost, but has not been able to be tested experimentally.
Maximal Inequalities for Dependent Random Variables
Hoffmann-Jorgensen, Jorgen
2016-01-01
Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X-k. Then a......Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X...
Singularity Structure of Maximally Supersymmetric Scattering Amplitudes
Arkani-Hamed, Nima; Bourjaily, Jacob L.; Cachazo, Freddy
2014-01-01
We present evidence that loop amplitudes in maximally supersymmetric (N=4) Yang-Mills theory (SYM) beyond the planar limit share some of the remarkable structures of the planar theory. In particular, we show that through two loops, the four-particle amplitude in full N=4 SYM has only logarithmic ...... singularities and is free of any poles at infinity—properties closely related to uniform transcendentality and the UV finiteness of the theory. We also briefly comment on implications for maximal (N=8) supergravity theory (SUGRA)....
Influence of Frequent Nocturnal Home Hemodialysis on Food Preference
Ipema, Karin; Franssen, Casper; van der Schans, Cees; Smit, Lianne; Noordman, Sabine; Haisma, Hinke
Objective: Dialysis patients frequently report a change of taste that is reversible after renal transplantation, suggesting that uremic toxins may negatively influence taste. Currently, frequent nocturnal home hemodialysis (NHHD) is the most effective method of hemodialysis, and is associated with
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching;
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...
Gradient dynamics and entropy production maximization
Janečka, Adam
2016-01-01
Gradient dynamics describes irreversible evolution by means of a dissipation potential, which leads to several advantageous features like Maxwell--Onsager relations, distinguishing between thermodynamic forces and fluxes or geometrical interpretation of the dynamics. Entropy production maximization is a powerful tool for predicting constitutive relations in engineering. In this paper, both approaches are compared and their shortcomings and advantages are discussed.
Robust Utility Maximization Under Convex Portfolio Constraints
Matoussi, Anis, E-mail: anis.matoussi@univ-lemans.fr [Université du Maine, Risk and Insurance institut of Le Mans Laboratoire Manceau de Mathématiques (France); Mezghani, Hanen, E-mail: hanen.mezghani@lamsin.rnu.tn; Mnif, Mohamed, E-mail: mohamed.mnif@enit.rnu.tn [University of Tunis El Manar, Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l’Ingénieur, ENIT (Tunisia)
2015-04-15
We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle.
Maximizing the Motivated Mind for Emergent Giftedness.
Rea, Dan
2001-01-01
This article explains how the theory of the motivated mind conceptualizes the productive interaction of intelligence, creativity, and achievement motivation and how this theory can help educators to maximize students' emergent potential for giftedness. It discusses the integration of cold-order thinking and hot-chaotic thinking into fluid-adaptive…
The Winning Edge: Maximizing Success in College.
Schmitt, David E.
This book offers college students ideas on how to maximize their success in college by examining the personal management techniques a student needs to succeed. Chapters are as follows: "Getting and Staying Motivated"; "Setting Goals and Tapping Your Resources"; "Conquering Time"; "Think Yourself to College Success"; "Understanding and Remembering…
MAXIMAL ELEMENTS AND EQUILIBRIUM OF ABSTRACT ECONOMY
刘心歌; 蔡海涛
2001-01-01
An existence theorem of maximal elements for a new type of preference correspondences which are Qθ-majorized is given. Then some existence theorems of equilibrium for abstract economy and qualitative game in which the constraint or preference correspondences are Qθ-majorized are obtained in locally convex topological vector spaces.
DNA solution of the maximal clique problem.
Ouyang, Q; Kaplan, P D; Liu, S; Libchaber, A
1997-10-17
The maximal clique problem has been solved by means of molecular biology techniques. A pool of DNA molecules corresponding to the total ensemble of six-vertex cliques was built, followed by a series of selection processes. The algorithm is highly parallel and has satisfactory fidelity. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
Maximal workload capacity on moving platforms
Heus, R.; Wertheim, A.H.
1996-01-01
Physical tasks on a moving platform required more energy than the same tasks on a non-moving platform. In this study the maximum aerobic performance (defined as V_O2max) of people working on a moving floor was established compared to the maximal aerobic performance on a non-moving floor. The main
Maximal workload capacity on moving platforms
Heus, R.; Wertheim, A.H.
1996-01-01
Physical tasks on a moving platform required more energy than the same tasks on a non-moving platform. In this study the maximum aerobic performance (defined as V_O2max) of people working on a moving floor was established compared to the maximal aerobic performance on a non-moving floor. The main qu
Maximizing Resource Utilization in Video Streaming Systems
Alsmirat, Mohammad Abdullah
2013-01-01
Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…
Maximizing throughput in an automated test system
朱君
2007-01-01
@@ Overview This guide is collection of whitepapers designed to help you develop test systems that lower your cost, increase your test throughput, and can scale with future requirements. This whitepaper provides strategies for maximizing system throughput. To download the complete developers guide (120 pages), visit ni. com/automatedtest.
The gaugings of maximal D=6 supergravity
Bergshoeff, E.; Samtleben, H.; Sezgin, E.
2008-01-01
We construct the most general gaugings of the maximal D = 6 supergravity. The theory is ( 2, 2) supersymmetric, and possesses an on-shell SO( 5, 5) duality symmetry which plays a key role in determining its couplings. The field content includes 16 vector fields that carry a chiral spinor representat
WEIGHTED BOUNDEDNESS OF A ROUGH MAXIMAL OPERATOR
无
2000-01-01
In this note the authors give the weighted Lp-boundedness fora class of maximal singular integral operators with rough kernel.The result in this note is an improvement and extension ofthe result obtained by Chen and Lin in 1990.
Maximizing the Range of a Projectile.
Brown, Ronald A.
1992-01-01
Discusses solutions to the problem of maximizing the range of a projectile. Presents three references that solve the problem with and without the use of calculus. Offers a fourth solution suitable for introductory physics courses that relies more on trigonometry and the geometry of the problem. (MDH)
Ehrenfest's Lottery--Time and Entropy Maximization
Ashbaugh, Henry S.
2010-01-01
Successful teaching of the Second Law of Thermodynamics suffers from limited simple examples linking equilibrium to entropy maximization. I describe a thought experiment connecting entropy to a lottery that mixes marbles amongst a collection of urns. This mixing obeys diffusion-like dynamics. Equilibrium is achieved when the marble distribution is…
Testing maximality in muon neutrino flavor mixing
Choubey, S; Choubey, Sandhya; Roy, Probir
2003-01-01
The small difference between the survival probabilities of muon neutrino and antineutrino beams, traveling through earth matter in a long baseline experiment such as MINOS, is shown to be an important measure of any possible deviation from maximality in the flavor mixing of those states.
Average utility maximization: A preference foundation
A.V. Kothiyal (Amit); V. Spinu (Vitalie); P.P. Wakker (Peter)
2014-01-01
textabstractThis paper provides necessary and sufficient preference conditions for average utility maximization over sequences of variable length. We obtain full generality by using a new algebraic technique that exploits the richness structure naturally provided by the variable length of the sequen
On the Hardy-Littlewood maximal theorem
Shinji Yamashita
1982-01-01
Full Text Available The Hardy-Littlewood maximal theorem is extended to functions of class PL in the sense of E. F. Beckenbach and T. Radó, with a more precise expression of the absolute constant in the inequality. As applications we deduce some results on hyperbolic Hardy classes in terms of the non-Euclidean hyperbolic distance in the unit disk.
Maximal Cartel Pricing and Leniency Programs
Houba, H.E.D.; Motchenkova, E.; Wen, Q.
2008-01-01
For a general class of oligopoly models with price competition, we analyze the impact of ex-ante leniency programs in antitrust regulation on the endogenous maximal-sustainable cartel price. This impact depends upon industry characteristics including its cartel culture. Our analysis disentangles the
How to Generate Good Profit Maximization Problems
Davis, Lewis
2014-01-01
In this article, the author considers the merits of two classes of profit maximization problems: those involving perfectly competitive firms with quadratic and cubic cost functions. While relatively easy to develop and solve, problems based on quadratic cost functions are too simple to address a number of important issues, such as the use of…
Ehrenfest's Lottery--Time and Entropy Maximization
Ashbaugh, Henry S.
2010-01-01
Successful teaching of the Second Law of Thermodynamics suffers from limited simple examples linking equilibrium to entropy maximization. I describe a thought experiment connecting entropy to a lottery that mixes marbles amongst a collection of urns. This mixing obeys diffusion-like dynamics. Equilibrium is achieved when the marble distribution is…
Maximally entangled mixed states made easy
Aiello, A; Voigt, D; Woerdman, J P
2006-01-01
We show that, contrarily to a recent claim [M. Ziman and V. Bu\\v{z}ek, Phys. Rev. A. \\textbf{72}, 052325 (2005)], it is possible to achieve maximally entangled mixed states of two qubits from the singlet state via the action of local nonunital quantum channels. Moreover, we present a simple, feasible linear optical implementation of one of such channels.
Maximizing Resource Utilization in Video Streaming Systems
Alsmirat, Mohammad Abdullah
2013-01-01
Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…
Maximizing scientific knowledge from randomized clinical trials
Gustafsson, Finn; Atar, Dan; Pitt, Bertram
2010-01-01
Trialists have an ethical and financial responsibility to plan and conduct clinical trials in a manner that will maximize the scientific knowledge gained from the trial. However, the amount of scientific information generated by randomized clinical trials in cardiovascular medicine is highly...
Maximal Heat Generation in Nanoscale Systems
ZHOU Li-Ling; LI Shu-Shen; ZENG Zhao-Yang
2009-01-01
We investigate the heat generation in a nanoscale system coupled to normal leads and find that it is maximal when the average occupation of the electrons in the nanoscale system is 0.5,no matter what mechanism induces the heat generation.
Understanding violations of Gricean maxims in preschoolers and adults.
Okanda, Mako; Asada, Kosuke; Moriguchi, Yusuke; Itakura, Shoji
2015-01-01
This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants' understanding of the following maxims was assessed: be informative (first maxim of quantity), avoid redundancy (second maxim of quantity), be truthful (maxim of quality), be relevant (maxim of relation), avoid ambiguity (second maxim of manner), and be polite (maxim of politeness). Sensitivity to violations of Gricean maxims increased with age: 4-year-olds' understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner), and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.
Understanding Violations of Gricean Maxims in Preschoolers and Adults
Mako eOkanda
2015-07-01
Full Text Available This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants’ understanding of the following maxims was assessed: be informative (first maxim of quantity, avoid redundancy (second maxim of quantity, be truthful (maxim of quality, be relevant (maxim of relation, avoid ambiguity (second maxim of manner, and be polite (maxim of politeness. Sensitivity to violations of Gricean maxims increased with age: 4-year-olds’ understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner, and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.
An Intelligent Approach For Mining Frequent Spatial Objects In Geographic Information System
Animesh Tripathy
2010-11-01
Full Text Available Spatial Data Mining is based on correlation of spatial objects in space. Mining frequent pattern fromspatial databases systems has always remained a challenge for researchers. In the light of the first law ofgeography “everything is related to everything else but nearby things is more related than distant things”suggests that values taken from samples of spatial data near to each other tend to be more similar thanthose taken farther apart. This tendency is termed spatial autocorrelation or spatial dependence. It’snatural that most spatial data are not independent, they have high autocorrelation. In this paper, wepropose an enhancement of existing mining algorithm for efficiently mining frequent patterns for spatialobjects occurring in space such as a city is located near a river. The frequency of each spatial object inrelation to other object tends to determine multiple occurrence of the same object. We further enhancethe proposed approach by using a numerical method. This method uses a tree structure basedmethodology for mining frequent patterns considering the frequency of each object stored at each node ofthe tree. Experimental results suggest significant improvement in finding valid frequent patterns overexisting methods.
Feature Extraction Using Supervised Independent Component Analysis by Maximizing Class Distance
Sakaguchi, Yoshinori; Ozawa, Seiichi; Kotani, Manabu
Recently, Independent Component Analysis (ICA) has been applied to not only problems of blind signal separation, but also feature extraction of patterns. However, the effectiveness of pattern features extracted by conventional ICA algorithms depends on pattern sets; that is, how patterns are distributed in the feature space. As one of the reasons, we have pointed out that ICA features are obtained by increasing only their independence even if the class information is available. In this context, we can expect that more high-performance features can be obtained by introducing the class information into conventional ICA algorithms. In this paper, we propose a supervised ICA (SICA) that maximizes Mahalanobis distance between features of different classes as well as maximize their independence. In the first experiment, two-dimensional artificial data are applied to the proposed SICA algorithm to see how maximizing Mahalanobis distance works well in the feature extraction. As a result, we demonstrate that the proposed SICA algorithm gives good features with high separability as compared with principal component analysis and a conventional ICA. In the second experiment, the recognition performance of features extracted by the proposed SICA is evaluated using the three data sets of UCI Machine Learning Repository. From the results, we show that the better recognition accuracy is obtained using our proposed SICA. Furthermore, we show that pattern features extracted by SICA are better than those extracted by only maximizing the Mahalanobis distance.
Frequently Asked Questions about Physical Medicine and Rehabilitation
... Outcomes for Patients with Spasticity: Improving Assessment and Maximizing Intervention Options General Information Mobile App Why You ... New Look, New Features Medicare Resources Diversifying Practice Revenue Advocacy Federal Health Care Reform Better Care Reconciliation ...
Altered gene expression in blood and sputum in COPD frequent exacerbators in the ECLIPSE cohort.
Dave Singh
Full Text Available Patients with chronic obstructive pulmonary disease (COPD who are defined as frequent exacerbators suffer with 2 or more exacerbations every year. The molecular mechanisms responsible for this phenotype are poorly understood. We investigated gene expression profile patterns associated with frequent exacerbations in sputum and blood cells in a well-characterised cohort. Samples from subjects from the ECLIPSE COPD cohort were used; sputum and blood samples from 138 subjects were used for microarray gene expression analysis, while blood samples from 438 subjects were used for polymerase chain reaction (PCR testing. Using microarray, 150 genes were differentially expressed in blood (>±1.5 fold change, p≤0.01 between frequent compared to non-exacerbators. In sputum cells, only 6 genes were differentially expressed. The differentially regulated genes in blood included downregulation of those involved in lymphocyte signalling and upregulation of pro-apoptotic signalling genes. Multivariate analysis of the microarray data followed by confirmatory PCR analysis identified 3 genes that predicted frequent exacerbations; B3GNT, LAF4 and ARHGEF10. The sensitivity and specificity of these 3 genes to predict the frequent exacerbator phenotype was 88% and 33% respectively. There are alterations in systemic immune function associated with frequent exacerbations; down-regulation of lymphocyte function and a shift towards pro-apoptosis mechanisms are apparent in patients with frequent exacerbations.
Altered gene expression in blood and sputum in COPD frequent exacerbators in the ECLIPSE cohort.
Singh, Dave; Fox, Steven M; Tal-Singer, Ruth; Bates, Stewart; Riley, John H; Celli, Bartolome
2014-01-01
Patients with chronic obstructive pulmonary disease (COPD) who are defined as frequent exacerbators suffer with 2 or more exacerbations every year. The molecular mechanisms responsible for this phenotype are poorly understood. We investigated gene expression profile patterns associated with frequent exacerbations in sputum and blood cells in a well-characterised cohort. Samples from subjects from the ECLIPSE COPD cohort were used; sputum and blood samples from 138 subjects were used for microarray gene expression analysis, while blood samples from 438 subjects were used for polymerase chain reaction (PCR) testing. Using microarray, 150 genes were differentially expressed in blood (>±1.5 fold change, p≤0.01) between frequent compared to non-exacerbators. In sputum cells, only 6 genes were differentially expressed. The differentially regulated genes in blood included downregulation of those involved in lymphocyte signalling and upregulation of pro-apoptotic signalling genes. Multivariate analysis of the microarray data followed by confirmatory PCR analysis identified 3 genes that predicted frequent exacerbations; B3GNT, LAF4 and ARHGEF10. The sensitivity and specificity of these 3 genes to predict the frequent exacerbator phenotype was 88% and 33% respectively. There are alterations in systemic immune function associated with frequent exacerbations; down-regulation of lymphocyte function and a shift towards pro-apoptosis mechanisms are apparent in patients with frequent exacerbations.
Rui Luo; Chao Wang; Daming Zhang
2006-01-01
The localization of 18S ribosomal RNA genes (rDNA) by fluorescence in situ hybridization (FISH) had been performed for some species of Paeonia. However, the pattern of 18S rDNA loci among populations is indistinct. In the present study, we localized 18S rDNA loci on meiotic or mitotic chromosomes of six populations of Paeonia obovata Maxim. (Paeoniaceae). Different numbers of rDNA loci were found with different diploid (2n=10) populations, namely eight (Lushi and Mt. Jiuhua populations), 10 (Mt. Taibai population), and seven (Mt. Guandi population), whereas tetraploid (2n=20) populations were all found with 16 loci. All rDNA loci were mapped near telomeres of mitotic chromosomes and there was no chromosome with two loci. The present results show that molecular cytological polymorphism exists among P. obovata diploid populations, indicating that structural variations occurred frequently during the evolutionary history of this species, accompanied with differentiation among populations.
Measurable Maximal Energy and Minimal Time Interval
Dahab, Eiman Abou El
2014-01-01
The possibility of finding the measurable maximal energy and the minimal time interval is discussed in different quantum aspects. It is found that the linear generalized uncertainty principle (GUP) approach gives a non-physical result. Based on large scale Schwarzshild solution, the quadratic GUP approach is utilized. The calculations are performed at the shortest distance, at which the general relativity is assumed to be a good approximation for the quantum gravity and at larger distances, as well. It is found that both maximal energy and minimal time have the order of the Planck time. Then, the uncertainties in both quantities are accordingly bounded. Some physical insights are addressed. Also, the implications on the physics of early Universe and on quantized mass are outlined. The results are related to the existence of finite cosmological constant and minimum mass (mass quanta).
Maximal temperature in a simple thermodynamical system
Dai, De-Chang
2016-01-01
Temperature in a simple thermodynamical system is not limited from above. It is also widely believed that it does not make sense talking about temperatures higher than the Planck temperature in the absence of the full theory of quantum gravity. Here, we demonstrate that there exist a maximal achievable temperature in a system where particles obey the laws of quantum mechanics and classical gravity before we reach the realm of quantum gravity. Namely, if two particles with a given center of mass energy come at the distance shorter than the Schwarzschild diameter apart, according to classical gravity they will form a black hole. It is possible to calculate that a simple thermodynamical system will be dominated by black holes at a critical temperature which is about three times lower than the Planck temperature. That represents the maximal achievable temperature in a simple thermodynamical system.
Hamiltonian formalism and path entropy maximization
Davis, Sergio; González, Diego
2015-10-01
Maximization of the path information entropy is a clear prescription for constructing models in non-equilibrium statistical mechanics. Here it is shown that, following this prescription under the assumption of arbitrary instantaneous constraints on position and velocity, a Lagrangian emerges which determines the most probable trajectory. Deviations from the probability maximum can be consistently described as slices in time by a Hamiltonian, according to a nonlinear Langevin equation and its associated Fokker-Planck equation. The connections unveiled between the maximization of path entropy and the Langevin/Fokker-Planck equations imply that missing information about the phase space coordinate never decreases in time, a purely information-theoretical version of the second law of thermodynamics. All of these results are independent of any physical assumptions, and thus valid for any generalized coordinate as a function of time, or any other parameter. This reinforces the view that the second law is a fundamental property of plausible inference.
Predicting Contextual Sequences via Submodular Function Maximization
Dey, Debadeepta; Hebert, Martial; Bagnell, J Andrew
2012-01-01
Sequence optimization, where the items in a list are ordered to maximize some reward has many applications such as web advertisement placement, search, and control libraries in robotics. Previous work in sequence optimization produces a static ordering that does not take any features of the item or context of the problem into account. In this work, we propose a general approach to order the items within the sequence based on the context (e.g., perceptual information, environment description, and goals). We take a simple, efficient, reduction-based approach where the choice and order of the items is established by repeatedly learning simple classifiers or regressors for each "slot" in the sequence. Our approach leverages recent work on submodular function maximization to provide a formal regret reduction from submodular sequence optimization to simple cost-sensitive prediction. We apply our contextual sequence prediction algorithm to optimize control libraries and demonstrate results on two robotics problems: ...
Nonlinear trading models through Sharpe Ratio maximization.
Choey, M; Weigend, A S
1997-08-01
While many trading strategies are based on price prediction, traders in financial markets are typically interested in optimizing risk-adjusted performance such as the Sharpe Ratio, rather than the price predictions themselves. This paper introduces an approach which generates a nonlinear strategy that explicitly maximizes the Sharpe Ratio. It is expressed as a neural network model whose output is the position size between a risky and a risk-free asset. The iterative parameter update rules are derived and compared to alternative approaches. The resulting trading strategy is evaluated and analyzed on both computer-generated data and real world data (DAX, the daily German equity index). Trading based on Sharpe Ratio maximization compares favorably to both profit optimization and probability matching (through cross-entropy optimization). The results show that the goal of optimizing out-of-sample risk-adjusted profit can indeed be achieved with this nonlinear approach.
Maximally Symmetric Spacetimes emerging from thermodynamic fluctuations
Bravetti, A; Quevedo, H
2015-01-01
In this work we prove that the maximally symmetric vacuum solutions of General Relativity emerge from the geometric structure of statistical mechanics and thermodynamic fluctuation theory. To present our argument, we begin by showing that the pseudo-Riemannian structure of the Thermodynamic Phase Space is a solution to the vacuum Einstein-Gauss-Bonnet theory of gravity with a cosmological constant. Then, we use the geometry of equilibrium thermodynamics to demonstrate that the maximally symmetric vacuum solutions of Einstein's Field Equations -- Minkowski, de-Sitter and Anti-de-Sitter spacetimes -- correspond to thermodynamic fluctuations. Moreover, we argue that these might be the only possible solutions that can be derived in this manner. Thus, the results presented here are the first concrete examples of spacetimes effectively emerging from the thermodynamic limit over an unspecified microscopic theory without any further assumptions.
Consistent 4-form fluxes for maximal supergravity
Godazgar, Hadi; Krueger, Olaf; Nicolai, Hermann
2015-01-01
We derive new ansaetze for the 4-form field strength of D=11 supergravity corresponding to uplifts of four-dimensional maximal gauged supergravity. In particular, the ansaetze directly yield the components of the 4-form field strength in terms of the scalars and vectors of the four-dimensional maximal gauged supergravity---in this way they provide an explicit uplift of all four-dimensional consistent truncations of D=11 supergravity. The new ansaetze provide a substantially simpler method for uplifting d=4 flows compared to the previously available method using the 3-form and 6-form potential ansaetze. The ansatz for the Freund-Rubin term allows us to conjecture a `master formula' for the latter in terms of the scalar potential of d=4 gauged supergravity and its first derivative. We also resolve a long-standing puzzle concerning the antisymmetry of the flux obtained from uplift ansaetze.
Modularity maximization using completely positive programming
Yazdanparast, Sakineh; Havens, Timothy C.
2017-04-01
Community detection is one of the most prominent problems of social network analysis. In this paper, a novel method for Modularity Maximization (MM) for community detection is presented which exploits the Alternating Direction Augmented Lagrangian (ADAL) method for maximizing a generalized form of Newman's modularity function. We first transform Newman's modularity function into a quadratic program and then use Completely Positive Programming (CPP) to map the quadratic program to a linear program, which provides the globally optimal maximum modularity partition. In order to solve the proposed CPP problem, a closed form solution using the ADAL merged with a rank minimization approach is proposed. The performance of the proposed method is evaluated on several real-world data sets used for benchmarks community detection. Simulation results shows the proposed technique provides outstanding results in terms of modularity value for crisp partitions.
Utility maximization in incomplete markets with default
Lim, Thomas
2008-01-01
We adress the maximization problem of expected utility from terminal wealth. The special feature of this paper is that we consider a financial market where the price process of risky assets can have a default time. Using dynamic programming, we characterize the value function with a backward stochastic differential equation and the optimal portfolio policies. We separately treat the cases of exponential, power and logarithmic utility.
Operational Modal Analysis using Expectation Maximization Algorithm
Cara Cañas, Francisco Javier; Carpio Huertas, Jaime; Juan Ruiz, Jesús; Alarcón Álvarez, Enrique
2011-01-01
This paper presents a time-domain stochastic system identification method based on Maximum Likelihood Estimation and the Expectation Maximization algorithm. The effectiveness of this structural identification method is evaluated through numerical simulation in the context of the ASCE benchmark problem on structural health monitoring. Modal parameters (eigenfrequencies, damping ratios and mode shapes) of the benchmark structure have been estimated applying the proposed identification method...
Revenue Maximizing Head Starts in Contests
Franke, Jörg; Leininger, Wolfgang; Wasser, Cédric
2014-01-01
We characterize revenue maximizing head starts for all-pay auctions and lottery contests with many heterogeneous players. We show that under optimal head starts all-pay auctions revenue-dominate lottery contests for any degree of heterogeneity among players. Moreover, all-pay auctions with optimal head starts induce higher revenue than any multiplicatively biased all-pay auction or lottery contest. While head starts are more effective than multiplicative biases in all-pay auctions, they are l...
Approximate Revenue Maximization in Interdependent Value Settings
Chawla, Shuchi; Fu, Hu; Karlin, Anna
2014-01-01
We study revenue maximization in settings where agents' values are interdependent: each agent receives a signal drawn from a correlated distribution and agents' values are functions of all of the signals. We introduce a variant of the generalized VCG auction with reserve prices and random admission, and show that this auction gives a constant approximation to the optimal expected revenue in matroid environments. Our results do not require any assumptions on the signal distributions, however, ...
Maximal supersymmetry and B-mode targets
Kallosh, Renata; Linde, Andrei; Wrase, Timm; Yamada, Yusuke
2017-04-01
Extending the work of Ferrara and one of the authors [1], we present dynamical cosmological models of α-attractors with plateau potentials for 3 α = 1, 2, 3, 4, 5, 6, 7. These models are motivated by geometric properties of maximally supersymmetric theories: M-theory, superstring theory, and maximal N = 8 supergravity. After a consistent truncation of maximal to minimal supersymmetry in a seven-disk geometry, we perform a two-step procedure: 1) we introduce a superpotential, which stabilizes the moduli of the seven-disk geometry in a supersymmetric minimum, 2) we add a cosmological sector with a nilpotent stabilizer, which breaks supersymmetry spontaneously and leads to a desirable class of cosmological attractor models. These models with n s consistent with observational data, and with tensor-to-scalar ratio r ≈ 10-2 - 10-3, provide natural targets for future B-mode searches. We relate the issue of stability of inflationary trajectories in these models to tessellations of a hyperbolic geometry.
Maximal respiratory pressures among adolescent swimmers.
Rocha Crispino Santos, M A; Pinto, M L; Couto Sant'Anna, C; Bernhoeft, M
2011-01-01
Maximal inspiratory pressures (MIP) and maximal expiratory pressures (MEP) are useful indices of respiratory muscle strength in athletes. The aims of this study were: to describe the strength of the respiratory muscles of Olympic junior swim team, at baseline and after a standard physical training; and to determine if there is a differential inspiratory and expiratory pressure response to the physical training. A cross-sectional study evaluated 28 international-level swimmers with ages ranging from 15 to 17 years, 19 (61 %) being males. At baseline, MIP was found to be lower in females (P = .001). The mean values reached by males and females were: MIP(cmH2O) = M: 100.4 (± 26.5)/F: 67.8 (± 23.2); MEP (cmH2O) = M: 87.4 (± 20.7)/F: 73.9 (± 17.3). After the physical training they reached: MIP (cmH2O) = M: 95.3 (± 30.3)/F: 71.8 (± 35.6); MEP (cmH2O) = M: 82.8 (± 26.2)/F: 70.4 (± 8.3). No differential pressure responses were observed in either males or females. These results suggest that swimmers can sustain the magnitude of the initial maximal pressures. Other studies should be developed to clarify if MIP and MEP could be used as a marker of an athlete's performance.
Cardiorespiratory Coordination in Repeated Maximal Exercise
Sergi Garcia-Retortillo
2017-06-01
Full Text Available Increases in cardiorespiratory coordination (CRC after training with no differences in performance and physiological variables have recently been reported using a principal component analysis approach. However, no research has yet evaluated the short-term effects of exercise on CRC. The aim of this study was to delineate the behavior of CRC under different physiological initial conditions produced by repeated maximal exercises. Fifteen participants performed 2 consecutive graded and maximal cycling tests. Test 1 was performed without any previous exercise, and Test 2 6 min after Test 1. Both tests started at 0 W and the workload was increased by 25 W/min in males and 20 W/min in females, until they were not able to maintain the prescribed cycling frequency of 70 rpm for more than 5 consecutive seconds. A principal component (PC analysis of selected cardiovascular and cardiorespiratory variables (expired fraction of O2, expired fraction of CO2, ventilation, systolic blood pressure, diastolic blood pressure, and heart rate was performed to evaluate the CRC defined by the number of PCs in both tests. In order to quantify the degree of coordination, the information entropy was calculated and the eigenvalues of the first PC (PC1 were compared between tests. Although no significant differences were found between the tests with respect to the performed maximal workload (Wmax, maximal oxygen consumption (VO2 max, or ventilatory threshold (VT, an increase in the number of PCs and/or a decrease of eigenvalues of PC1 (t = 2.95; p = 0.01; d = 1.08 was found in Test 2 compared to Test 1. Moreover, entropy was significantly higher (Z = 2.33; p = 0.02; d = 1.43 in the last test. In conclusion, despite the fact that no significant differences were observed in the conventionally explored maximal performance and physiological variables (Wmax, VO2 max, and VT between tests, a reduction of CRC was observed in Test 2. These results emphasize the interest of CRC
Cardiorespiratory Coordination in Repeated Maximal Exercise.
Garcia-Retortillo, Sergi; Javierre, Casimiro; Hristovski, Robert; Ventura, Josep L; Balagué, Natàlia
2017-01-01
Increases in cardiorespiratory coordination (CRC) after training with no differences in performance and physiological variables have recently been reported using a principal component analysis approach. However, no research has yet evaluated the short-term effects of exercise on CRC. The aim of this study was to delineate the behavior of CRC under different physiological initial conditions produced by repeated maximal exercises. Fifteen participants performed 2 consecutive graded and maximal cycling tests. Test 1 was performed without any previous exercise, and Test 2 6 min after Test 1. Both tests started at 0 W and the workload was increased by 25 W/min in males and 20 W/min in females, until they were not able to maintain the prescribed cycling frequency of 70 rpm for more than 5 consecutive seconds. A principal component (PC) analysis of selected cardiovascular and cardiorespiratory variables (expired fraction of O2, expired fraction of CO2, ventilation, systolic blood pressure, diastolic blood pressure, and heart rate) was performed to evaluate the CRC defined by the number of PCs in both tests. In order to quantify the degree of coordination, the information entropy was calculated and the eigenvalues of the first PC (PC1) were compared between tests. Although no significant differences were found between the tests with respect to the performed maximal workload (Wmax), maximal oxygen consumption (VO2 max), or ventilatory threshold (VT), an increase in the number of PCs and/or a decrease of eigenvalues of PC1 (t = 2.95; p = 0.01; d = 1.08) was found in Test 2 compared to Test 1. Moreover, entropy was significantly higher (Z = 2.33; p = 0.02; d = 1.43) in the last test. In conclusion, despite the fact that no significant differences were observed in the conventionally explored maximal performance and physiological variables (Wmax, VO2 max, and VT) between tests, a reduction of CRC was observed in Test 2. These results emphasize the interest of CRC evaluation in
Is energy expenditure taken into account in human sub-maximal jumping?--A simulation study.
Vanrenterghem, Jos; Bobbert, Maarten F; Casius, L J Richard; De Clercq, Dirk
2008-02-01
This paper presents a simulation study that was conducted to investigate whether the stereotyped motion pattern observed in human sub-maximal jumping can be interpreted from the perspective of energy expenditure. Human sub-maximal vertical countermovement jumps were compared to jumps simulated with a forward dynamic musculo-skeletal model. This model consisted of four interconnected rigid segments, actuated by six Hill-type muscle actuators. The only independent input of the model was the stimulation of muscles as a function of time. This input was optimized using an objective function, in which targeting a specific sub-maximal height value was combined with minimizing the amount of muscle work produced. The characteristic changes in motion pattern observed in humans jumping to different target heights were reproduced by the model. As the target height was lowered, two major changes occurred in the motion pattern. First, the countermovement amplitude was reduced; this helped to save energy because of reduced dissipation and regeneration of energy in the contractile elements. Second, the contribution of rotation of the heavy proximal segments of the lower limbs to the vertical velocity of the centre of gravity at take-off was less; this helped to save energy because of reduced ineffective rotational energies at take-off. The simulations also revealed that, with the observed movement adaptations, muscle work was reduced through improved relative use of the muscle's elastic properties in sub-maximal jumping. According to the results of the simulations, the stereotyped motion pattern observed in sub-maximal jumping is consistent with the idea that in sub-maximal jumping, subjects are trying to achieve the targeted jump height with minimal energy expenditure.
Held, Fabian; Le Couteur, David G; Blyth, Fiona M; Hirani, Vasant; Naganathan, Vasi; Waite, Louise M; Seibel, Markus J; Handelsman, David J; Cumming, Robert G; Allore, Heather G; Gnjidic, Danijela
2017-02-01
The aim of this study was to apply Association Rule and Frequent-Set analysis, and novel means of data visualisation to ascertain patterns of medication use and medication combinations contributing to medication group clusters according to geriatric syndrome status in older adults. Participants were community-dwelling men (aged ≥70 years, n=1686), Sydney, Australia. Medication exposure was categorised at medication class level and data were analysed according to geriatric syndrome status (presence of at least one syndrome including frailty, falls, cognitive impairment and urinary incontinence). Association Rule and Frequent-Set analysis were performed to identify "interesting" patterns of medication combinations that occur together. This analysis involves advanced computer algorithms that investigated all possible combinations of medications in the dataset in order to identify those which are observed more or much less frequently than expected. Frequent-Set Analysis demonstrated one unexpected medication combination, antiulcer and antidiabetic medications (3.5% of participants) in the overall population (n=1687). Frequency of medication combinations was similar in participants with (n=666) and without (n=1020) geriatric syndromes. Among participants with geriatric syndromes, the most frequent combinations included antigout with lipid-lowering agents (5.7%) followed by angiotensin II and diuretics combination (22%). This novel methodology can be used to detect common medication combinations overall by data visualisation, and against specific adverse drug reactions such as geriatric syndromes. This methodology may be a valuable pharmacovigilance approach to monitor large databases for the safety of medications.
Maximal sfermion flavour violation in super-GUTs
Ellis, John [King' s College London, Theoretical Particle Physics and Cosmology Group, Department of Physics, London (United Kingdom); Olive, Keith A. [CERN, Theoretical Physics Department, Geneva (Switzerland); University of Minnesota, William I. Fine Theoretical Physics Institute, School of Physics and Astronomy, Minneapolis, MN (United States); Velasco-Sevilla, L. [University of Bergen, Department of Physics and Technology, PO Box 7803, Bergen (Norway)
2016-10-15
We consider supersymmetric grand unified theories with soft supersymmetry-breaking scalar masses m{sub 0} specified above the GUT scale (super-GUTs) and patterns of Yukawa couplings motivated by upper limits on flavour-changing interactions beyond the Standard Model. If the scalar masses are smaller than the gaugino masses m{sub 1/2}, as is expected in no-scale models, the dominant effects of renormalisation between the input scale and the GUT scale are generally expected to be those due to the gauge couplings, which are proportional to m{sub 1/2} and generation independent. In this case, the input scalar masses m{sub 0} may violate flavour maximally, a scenario we call MaxSFV, and there is no supersymmetric flavour problem. We illustrate this possibility within various specific super-GUT scenarios that are deformations of no-scale gravity. (orig.)
Maximal sfermion flavour violation in super-GUTs
AUTHOR|(CDS)2108556; Velasco-Sevilla, Liliana
2016-01-01
We consider supersymmetric grand unified theories with soft supersymmetry-breaking scalar masses $m_0$ specified above the GUT scale (super-GUTs) and patterns of Yukawa couplings motivated by upper limits on flavour-changing interactions beyond the Standard Model. If the scalar masses are smaller than the gaugino masses $m_{1/2}$, as is expected in no-scale models, the dominant effects of renormalization between the input scale and the GUT scale are generally expected to be those due to the gauge couplings, which are proportional to $m_{1/2}$ and generation-independent. In this case, the input scalar masses $m_0$ may violate flavour maximally, a scenario we call MaxFV, and there is no supersymmetric flavour problem. We illustrate this possibility within various specific super-GUT scenarios that are deformations of no-scale gravity.
Focus Group Study Exploring Factors Related to Frequent Sickness Absence.
Annette Notenbomer
Full Text Available Research investigating frequent sickness absence (3 or more episodes per year is scarce and qualitative research from the perspective of frequent absentees themselves is lacking. The aim of the current study is to explore awareness, determinants of and solutions to frequent sickness absence from the perspective of frequent absentees themselves.We performed a qualitative study of 3 focus group discussions involving a total of 15 frequent absentees. Focus group discussions were audiotaped and transcribed verbatim. Results were analyzed with the Graneheim method using the Job Demands Resources (JD-R model as theoretical framework.Many participants were not aware of their frequent sickness absence and the risk of future long-term sickness absence. As determinants, participants mentioned job demands, job resources, home demands, poor health, chronic illness, unhealthy lifestyles, and diminished feeling of responsibility to attend work in cases of low job resources. Managing these factors and improving communication (skills were regarded as solutions to reduce frequent sickness absence.The JD-R model provided a framework for determinants of and solutions to frequent sickness absence. Additional determinants were poor health, chronic illness, unhealthy lifestyles, and diminished feeling of responsibility to attend work in cases of low job resources. Frequent sickness absence should be regarded as a signal that something is wrong. Managers, supervisors, and occupational health care providers should advise and support frequent absentees to accommodate job demands, increase both job and personal resources, and improve health rather than express disapproval of frequent sickness absence and apply pressure regarding work attendance.
Postactivation Potentiation Biases Maximal Isometric Strength Assessment
Leonardo Coelho Rabello Lima
2014-01-01
Full Text Available Postactivation potentiation (PAP is known to enhance force production. Maximal isometric strength assessment protocols usually consist of two or more maximal voluntary isometric contractions (MVCs. The objective of this study was to determine if PAP would influence isometric strength assessment. Healthy male volunteers (n=23 performed two five-second MVCs separated by a 180-seconds interval. Changes in isometric peak torque (IPT, time to achieve it (tPTI, contractile impulse (CI, root mean square of the electromyographic signal during PTI (RMS, and rate of torque development (RTD, in different intervals, were measured. Significant increases in IPT (240.6 ± 55.7 N·m versus 248.9 ± 55.1 N·m, RTD (746 ± 152 N·m·s−1versus 727 ± 158 N·m·s−1, and RMS (59.1 ± 12.2% RMSMAX versus 54.8 ± 9.4% RMSMAX were found on the second MVC. tPTI decreased significantly on the second MVC (2373 ± 1200 ms versus 2784 ± 1226 ms. We conclude that a first MVC leads to PAP that elicits significant enhancements in strength-related variables of a second MVC performed 180 seconds later. If disconsidered, this phenomenon might bias maximal isometric strength assessment, overestimating some of these variables.
Maximizing versus satisficing: happiness is a matter of choice.
Schwartz, Barry; Ward, Andrew; Monterosso, John; Lyubomirsky, Sonja; White, Katherine; Lehman, Darrin R
2002-11-01
Can people feel worse off as the options they face increase? The present studies suggest that some people--maximizers--can. Study 1 reported a Maximization Scale, which measures individual differences in desire to maximize. Seven samples revealed negative correlations between maximization and happiness, optimism, self-esteem, and life satisfaction, and positive correlations between maximization and depression, perfectionism, and regret. Study 2 found maximizers less satisfied than nonmaximizers (satisficers) with consumer decisions, and more likely to engage in social comparison. Study 3 found maximizers more adversely affected by upward social comparison. Study 4 found maximizers more sensitive to regret and less satisfied in an ultimatum bargaining game. The interaction between maximizing and choice is discussed in terms of regret, adaptation, and self-blame.
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...... on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing...
ON THE SPACES OF THE MAXIMAL POINTS
梁基华; 刘应明
2003-01-01
For a continuous domain D, some characterization that the convex powerdomain CD is adomain hull of Max(CD) is given in terms of compact subsets of D. And in this case, it isproved that the set of the maximal points Max(CD) of CD with the relative Scott topology ishomeomorphic to the set of all Scott compact subsets of Max(D) with the topology induced bythe Hausdorff metric derived from a metric on Max(D) when Max(D) is metrizable.
Understanding of English Contracts though Relation Maxims
XU Chi-ying; JIANG Li-hui
2013-01-01
Contract is the legal evidence of the concerning parties of business. And this lead to its unique characteristics:technical terms, archaism, borrowed words, juxtaposition, and abbreviation. The understanding of contracts is of vital importance for each party, because it concerns the share of interests. In order to avoid ambiguity that some words or sentence in English contracts may lead to, and achieve“best relevance and least effort”of communication, this paper, by applying relation maxim, deeply analyze how to understand English contracts though selection of words, modification, the complexity and simplicity of sentence.
Maximizing results in reconstruction of cheek defects.
Mureau, Marc A M; Hofer, Stefan O P
2009-07-01
The face is exceedingly important, as it is the medium through which individuals interact with the rest of society. Reconstruction of cheek defects after trauma or surgery is a continuing challenge for surgeons who wish to reliably restore facial function and appearance. Important in aesthetic facial reconstruction are the aesthetic unit principles, by which the face can be divided in central facial units (nose, lips, eyelids) and peripheral facial units (cheeks, forehead, chin). This article summarizes established options for reconstruction of cheek defects and provides an overview of several modifications as well as tips and tricks to avoid complications and maximize aesthetic results.
Maximizing policy learning in international committees
Nedergaard, Peter
2007-01-01
, this article demonstrates that valuable lessons can be learned about policy learning, in practice and theoretically, by analysing the cooperation in the OMC committees. Using the Advocacy Coalition Framework as the starting point of analysis, 15 hypotheses on policy learning are tested. Among other things......, it is concluded that in order to maximize policy learning in international committees, empirical data should be made available to committees and provided by sources close to the participants (i.e. the Commission). In addition, the work in the committees should be made prestigious in order to attract well...
Kjøllesdal, Marte Råberg; Holmboe-Ottesen, Gerd; Wandel, Margareta
2011-01-01
To explore socio-economic differences in use of staff canteens and whether frequent use of staff canteens is associated with different food patterns and obesity. Cross-sectional study using three self-administered questionnaires, two of them including food frequency questions. Factor analysis was used to explore food patterns. Oslo, Norway, 2000-2001. In total 8943 adult, working Oslo citizens. Frequent (≥3 times/week) use of staff canteens was most likely among men, younger workers and those in the highest education and income groups. However, after adjustment for demographic, socio-economic and lifestyle factors, those with highest education were least likely to use staff canteens frequently. Frequent eating in staff canteens was positively associated with a Western food pattern (based on fat-rich food, fast food and red meat) and inversely associated with a traditional food pattern (based on boiled potatoes and gravy, and less rice, pasta and oil) in multivariate analyses. Unadjusted, frequent eating in staff canteens was also inversely associated with a prudent food pattern (based on fruit, vegetables, fish, legumes and oil). The likelihood of being obese (BMI ≥ 30 kg/m2) increased significantly with frequent eating in staff canteens, also when adjusted for demographic and socio-economic variables. Adjustment for the food patterns attenuated this relationship, but it was still significant. Frequent eating in staff canteens was negatively related to socio-economic position and positively associated with unhealthy dietary habits. This partly explained higher odds for obesity among frequent users of staff canteens. Future research should assess the availability and food options of staff canteens.
Social environment and frequent attendance in Danish general practice
Vedsted, Peter; Olesen, Frede
2005-01-01
of 1423 (73.7%) frequent attenders and 1103 (74.9%) infrequent attenders responded. Male frequent attendance was associated, with statistical significance, with living alone and being without work or on a disability pension. Among women, lack of professional education or being without work tended...
The rank-size scaling law and entropy-maximizing principle
Chen, Yanguang
2012-02-01
The rank-size regularity known as Zipf's law is one of the scaling laws and is frequently observed in the natural living world and social institutions. Many scientists have tried to derive the rank-size scaling relation through entropy-maximizing methods, but they have not been entirely successful. By introducing a pivotal constraint condition, I present here a set of new derivations based on the self-similar hierarchy of cities. First, I derive a pair of exponent laws by postulating local entropy maximizing. From the two exponential laws follows a general hierarchical scaling law, which implies the general form of Zipf's law. Second, I derive a special hierarchical scaling law with the exponent equal to 1 by postulating global entropy maximizing, and this implies the pure form of Zipf's law. The rank-size scaling law has proven to be one of the special cases of the hierarchical scaling law, and the derivation suggests a certain scaling range with the first or the last data point as an outlier. The entropy maximization of social systems differs from the notion of entropy increase in thermodynamics. For urban systems, entropy maximizing suggests the greatest equilibrium between equity for parts/individuals and efficiency of the whole.
Predictors of Frequent Emergency Room Visits among a Homeless Population.
Kinna Thakarar
Full Text Available Homelessness, HIV, and substance use are interwoven problems. Furthermore, homeless individuals are frequent users of emergency services. The main purpose of this study was to identify risk factors for frequent emergency room (ER visits and to examine the effects of housing status and HIV serostatus on ER utilization. The second purpose was to identify risk factors for frequent ER visits in patients with a history of illicit drug use.A retrospective analysis was performed on 412 patients enrolled in a Boston-based health care for the homeless program (HCH. This study population was selected as a 2:1 HIV seronegative versus HIV seropositive match based on age, sex, and housing status. A subgroup analysis was performed on 287 patients with history of illicit drug use. Chart data were analyzed to compare demographics, health characteristics, and health service utilization. Results were stratified by housing status. Logistic models using generalized estimating equations were used to predict frequent ER visits.In homeless patients, hepatitis C was the only predictor of frequent ER visits (OR 4.49, p<0.01. HIV seropositivity was not predictive of frequent ER visits. In patients with history of illicit drug use, mental health (OR 2.53, 95% CI 1.07-5.95 and hepatitis C (OR 2.85, 95% CI 1.37-5.93 were predictors of frequent ER use. HIV seropositivity did not predict ER use (OR 0.45, 95% CI 0.21 - 0.97.In a HCH population, hepatitis C predicted frequent ER visits in homeless patients. HIV seropositivity did not predict frequent ER visits, likely because HIV seropositive HCH patients are engaged in care. In patients with history of illicit drug use, hepatitis C and mental health disorders predicted frequent ER visits. Supportive housing for patients with mental health disorders and hepatitis C may help prevent unnecessary ER visits in this population.
Research on Algorithm for Mining Negative Association Rules Based on Frequent Pattern Tree
无
2006-01-01
Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. They are also very convenient for associative classifiers, classifiers that build their classification model based on association rules. Indeed, mining for such rules necessitates the examination of an exponentially large search space. Despite their usefulness, very few algorithms to mine them have been proposed to date. In this paper, an algorithm based on FP-tree is presented to discover negative association rules.
Maximal subbundles, quot schemes, and curve counting
Gillam, W D
2011-01-01
Let $E$ be a rank 2, degree $d$ vector bundle over a genus $g$ curve $C$. The loci of stable pairs on $E$ in class $2[C]$ fixed by the scaling action are expressed as products of $\\Quot$ schemes. Using virtual localization, the stable pairs invariants of $E$ are related to the virtual intersection theory of $\\Quot E$. The latter theory is extensively discussed for an $E$ of arbitrary rank; the tautological ring of $\\Quot E$ is defined and is computed on the locus parameterizing rank one subsheaves. In case $E$ has rank 2, $d$ and $g$ have opposite parity, and $E$ is sufficiently generic, it is known that $E$ has exactly $2^g$ line subbundles of maximal degree. Doubling the zero section along such a subbundle gives a curve in the total space of $E$ in class $2[C]$. We relate this count of maximal subbundles with stable pairs/Donaldson-Thomas theory on the total space of $E$. This endows the residue invariants of $E$ with enumerative significance: they actually \\emph{count} curves in $E$.
Maximal coherence in a generic basis
Yao, Yao; Dong, G. H.; Ge, Li; Li, Mo; Sun, C. P.
2016-12-01
Since quantum coherence is an undoubted characteristic trait of quantum physics, the quantification and application of quantum coherence has been one of the long-standing central topics in quantum information science. Within the framework of a resource theory of quantum coherence proposed recently, a fiducial basis should be preselected for characterizing the quantum coherence in specific circumstances, namely, the quantum coherence is a basis-dependent quantity. Therefore, a natural question is raised: what are the maximum and minimum coherences contained in a certain quantum state with respect to a generic basis? While the minimum case is trivial, it is not so intuitive to verify in which basis the quantum coherence is maximal. Based on the coherence measure of relative entropy, we indicate the particular basis in which the quantum coherence is maximal for a given state, where the Fourier matrix (or more generally, complex Hadamard matrices) plays a critical role in determining the basis. Intriguingly, though we can prove that the basis associated with the Fourier matrix is a stationary point for optimizing the l1 norm of coherence, numerical simulation shows that it is not a global optimal choice.
Symmetry and approximability of submodular maximization problems
Vondrak, Jan
2011-01-01
A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem. These results hold typically in the value oracle model, where the objective function is accessible via a black box returning f(S) for a given S. We present a general approach to deriving inapproximability results in the value oracle model, based on the notion of symmetry gap. Our main result is that for any fixed instance that exhibits a certain symmetry gap in its multilinear relaxation, there is a naturally related class of instances for which a better approximation factor than the symmetry gap would require exponentially many oracle queries. This unifies several known hardness results for submodular maximization, and implies several new ones. In particular, we prove that there is no constant-factor approximation for the problem of maximizing a non-negative submodular function over the bases of a matroid. We also provide a closely matching approximation algorithm for...
A4 and CP symmetry and a model with maximal CP violation
Li, Cai-Chang; Lu, Jun-Nan; Ding, Gui-Jun
2016-12-01
We study a second CP symmetry compatible with the A4 flavor group, which interchanges the representations 1‧ and 1″. We analyze the lepton mixing patterns arising from the A4 and CP symmetry broken to residual subgroups Z3 and Z2 × CP in the charged lepton and neutrino sectors respectively. One phenomenologically viable mixing pattern is found, and it predicts maximal atmospheric mixing angle as well as maximal Dirac CP phase, trivial Majorana phases and the correlation sin2 θ12cos2 θ13 = 1 / 3. We construct a concrete model based on the A4 and CP symmetry, the above interesting mixing pattern is achieved, the observed charged lepton mass hierarchy is reproduced, and the reactor mixing angle θ13 is of the correct order.
$A_4$ and CP symmetry and a model with maximal CP violation
Li, Cai-Chang; Ding, Gui-Jun
2016-01-01
We study a second CP symmetry compatible with the $A_4$ flavor group, which interchanges the representations $\\mathbf{1}'$ and $\\mathbf{1}"$. We analyze the lepton mixing patterns arising from the $A_4$ and CP symmetry broken to residual subgroups $Z_3$ and $Z_2\\times CP$ in the charged lepton and neutrino sectors respectively. One phenomenologically viable mixing pattern is found, and it predicts maximal atmospheric mixing angle as well as maximal Dirac CP phase, trivial Majorana phase and the correlation $\\sin^2\\theta_{12}\\cos^2\\theta_{13}=1/3$. We construct a concrete model based on the $A_4$ and CP symmetry, the above interesting mixing pattern is achieved, the observed charged lepton mass hierarchy is reproduced, and the reactor mixing angle $\\theta_{13}$ is of the correct order.
Bruine de Bruin, W; Parker, A; Strough, J
2016-01-01
Maximizing is a decision strategy that seeks the very best option, which is more elaborate and potentially more regret-inducing than choosing an option that is ‘good enough.’ In surveys with a large national sample, we find that older adults are less likely than younger adults to self-report maximizing, which is associated with their better experienced well-being reported two years later. This pattern holds after controlling for demographic characteristics and negative life events. Our findin...
EFFICIENT ALGORITHM FOR MINING FREQUENT ITEMSETS USING CLUSTERING TECHNIQUES
D.Kerana Hanirex
2011-03-01
Full Text Available Now a days, Association rule plays an important role. The purchasing of one product when another product is purchased represents an association rule. The Apriori algorithm is the basic algorithm for mining association rules. This paper presents an efficient Partition Algorithm for Mining Frequent Itemsets(PAFI using clustering. This algorithm finds the frequent itemsets by partitioning the database transactions into clusters. Clusters are formed based on the imilarity measures between the transactions. Then it finds the frequent itemsets with the transactions in the clusters directly using improved Apriori algorithm which further reduces the number of scans in the database and hence improve the efficiency.
Amiodarone-Induced Pulmonary Toxicity – A Frequently Missed Complication
Sweidan, Alexander J.; Singh, Navneet K.; Dang, Natasha; Lam, Vinh; Datta, Jyoti
2016-01-01
INTRODUCTION Amiodarone is often used in the suppression of tachyarrhythmias. One of the more serious adverse effects includes amiodarone pulmonary toxicity (APT). Several pulmonary diseases can manifest including interstitial pneumonitis, organizing pneumonia, acute respiratory distress syndrome, diffuse alveolar hemorrhage, pulmonary nodules or masses, and pleural effusion. Incidence of APT varies from 5–15% and is correlated to dosage, age of the patient, and preexisting lung disease. DESCRIPTION A 56-year-old male with a past medical history of coronary artery disease and chronic obstructive pulmonary disease was admitted for a coronary artery bypass graft. Post-operatively, the patient was admitted to the ICU for ventilator management and continued to receive his home dose of amiodarone 400 mg orally twice daily, which he had been taking for the past 3 months. The patient was found to be hypoxemic with a PaO2 52 mmHg and bilateral infiltrates on chest x-ray. Patient also complained of new onset dyspnea. Physical exam found bilateral rhonchi with bibasilar crackles and subcutaneous emphysema along the left anterior chest wall. Daily chest x-rays showed worsening of bilateral interstitial infiltrates and pleural effusions. A chest high-resolution computed tomography on post-operative day 3 showed extensive and severe bilateral ground glass opacities. APT was suspected and amiodarone was discontinued. A course of oral prednisone without antibiotics was initiated, and after one week of treatment the chest film cleared, the PaO2 value normalized and dyspnea resolved. DISCUSSION APT occurs via cytotoxic T cells and indirectly by immunological reaction. Typically the lungs manifest a diffuse interstitial pneumonitis with varying degrees of fibrosis. Infiltrates with a ‘ground-glass’ appearance appreciated on HRCT are more definitive than chest x-ray. Pulmonary nodules can be seen, frequently in the upper lobes. These are postulated to be accumulations of
Maximal lattice free bodies, test sets and the Frobenius problem
Jensen, Anders Nedergaard; Lauritzen, Niels; Roune, Bjarke Hammersholt
Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for computing the maximal lattice free bodies of an integral...... method is inspired by the novel algorithm by Einstein, Lichtblau, Strzebonski and Wagon and the Groebner basis approach by Roune....
Maximizing scientific knowledge from randomized clinical trials
Gustafsson, Finn; Atar, Dan; Pitt, Bertram;
2010-01-01
Trialists have an ethical and financial responsibility to plan and conduct clinical trials in a manner that will maximize the scientific knowledge gained from the trial. However, the amount of scientific information generated by randomized clinical trials in cardiovascular medicine is highly...... variable. Generation of trial databases and/or biobanks originating in large randomized clinical trials has successfully increased the knowledge obtained from those trials. At the 10th Cardiovascular Trialist Workshop, possibilities and pitfalls in designing and accessing clinical trial databases were......, in particular with respect to collaboration with the trial sponsor and to analytic pitfalls. The advantages of creating screening databases in conjunction with a given clinical trial are described; and finally, the potential for posttrial database studies to become a platform for training young scientists...
Characterizing maximally singular phase-space distributions
Sperling, J.
2016-07-01
Phase-space distributions are widely applied in quantum optics to access the nonclassical features of radiations fields. In particular, the inability to interpret the Glauber-Sudarshan distribution in terms of a classical probability density is the fundamental benchmark for quantum light. However, this phase-space distribution cannot be directly reconstructed for arbitrary states, because of its singular behavior. In this work, we perform a characterization of the Glauber-Sudarshan representation in terms of distribution theory. We address important features of such distributions: (i) the maximal degree of their singularities is studied, (ii) the ambiguity of representation is shown, and (iii) their dual space for nonclassicality tests is specified. In this view, we reconsider the methods for regularizing the Glauber-Sudarshan distribution for verifying its nonclassicality. This treatment is supported with comprehensive examples and counterexamples.
Maximization of eigenvalues using topology optimization
Pedersen, Niels Leergaard
2000-01-01
Topology optimization is used to optimize the eigenvalues of plates. The results are intended especially for MicroElectroMechanical Systems (MEMS) but call be seen as more general. The problem is not formulated as a case of reinforcement of an existing structure, so there is a problem related...... to localized modes in low density areas. The topology optimization problem is formulated using the SIMP method. Special attention is paid to a numerical method for removing localized eigenmodes in low density areas. The method is applied to numerical examples of maximizing the first eigenfrequency, One example...... is a practical MEMS application; a probe used in an Atomic Force Microscope (AFM). For the AFM probe the optimization is complicated by a constraint on the stiffness and constraints on higher order eigenvalues....
MAXIMIZING THE BENEFITS OF ERP SYSTEMS
Paulo André da Conceição Menezes
2010-04-01
Full Text Available The ERP (Enterprise Resource Planning systems have been consolidated in companies with different sizes and sectors, allowing their real benefits to be definitively evaluated. In this study, several interactions have been studied in different phases, such as the strategic priorities and strategic planning defined as ERP Strategy; business processes review and the ERP selection in the pre-implementation phase, the project management and ERP adaptation in the implementation phase, as well as the ERP revision and integration efforts in the post-implementation phase. Through rigorous use of case study methodology, this research led to developing and to testing a framework for maximizing the benefits of the ERP systems, and seeks to contribute for the generation of ERP initiatives to optimize their performance.
MAXIMIZING THE BENEFITS OF ERP SYSTEMS
Paulo André Da Conceiçao Menezes
2010-04-01
Full Text Available The ERP (Enterprise Resource Planning systems have been consolidated in companies with different sizes and sectors, allowing their real benefits to be definitively evaluated. In this study, several interactions have been studied in different phases, such as the strategic priorities and strategic planning defined as ERP Strategy; business processes review and the ERP selection in the pre-implementation phase, the project management and ERP adaptation in the implementation phase, as well as the ERP revision and integration efforts in the post-implementation phase. Through rigorous use of case study methodology, this research led to developing and to testing a framework for maximizing the benefits of the ERP systems, and seeks to contribute for the generation of ERP initiatives to optimize their performance.
Reflection Quasilattices and the Maximal Quasilattice
Boyle, Latham
2016-01-01
We introduce the concept of a {\\it reflection quasilattice}, the quasiperiodic generalization of a Bravais lattice with irreducible reflection symmetry. Among their applications, reflection quasilattices are the reciprocal (i.e. Bragg diffraction) lattices for quasicrystals and quasicrystal tilings, such as Penrose tilings, with irreducible reflection symmetry and discrete scale invariance. In a follow-up paper, we will show that reflection quasilattices can be used to generate tilings in real space with properties analogous to those in Penrose tilings, but with different symmetries and in various dimensions. Here we prove that reflection quasilattices only exist in dimensions two, three and four, and we prove that there is a unique reflection quasilattice in dimension four: the "maximal reflection quasilattice" in terms of dimensionality and symmetry. We further show that, unlike crystallographic Bravais lattices, all reflection quasilattices are invariant under rescaling by certain discrete scale factors. W...
Distributed Maximality based CTL Model Checking
Djamel Eddine Saidouni
2010-05-01
Full Text Available In this paper we investigate an approach to perform a distributed CTL Model checker algorithm on a network of workstations using Kleen three value logic, the state spaces is partitioned among the network nodes, We represent the incomplete state spaces as a Maximality labeled Transition System MLTS which are able to express true concurrency. we execute in parallel the same algorithm in each node, for a certain property on an incomplete MLTS , this last compute the set of states which satisfy or which if they fail are assigned the value .The third value mean unknown whether true or false because the partial state space lacks sufficient information needed for a precise answer concerning the complete state space .To solve this problem each node exchange the information needed to conclude the result about the complete state space. The experimental version of the algorithm is currently being implemented using the functional programming language Erlang.
Witten spinors on maximal, conformally flat hypersurfaces
Frauendiener, Jörg; Szabados, László B
2011-01-01
The boundary conditions that exclude zeros of the solutions of the Witten equation (and hence guarantee the existence of a 3-frame satisfying the so-called special orthonormal frame gauge conditions) are investigated. We determine the general form of the conformally invariant boundary conditions for the Witten equation, and find the boundary conditions that characterize the constant and the conformally constant spinor fields among the solutions of the Witten equations on compact domains in extrinsically and intrinsically flat, and on maximal, intrinsically globally conformally flat spacelike hypersurfaces, respectively. We also provide a number of exact solutions of the Witten equation with various boundary conditions (both at infinity and on inner or outer boundaries) that single out nowhere vanishing spinor fields on the flat, non-extreme Reissner--Nordstr\\"om and Brill--Lindquist data sets. Our examples show that there is an interplay between the boundary conditions, the global topology of the hypersurface...
Greedy Maximal Scheduling in Wireless Networks
Li, Qiao
2010-01-01
In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.
Dispatch Scheduling to Maximize Exoplanet Detection
Johnson, Samson; McCrady, Nate; MINERVA
2016-01-01
MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.
A New Biflavone from Selaginella pulvinata Maxim
XU Kang-Ping; XU Zhi; DENG Yin-Hua; LI Fu-Shuang; ZHOU Ying-Jun; HU Gao-Yun; TAN Gui-Shan
2003-01-01
@@ Selaginella pulvinata Maxim. distributes all over the country of China and is used for the treatment for haemor rhage. [1] We studied on the chemical constituents of S. pulvinata in order to find the active compounds. Dried stems and leaves of S. pulvinata (6.5 kg) were extracted with 70% ethanol twice. The extract was evaporated under vacuum and than suspended in water, extracted with petroleum and EtOAc sequentially. The EtOAc extract was chromatographed on silica gel, eluted with CHCl3-MeOH. As a result, a novel biflavone, named pulvinatabiflavone, was obtained from fractions 75 ～ 78. Its structure was determined on the basis of spectroscopic analysis as 5,5″, 4′″ trihydroxy-7,7″-dimethoxy-[4′-O-6″]-biflavone (compound 1).
Maximal energy extraction under discrete diffusive exchange
Hay, M. J., E-mail: hay@princeton.edu [Department of Astrophysical Sciences, Princeton University, Princeton, New Jersey 08544 (United States); Schiff, J. [Department of Mathematics, Bar-Ilan University, Ramat Gan 52900 (Israel); Fisch, N. J. [Department of Astrophysical Sciences, Princeton University, Princeton, New Jersey 08544 (United States); Princeton Plasma Physics Laboratory, Princeton, New Jersey 08543 (United States)
2015-10-15
Waves propagating through a bounded plasma can rearrange the densities of states in the six-dimensional velocity-configuration phase space. Depending on the rearrangement, the wave energy can either increase or decrease, with the difference taken up by the total plasma energy. In the case where the rearrangement is diffusive, only certain plasma states can be reached. It turns out that the set of reachable states through such diffusive rearrangements has been described in very different contexts. Building upon those descriptions, and making use of the fact that the plasma energy is a linear functional of the state densities, the maximal extractable energy under diffusive rearrangement can then be addressed through linear programming.
Maximal energy extraction under discrete diffusive exchange
Hay, Michael J; Fisch, Nathaniel J
2015-01-01
Waves propagating through a bounded plasma can rearrange the densities of states in the six-dimensional velocity-configuration phase space. Depending on the rearrangement, the wave energy can either increase or decrease, with the difference taken up by the total plasma energy. In the case where the rearrangement is diffusive, only certain plasma states can be reached. It turns out that the set of reachable states through such diffusive rearrangements has been described in very different contexts. Building upon those descriptions, and making use of the fact that the plasma energy is a linear functional of the state densities, the maximal extractable energy under diffusive rearrangement can then be addressed through linear programming.
Unsupervised mining of frequent tags for clinical eligibility text indexing
Miotto, Riccardo; Weng, Chunhua
2013-01-01
.... This paper proposes a novel methodology to derive a semantic index for clinical eligibility documents based on a controlled vocabulary of frequent tags, which are automatically mined from the text...
Frequently Asked Questions about Measles in the U.S.
... Pan American Health Organization Frequently Asked Questions about Measles in the U.S. Language: English (US) EspaÃ±ol ( ... I’ve been exposed to someone who has measles. What should I do? A: Immediately call your ...
Stability of the frequent COPD exacerbator in the general population
Reilev, Mette; Lykkegaard, Jesper; Halling, Anders
2017-01-01
Exacerbation frequency is central in treatment strategies for chronic obstructive pulmonary disease. However, whether chronic obstructive pulmonary disease patients from the general population with frequent exacerbations continue to have frequent exacerbations over an extended period of time...... no additional years as frequent exacerbators, while the minority (6%) remained in this category each year. In conclusion, the rate of exacerbations shows considerable variation over time among chronic obstructive pulmonary disease patients in the general population. This might hold implications for chronic...... is currently unknown. In this study, we aimed to investigate the stability of the frequent exacerbator in a population-based setting. To this end, we conducted a nationwide register-based descriptive study with a 10-year follow-up period of chronic obstructive pulmonary disease patients with at least one...
Perceived Quality of Social Relations and Frequent Drunkenness
Kjærulff, Thora M; Rivera, Francisco; Jiménez-Iglesias, Antonia
2014-01-01
AIM: The aim of the study was to examine, for female and male students separately, whether perceived quality of relationships with peers and parents and relations in school predict self-reported frequent drunkenness among Spanish adolescents. METHODS: The Spanish data from the Health Behaviour...... in School-aged Children Study (HBSC) 2010 survey were used including 1177 female and 1126 male students aged between 15 and 16 years. RESULTS: For both genders, students reporting low school satisfaction had increased odds of frequent drunkenness. Among females, low and medium levels of classmate support...... odds of frequent drunkenness compared with those with high level of satisfaction with friendships. CONCLUSION: We found different associations between perceived quality of social relations and frequent drunkenness among male and female students. Results showed that social relations seemed to better...
Deranged Wnt signaling is frequent in hereditary nonpolyposis colorectal cancer
Isinger-Ekstrand, Anna; Therkildsen, Christina; Bernstein, Inge
2011-01-01
The Wnt signaling pathway is frequently deranged in colorectal cancer and is a key target for future preventive and therapeutic approaches. Colorectal cancers associated with the hereditary nonpolyposis colorectal cancer (HNPCC) syndrome are characterized by wide-spread microsatellite instability...
Frequently Asked Questions about Ventilator-Associated Pneumonia
... Submit Button Frequently Asked Questions about Ventilator-associated Pneumonia Recommend on Facebook Tweet Share Compartir What is a Ventilator-associated Pneumonia (VAP)? Ventilator-associated pneumonia (VAP) is a lung ...
THE FREQUENT SKIN DISEASES DIAGNOSED AT UNIVERSITY STUDENTS
Yesim KAYMAK
2005-12-01
Full Text Available The incidence of some skin diseases are increasing at adolescent and early adulthood period. The most frequent disease at this period is acne vulgaris whereas fungal diseases, dermatitis, dermatosis which are due to stress and other reasons, oral mucosal lesions and herpetic lesions of perioral region are also frequent. In this research we aim to determine the frequent dermatologic diseases of university students and 147 female, 74 male, a total of 221 students are included. We questioned the dermatologic complaints of students, then examined dermatologically in detail and registered ages, sexes, findings of the dermatological examination and dermatological diagnostic informations. As a result it is found out that the most frequent diseases are acne vulgaris (34.1%, allergic and pruritic dermatosis (16.6%, fungal diseases ( 13.0%, and eritamatous-squamous disease (8.3%. [TAF Prev Med Bull 2005; 4(6.000: 313-320
A NEW ASSOCIATION RULE MINING BASED ON FREQUENT ITEM SET
Ms. Sanober Shaikh
2011-09-01
Full Text Available In this paper a new mining algorithm is defined based on frequent item set. Apriori Algorithm scans the database every time when it finds the frequent item set so it is very time consuming and at each step it generates candidate item set. So for large databases it takes lots of space to store candidate item set. The defined algorithm scans the database at the start only once and then makes the undirected item set graph. From this graph by considering minimum support it finds the frequent item set and by considering the minimum confidence it generates the association rule. If database and minimum support is changed, the new algorithm finds the new frequent items by scanning undirected item set graph. That is why it’s executing efficiency is improved distinctly compared to traditional algorithm.
Frequently Asked Questions for Parents of Children with PH
... Frequently Asked Questions for Parents of Children with PH What causes pulmonary hypertension in children? I’ve ... of what I read is about adults with PH. What are the primary differences between PH in ...
Maximally reliable Markov chains under energy constraints.
Escola, Sean; Eisele, Michael; Miller, Kenneth; Paninski, Liam
2009-07-01
Signal-to-noise ratios in physical systems can be significantly degraded if the outputs of the systems are highly variable. Biological processes for which highly stereotyped signal generations are necessary features appear to have reduced their signal variabilities by employing multiple processing steps. To better understand why this multistep cascade structure might be desirable, we prove that the reliability of a signal generated by a multistate system with no memory (i.e., a Markov chain) is maximal if and only if the system topology is such that the process steps irreversibly through each state, with transition rates chosen such that an equal fraction of the total signal is generated in each state. Furthermore, our result indicates that by increasing the number of states, it is possible to arbitrarily increase the reliability of the system. In a physical system, however, an energy cost is associated with maintaining irreversible transitions, and this cost increases with the number of such transitions (i.e., the number of states). Thus, an infinite-length chain, which would be perfectly reliable, is infeasible. To model the effects of energy demands on the maximally reliable solution, we numerically optimize the topology under two distinct energy functions that penalize either irreversible transitions or incommunicability between states, respectively. In both cases, the solutions are essentially irreversible linear chains, but with upper bounds on the number of states set by the amount of available energy. We therefore conclude that a physical system for which signal reliability is important should employ a linear architecture, with the number of states (and thus the reliability) determined by the intrinsic energy constraints of the system.
Glioma Surgery: Technological Advances to Achieve a Maximal Safe Resection.
Altieri, Roberto; Zenga, Francesco; Fontanella, Marco Maria; Cofano, Fabio; Agnoletti, Alessandro; Spena, Giannantonio; Crobeddu, Emanuela; Fornaro, Riccardo; Ducati, Alessandro; Garbossa, Diego
2015-11-01
Glioblastoma multiforme (GBM) is the most frequent primary central nervous system (CNS) tumor. Despite the best treatment and advances in therapy, prognosis remains poor. One of the mainstays of therapy in GBM is surgical excision. Several studies have confirmed that the extent of resection (EOR) positively influences overall survival (OS) in patients with high-grade gliomas (HGGs). A literature search was performed using PubMed to assess the useful neurosurgical tools to achieve the best neurosurgical performance. In order to achieve the major extent of resection, preserving neurological function, many tools are now available, especially neuronavigation, intraoperative fluorescence, intraoperative ultrasound, and neuromonitoring. In addition to the maximal excision of tumor, the neurosurgeon can use photodynamic therapy (PTD) and local drug delivery (LDD) to improve the local control and bridge conventional radio and chemotherapy. EOR improves OS in patients with HGGs. There are technological possibilities for achieving a complete resection preserving neurological function, and it is not acceptable to perform only biopsy of these lesions.
Wyse, Adam E.; Babcock, Ben
2016-01-01
A common suggestion made in the psychometric literature for fixed-length classification tests is that one should design tests so that they have maximum information at the cut score. Designing tests in this way is believed to maximize the classification accuracy and consistency of the assessment. This article uses simulated examples to illustrate…
From entropy-maximization to equality-maximization: Gauss, Laplace, Pareto, and Subbotin
Eliazar, Iddo
2014-12-01
The entropy-maximization paradigm of statistical physics is well known to generate the omnipresent Gauss law. In this paper we establish an analogous socioeconomic model which maximizes social equality, rather than physical disorder, in the context of the distributions of income and wealth in human societies. We show that-on a logarithmic scale-the Laplace law is the socioeconomic equality-maximizing counterpart of the physical entropy-maximizing Gauss law, and that this law manifests an optimized balance between two opposing forces: (i) the rich and powerful, striving to amass ever more wealth, and thus to increase social inequality; and (ii) the masses, struggling to form more egalitarian societies, and thus to increase social equality. Our results lead from log-Gauss statistics to log-Laplace statistics, yield Paretian power-law tails of income and wealth distributions, and show how the emergence of a middle-class depends on the underlying levels of socioeconomic inequality and variability. Also, in the context of asset-prices with Laplace-distributed returns, our results imply that financial markets generate an optimized balance between risk and predictability.
THE EFFECTS MAXIMAL AND SUB MAXIMAL AEROBIC EXERCISE ON THE BRONCHOSPASM INDICES IN NON ATHLETIC
Amir GANJİ
2012-08-01
Full Text Available Background: Exercise-induced bronchospasm (EIB is a transient airway obstruction that occurs during and after the exercise. Exercise-induced bronchospasm is observed in healthy individuals as well as the asthmatic and allergic rhinitis patients. Research question: The study compared the effects of one session of submaximal aerobic exercise and a maximal one on the prevalence of exercise-induced bronchospasm in non-athletic students. Type of study: An experimental study, using human subjects, was designed. Methods: 20 non-athletic male students participated in two sessions of aerobic exercise. The prevalence of EIB was investigated among them. The criteria for assessing exercise-induced bronchospasm were ≥10% fall in FEV1, ≥15% fall in FEF25-75%, or ≥25% fall in PEFR. Results: The results revealed that the maximal exercise did not affect FEF25-75% and PEF, but it led to a meaningful reduction in FEV1. Contrarily, the submaximal exercise affected none of these indices. That is, in both protocols the same result was obtained for PEF and FEF25-75. Moreover, the prevalence of EIB was 15% in the submaximal exercise and 20% in the maximal one. Actually, this difference was significant. Conclusion: This study demonstrated that in contrast to the subjects who performed submaximal exercise, those who participated in the maximal protocol showed more changes in the pulmonary function indices and the prevalence of EIB was greater among them.
Predictors of frequent visits to a psychiatric emergency room
Aagaard, Jørgen; Aagaard, Andreas; Buus, Niels
2014-01-01
BACKGROUND: The role of the psychiatric emergency services has undergone extensive changes following a significant downsizing of the number of psychiatric hospital beds during the past decades. A relatively small number of "frequent visitors" accounts for a disproportionately large amount of visi...... deinstitutionalising of the Danish mental health services and a radical health care reform. A basic multiplicative model was designed for the early detection of individual frequent visitors....
Excess Frequent Insufficient Sleep in American Indians/Alaska Natives
Daniel P. Chapman
2013-01-01
Full Text Available Objective. Frequent insufficient sleep, defined as ≥14 days/past 30 days in which an adult did not get enough rest or sleep, is associated with adverse mental and physical health outcomes. Little is known about the prevalence of frequent insufficient sleep among American Indians/Alaska Natives (AI/AN. Methods. We assessed racial/ethnic differences in the prevalence of frequent insufficient sleep from the combined 2009-2010 Behavioral Risk Factor Surveillance Survey among 810,168 respondents who self-identified as non-Hispanic white (NHW, , non-Hispanic black (NHB, , Hispanic (, or AI/AN (. Results. We found significantly higher unadjusted prevalences (95% CI of frequent insufficient sleep among AI/AN (34.2% [32.1–36.4] compared to NHW (27.4% [27.1–27.6]. However, the age-adjusted excess prevalence of frequent insufficient sleep in AI/AN compared to NHW was decreased but remained significant with the addition of sex, education, and employment status; this latter relationship was further attenuated by the separate additions of obesity and lifestyle indicators, but was no longer significant with the addition of frequent mental distress to the model (PR = 1.05; 95% CI : 0.99–1.13. This is the first report of a high prevalence of frequent insufficient sleep among AI/AN. These results further suggest that investigation of sleep health interventions addressing frequent mental distress may benefit AI/AN populations.
Maximal elements of non necessarily acyclic binary relations
Josep Enric Peris Ferrando; Begoña Subiza Martínez
1992-01-01
The existence of maximal elements for binary preference relations is analyzed without imposing transitivity or convexity conditions. From each preference relation a new acyclic relation is defined in such a way that some maximal elements of this new relation characterize maximal elements of the original one. The result covers the case whereby the relation is acyclic.
Maintaining Discovered Frequent Itemsets: Cases for Changeable Database and Support
DU XiaoPing(杜孝平); TANG ShiWei(唐世渭); Akifumi Makinouchi(牧之内顕文)
2003-01-01
Mining frequent itemsets from large databases has played an essential role inmany data mining tasks. It is also important to maintain the discovered frequent itemsets forthese data mining tasks when the database is updated. All algorithms proposed so far for the maintenance of discovered frequent itemsets are only performed with a fixed minimum support,which is the same as that used to obtain the discovered frequent itemsets. That is, users cannot change the minimum support even if the new results are unsatisfactory to the users. In thispaper two new complementary algorithms, FMP (First Maintaining Process) and RMP (Repeated Maintaining Process), are proposed to maintain discovered frequent itemsets in the case that new transaction data are added to a transaction database. Both algorithms allow users to change theminimum support for the maintenance processes. FMP is used for the first maintaining process, andwhen the result derived from the FMP is unsatisfactory, RMP will be performed repeatedly untilsatisfactory results are obtained. The proposed algorithms re-use the previous results to cut downthe cost of maintenance. Extensive experiments have been conducted to assess the performance of the algorithms. The experimental results show that the proposed algorithms are very resultful compared with the previous mining and maintenance algorithms for maintenance of discovered frequent itemsets.
Perfetto, Ralph; Woodside, Arch G
2009-09-01
The present study informs understanding of customer segmentation strategies by extending Twedt's heavy-half propositions to include a segment of users that represent less than 2% of all households-consumers demonstrating extremely frequent behavior (EFB). Extremely frequent behavior (EFB) theory provides testable propositions relating to the observation that few (2%) consumers in many product and service categories constitute more than 25% of the frequency of product or service use. Using casino gambling as an example for testing EFB theory, an analysis of national survey data shows that extremely frequent casino gamblers do exist and that less than 2% of all casino gamblers are responsible for nearly 25% of all casino gambling usage. Approximately 14% of extremely frequent casino users have very low-household income, suggesting somewhat paradoxical consumption patterns (where do very low-income users find the money to gamble so frequently?). Understanding the differences light, heavy, and extreme users and non-users can help marketers and policymakers identify and exploit "blue ocean" opportunities (Kim and Mauborgne, Blue ocean strategy, Harvard Business School Press, Boston, 2005), for example, creating effective strategies to convert extreme users into non-users or non-users into new users.
Itoh, Yoshiaki; Tanaka, Kazuyo
2004-08-01
Word frequency in a document has often been utilized in text searching and summarization. Similarly, identifying frequent words or phrases in a speech data set for searching and summarization would also be meaningful. However, obtaining word frequency in a speech data set is difficult, because frequent words are often special terms in the speech and cannot be recognized by a general speech recognizer. This paper proposes another approach that is effective for automatic extraction of such frequent word sections in a speech data set. The proposed method is applicable to any domain of monologue speech, because no language models or specific terms are required in advance. The extracted sections can be regarded as speech labels of some kind or a digest of the speech presentation. The frequent word sections are determined by detecting similar sections, which are sections of audio data that represent the same word or phrase. The similar sections are detected by an efficient algorithm, called Shift Continuous Dynamic Programming (Shift CDP), which realizes fast matching between arbitrary sections in the reference speech pattern and those in the input speech, and enables frame-synchronous extraction of similar sections. In experiments, the algorithm is applied to extract the repeated sections in oral presentation speeches recorded in academic conferences in Japan. The results show that Shift CDP successfully detects similar sections and identifies the frequent word sections in individual presentation speeches, without prior domain knowledge, such as language models and terms.
Location Based Throughput Maximization Routing in Energy Constrained Mobile Ad-hoc Network
V. Sumathy
2006-01-01
Full Text Available In wireless Ad-hoc network, power consumption becomes an important issue due to limited battery power. One of the reasons for energy expenditure in this network is irregularly distributed node pattern, which impose large interference range in certain area. To maximize the lifetime of ad-hoc mobile network, the power consumption rate of each node must be evenly distributed and the over all transmission range of each node must be minimized. Our protocol, Location based throughput maximization routing in energy constrained Ad-hoc network finds routing paths, which maximize the lifetime of individual nodes and minimize the total transmission energy consumption. The life of the entire network is increased and the network throughput is also increased. The reliability of the path is also increased. Location based energy constrained routing finds the distance between the nodes. Based on the distance the transmission power required is calculated and dynamically reduces the total transmission energy.
Maximization Paradox: Result of Believing in an Objective Best.
Luan, Mo; Li, Hong
2017-05-01
The results from four studies provide reliable evidence of how beliefs in an objective best influence the decision process and subjective feelings. A belief in an objective best serves as the fundamental mechanism connecting the concept of maximizing and the maximization paradox (i.e., expending great effort but feeling bad when making decisions, Study 1), and randomly chosen decision makers operate similar to maximizers once they are manipulated to believe that the best is objective (Studies 2A, 2B, and 3). In addition, the effect of a belief in an objective best on the maximization paradox is moderated by the presence of a dominant option (Study 3). The findings of this research contribute to the maximization literature by demonstrating that believing in an objective best leads to the maximization paradox. The maximization paradox is indeed the result of believing in an objective best.
EXPLANATORY VARIANCE IN MAXIMAL OXYGEN UPTAKE
Jacalyn J. Robert McComb
2006-06-01
Full Text Available The purpose of this study was to develop a prediction equation that could be used to estimate maximal oxygen uptake (VO2max from a submaximal water running protocol. Thirty-two volunteers (n =19 males, n = 13 females, ages 18 - 24 years, underwent the following testing procedures: (a a 7-site skin fold assessment; (b a land VO2max running treadmill test; and (c a 6 min water running test. For the water running submaximal protocol, the participants were fitted with an Aqua Jogger Classic Uni-Sex Belt and a Polar Heart Rate Monitor; the participants' head, shoulders, hips and feet were vertically aligned, using a modified running/bicycle motion. A regression model was used to predict VO2max. The criterion variable, VO2max, was measured using open-circuit calorimetry utilizing the Bruce Treadmill Protocol. Predictor variables included in the model were percent body fat (% BF, height, weight, gender, and heart rate following a 6 min water running protocol. Percent body fat accounted for 76% (r = -0.87, SEE = 3.27 of the variance in VO2max. No other variables significantly contributed to the explained variance in VO2max. The equation for the estimation of VO2max is as follows: VO2max ml.kg-1·min-1 = 56.14 - 0.92 (% BF.
Reflection quasilattices and the maximal quasilattice
Boyle, Latham; Steinhardt, Paul J.
2016-08-01
We introduce the concept of a reflection quasilattice, the quasiperiodic generalization of a Bravais lattice with irreducible reflection symmetry. Among their applications, reflection quasilattices are the reciprocal (i.e., Bragg diffraction) lattices for quasicrystals and quasicrystal tilings, such as Penrose tilings, with irreducible reflection symmetry and discrete scale invariance. In a follow-up paper, we will show that reflection quasilattices can be used to generate tilings in real space with properties analogous to those in Penrose tilings, but with different symmetries and in various dimensions. Here we explain that reflection quasilattices only exist in dimensions two, three, and four, and we prove that there is a unique reflection quasilattice in dimension four: the "maximal reflection quasilattice" in terms of dimensionality and symmetry. Unlike crystallographic Bravais lattices, all reflection quasilattices are invariant under rescaling by certain discrete scale factors. We tabulate the complete set of scale factors for all reflection quasilattices in dimension d >2 , and for all those with quadratic irrational scale factors in d =2 .
Viral quasispecies assembly via maximal clique enumeration.
Töpfer, Armin; Marschall, Tobias; Bull, Rowena A; Luciani, Fabio; Schönhuth, Alexander; Beerenwinkel, Niko
2014-03-01
Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples. We develop a statistical model for paired-end reads accounting for mutations, insertions, and deletions. Using an iterative maximal clique enumeration approach, read pairs are assembled into haplotypes of increasing length, eventually enabling global haplotype assembly. The performance of our quasispecies assembly method is assessed on simulated data for varying population characteristics and sequencing technology parameters. Owing to its paired-end handling, HaploClique compares favorably to state-of-the-art haplotype inference methods. It can reconstruct error-free full-length haplotypes from low coverage samples and detect large insertions and deletions at low frequencies. We applied HaploClique to sequencing data derived from a clinical hepatitis C virus population of an infected patient and discovered a novel deletion of length 357±167 bp that was validated by two independent long-read sequencing experiments. HaploClique is available at https://github.com/armintoepfer/haploclique. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.
Network channel allocation and revenue maximization
Hamalainen, Timo; Joutsensalo, Jyrki
2002-09-01
This paper introduces a model that can be used to share link capacity among customers under different kind of traffic conditions. This model is suitable for different kind of networks like the 4G networks (fast wireless access to wired network) to support connections of given duration that requires a certain quality of service. We study different types of network traffic mixed in a same communication link. A single link is considered as a bottleneck and the goal is to find customer traffic profiles that maximizes the revenue of the link. Presented allocation system accepts every calls and there is not absolute blocking, but the offered data rate/user depends on the network load. Data arrival rate depends on the current link utilization, user's payment (selected CoS class) and delay. The arrival rate is (i) increasing with respect to the offered data rate, (ii) decreasing with respect to the price, (iii) decreasing with respect to the network load, and (iv) decreasing with respect to the delay. As an example, explicit formula obeying these conditions is given and analyzed.
Viral quasispecies assembly via maximal clique enumeration.
Armin Töpfer
2014-03-01
Full Text Available Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples. We develop a statistical model for paired-end reads accounting for mutations, insertions, and deletions. Using an iterative maximal clique enumeration approach, read pairs are assembled into haplotypes of increasing length, eventually enabling global haplotype assembly. The performance of our quasispecies assembly method is assessed on simulated data for varying population characteristics and sequencing technology parameters. Owing to its paired-end handling, HaploClique compares favorably to state-of-the-art haplotype inference methods. It can reconstruct error-free full-length haplotypes from low coverage samples and detect large insertions and deletions at low frequencies. We applied HaploClique to sequencing data derived from a clinical hepatitis C virus population of an infected patient and discovered a novel deletion of length 357±167 bp that was validated by two independent long-read sequencing experiments. HaploClique is available at https://github.com/armintoepfer/haploclique. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.
Maximal respiratory pressure in healthy Japanese children
Tagami, Miki; Okuno, Yukako; Matsuda, Tadamitsu; Kawamura, Kenta; Shoji, Ryosuke; Tomita, Kazuhide
2017-01-01
[Purpose] Normal values for respiratory muscle pressures during development in Japanese children have not been reported. The purpose of this study was to investigate respiratory muscle pressures in Japanese children aged 3–12 years. [Subjects and Methods] We measured respiratory muscle pressure values using a manovacuometer without a nose clip, with subjects in a sitting position. Data were collected for ages 3–6 (Group I: 68 subjects), 7–9 (Group II: 86 subjects), and 10–12 (Group III: 64 subjects) years. [Results] The values for respiratory muscle pressures in children were significantly higher with age in both sexes, and were higher in boys than in girls. Correlation coefficients were significant at values of 0.279 to 0.471 for each gender relationship between maximal respiratory pressure and age, height, and weight, respectively. [Conclusion] In this study, we showed pediatric respiratory muscle pressure reference value for each age. In the present study, values for respiratory muscle pressures were lower than Brazilian studies. This suggests that differences in respiratory muscle pressures vary with ethnicity. PMID:28356644
Maximizing exosome colloidal stability following electroporation.
Hood, Joshua L; Scott, Michael J; Wickline, Samuel A
2014-03-01
Development of exosome-based semisynthetic nanovesicles for diagnostic and therapeutic purposes requires novel approaches to load exosomes with cargo. Electroporation has previously been used to load exosomes with RNA. However, investigations into exosome colloidal stability following electroporation have not been considered. Herein, we report the development of a unique trehalose pulse media (TPM) that minimizes exosome aggregation following electroporation. Dynamic light scattering (DLS) and RNA absorbance were employed to determine the extent of exosome aggregation and electroextraction post electroporation in TPM compared to common PBS pulse media or sucrose pulse media (SPM). Use of TPM to disaggregate melanoma exosomes post electroporation was dependent on both exosome concentration and electric field strength. TPM maximized exosome dispersal post electroporation for both homogenous B16 melanoma and heterogeneous human serum-derived populations of exosomes. Moreover, TPM enabled heavy cargo loading of melanoma exosomes with 5nm superparamagnetic iron oxide nanoparticles (SPION5) while maintaining original exosome size and minimizing exosome aggregation as evidenced by transmission electron microscopy. Loading exosomes with SPION5 increased exosome density on sucrose gradients. This provides a simple, label-free means of enriching exogenously modified exosomes and introduces the potential for MRI-driven theranostic exosome investigations in vivo.
Rotavirus is frequent among adults hospitalised for acute gastroenteritis
Lausch, Karen Rokkedal; Westh, Lena; Kristensen, Lena Hagelskjær;
2017-01-01
INTRODUCTION: Rotavirus infection is the most common aetiology of acute gastroenteritis (AGE) among young children. In adults, diagnostics focus mainly on bacterial causes, though recent studies suggest that rotavirus is a frequent agent. The aim of this study was to examine the proportion...... culture for bacterial pathogens. RESULTS: A total of 265 adult patients were included. 9.4% tested positive for rotavirus. Enteropathogenic bacteria were found in 24.5% of the cases. In the majority of cases (62.3%), no pathogen was found. Overall, rotavirus was the second-most frequent pathogen, exceeded...... only by Campylobacter spp. Immunosuppression and a C-reactive protein (CRP) below 50 mg/l (0-8 mg/l) were associated with rotavirus. The seasonality of rotavirus differed markedly from that of bacterial gastroenteritis. CONCLUSION: Rotavirus is the second-most frequently identified pathogen in adults...
FraudMiner: A Novel Credit Card Fraud Detection Model Based on Frequent Itemset Mining
K. R. Seeja
2014-01-01
Full Text Available This paper proposes an intelligent credit card fraud detection model for detecting fraud from highly imbalanced and anonymous credit card transaction datasets. The class imbalance problem is handled by finding legal as well as fraud transaction patterns for each customer by using frequent itemset mining. A matching algorithm is also proposed to find to which pattern (legal or fraud the incoming transaction of a particular customer is closer and a decision is made accordingly. In order to handle the anonymous nature of the data, no preference is given to any of the attributes and each attribute is considered equally for finding the patterns. The performance evaluation of the proposed model is done on UCSD Data Mining Contest 2009 Dataset (anonymous and imbalanced and it is found that the proposed model has very high fraud detection rate, balanced classification rate, Matthews correlation coefficient, and very less false alarm rate than other state-of-the-art classifiers.
FraudMiner: A Novel Credit Card Fraud Detection Model Based on Frequent Itemset Mining
Seeja, K. R.; Zareapoor, Masoumeh
2014-01-01
This paper proposes an intelligent credit card fraud detection model for detecting fraud from highly imbalanced and anonymous credit card transaction datasets. The class imbalance problem is handled by finding legal as well as fraud transaction patterns for each customer by using frequent itemset mining. A matching algorithm is also proposed to find to which pattern (legal or fraud) the incoming transaction of a particular customer is closer and a decision is made accordingly. In order to handle the anonymous nature of the data, no preference is given to any of the attributes and each attribute is considered equally for finding the patterns. The performance evaluation of the proposed model is done on UCSD Data Mining Contest 2009 Dataset (anonymous and imbalanced) and it is found that the proposed model has very high fraud detection rate, balanced classification rate, Matthews correlation coefficient, and very less false alarm rate than other state-of-the-art classifiers. PMID:25302317
The Rank-Size Scaling Law and Entropy-Maximizing Principle
Chen, Yanguang
2011-01-01
The rank-size regularity known as Zipf's law is one of scaling laws and frequently observed within the natural living world and in social institutions. Many scientists tried to derive the rank-size scaling relation by entropy-maximizing methods, but the problem failed to be resolved thoroughly. By introducing a pivotal constraint condition, I present here a set of new derivations based on the self-similar hierarchy of cities. First, I derive a pair of exponent laws by postulating local entropy maximizing. From the two exponential laws follows a general hierarchical scaling law, which implies general Zipf's law. Second, I derive a special hierarchical scaling law with exponent equal to 1 by postulating global entropy maximizing, and this implies the strong form of Zipf's law. The rank-size scaling law proved to be one of the special cases of the hierarchical law, and the derivation suggests a certain scaling range with the first or last data point as an outlier. The entropy maximization of social systems diffe...
Do additional inputs change maximal voluntary motor unit firing rates after spinal cord injury?
Zijdewind, Inge; Gant, Katie; Bakels, Rob; Thomas, Christine K
2012-01-01
Motor unit firing frequencies are low during maximal voluntary contractions (MVCs) of human thenar muscles impaired by cervical spinal cord injury (SCI). This study aimed to examine whether thenar motor unit firing frequencies increase when driven by both maximal voluntary drive and other concurrent inputs compared with an MVC alone. Motor unit firing rates, force, and surface electromyographic activity (EMG) were compared across 2 contractions: (a) MVC alone and (b) MVC combined with another input (combination contraction). Other inputs (conditions) included vibration, heat, or cold applied to the anterior surface of the forearm, electrical stimulation delivered to the anterior surface of the middle finger, a muscle spasm, or a voluntary contraction of the contralateral thenar muscles against resistance. The maximal firing frequency (n = 68 units), force, and electromyographic activity (n = 92 contraction pairs) were all significantly higher during the combined contractions compared with MVCs alone. There was a 3-way interaction between contraction, condition, and subject for maximal motor unit firing rates, force, and EMG. Thus, combined contraction responses were different for conditions across subjects. Some conditions (eg, a muscle spasm) resulted in more effective and more frequent responses (increases in unit firing frequency, force, EMG in >50% contractions) than others. Recruitment of new units also occurred in combined contractions. Motoneurons are still responsive to additional afferent inputs from various sources when rate modulation from voluntary drive is limited by SCI. Individuals with SCI may be able to combine inputs to control functional tasks they cannot perform with voluntary drive alone.
Social environment and frequent attendance in Danish general practice
Vedsted, Peter; Olesen, Frede
2005-01-01
inequalities in health or whether social factors in themselves determine the use of general practice. AIM: To examine if social factors are associated with frequent attendance in general practice after adjusting for physical and psychological health variables. DESIGN OF STUDY: Population-based cross...... during the period November 1997-October 1998. A questionnaire about physical, psychological and social factors was sent to the patients. The associations between social factors and frequent attendance were adjusted for physical and psychological health and tendency towards somatisation. RESULTS: A total...
Examination of Operation Quality for High-frequent Railway Operation
Landex, Alex; Kaas, Anders H.
2009-01-01
The examination of operation quality for high-frequent operation requires other approaches than the typical evaluation of punctuality (trains on time) and reliability (operated trains). This is because passengers in high-frequent railway systems do not necessarily notice train delays as they just...... measurement. However, if an even more accurate measurement is wanted, the article recommends using the passenger delay approach. For the passenger delay approach, the article recommends using a 3rd generation passenger delay model since it is the most accurate type of model and it can be combined with railway...
Mining Frequent Itemsets from Online Data Streams: Comparative Study
HebaTallah Mohamed Nabil
2013-08-01
Full Text Available Online mining of data streams poses many new challenges more than mining static databases. In addition to the one-scan nature, the unbounded memory requirement, the high data arrival rate of data streams and the combinatorial explosion of itemsets exacerbate the mining task. The high complexity of the frequent itemsets mining problem hinders the application of the stream mining techniques. In this review, we present a comparative study among almost all, as we are acquainted, the algorithms for mining frequent itemsets from online data streams. All those techniques immolate with the accuracy of the results due to the relatively limited storage, leading, at all times, to approximated results.
Frequent rhabdomyolysis in anti-NMDA receptor encephalitis.
Lim, Jung-Ah; Lee, Soon-Tae; Kim, Tae-Joon; Moon, Jangsup; Sunwoo, Jun-Sang; Byun, Jung-Ick; Jung, Keun-Hwa; Jung, Ki-Young; Chu, Kon; Lee, Sang Kun
2016-09-15
The aim of this study was to analyze the clinical presentation and provocation factors of rhabdomyolysis in anti-NMDAR encephalitis. Among the 16 patients with anti-NMDAR encephalitis in our institutional cohort, nine patients had elevated CK enzyme levels and clinical evidence of rhabdomyolysis. Rhabdomyolysis was more frequent after immunotherapy. The use of dopamine receptor blocker (DRB) increased the risk of rhabdomyolysis. None of the patients without rhabdomyolysis received DRBs. Rhabdomyolysis is a frequent complication in anti-NMDAR encephalitis and more common after immunotherapy and the use of DRBs increases the risk. Therefore, DRBs should be administered carefully in patients with anti-NMDAR encephalitis.
Analysis of time-varying psoriasis lesion image patterns
Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær; Nielsen, Allan Aasbjerg
2004-01-01
The multivariate alteration detection transform is applied to pairs of within and between time varying registered psoriasis image patterns. Color band contribution to the variates explaining maximal change is analyzed.......The multivariate alteration detection transform is applied to pairs of within and between time varying registered psoriasis image patterns. Color band contribution to the variates explaining maximal change is analyzed....
Fraternity Membership & Frequent Drinking. NBER Working Paper No. 16291
DeSimone, Jeffrey S.
2010-01-01
Reinforcing earlier findings from other data, college senior fraternity/sorority members are more likely to consume alcohol frequently. Large reductions in estimates upon controlling for time spent partying, and to a lesser extent cigarette use and intramural sports involvement, suggest considerable unobserved heterogeneity in the relationship.…
Hybrid Recommendation System Memanfaatkan Penggalian Frequent Itemset dan Perbandingan Keyword
Suka Parwita, Wayan Gede; Winarko, Edi
2015-01-01
AbstrakRecommendation system sering dibangun dengan memanfaatkan data peringkat item dan data identitas pengguna. Data peringkat item merupakan data yang langka pada sistem yang baru dibangun. Sedangkan, pemberian data identitas pada recommendation system dapat menimbulkan kekhawatiran penyalahgunaan data identitas.Hybrid recommendation system memanfaatkan algoritma penggalian frequent itemset dan perbandingan keyword dapat memberikan daftar rekomendasi tanpa menggunakan data identitas penggu...
Competence-Based Education and Training– about Frequently Asked Questions
Mulder, M.
2012-01-01
This article follows the author's previous piece on practical guidelines for the development of comprehensive competence-based education and training (Mulder, 2012). It is about the questions that have been and are still frequently asked in presentations, workshops and classes about the introduction
Frequent Errors in Chinese EFL Learners' Topic-Based Writings
Zhan, Huifang
2015-01-01
This paper investigated a large number of errors found in the topic-based writings of Chinese EFL learners, especially provided an analysis on frequent errors, to find useful pedagogical implications for English grammar teaching and writing instruction in Chinese EFL setting. Students' topic-based writings were examined by the author. The findings…
Readiness Assessment Tests versus Frequent Quizzes: Student Preferences
Weinstein, Suzanne E.; Wu, Shao-Wei
2009-01-01
This study compares the effectiveness of two different assessment techniques; readiness assessment tests (RATs) and frequent quizzing. We report student perceptions of the impact of these techniques on the number of readings done prior to the class period, thorough reading of assignments, ability to follow class discussions, ability to participate…
Ban the Book Report: Promoting Frequent and Enthusiastic Reading
Foster, Graham
2012-01-01
Teachers recognize that frequent independent reading increases student knowledge on a wide range of topics, enhances vocabulary, and improves comprehension. "Ban the Book Report" inspires teachers to go beyond narrow and analytical book reports by exploring the potential of book talks, alternate book covers, identifying features of informational…
An Adaptive Algorithm for Finding Frequent Sets in Landmark Windows
Dang, Xuan-Hong; Ong, Kok-Leong; Lee, Vincent
2012-01-01
We consider a CPU constrained environment for finding approximation of frequent sets in data streams using the landmark window. Our algorithm can detect overload situations, i.e., breaching the CPU capacity, and sheds data in the stream to “keep up”. This is done within a controlled error thresho...
Most frequent location of the sentinel lymph nodes
Chiao Lo
2014-07-01
Conclusion: The area between these four landmarks is the most frequent location of the sentinel lymph node identified using the radioisotope method. We suggest that this area should be carefully evaluated preoperatively by ultrasound for appropriate surgical planning. A skin incision in this area is also recommended when sentinel lymph node dissection is guided by blue dye.
Frequent visitors at the psychiatric emergency room - A literature review.
Schmidt, Manuela
2017-03-29
Frequent visitors at the psychiatric emergency room (PER) constitute a small subgroup of patients, yet they are responsible for a disproportionate number of visits and thus claim considerable resources. Their needs are often left unmet and their repetitive visits reflect their dissatisfaction as well as that of PERs' staff. Motivated by these dilemmas, this study systematically reviews the literature about frequent visitors at PER and seeks to answer two questions: What characterizes frequent visitors at PER in the literature? and What characterizes PER in the literature? Based on 29 studies, this paper offers answers to the two questions based on a strength weakness opportunities and threats (SWOT) analysis. The results of the review and subsequent analysis of the literature revealed the multiplicity and complexity of frequent visitors' characteristics and how they appear to converge. Commonalities were more difficult to identify in PER characteristics. In some cases, this happened because the characteristics were poorly described or were context specific. As a result, it was not easy to compare the studies on PER. Based on SWOT and the findings of the analysis, the paper proposes new venues of research and suggests how the field of mental health might develop by taking into account its opportunities and threats.
Understanding women's hesitancy to undergo less frequent cervical cancer screening.
Gerend, Mary A; Shepherd, Melissa A; Kaltz, Emily A; Davis, Whitney J; Shepherd, Janet E
2017-02-01
Inappropriate cervical cancer screening (e.g., screening too often) can result in unnecessary medical procedures, treatment, and psychological distress. To balance the benefits and harms, cervical cancer screening guidelines were recently modified in favor of less frequent screening (i.e., every 3 to 5 years). This study investigated women's acceptance of less frequent cervical cancer screening and their primary concerns about extending the screening interval beyond one year. A national sample of 376 U.S. women ages 21-65 completed an online survey in 2014. Predictors of willingness to get a Pap test every 3 to 5 years were identified using logistic regression. We also examined perceived consequences of less frequent screening. Over two thirds were willing to undergo less frequent screening if it was recommended by their healthcare provider. Nevertheless, nearly 20% expressed discomfort with less frequent screening and 45% were either in opposition or unsure whether they would be comfortable replacing Pap testing with primary HPV testing. Women whose most recent Pap test was (vs. was not) within the past year and women who ever (vs. never) had an abnormal Pap test were less willing to extend the screening interval. Additionally, women who typically saw an obstetrician/gynecologist or nurse practitioner for their Pap test (vs. a family physician) were less accepting of the guidelines. Hesitancy about the longer screening interval appears to stem from concern about developing cancer between screenings. Findings contribute to the growing body of research on cancer overscreening and may inform interventions for improving adherence to cancer screening guidelines.
Catalan Number and Enumeration of Maximal Outerplanar Graphs
无
2000-01-01
Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means of the compressing graph and group theory method are given first. Then the relationships between Catalan numbers and the numbers of labeled and unlabeled maximal outerplanar graphs are presented. The computed results verified these formulas.
Maximality-Based Structural Operational Semantics for Petri Nets
Saīdouni, Djamel Eddine; Belala, Nabil; Bouneb, Messaouda
2009-03-01
The goal of this work is to exploit an implementable model, namely the maximality-based labeled transition system, which permits to express true-concurrency in a natural way without splitting actions on their start and end events. One can do this by giving a maximality-based structural operational semantics for the model of Place/Transition Petri nets in terms of maximality-based labeled transition systems structures.
Relative advantage, queue jumping, and welfare maximizing wealth distribution
2006-01-01
Suppose individuals get utilities from the total amount of wealth they hold and from their wealth relative to those immediately below them. This paper studies the distribution of wealth that maximizes an additive welfare function made up of these utilities. It interprets wealth distribution in a control theory framework to show that the welfare maximizing distribution may have unexpected properties. In some circumstances it requires that inequality be maximized at the poorest and richest ends...
Maximizers versus satisficers: Decision-making styles, competence, and outcomes
Parker, Andrew M.; Wändi Bruine de Bruin; Baruch Fischhoff
2007-01-01
Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al.\\ (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decision...
Maximally entangled states in pseudo-telepathy games
Mančinska, Laura
2015-01-01
A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangled states suffice. In particular, we show that maximally entangled states suffice for weak projection...
Bit-Table Based Biclustering and Frequent Closed Itemset Mining in High-Dimensional Binary Data
András Király
2014-01-01
Full Text Available During the last decade various algorithms have been developed and proposed for discovering overlapping clusters in high-dimensional data. The two most prominent application fields in this research, proposed independently, are frequent itemset mining (developed for market basket data and biclustering (applied to gene expression data analysis. The common limitation of both methodologies is the limited applicability for very large binary data sets. In this paper we propose a novel and efficient method to find both frequent closed itemsets and biclusters in high-dimensional binary data. The method is based on simple but very powerful matrix and vector multiplication approaches that ensure that all patterns can be discovered in a fast manner. The proposed algorithm has been implemented in the commonly used MATLAB environment and freely available for researchers.
Sums of magnetic eigenvalues are maximal on rotationally symmetric domains
Laugesen, Richard S; Roy, Arindam
2011-01-01
The sum of the first n energy levels of the planar Laplacian with constant magnetic field of given total flux is shown to be maximal among triangles for the equilateral triangle, under normalization of the ratio (moment of inertia)/(area)^3 on the domain. The result holds for both Dirichlet and Neumann boundary conditions, with an analogue for Robin (or de Gennes) boundary conditions too. The square similarly maximizes the eigenvalue sum among parallelograms, and the disk maximizes among ellipses. More generally, a domain with rotational symmetry will maximize the magnetic eigenvalue sum among all linear images of that domain. These results are new even for the ground state energy (n=1).
Sums of Laplace eigenvalues - rotationally symmetric maximizers in the plane
Laugesen, R S
2010-01-01
The sum of the first $n \\geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio $\\text{(area)}^3/\\text{(moment of inertia)}$ for the domain is fixed. This result holds for both Dirichlet and Neumann eigenvalues, and similar conclusions are derived for Robin boundary conditions and Schr\\"odinger eigenvalues of potentials that grow at infinity. A key ingredient in the method is the tight frame property of the roots of unity. For general convex plane domains, the disk is conjectured to maximize sums of Neumann eigenvalues.
Acceleration of Expectation-Maximization algorithm for length-biased right-censored data.
Chan, Kwun Chuen Gary
2017-01-01
Vardi's Expectation-Maximization (EM) algorithm is frequently used for computing the nonparametric maximum likelihood estimator of length-biased right-censored data, which does not admit a closed-form representation. The EM algorithm may converge slowly, particularly for heavily censored data. We studied two algorithms for accelerating the convergence of the EM algorithm, based on iterative convex minorant and Aitken's delta squared process. Numerical simulations demonstrate that the acceleration algorithms converge more rapidly than the EM algorithm in terms of number of iterations and actual timing. The acceleration method based on a modification of Aitken's delta squared performed the best under a variety of settings.
Sumiaki Maeo
Full Text Available Antagonistic muscle pairs cannot be fully activated simultaneously, even with maximal effort, under conditions of voluntary co-contraction, and their muscular activity levels are always below those during agonist contraction with maximal voluntary effort (MVE. Whether the muscular activity level during the task has trainability remains unclear. The present study examined this issue by comparing the muscular activity level during maximal voluntary co-contraction for highly experienced bodybuilders, who frequently perform voluntary co-contraction in their training programs, with that for untrained individuals (nonathletes. The electromyograms (EMGs of biceps brachii and triceps brachii muscles during maximal voluntary co-contraction of elbow flexors and extensors were recorded in 11 male bodybuilders and 10 nonathletes, and normalized to the values obtained during the MVE of agonist contraction for each of the corresponding muscles (% EMGMVE. The involuntary coactivation level in antagonist muscle during the MVE of agonist contraction was also calculated. In both muscles, % EMGMVE values during the co-contraction task for bodybuilders were significantly higher (P<0.01 than those for nonathletes (biceps brachii: 66±14% in bodybuilders vs. 46±13% in nonathletes, triceps brachii: 74±16% vs. 57±9%. There was a significant positive correlation between a length of bodybuilding experience and muscular activity level during the co-contraction task (r = 0.653, P = 0.03. Involuntary antagonist coactivation level during MVE of agonist contraction was not different between the two groups. The current result indicates that long-term participation in voluntary co-contraction training progressively enhances muscular activity during maximal voluntary co-contraction.
Determinants of frequent attendance in Danish general practice
Jørgensen, Jeanette Therming; Andersen, John Sahl; Tjønneland, Anne
2016-01-01
. below recommended level), and hormone therapy in women (1.52; 1.42-1.63) were all significant determinants of frequent attendance. CONCLUSIONS: In addition to pre-existing medical conditions, gender, socio-demographic and gender-specific factors, lifestyle (obesity, smoking, exercise and alcohol use.......57-0.69, >4 years higher education vs. no vocational training) and employment (0.61; 0.57-0.65) were inversely associated with frequent attendance. Finally, obesity (1.54; 1.14-2.08), smoking (1.21; 1.12-1.30, current vs. never), physical activity (0.84; 0.80-89), alcohol consumption (0.83; 0.78-0.87 above vs...
Evidence for frequent incest in a cooperatively breeding mammal.
Nichols, H J; Cant, M A; Hoffman, J I; Sanderson, J L
2014-12-01
As breeding between relatives often results in inbreeding depression, inbreeding avoidance is widespread in the animal kingdom. However, inbreeding avoidance may entail fitness costs. For example, dispersal away from relatives may reduce survival. How these conflicting selection pressures are resolved is challenging to investigate, but theoretical models predict that inbreeding should occur frequently in some systems. Despite this, few studies have found evidence of regular incest in mammals, even in social species where relatives are spatio-temporally clustered and opportunities for inbreeding frequently arise. We used genetic parentage assignments together with relatedness data to quantify inbreeding rates in a wild population of banded mongooses, a cooperatively breeding carnivore. We show that females regularly conceive to close relatives, including fathers and brothers. We suggest that the costs of inbreeding avoidance may sometimes outweigh the benefits, even in cooperatively breeding species where strong within-group incest avoidance is considered to be the norm.
Finding Recently Frequent Items over Online Data Streams
YIN Zhi-wu; HUANG Shang-teng
2006-01-01
In this paper, a new algorithm HCOUNT + is proposed to find frequent items over data stream based on the HCOUNT algorithm. The new algorithm adopts aided measures to improve the precision of HCOUNT greatly. In addition,HCOUNT + is introduced to time critical applications and a novel sliding windows-based algorithm SL-HCOUNT + is proposed to mine the most frequent items occurring recently.This algorithm uses limited memory (nB · (1 +α) · e/ε·In(-M/lnρ)(α＜1) counters), requires constant processing time per packet (only (1+α) · ln(-M/lnρ(α＜1)) counters are updated), makes only one pass over the streaming data,and is shown to work well in the experimental results.
Lymphedema following cancer therapy in Slovenia: a frequently overlooked condition?
Rucigaj, Tanja Planinsek; Leskovec, Nada Kecelj; Zunter*, Vesna Tlaker
2010-01-01
Introduction Secondary lymphedema following cancer therapy is a frequent, often painful, quality of life disturbing condition, reducing the patients’ mobility and predisposing them to complications, e.g. infections and malignancies. The critical aspect of lymphedema therapy is to start as soon as possible to prevent the irreversible tissue damage. Patients and methods We performed a retrospective study of patients with lymphedema, treated at the Department of Dermatovenereology, University Me...
Predictors of frequent oral analgesic use in rheumatoid arthritis
Gupta, Esha Das; Tee, Huey Shin; Sakthiswary, Rajalingham
2014-01-01
Objective: The main objective of this study was to determine the predictors of frequent oral analgesic use among Rheumatoid Arthritis (RA) patients who were prescribed with the above medication on an ‘as-needed’ basis. Methods: Patients with RA were recruited consecutively from the Rheumatology outpatient clinics in this cross-sectional study. The sociodemographic data, frequency of oral analgesic intake, Patient Global Assessment (PGA) scores and HAQ (Health Assessment Questionnaire) scores ...
Lymphedema following cancer therapy in Slovenia: a frequently overlooked condition?:
Rucigaj, Tanja Planinsek; Leskovec, Nada Kecelj; Zunter*, Vesna Tlaker
2010-01-01
Introduction Secondary lymphedema following cancer therapy is a frequent, often painful, quality of life disturbing condition, reducing the patients’ mobility and predisposing them to complications, e.g. infections and malignancies. The critical aspect of lymphedema therapy is to start as soon as possible to prevent the irreversible tissue damage. Patients and methods We performed a retrospective study of patients with lymphedema, treated at the Department of Dermatovenereology, University Me...
Frequent Replenishment Sustains the Beneficial Microbiome of Drosophila melanogaster
2013-01-01
ABSTRACT We report that establishment and maintenance of the Drosophila melanogaster microbiome depend on ingestion of bacteria. Frequent transfer of flies to sterile food prevented establishment of the microbiome in newly emerged flies and reduced the predominant members, Acetobacter and Lactobacillus spp., by 10- to 1,000-fold in older flies. Flies with a normal microbiome were less susceptible than germfree flies to infection by Serratia marcescens and Pseudomonas aeruginosa. Augmentation ...
Patterning of somatosympathetic reflexes
Kerman, I. A.; Yates, B. J.
1999-01-01
In a previous study, we reported that vestibular nerve stimulation in the cat elicits a specific pattern of sympathetic nerve activation, such that responses are particularly large in the renal nerve. This patterning of vestibulosympathetic reflexes was the same in anesthetized and decerebrate preparations. In the present study, we report that inputs from skin and muscle also elicit a specific patterning of sympathetic outflow, which is distinct from that produced by vestibular stimulation. Renal, superior mesenteric, and lumbar colonic nerves respond most strongly to forelimb and hindlimb nerve stimulation (approximately 60% of maximal nerve activation), whereas external carotid and hypogastric nerves were least sensitive to these inputs (approximately 20% of maximal nerve activation). In contrast to vestibulosympathetic reflexes, the expression of responses to skin and muscle afferent activation differs in decerebrate and anesthetized animals. In baroreceptor-intact animals, somatosympathetic responses were strongly attenuated (to 150 mmHg. These findings demonstrate that different types of somatic inputs elicit specific patterns of sympathetic nerve activation, presumably generated through distinct neural circuits.
IMPLEMENTASI ALGORITMA APRIORI UNTUK MENEMUKAN FREQUENT ITEMSET DALAM KERANJANG BELANJA
Adie Wahyudi Oktavia Gama
2016-11-01
Full Text Available Algoritma apriori menggunakan pendekatan iteratif dimana k-itemset digunakan untuk mengeksplorasi (k+1-itemset. Calon (k+1-itemset yang mengandung frekuensi subset yang jarang muncul atau dibawah threshold akan dipangkas dan tidak dipakai menentukan aturan asosiasi. Aturan asosiasi berbentuk if antecedent then consequent. Implementasi algoritma apriori didahului dengan persiapan database transaksi serta penentuan batas minimum support dan confidence. Algoritma apriori akan menemukan kombinasi dengan cara iterasi yaitu scaning database berulang-ulang, memasangkan satu item dengan item lainnya dan mencatat jumlah kemunculan kombinasi dalam keseluruhan transaksi. Frequent itemset ditentukan dengan memilih itemset yang nilai kemuculannya diatas atau sama dengan nilai minimum support dan kemudian menjadi calon aturan asosiasi. Persentase nilai support dan confidence dari masing-masing calon aturan asosiasi kemudian dihitung. Aturan asosiasi yang berlaku dipilih dari yang memenuhi syarat minimum support dan confidence. Penelitian ini membuktikan bahwa algoritma apriori cocok diimplementasikan untuk mencari frequent itemset pada keranjang belanja. Aturan asosiasi yang dibentuk dari frequent itemset tersebut dapat dipakai sebagai pendukung keputusan dalam penjualan.
Incremental Frequent Subgraph Mining on Large Evolving Graphs
Abdelhamid, Ehab
2017-08-22
Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. We adapt the notion of “fringe” to the graph context, that is the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.
MIR MD. JAHANGIR KABIR
2014-07-01
Full Text Available In data mining research, generating frequent items from large databases is one of the important issues and the key factor for implementing association rule mining tasks. Mining infrequent items such as relationships among rare but expensive products is another demanding issue which have been shown in some recent studies. Therefore this study considers user assigned threshold values as a constraint which helps users mine those rules which are more interesting for them. In addition, in real world users may prefer to know relationships among frequent items along with infrequent ones. The particle swarm optimization algorithm is an important heuristic technique in recent years and this study uses this technique to mine association rules effectively. If this technique considers user defined threshold values, interesting association rules can be generated more efficiently. Therefore this study proposes a novel approach which includes using particle swarm optimization algorithm to mine association rules from databases. Our implementation of the search strategy includes bitmap representation of nodes in a lexicographic tree and from superset-subset relationship of the nodes it classifies frequent items along with infrequent itemsets. In addition, this approach avoids extra calculation overhead for generating frequent pattern trees and handling large memory which store the support values of candidate item sets. Our experimental results show that this approach efficiently mines association rules. It accesses a database to calculate a support value for fewer numbers of nodes to find frequent itemsets and from that it generates association rules, which dramatically reduces search time. The main aim of this proposed algorithm is to show how heuristic method works on real databases to find all the interesting association rules in an efficient way.
DoS detections based on association rules and frequent itemsets
George S Oreku; LI Jian-zhong; Fredrick J Mtenzi
2008-01-01
To detect the DoS in networks by applying association rules mining techniques, we propose that asso-ciation rules and frequent itemsets can be employed to find DoS pattern in packet streams which describe trafficand user behaviors. The method extracts information from the log analysis of submitted packets using the algo-rithm which depends on the definition of the intrusion. Large itemsets were extracted to represent the super facts to build the association analysis for the intrusion. Network data files were analysed for experiments. The analy-sis and experimental results are encouraging with better performance as packet frequency number increases.
D2-brane Chern-Simons theories: F-maximization = a-maximization
Fluder, Martin
2015-01-01
We study a system of N D2-branes probing a generic Calabi-Yau three-fold singularity in the presence of a non-zero quantized Romans mass n. We argue that the low-energy effective N = 2 Chern-Simons quiver gauge theory flows to a superconformal fixed point in the IR, and construct the dual AdS_4 solution in massive IIA supergravity. We compute the free energy F of the gauge theory on S^3 using localization. In the large N limit we find F = c(nN)^{1/3}a^{2/3}, where c is a universal constant and a is the a-function of the "parent" four-dimensional N = 1 theory on N D3-branes probing the same Calabi-Yau singularity. It follows that maximizing F over the space of admissible R-symmetries is equivalent to maximizing a for this class of theories. Moreover, we show that the gauge theory result precisely matches the holographic free energy of the supergravity solution, and provide a similar matching of the VEV of a BPS Wilson loop operator.
Ran Wang, David H. Fukuda, Jeffrey R. Stout, Edward H. Robinson, Amelia A. Miramonti, Maren S. Fragala, Jay R. Hoffman
2015-06-01
Full Text Available To evaluate the time course of EMG frequency changes during a three-minute maximal effort cycling test (3MT session and to examine which parameter between mean (MNF and median (MDF frequency is more suitable for evaluation of changes in neuromuscular function throughout a 3MT. Eighteen recreationally-active men volunteered to participate in this study. Maximum voluntary contraction (MVC was measured using a dynamometer to determine maximal EMG frequency of the vastus lateralis (VL of the kicking leg during isometric knee extension. A maximal oxygen consumption test (VO2peak on a cycle ergometer was performed to establish the appropriate load profile for the 3MT which was completed after a period of at least 48 hours. MNF, MDF and power output (PO values were measured at 10-second epochs throughout the duration of the 3MT. Repeated measures analysis of variance was used to compare the changes in EMG frequency, relative to maximal values from the MVC, and change in PO during the testing procedure. MNF, Root Mean Square (RMS, and PO significantly decreased during the 3MT, while MDF did not change significantly. Statistically, EMG frequency and PO decreased at first and remained constant in response to the 3MT, which may be reflective of differing patterns of muscle fiber type fatigue throughout the testing session. Due to decreased variability, changes in neuromuscular function during this protocol may be better evaluated using MNF than MDF.
Schulze, Christin; Newell, Ben R
2016-07-01
Cognitive load has previously been found to have a positive effect on strategy selection in repeated risky choice. Specifically, whereas inferior probability matching often prevails under single-task conditions, optimal probability maximizing sometimes dominates when a concurrent task competes for cognitive resources. We examined the extent to which this seemingly beneficial effect of increased task demands hinges on the effort required to implement each of the choice strategies. Probability maximizing typically involves a simple repeated response to a single option, whereas probability matching requires choice proportions to be tracked carefully throughout a sequential choice task. Here, we flipped this pattern by introducing a manipulation that made the implementation of maximizing more taxing and, at the same time, allowed decision makers to probability match via a simple repeated response to a single option. The results from two experiments showed that increasing the implementation effort of probability maximizing resulted in decreased adoption rates of this strategy. This was the case both when decision makers simultaneously learned about the outcome probabilities and responded to a dual task (Exp. 1) and when these two aspects were procedurally separated in two distinct stages (Exp. 2). We conclude that the effort involved in implementing a choice strategy is a key factor in shaping repeated choice under uncertainty. Moreover, highlighting the importance of implementation effort casts new light on the sometimes surprising and inconsistent effects of cognitive load that have previously been reported in the literature.
Detrimental Relations of Maximization with Academic and Career Attitudes
Dahling, Jason J.; Thompson, Mindi N.
2013-01-01
Maximization refers to a decision-making style that involves seeking the single best option when making a choice, which is generally dysfunctional because people are limited in their ability to rationally evaluate all options and identify the single best outcome. The vocational consequences of maximization are examined in two samples, college…
An Overview of Maximal Unitarity at Two Loops
Johansson, Henrik; Larsen, Kasper J.
2012-01-01
We discuss the extension of the maximal-unitarity method to two loops, focusing on the example of the planar double box. Maximal cuts are reinterpreted as contour integrals, with the choice of contour fixed by the requirement that integrals of total derivatives vanish on it. The resulting formulae, like their one-loop counterparts, can be applied either analytically or numerically.
The Negative Consequences of Maximizing in Friendship Selection.
Newman, David B; Schug, Joanna; Yuki, Masaki; Yamada, Junko; Nezlek, John B
2017-02-27
Previous studies have shown that the maximizing orientation, reflecting a motivation to select the best option among a given set of choices, is associated with various negative psychological outcomes. In the present studies, we examined whether these relationships extend to friendship selection and how the number of options for friends moderated these effects. Across 5 studies, maximizing in selecting friends was negatively related to life satisfaction, positive affect, and self-esteem, and was positively related to negative affect and regret. In Study 1, a maximizing in selecting friends scale was created, and regret mediated the relationships between maximizing and well-being. In a naturalistic setting in Studies 2a and 2b, the tendency to maximize among those who participated in the fraternity and sorority recruitment process was negatively related to satisfaction with their selection, and positively related to regret and negative affect. In Study 3, daily levels of maximizing were negatively related to daily well-being, and these relationships were mediated by daily regret. In Study 4, we extended the findings to samples from the U.S. and Japan. When participants who tended to maximize were faced with many choices, operationalized as the daily number of friends met (Study 3) and relational mobility (Study 4), the opportunities to regret a decision increased and further diminished well-being. These findings imply that, paradoxically, attempts to maximize when selecting potential friends is detrimental to one's well-being. (PsycINFO Database Record (c) 2017 APA, all rights reserved).
Haemodynamics during maximal exercise after coronary bypass surgery
P.W.J.C. Serruys (Patrick); M.F. Rousseau (Francois); J. Cosyns; R. Ponlot; L.A. Brasseur; J-M.R. Detry (Jean-Marie)
1978-01-01
textabstractFifty patients underwent an objective measurement of physical working capacity by means of a multistage test of maximally tolerated exertion before and after coronary bypass surgery; 29 patients also had haemodynamic measurements during maximal exercise before and after coronary bypass s
Utility maximization under solvency constraints and unhedgeable risks
T. Kleinow; A. Pelsser
2008-01-01
We consider the utility maximization problem for an investor who faces a solvency or risk constraint in addition to a budget constraint. The investor wishes to maximize her expected utility from terminal wealth subject to a bound on her expected solvency at maturity. We measure solvency using a solv
Detrimental Relations of Maximization with Academic and Career Attitudes
Dahling, Jason J.; Thompson, Mindi N.
2013-01-01
Maximization refers to a decision-making style that involves seeking the single best option when making a choice, which is generally dysfunctional because people are limited in their ability to rationally evaluate all options and identify the single best outcome. The vocational consequences of maximization are examined in two samples, college…
On a discrete version of Tanaka's theorem for maximal functions
Bober, Jonathan; Hughes, Kevin; Pierce, Lillian B
2010-01-01
In this paper we prove a discrete version of Tanaka's Theorem \\cite{Ta} for the Hardy-Littlewood maximal operator in dimension $n=1$, both in the non-centered and centered cases. For the discrete non-centered maximal operator $\\wM $ we prove that, given a function $f: \\Z \\to \\R$ of bounded variation,
Haemodynamics during maximal exercise after coronary bypass surgery
P.W.J.C. Serruys (Patrick); M.F. Rousseau (Francois); J. Cosyns; R. Ponlot; L.A. Brasseur; J-M.R. Detry (Jean-Marie)
1978-01-01
textabstractFifty patients underwent an objective measurement of physical working capacity by means of a multistage test of maximally tolerated exertion before and after coronary bypass surgery; 29 patients also had haemodynamic measurements during maximal exercise before and after coronary bypass
A Class of Maximal Functions with Oscillating Kernels
Ahmad AL-SALMAN
2007-01-01
The author studies the Lp mapping properties of a class of maximal functions that are related to oscillatory singular integral operators. Lp estimates, as well as the corresponding weighted estimates of such maximal functions, are obtained. Moreover, several applications of our results are highlighted.
ESTIMATES FOR THE MAXIMAL MULTILINEAR SINGULAR INTEGRAL OPERATORS
Yulan Jiao
2010-01-01
In this paper,some mapping properties are considered for the maximal multilinear singular integral operator whose kernel satisfies certain minimum regularity condition.It is proved that certain uniform local estimate for doubly truncated operators implies the LP(Rn)(1
maximal operator.
Maximally Flat Waveforms Operation of Class-F Power Amplifiers
V. Krizhanovski
2001-04-01
Full Text Available The requirements to output network's impedance on higher harmoniccomponents and appropriate input driving for formation maximally flatwaveforms of drain current and voltage were presented. Using suchwaveforms allows obtaining maximal efficiency and output powercapability of class-F power amplifiers.
Entanglement of Superpositions of Orthogonal Maximally Entangled States
ZHANG Dao-Hua; ZHOU Duan-Lu; FAN Heng
2010-01-01
@@ We study the entanglement properties of the superposed state of orthogonal maximally entangled states.It is shown that the superposed state is maximally entangled and the superposed state is separable.The relation between the superposed state and the mutually unbiased state is discussed.
CHROMATIC NUMBER OF SQUARE OF MAXIMAL OUTERPLANAR GRAPHS
Luo Xiaofang
2007-01-01
Let χ(G2) denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords and χ(G2) = Δ + 2 if and only if G is Q, where Δ represents the maximum degree of G.
SAR image target segmentation based on entropy maximization and morphology
柏正尧; 刘洲峰; 何佩琨
2004-01-01
Entropy maximization thresholding is a simple, effective image segmentation method. The relation between the histogram entropy and the gray level of an image is analyzed. An approach, which speeds the computation of optimal threshold based on entropy maximization, is proposed. The suggested method has been applied to the synthetic aperture radar (SAR) image targets segmentation. Mathematical morphology works well in reducing the residual noise.
Effect of Age and Other Factors on Maximal Heart Rate.
Londeree, Ben R.; Moeschberger, Melvin L.
1982-01-01
To reduce confusion regarding reported effects of age on maximal exercise heart rate, a comprehensive review of the relevant English literature was conducted. Data on maximal heart rate after exercising with a bicycle, a treadmill, and after swimming were analyzed with regard to physical fitness and to age, sex, and racial differences. (Authors/PP)
On the maximal efficiency of the collisional Penrose process
Leiderschneider, Elly
2015-01-01
The center of mass (CM) energy in a collisional Penrose process - a collision taking place within the ergosphere of a Kerr black hole - can diverge under suitable extreme conditions (maximal Kerr, near horizon collision and suitable impact parameters). We present an analytic expression for the CM energy, refining expressions given in the literature. Even though the CM energy diverges, we show that the maximal energy attained by a particle that escapes the black hole's gravitational pull and reaches infinity is modest. We obtain an analytic expression for the energy of an escaping particle resulting from a collisional Penrose process, and apply it to derive the maximal energy and the maximal efficiency for several physical scenarios: pair annihilation, Compton scattering, and the elastic scattering of two massive particles. In all physically reasonable cases (in which the incident particles initially fall from infinity towards the black hole) the maximal energy (and the corresponding efficiency) are only one o...
Effects of frequent announced parasitology quizzes on the academic achievement.
Ghasem Zamini
2013-12-01
Full Text Available The effect of frequent examinations on the students' learning has had inconsistent results. This study aimed to assess the effectiveness of frequent announced quizzes on the learning of a representative sample of Iranian medical students.This experimental study was conducted among 37 fifth semester medical students who had taken the course in Protozoology and Helminthology, in which the same basic information were provided about different types of protozoa and worms. Initially, in the teaching of helminthology, ten routine sessions were handled with lectures and interactive questions and answers. Then at the beginning of the protozoology topic in the beginning of all of the next 9 sessions, the students were informed that they will have a quiz at the end of each session. At the end of the semester, the total scores of quizzes were compared with the mean final scores of protozoology and helminthology using paired t and repeated measure tests.The mean final scores of the protozoology lesson were not significantly different from that of the helminthology (10.45 ± 2.75 vs.11.25 ± 2.56 on the scale of 20, respectively, P=0.13. There was no significant difference in the mean score of the five quizzes compared with the mean final term score of protozoology. The overall mean scores in the helminthology lesson (11.25±2.56, protozoology lesson (10.45±2.75, and the quizzes (9.16 ± 3.55 were significantly different (P <0.0001.Frequent announced quizzes were not effective on increasing the medical students' motivation and learning.
The Moderating Effect of Frequent Singing on Voice Aging.
Lortie, Catherine L; Rivard, Julie; Thibeault, Mélanie; Tremblay, Pascale
2017-01-01
The effects of aging on voice production are well documented, including changes in loudness, pitch, and voice quality. However, one important and clinically relevant question that remains concerns the possibility that the aging of voice can be prevented or at least delayed through noninvasive methods. Indeed, discovering natural means to preserve the integrity of the human voice throughout aging could have a major impact on the quality of life of elderly adults. The objective of this study was therefore to examine the potentially positive effect of singing on voice production. To this aim, a group of 72 healthy nonsmoking adults (20-93 years old) was recruited and separated into three groups based on their singing habits. Several voice parameters were assessed (fundamental frequency [f0] mean, f0 standard deviation [SD], f0 minimum and f0 maximum, mean amplitude and amplitude SD, jitter, shimmer, and harmonic-to-noise ratio) during the sustained production of vowel /a/. Other parameters were assessed during standardized reading passage (speaking f0, speaking f0 SD). As was expected, age effects were found on most acoustic parameters with significant sex differences. Importantly, moderation analyses revealed that frequent singing moderates the effect of aging on most acoustic parameters. Specifically, in frequent singers, there was no decrease in the stability of pitch and amplitude with age, suggesting that the voice of frequent singers remains more stable in aging than the voice of non-singers, and more generally, providing empirical evidence for a positive effect of singing on voice in aging. Copyright © 2017 The Voice Foundation. Published by Elsevier Inc. All rights reserved.
Managing for Old Growth in Frequent-fire Landscapes
Carl E. Fiedler
2007-12-01
Full Text Available There is no one-size-fits-all approach to managing frequent-fire, old-growth forests. However, there are general guidelines to follow: 1 set objectives for both structure (tree density, diameter distribution, tree species composition, spatial arrangement, amount of coarse woody debris and function (nutrient cycling, desired tree species regeneration; 2 prioritize treatments according to ecological, economic, and social needs and risks; 3 identify the potential treatments (natural fire, prescribed fire, silvicultural cutting that best meet the objectives and scale of the project; and 4 implement the treatment(s. We discuss each of these guidelines in this article.
Obsessive-compulsive disorder presenting with compulsions to urinate frequently
Stephen Amarjeet Jiwanmall
2016-01-01
Full Text Available Obsessive compulsive disorder (OCD is a common psychiatric disorder which is easily recognized. However, sometimes patients of OCD present in such an atypical presentation of symptoms and a pathway to care involving multiple specialities. We report a case of a girl who had consulted several physicians and a urologist for frequent micturition, who was treated as a case of OCD after clarifying the compulsive nature of her symptom. There was significant improvement in her condition following 8 weeks of treatment with 200 mg of Sertraline and behaviour therapy.
FLCW: Frequent Itemset Based Text Clustering with Window Constraint
ZHOU Chong; LU Yansheng; ZOU Lei; HU Rong
2006-01-01
Most of the existing text clustering algorithms overlook the fact that one document is a word sequence with semantic information.There is some important semantic information existed in the positions of words in the sequence.In this paper, a novel method named Frequent Itemset-based Clustering with Window (FICW) was proposed, which makes use of the semantic information for text clustering with a window constraint.The experimental results obtained from tests on three (hypertext) text sets show that FICW outperforms the method compared in both clustering accuracy and efficiency.
Frequent Daytime Naps Predict Vocabulary Growth in Early Childhood
Horváth, Klára; Plunkett, Kim
2016-01-01
Background: The facilitating role of sleep for language learning is well-attested in adults and to a lesser extent in infants and toddlers. However, the longitudinal relationship between sleep patterns and early vocabulary development is not well understood. Methods: This study investigates how measures of sleep are related to the development of…
Frequent Daytime Naps Predict Vocabulary Growth in Early Childhood
Horváth, Klára; Plunkett, Kim
2016-01-01
Background: The facilitating role of sleep for language learning is well-attested in adults and to a lesser extent in infants and toddlers. However, the longitudinal relationship between sleep patterns and early vocabulary development is not well understood. Methods: This study investigates how measures of sleep are related to the development of…
Berthon, P; Fellmann, N
2002-09-01
The maximal aerobic velocity concept developed since eighties is considered as either the minimal velocity which elicits the maximal aerobic consumption or as the "velocity associated to maximal oxygen consumption". Different methods for measuring maximal aerobic velocity on treadmill in laboratory conditions have been elaborated, but all these specific protocols measure V(amax) either during a maximal oxygen consumption test or with an association of such a test. An inaccurate method presents a certain number of problems in the subsequent use of the results, for example in the elaboration of training programs, in the study of repeatability or in the determination of individual limit time. This study analyzes 14 different methods to understand their interests and limits in view to propose a general methodology for measuring V(amax). In brief, the test should be progressive and maximal without any rest period and of 17 to 20 min total duration. It should begin with a five min warm-up at 60-70% of the maximal aerobic power of the subjects. The beginning of the trial should be fixed so that four or five steps have to be run. The duration of the steps should be three min with a 1% slope and an increasing speed of 1.5 km x h(-1) until complete exhaustion. The last steps could be reduced at two min for a 1 km x h(-1) increment. The maximal aerobic velocity is adjusted in relation to duration of the last step.
IIS-Mine: A new efficient method for mining frequent itemsets
Supatra Sahaphong
2012-04-01
Full Text Available A new approach to mine all frequent itemsets from a transaction database isproposed. The main features of this paper are as follows: (1 the proposed algorithmperforms database scanning only once to construct a data structure called an invertedindex structure (IIS; (2 the change in the minimum support threshold is not affected bythis structure, and as a result, a rescan of the database is not required; and (3 theproposed mining algorithm, IIS-Mine, uses an efficient property of an extendable itemset,which reduces the recursiveness of mining steps without generating candidate itemsets,allowing frequent itemsets to be found quickly. We have provided definitions, examples,and a theorem, the completeness and correctness of which is shown by mathematicalproof. We present experiments in which the run time, memory consumption and scalabilityare tested in comparison with a frequent-pattern (FP growth algorithm when theminimum support threshold is varied. Both algorithms are evaluated by applying them tosynthetics and real-world datasets. The experimental results demonstrate that IIS-Mineprovides better performance than FP-growth in terms of run time and space consumptionand is effective when used on dense datasets.
Imaging patterns in melioidosis
Tan, A.P.A.; Pui, M.H.; Tan, L.K.A. [National Univ. of Singapore (Senegal). Dept. of Diagnostic Radiology
1995-08-01
Melioidosis is an infectious disease caused by Pseudomonas pseudomallei. It is seldom diagnosed promptly and, if untreated, can lead to an 80-100% mortality rate. Twenty-eight patients with melioidosis were identified over a 6 year period, and their imaging patterns were analysed. Respiratory infections were the commonest form of presentation, frequently shown as diffuse airspace consolidation, and accounted for the highest mortality. Visceral and musculoskeletal infections were associated with chronicity and a high relapse rate. Multifocal splenic abscesses were a common occurence. Septic arthritis of the knee was frequently seen. The majority of patients had diabetes mellitus and chronic ill health. 11 refs., 9 figs.
Physiological alterations of maximal voluntary quadriceps activation by changes of knee joint angle.
Becker, R; Awiszus, F
2001-05-01
The purpose of this study was to investigate the influence of different angles of the knee joint on voluntary activation of the quadriceps muscle, estimating the ability of a subject to activate a muscle maximally by means of voluntary contraction. Isometric torque measurement was performed on 6 healthy subjects in 5 degrees intervals between 30 degrees and 90 degrees of knee joint flexion. Superimposed twitches at maximal voluntary contraction (MVC) and at a level of 60% and 40% of the MVC were applied and the voluntary activation estimated. At between 30 degrees and 75 degrees of knee flexion, the maximal extension torque increased at an average rate of 2.67 +/- 0.6 Nm/degree, followed by a decline with further flexion. However, throughout the joint-angle range tested, voluntary activation increased on average by 0.37%/degree with a maximum at 90 degrees of flexion. Due to the influence of joint position it is not possible to generalize results obtained at the knee joint angle of 90 degrees of flexion, which is usually used for the quadriceps twitch-interpolation technique. Consequently, it is useful to investigate voluntary activation deficits in knee joint disorders at a range of knee joint angles that includes, in particular, the more extended joint angles used frequently during daily activity.
Analyzing the Number of Varieties in Frequently Found Flows
Shomura, Yusuke; Watanabe, Yoshinori; Yoshida, Kenichi
Abnormal traffic that causes various problems on the Internet, such as P2P flows, DDoS attacks, and Internet worms, is increasing; therefore, the importance of methods that identify and control abnormal traffic is also increasing. Though the application of frequent-itemset-mining techniques is a promising way to analyze Internet traffic, the huge amount of data on the Internet prevents such techniques from being effective. To overcome this problem, we have developed a simple frequent-itemset-mining method that uses only a small amount of memory but is effective even with the large volumes of data associated with broadband Internet traffic. Using our method also involves analyzing the number of distinct elements in the itemsets found, which helps identify abnormal traffic. We used a cache-based implementation of our method to analyze actual data on the Internet and demonstrated that such an implementation can be used to provide on-line analysis of data while using only a small amount of memory.
Functional Aerophagia in Children: A Frequent, Atypical Disorder
Giuliana Morabito
2014-04-01
Full Text Available Aerophagia is a functional gastrointestinal disorder characterized by repetitive air swallowing, abdominal distension, belching and flatulence. Pathologic aerophagia is a condition caused by the swallowing of excessive volumes of air with associated various gastrointestinal symptoms, such as burping, abdominal cramps, flatulence and a reduced appetite. It is a clinical entity that can simulate pediatric gastrointestinal motility disorders, such as gastroparesis, megacolon and intestinal pseudo-obstruction, and presents more frequently in children with mental retardation. Early recognition and diagnosis of functional aerophagia or pathologic aerophagia is required to avoid unnecessary, expensive diagnostic investigations or serious clinical complications. Functional aerophagia is frequent in the adult population, but rarely discussed in the pediatric literature. We present two pediatric clinical cases with a history of functional constipation in whom gaseous abdominal distension was the most important symptom. Mechanical intestinal obstruction, chronic intestinal pseudo-obstruction, malabsorption and congenital aganglionic megacolon were ruled out. Extensive gaseous abdominal distension was due to aerophagia, and treatment consisted of parents' reassurance and psychological counseling.
Frequent chromatin rearrangements in myelodysplastic syndromes--what stands behind?
Pagáčová, E; Falk, M; Falková, I; Lukášová, E; Michalová, K; Oltová, A; Raška, I; Kozubek, S
2014-01-01
Myelodysplastic syndromes (MDS) represent a clinically and genetically heterogeneous group of clonal haematopoietic diseases characterized by a short survival and high rate of transformation to acute myeloid leukaemia (AML). In spite of this variability, MDS is associated with typical recurrent non-random cytogenetic defects. Chromosomal abnormalities are detected in the malignant bone-marrow cells of approximately 40-80 % of patients with primary or secondary MDS. The most frequent chromosomal rearrangements involve chromosomes 5, 7 and 8. MDS often shows presence of unbalanced chromosomal changes, especially large deletions [del(5), del(7q), del(12p), del(18q), del(20q)] or losses of whole chromosomes (7 and Y). The most typical cytogenetic abnormality is a partial or complete deletion of 5q- that occurs in roughly 30 % of all MDS cases either as the sole abnormality or in combination with other aberrations as a part of frequently complex karyotypes. The mechanisms responsible for the formation of MDS-associated recurrent translocations and complex karyotypes are unknown. Since some of the mentioned aberrations are characteristic for several haematological malignancies, more general cellular conditions could be expected to play a role. In this article, we introduce the most common rearrangements linked to MDS and discuss the potential role of the non-random higher-order chromatin structure in their formation. A contribution of the chromothripsis - a catastrophic event discovered only recently - is considered to explain how complex karyotypes may occur (during a single event).
WEB DOCUMENT SEGMENTATION USING FREQUENT TERM SETS FOR SUMMARIZATION
Sarukesi Karunakaran
2012-01-01
Full Text Available Query sensitive summarization aims at extracting the query relevant contents from web documents. Web page segmentation focuses on reducing the run time overhead of the summarization systems by grouping the related contents of a web page into segments. At query time, query relevant segments of the web page are identified and important sentences from these segments are extracted to compose the summary. DOM tree structures of the web documents are utilized to perform the segmentation of the contents. Leaf nodes of DOM tress are merged to form segments according to the statistical and linguistic similarity measure. The proposed system has been evaluated by intrinsic approach making use of user satisfaction index. The performance of the system is compared with summarization without using preprocessed segments. Performance of this system is more promising than the other measures like cosine similarity, jaccard measure which make use of sparse term-frequent vectors, since the most frequent term sets are considered to measure the relevance. Relevant segments alone need to be processed at run time for summarization which reduces the time complexity of the summarization process.
Common pharmacophore identification using frequent clique detection algorithm.
Podolyan, Yevgeniy; Karypis, George
2009-01-01
The knowledge of a pharmacophore, or the 3D arrangement of features in the biologically active molecule that is responsible for its pharmacological activity, can help in the search and design of a new or better drug acting upon the same or related target. In this paper, we describe two new algorithms based on the frequent clique detection in the molecular graphs. The first algorithm mines all frequent cliques that are present in at least one of the conformers of each (or a portion of all) molecules. The second algorithm exploits the similarities among the different conformers of the same molecule and achieves an order of magnitude performance speedup compared to the first algorithm. Both algorithms are guaranteed to find all common pharmacophores in the data set, which is confirmed by the validation on the set of molecules for which pharmacophores have been determined experimentally. In addition, these algorithms are able to scale to data sets with arbitrarily large number of conformers per molecule and identify multiple ligand binding modes or multiple binding sites of the target.
Fever of unknown origin: Most frequent causes in adults patients.
Popovska-Jovicić, Biljana; Canović, Predrag; Gajović, Olgica; Raković, Ivana; Mijailović, Zeljko
2016-01-01
The differential diagnosis of fever of unknown origin (FUO) includes more than 200 different diseases and conditions. The aim of this study was to identify the most frequent causes of FUO among adult patients according to gender and age. The study included 74 patients examined from June 2010 to June 2013 at the Infectious Disease Clinic, Clinical Center Kragujevac in Serbia, according to the defined criteria for FUO. The patients were divided according to the diagnosis into four groups: infectious, malignant, rheumatic and "other diseases". A cause of febricity could not be estabilshed in a portion of subjects, and they comprised the group of undiagnosed cases. Infectious diseases were dominant in the study, followed by rheumatic diseases, which were most frequently found in women and the elderly. The diseases recognised as the most common causes of febricity were subacute thyroiditis, subacute endocarditis, Still's disease, rheumatic polymyalgia with or without temporal arteritis, and cytomegalovirus infection. In 44% of the patients, the final diagnosis was composed of only six clinical entities. The importance of establishing the diagnosis of rheumatic disease is especially emphasised, in line with other authors' research indicating the number of these diseases is on the rise. The diagnostic approach to FUO should always be directed to the known frequency of diseases.
Substance use treatment barriers for patients with frequent hospital admissions.
Raven, Maria C; Carrier, Emily R; Lee, Joshua; Billings, John C; Marr, Mollie; Gourevitch, Marc N
2010-01-01
Substance use (SU) disorders adversely impact health status and contribute to inappropriate health services use. This qualitative study sought to determine SU-related factors contributing to repeated hospitalizations and to identify opportunities for preventive interventions. Fifty Medicaid-insured inpatients identified by a validated statistical algorithm as being at high-risk for frequent hospitalizations were interviewed at an urban public hospital. Patient drug/alcohol history, experiences with medical, psychiatric and addiction treatment, and social factors contributing to readmission were evaluated. Three themes related to SU and frequent hospitalizations emerged: (a) barriers during hospitalization to planning long-term treatment and follow-up, (b) use of the hospital as a temporary solution to housing/family problems, and (c) unsuccessful SU aftercare following discharge. These data indicate that homelessness, brief lengths of stay complicating discharge planning, patient ambivalence regarding long-term treatment, and inadequate detox-to-rehab transfer resources compromise substance-using patients' likelihood of avoiding repeat hospitalization. Intervention targets included supportive housing, detox-to-rehab transportation, and postdischarge patient support.
Forest Administration in Romania: Frequent Problems and Expectations
Mihai MARINCHESCU
2014-12-01
Full Text Available The aim of this study is to describe the status and evolution of forest management in Romania in terms of forest regime, as well as to highlight the most frequent problems and common expectations of forest district managers. Underlying the presented results are an analysis of the compiled statistical indicators used in Romanian forestry and the outcome of a sociological survey conducted on a sample of 345 forest district managers. In early 2013, over 4.4 million hectares of state, public and private forest land were administered by state and experimental forest districts, and over 1.7 million hectares of forest land, other than state-owned, by private forest districts. Note that approximately 0.36 million hectares (over 5% of Romania’s forest area are not in the care of specialized units, contrary to the legal provisions. The most frequent problems faced by forest district managers arise in relation to the owners of forests or are caused by illegal logging. This study is a contribution to making the concrete problems faced by foresters and especially the structure and ownership related characteristics of forestland the driving force of legislative changes in the forestry sector.
Sleep quality and duration are associated with performance in maximal incremental test.
Antunes, B M; Campos, E Z; Parmezzani, S S; Santos, R V; Franchini, E; Lira, F S
2017-08-01
Inadequate sleep patterns may be considered a trigger to development of several metabolic diseases. Additionally, sleep deprivation and poor sleep quality can negatively impact performance in exercise training. However, the impact of sleep duration and sleep quality on performance during incremental maximal test performed by healthy men is unclear. Therefore, the purpose of the study was to analyze the association between sleep pattern (duration and quality) and performance during maximal incremental test in healthy male individuals. A total of 28 healthy males volunteered to take part in the study. Sleep quality, sleep duration and physical activity were subjectively assessed by questionnaires. Sleep pattern was classified by sleep duration (>7h or Incremental exercise test was performed at 35 watts for untrained subjects, 70 watts for physically active subjects and 105 watts for well-trained subjects. HRmax was correlated with sleep quality (r=0.411, p=0.030) and sleep duration (r=-0.430, p=0.022). Participants reporting good sleep quality presented higher values of Wmax, VO2max and lower values of HRmax when compared to participants with altered sleep. Regarding sleep duration, only Wmax was influenced by the amount of sleeping hours per night and this association remained significant even after adjustment by VO2max. Sleep duration and quality are associated, at least in part, with performance during maximal incremental test among healthy men, with losses in Wmax and HRmax. In addition, our results suggest that the relationship between sleep patterns and performance, mainly in Wmax, is independent of fitness condition. Copyright © 2017 Elsevier Inc. All rights reserved.
Inquiry in bibliography some of the bustan`s maxim
sajjad rahmatian
2016-12-01
Full Text Available Sa`di is on of those poets who`s has placed a special position to preaching and guiding the people and among his works, allocated throughout the text of bustan to advice and maxim on legal and ethical various subjects. Surely, sa`di on the way of to compose this work and expression of its moral point, direct or indirect have been affected by some previous sources and possibly using their content. The main purpose of this article is that the pay review of basis and sources of bustan`s maxims and show that sa`di when expression the maxims of this work has been affected by which of the texts and works. For this purpose is tried to with search and research on the resources that have been allocated more or less to the aphorisms, to discover and extract traces of influence sa`di from their moral and didactic content. From the most important the finding of this study can be mentioned that indirect effect of some pahlavi books of maxim (like maxims of azarbad marespandan and bozorgmehr book of maxim and also noted sa`di directly influenced of moral and ethical works of poets and writers before him, and of this, sa`di`s influence from abo- shakur balkhi maxims, ferdowsi and keikavus is remarkable and noteworthy.
O'Bryan, Katharine E; Prober, Suzanne Mary; Lunt, Ian D; Eldridge, David J
2009-04-01
The intermediate disturbance hypothesis (IDH) predicts that species diversity is maximized at moderate disturbance levels. This model is often applied to grassy ecosystems, where disturbance can be important for maintaining vascular plant composition and diversity. However, effects of disturbance type and frequency on cover and diversity of non-vascular plants comprising biological soil crusts are poorly known, despite their potentially important role in ecosystem function. We established replicated disturbance regimes of different type (fire vs. mowing) and frequency (2, 4, 8 yearly and unburnt) in a high-quality, representative Themeda australis-Poa sieberiana derived grassland in south-eastern Australia. Effects on soil crust bryophytes and lichens (hereafter cryptogams) were measured after 12 years. Consistent with expectations under IDH, cryptogam richness and abundance declined under no disturbance, likely due to competitive exclusion by vascular plants as well as high soil turnover by soil invertebrates beneath thick grass. Disturbance type was also significant, with burning enhancing richness and abundance more than mowing. Contrary to expectations, however, cryptogam richness increased most dramatically under our most frequent and recent (2 year) burning regime, even when changes in abundance were accounted for by rarefaction analysis. Thus, from the perspective of cryptogams, 2-year burning was not an adequately severe disturbance regime to reduce diversity, highlighting the difficulty associated with expression of disturbance gradients in the application of IDH. Indeed, significant correlations with grassland structure suggest that cryptogam abundance and diversity in this relatively mesic (600 mm annual rainfall) grassland is maximised by frequent fires that reduce vegetation and litter cover, providing light, open areas and stable soil surfaces for colonisation. This contrasts with detrimental effects of 2-year burning on native perennial grasses
[Contraceptive compliance - why is contraceptive failure still so frequent?].
Bitzer, Johannes
2009-02-01
Contraceptive compliance is defined as the correct use (according to the method specific prescriptions given by a medical professional and/or in written form as patient information leaflet) of a contraceptive method. Non-compliance describes a mismatch between the real behaviour of a user and the correct or ideal behaviour. There are various indicators that in general contraceptive compliance is far from ideal. Many studies report a rate of unintended pregnancies of 50%, half of them terminating in abortion. The abortion rate remains high even in countries with availability of advanced contraceptive technology. Especially with hormonal contraception and barrier methods the gap between correct and real use is large. Discontinuation rates per year reach up to 50%. Reasons for Non Compliance are (a) Lack of motivation to prevent a pregnancy due to ambivalence regarding the wish for a child as well as sexual and relationship issues (b) Cognitive factors (False information, misconceptions, irrational fears) (c) Difficult or lacking access to contraceptive methods (d) Behavioral errors and mistakes (Forgetting, loosing etc.) and (e) Side effects of the methods used. Three strategies to improve compliance can be distinguished: (a) Improving counselling; (b) Developing contraceptive methods which demand a low level of compliant behaviour by the user; (c) Improving quality of life of users by minimizing the negative side effects and maximizing the non contraceptive health benefits.
Viability of bi-maximal solution of the Zee mass matrix
Brahmachari, B; Brahmachari, Biswajoy; Choubey, Sandhya
2002-01-01
We know $L_e-L_\\mu-L_\\tau$ symmetry gives $m^2_1= m^2_2 >> m^2_3$ pattern in Zee model. $\\Delta m^2_\\odot$ emerges from a small breaking of this symmetry. Because this symmetry is broken very weakly $\\theta_\\odot$ does not deviate much from $\\tan^2 \\theta_\\odot=1$ which is its value in the symmetric limit. This gives a mismatch with LMA solution where mixing is large but not exactly maximal. We confront this property of Zee mass matrix by phenomenologically analyzing recent results from solar and atmospheric neutrino oscillation experiments at various confidence levels. We conclude that LOW type solution is compatible with the Zee mass matrix at 99% confidence level when atmospheric neutrino deficit is explained by maximal $\
Maximal strength training improves cycling economy in competitive cyclists.
Sunde, Arnstein; Støren, Oyvind; Bjerkaas, Marius; Larsen, Morten H; Hoff, Jan; Helgerud, Jan
2010-08-01
The purpose of the present study was to investigate the effect of maximal strength training on cycling economy (CE) at 70% of maximal oxygen consumption (Vo2max), work efficiency in cycling at 70% Vo2max, and time to exhaustion at maximal aerobic power. Responses in 1 repetition maximum (1RM) and rate of force development (RFD) in half-squats, Vo2max, CE, work efficiency, and time to exhaustion at maximal aerobic power were examined. Sixteen competitive road cyclists (12 men and 4 women) were randomly assigned into either an intervention or a control group. Thirteen (10 men and 3 women) cyclists completed the study. The intervention group (7 men and 1 woman) performed half-squats, 4 sets of 4 repetitions maximum, 3 times per week for 8 weeks, as a supplement to their normal endurance training. The control group continued their normal endurance training during the same period. The intervention manifested significant (p < 0.05) improvements in 1RM (14.2%), RFD (16.7%), CE (4.8%), work efficiency (4.7%), and time to exhaustion at pre-intervention maximal aerobic power (17.2%). No changes were found in Vo2max or body weight. The control group exhibited an improvement in work efficiency (1.4%), but this improvement was significantly (p < 0.05) smaller than that in the intervention group. No changes from pre- to postvalues in any of the other parameters were apparent in the control group. In conclusion, maximal strength training for 8 weeks improved CE and efficiency and increased time to exhaustion at maximal aerobic power among competitive road cyclists, without change in maximal oxygen uptake, cadence, or body weight. Based on the results from the present study, we advise cyclists to include maximal strength training in their training programs.
The Maximal Graded Left Quotient Algebra of a Graded Algebra
Gonzalo ARANDA PINO; Mercedes SILES MOLINA
2006-01-01
We construct the maximal graded left quotient algebra of every graded algebra A without homogeneous total right zero divisors as the direct limit of graded homomorphisms (of left A-modules)from graded dense left ideals of A into a graded left quotient algebra of A. In the case of a superalgebra,and with some extra hypothesis, we prove that the component in the neutral element of the group of the maximal graded left quotient algebra coincides with the maximal left quotient algebra of the component in the neutral element of the group of the superalgebra.
Maximal regularity of second order delay equations in Banach spaces
无
2010-01-01
We give necessary and sufficient conditions of Lp-maximal regularity(resp.B sp ,q-maximal regularity or F sp ,q-maximal regularity) for the second order delay equations:u″(t)=Au(t) + Gu’t + F u t + f(t), t ∈ [0, 2π] with periodic boundary conditions u(0)=u(2π), u′(0)=u′(2π), where A is a closed operator in a Banach space X,F and G are delay operators on Lp([-2π, 0];X)(resp.Bsp ,q([2π, 0];X) or Fsp,q([-2π, 0;X])).
Building hospital TQM teams: effective polarity analysis and maximization.
Hurst, J B
1996-09-01
Building and maintaining teams require careful attention to and maximization of such polar opposites (¿polarities¿) as individual and team, directive and participatory leadership, task and process, and stability and change. Analyzing systematic elements of any polarity and listing blocks, supports, and flexible ways to maximize it will prevent the negative consequences that occur when treating a polarity like a solvable problem. Flexible, well-timed shifts from pole to pole result in the maximization of upside and minimization of downside consequences.
People believe each other to be selfish hedonic maximizers.
De Vito, Stefania; Bonnefon, Jean-François
2014-10-01
Current computational models of theory of mind typically assume that humans believe each other to selfishly maximize utility, for a conception of utility that makes it indistinguishable from personal gains. We argue that this conception is at odds with established facts about human altruism, as well as the altruism that humans expect from each other. We report two experiments showing that people expect other agents to selfishly maximize their pleasure, even when these other agents behave altruistically. Accordingly, defining utility as pleasure permits us to reconcile the assumption that humans expect each other to selfishly maximize utility with the fact that humans expect each other to behave altruistically.
Lp Estimates of Rough Maximal Functions Along Surfaces with Applications
Ahmad AL-SALMAN; Abdulla M. JARRAH
2016-01-01
In this paper, we study the Lp mapping properties of certain class of maximal oscillatory singular integral operators. We prove a general theorem for a class of maximal functions along surfaces. As a consequence of such theorem, we establish the Lp boundedness of various maximal oscillatory singular integrals provided that their kernels belong to the natural space L log L(Sn−1). Moreover, we highlight some additional results concerning operators with kernels in certain block spaces. The results in this paper substantially improve previously known results.
The most frequently cited adsorption research articles in the Science Citation Index (Expanded).
Fu, Hui-Zhen; Wang, Ming-Huang; Ho, Yuh-Shan
2012-08-01
The 126 most frequently cited articles published in the adsorption field between 1900 and 2011 were identified and characterized using the Science Citation Index (Expanded). The data analyzed cover a range of publication years, journals, Web of Science categories, authors, institutions, countries/territories, life citation cycle curves, and characteristics of frequently cited articles. The 126 most-frequently-cited articles were each cited an average of 1014 times, ranging from 502 to 9922 citations per article from 1918 to 2006; 80% of these articles were published after 1970. Fifty-five journals were represented, led by the Journal of the American Chemical Society, and followed by Science and Nature. Three categories out of the 35 Web of Science categories constituted 60% of the citations. The three categories were: physical chemistry, multidisciplinary chemistry, and multidisciplinary sciences. Thirteen of the authors contributed three or more articles. Harvard University, the Massachusetts Institute of Technology, and the University of Washington led the list of 107 institutions, while the United States led the list of 17 countries/territories, comprising more than half of the articles. Collaboration among the top authors was a frequent occurrence, while inter-institutional collaboration and national collaboration was not obvious among the topmost articles. Moreover, the citation patterns as a function of time varied widely among the topmost articles. As evidenced by citation life cycles, the well known BET and Langmuir isotherms have received considerable attention during the study period, and will probably continue to be popular in the adsorption field. Some emerging hotspots are likely to receive particular attention in the near future; these include the new family of "M41S" materials, pseudo-second-order kinetic models, and the nudged elastic band method.
Frequent occurrence of uniparental disomy in colorectal cancer
Andersen, Claus Lindbjerg; Wiuf, Carsten; Kruhøffer, Mogens;
2007-01-01
, consisting of 17 normal mucosa and 66 adenocarcinoma samples. The transcriptional analysis revealed an unchanged expression level in areas with intact copy number, including regions with uniparental disomy, and a reduced expression level in the LOH regions representing factual losses (including 5q, 8p and 17......) and lymph node metastasis status (gain of 7q and 13q). Another subset of the identified alterations was shown to represent intratumor heterogeneity. In conclusion, we demonstrate that uniparental disomy is frequent in CRC, and identify genomic alterations associated with TP53 inactivation and lymph node...... LOH regions showed no evidence of a reduced copy number, indicating the presence of uniparental structures. The distribution of these structures was non-random, primarily involving 8q, 13q and 20q. This finding was supported by analysis of an independent set of array-based transcriptional profiles...
Personality Profiles and Frequent Heavy Drinking in Young Adulthood.
Zhang, Jieting; Bray, Bethany C; Zhang, Minqiang; Lanza, Stephanie T
2015-07-01
Few studies examining the link between personality and alcohol use have adopted a comprehensive modeling framework to take into account individuals' profiles across multiple personality traits. In this study, latent profile analysis (LPA) was applied to a national sample of young adults in the United States to identify subgroups defined by their profiles of mean scores on the Neuroticism, Extraversion, Openness, Agreeableness, and Conscientiousness personality factors. Personality profiles were then used to predict heavy drinking. Five profiles were identified: Reserved, Rigid, Confident, Ordinary, and Resilient. Compared to individuals in the Ordinary profile, those with Reserved and Resilient profiles were at increased risk of frequent heavy drinking. These findings suggest which comprehensive personality profiles may place individuals at risk for problematic alcohol-related outcomes.
Mining φ-Frequent Itemset Using FP-Tree
无
2001-01-01
The problem of association rule mining has gained considerableprominence in the data mining community for its use as an important tool of knowledge discovery from large-scale databases. And there has been a spurt of research activities around this problem. However, traditional association rule mining may often derive many rules in which people are uninterested. This paper reports a generalization of association rule mining called φ-association rule mining. It allows people to have different interests on different itemsets that are the need of real application. Also, it can help to derive interesting rules and substantially reduce the amount of rules. An algorithm based on FP-tree for mining φ-frequent itemset is presented. It is shown by experiments that the proposed method is efficient and scalable over large databases.
Frequent itemsets mining for database auto-administration
Aouiche, Kamel; Gruenwald, Le
2008-01-01
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The aim of auto-administrative systems is to administrate and adapt themselves automatically without loss (or even with a gain) in performance. The idea of using data mining techniques to extract useful knowledge for administration from the data themselves has existed for some years. However, little research has been achieved. This idea nevertheless remains a very promising approach, notably in the field of data warehousing, where queries are very heterogeneous and cannot be interpreted easily. The aim of this study is to search for a way of extracting useful knowledge from stored data themselves to automatically apply performance optimization techniques, and more particularly indexing techniques. We have designed a tool that extracts frequent itemsets from a given workload to compute an index configuration that helps optimizing data acce...
Influence of frequent nocturnal home hemodialysis on food preference.
Ipema, Karin; Franssen, Casper; van der Schans, Cees; Smit, Lianne; Noordman, Sabine; Haisma, Hinke
2010-03-01
Dialysis patients frequently report a change of taste that is reversible after renal transplantation, suggesting that uremic toxins may negatively influence taste. Currently, frequent nocturnal home hemodialysis (NHHD) is the most effective method of hemodialysis, and is associated with the lowest levels of uremic toxins. We studied preferences for various foods as an indicator of taste perception. We questioned whether food preference differs between NHHD patients and those on conventional hemodialysis. In this transverse, cross-sectional pilot study, we assessed food preference by means of a questionnaire for patients on NHHD (n=6; 8 hours of dialysis per night, for 5 or 6 nights a week) and 3 age-matched and sex-matched control groups: chronic home hemodialysis patients (HHD; n=9; 4 to 5 hours of dialysis per day, 3 days a week), chronic in-center hemodialysis patients (CHD; n=18; 4 to 5 hours of dialysis per day, 3 days a week), and healthy control subjects (HC; n=23). Mean scores for food preference did not differ between groups (P=.32). Similarly, the preference for product groups did not differ between groups. On an individual product level, we found only minor differences. The NHHD patients had a preference for savory snacks, as did the HC and CHD groups, whereas the HHD group had a preference for sweet snacks (P food preference. The change in taste reported by NHHD patients is not related to their particular food preferences. Copyright (c) 2010 National Kidney Foundation, Inc. Published by Elsevier Inc. All rights reserved.
Ganglion Cells Are Frequently Present in Pediatric Mucosal Colorectal Biopsies.
Kovach, Alexandra E; Pacheco, M Cristina
2017-01-01
Hirschsprung disease (HD) rarely presents as chronic constipation after the newborn period. At our institution, calretinin immunohistochemistry (CAL) is frequently requested by clinicians on rectal mucosal biopsies (RMBs) taken during colonoscopy in older children in whom suspicion for HD is low. We hypothesized that review of these biopsies would frequently reveal ganglion cells (GCs). We reviewed features of mucosal biopsies (November 2013 to September 2015) from children ≥1 year of age on which clinicians had requested CAL on at least one specimen. A total of 93 biopsies with paired CAL from 83 patients were suitable for study (ages 1-18 years, M:F 1.2). Submitted clinical indication was constipation in 62 patients (75%). GCs were found within or subjacent to muscularis mucosa in 63 biopsies (68%), 12 (19%) of which were designated from a specific anatomic site, eg, 2 or 3 cm. In 25 of 63 (40%) cases, GCs were identified on one of the first 3 sections (median 5th, range 1st-54th). Forty-six cases (73%) contained no or 1 mm of SM, and 21 (70%) had no SM. CAL was positive in 28 (93%) and equivocal/weak in 2 (7%); no additional work-up for HD was pursued. The data suggest that H&E sections of RMBs can exclude HD at a specified site in many cases and provide the basis for a future study examining the utility of CAL in RMBs without SM as a means for excluding HD.
Gastrocnemius tendinosis--A frequent finding on MRI knee examination.
Jawahar, Anugayathri; Lu, Yanan; Okur, Gokcan; Kliethermes, Stephanie; Lomasney, Laurie
2015-12-01
Gastrocnemius tendinosis (GT) is one potential cause for posterior knee pain, commonly overlooked on clinical examinations and imaging. This study assesses the frequency of GT on MR imaging in a convenience sample based on a database search and associations with other articular pathologies and clinical findings. With IRB approval, retrospective review was completed on 300 randomly selected MR knee exams performed from February 2009 to June 2010. Following de-identification, axial T2 and sagittal PD images, with or without fat suppression, were reviewed by 2 radiologists. The gastrocnemius tendon femoral attachments were graded as normal, mild (few cysts, thickening, intermediate signal) or severe GT (multiple cysts, marrow edema, tear). Select associated MR findings of internal derangement were documented. Clinical charts were reviewed for clinical presentation, physical exam findings, and select demographics. The inter-observer reliability for presence/grading of GT was very high (kappa statistic=0.97). Frequency of GT was 50.33%, most frequently involving medial head of gastrocnemius (63.6%). Grades of GT were 41.7% and 17.2% for mild and severe respectively. Univariate analysis showed statistically significant relationship between grade of GT with arthrosis (p=0.05) and clinical joint effusion (p=0.02). Multivariate analysis showed higher odds of severe GT for individuals with medial plus lateral GT. Statistical significance was noted for presence of both GT and ACL tear (13.9%; p=0.02). Significant findings of our analysis included GT presented with predominant involvement of medial head of gastrocnemius tendon, mild in severity, strong association with ACL tear, presented frequently as posterior knee pain, limited joint motion and clinical joint effusion. However, there was no statistically significant association between demographic features and medical comorbidities in the patients. Increased understanding of frequency of GT allows more accurate reporting of
ter Riet Gerben
2009-01-01
Full Text Available Abstract Background General Practitioners spend a disproportionate amount of time on frequent attenders. So far, trials on the effect of interventions on frequent attenders have shown negative results. However, these trials were conducted in short-term frequent attenders. It would be more reasonable to target intervention at persistent frequent attenders. Typical characteristics of persistent frequent attenders, as opposed to 1-year frequent attenders and non-frequent attenders, may generate hypotheses regarding modifiable factors on which new randomized trials may be designed. Methods We used the data of all 28,860 adult patients from 5 primary healthcare centers. Frequent attenders were patients whose attendance rate ranked in the (age and sex adjusted top 10 percent during 1 year (1-year frequent attenders or 3 years (persistent frequent attenders. All other patients on the register over the 3-year period were referred to as non-frequent attenders. The lists of medical problems coded by the GP using the International Classification of Primary Care (ICPC were used to assess morbidity. First, we determined which proportion of 1-year frequent attenders was still a frequent attender during the next two consecutive years and calculated the GPs' workload for these patients. Second, we compared morbidity and number of prescriptions for non-frequent attenders, 1-year frequent attenders and persistent frequent attenders. Results Of all 1-year frequent attenders, 15.4% became a persistent frequent attender equal to 1.6% of all patients. The 1-year frequent attenders (3,045; 10.6% were responsible for 39% of the face-to-face consultations; the 470 patients who would become persistent frequent attenders (1.6% were responsible for 8% of all consultations in 2003. Persistent frequent attenders presented more social problems, more psychiatric problems and medically unexplained physical symptoms, but also more chronic somatic diseases (especially diabetes
Maximally entangled state can be a mixed state
Li, Zong-Guo; Fei, Shao-Ming; Fan, Heng; Liu, W M
2009-01-01
We present mixed maximally entangled states in d\\otimes d' (d'\\geq 2d) spaces. This result is beyond the generally accepted fact that all maximally entangled states are pure. These states possess important properties of the pure maximally entangled states in $d\\otimes d$ systems, for example, they can be used as a resource for faithful teleportation, their local distinguishability property is also the same as the pure states case. On the other hand, one advantage of these mixed maximally entangled states is that the decoherence induced by certain noisy quantum channel does not destroy their entanglement. Thus one party of these mixed states can be sent through this channel to arbitrary distance while still keeping them as a valuable resource for quantum information processing. We also propose a scheme to prepare these states and confirm their advantage in NMR physical system.
Groups Satisfying the Maximal Condition on Non-modular Subgroups
Maria De Falco; Carmela Musella
2005-01-01
In this paper, (generalized) soluble groups for which the set of non-modular subgroups verifies the maximal condition and groups for which the set of non-permutable subgroups satisfies the same property are classified.
Maximizing antimalarial efficacy and the importance of dosing strategies
Beeson, James G; Boeuf, Philippe; Fowkes, Freya J I
2015-01-01
.... Without new drugs to replace artemisinins, it is essential to define dosing strategies that maximize therapeutic efficacy, limit the spread of resistance, and preserve the clinical value of ACTs...
Maximal entanglement versus entropy for mixed quantum states
Wei, T C; Goldbart, P M; Kwiat, P G; Munro, W J; Verstraete, F; Wei, Tzu-Chieh; Nemoto, Kae; Goldbart, Paul M.; Kwiat, Paul G.; Munro, William J.; Verstraete, Frank
2003-01-01
Maximally entangled mixed states are those states that, for a given mixedness, achieve the greatest possible entanglement. For two-qubit systems and for various combinations of entanglement and mixedness measures, the form of the corresponding maximally entangled mixed states is determined primarily analytically. As measures of entanglement, we consider entanglement of formation, relative entropy of entanglement, and negativity; as measures of mixedness, we consider linear and von Neumann entropies. We show that the forms of the maximally entangled mixed states can vary with the combination of (entanglement and mixedness) measures chosen. Moreover, for certain combinations, the forms of the maximally entangled mixed states can change discontinuously at a specific value of the entropy.
Carnot cycle at finite power: attainability of maximal efficiency.
Allahverdyan, Armen E; Hovhannisyan, Karen V; Melkikh, Alexey V; Gevorkian, Sasun G
2013-08-01
We want to understand whether and to what extent the maximal (Carnot) efficiency for heat engines can be reached at a finite power. To this end we generalize the Carnot cycle so that it is not restricted to slow processes. We show that for realistic (i.e., not purposefully designed) engine-bath interactions, the work-optimal engine performing the generalized cycle close to the maximal efficiency has a long cycle time and hence vanishing power. This aspect is shown to relate to the theory of computational complexity. A physical manifestation of the same effect is Levinthal's paradox in the protein folding problem. The resolution of this paradox for realistic proteins allows to construct engines that can extract at a finite power 40% of the maximally possible work reaching 90% of the maximal efficiency. For purposefully designed engine-bath interactions, the Carnot efficiency is achievable at a large power.
Maximal induced paths and minimal percolating sets in hypercubes
Anil M. Shende
2015-01-01
Full Text Available For a graph $G$, the \\emph{$r$-bootstrap percolation} process can be described as follows: Start with an initial set $A$ of "infected'' vertices. Infect any vertex with at least $r$ infected neighbours, and continue this process until no new vertices can be infected. $A$ is said to \\emph{percolate in $G$} if eventually all the vertices of $G$ are infected. $A$ is a \\emph{minimal percolating set} in $G$ if $A$ percolates in $G$ and no proper subset of $A$ percolates in $G$. An induced path, $P$, in a hypercube $Q_n$ is maximal if no induced path in $Q_n$ properly contains $P$. Induced paths in hypercubes are also called snakes. We study the relationship between maximal snakes and minimal percolating sets (under 2-bootstrap percolation in hypercubes. In particular, we show that every maximal snake contains a minimal percolating set, and that every minimal percolating set is contained in a maximal snake.
Sensitivity to conversational maxims in deaf and hearing children.
Surian, Luca; Tedoldi, Mariantonia; Siegal, Michael
2010-09-01
We investigated whether access to a sign language affects the development of pragmatic competence in three groups of deaf children aged 6 to 11 years: native signers from deaf families receiving bimodal/bilingual instruction, native signers from deaf families receiving oralist instruction and late signers from hearing families receiving oralist instruction. The performance of these children was compared to a group of hearing children aged 6 to 7 years on a test designed to assess sensitivity to violations of conversational maxims. Native signers with bimodal/bilingual instruction were as able as the hearing children to detect violations that concern truthfulness (Maxim of Quality) and relevance (Maxim of Relation). On items involving these maxims, they outperformed both the late signers and native signers attending oralist schools. These results dovetail with previous findings on mindreading in deaf children and underscore the role of early conversational experience and instructional setting in the development of pragmatics.
Classification of conformal representations induced from the maximal cuspidal parabolic
Dobrev, V. K., E-mail: dobrev@inrne.bas.bg [Scuola Internazionale Superiore di Studi Avanzati (Italy)
2017-03-15
In the present paper we continue the project of systematic construction of invariant differential operators on the example of representations of the conformal algebra induced from the maximal cuspidal parabolic.
A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
Bhowmick, Sanjukta; Chen, Tzu-Yi; Halappanavar, Mahantesh
2015-02-01
A graph is chordal if every cycle of length greater than three contains an edge between non-adjacent vertices. Chordal graphs are of interest both theoretically, since they admit polynomial time solutions to a range of NP-hard graph problems, and practically, since they arise in many applications including sparse linear algebra, computer vision, and computational biology. A maximal chordal subgraph is a chordal subgraph that is not a proper subgraph of any other chordal subgraph. Existing algorithms for computing maximal chordal subgraphs depend on dynamically ordering the vertices, which is an inherently sequential process and therefore limits the algorithms' parallelizability. In this paper we explore techniques to develop a scalable parallel algorithm for extracting a maximal chordal subgraph. We demonstrate that an earlier attempt at developing a parallel algorithm may induce a non-optimal vertex ordering and is therefore not guaranteed to terminate with a maximal chordal subgraph. We then give a new algorithm that first computes and then repeatedly augments a spanning chordal subgraph. After proving that the algorithm terminates with a maximal chordal subgraph, we then demonstrate that this algorithm is more amenable to parallelization and that the parallel version also terminates with a maximal chordal subgraph. That said, the complexity of the new algorithm is higher than that of the previous parallel algorithm, although the earlier algorithm computes a chordal subgraph which is not guaranteed to be maximal. We experimented with our augmentation-based algorithm on both synthetic and real-world graphs. We provide scalability results and also explore the effect of different choices for the initial spanning chordal subgraph on both the running time and on the number of edges in the maximal chordal subgraph.
IMRank: Influence Maximization via Finding Self-Consistent Ranking
Cheng, Suqi; Shen, Hua-Wei; Huang, Junming; Chen, Wei; Cheng, Xue-Qi
2014-01-01
Influence maximization, fundamental for word-of-mouth marketing and viral marketing, aims to find a set of seed nodes maximizing influence spread on social network. Early methods mainly fall into two paradigms with certain benefits and drawbacks: (1)Greedy algorithms, selecting seed nodes one by one, give a guaranteed accuracy relying on the accurate approximation of influence spread with high computational cost; (2)Heuristic algorithms, estimating influence spread using efficient heuristics,...
Probing the deviation from maximal mixing of atmospheric neutrinos
Choubey, S; Choubey, Sandhya; Roy, Probir
2006-01-01
Pioneering atmospheric muon neutrino experiments have demonstrated the near-maximal magnitude of the flavor mixing angle $\\theta_{23}$. But the precise value of the deviation $D \\equiv 1/2 - \\sin^2 \\theta_{23}$ from maximality (if nonzero) needs to be known, being of great interest -- especially to builders of neutrino mass and mixing models. We quantitatively investigate in a three generation framework the feasibility of determining $D$ in a statistically significant manner from studies of the atmospheric $\
Shareholder, stakeholder-owner or broad stakeholder maximization
Mygind, Niels
2004-01-01
including the shareholders of a company. Although it may be the ultimate goal for Corporate Social Responsibility to achieve this kind of maximization, broad stakeholder maximization is quite difficult to give a precise definition. There is no one-dimensional measure to add different stakeholder benefits...... by other stakeholders' interests. These constraints vary for dif-ferent stakeholder owners and new standards for Corporate Social Responsibility and more active political consumers will strengthen these constraints....
Maximal speed of particles in super-Lévy process
LIN Zheng-yan; CHENG Zong-mao
2008-01-01
We introduce a super-Lévy process and study maximal speed of all particles process is a measure on the set of paths.We study the maximal speed of all particles during a given time period,which turns out to be a function of the packing dimension of the time period.We calculate the Hausdorff dimension of the set of a-fast patlls in the support and the range of the historical super-lévy process.
Choice with frequently changing food rates and food ratios.
Baum, William M; Davison, Michael
2014-03-01
In studies of operant choice, when one schedule of a concurrent pair is varied while the other is held constant, the constancy of the constant schedule may exert discriminative control over performance. In our earlier experiments, schedules varied reciprocally across components within sessions, so that while food ratio varied food rate remained constant. In the present experiment, we held one variable-interval (VI) schedule constant while varying the concurrent VI schedule within sessions. We studied five conditions, each with a different constant left VI schedule. On the right key, seven different VI schedules were presented in seven different unsignaled components. We analyzed performances at several different time scales. At the longest time scale, across conditions, behavior ratios varied with food ratios as would be expected from the generalized matching law. At shorter time scales, effects due to holding the left VI constant became more and more apparent, the shorter the time scale. In choice relations across components, preference for the left key leveled off as the right key became leaner. Interfood choice approximated strict matching for the varied right key, whereas interfood choice hardly varied at all for the constant left key. At the shortest time scale, visit patterns differed for the left and right keys. Much evidence indicated the development of a fix-and-sample pattern. In sum, the procedural difference made a large difference to performance, except for choice at the longest time scale and the fix-and-sample pattern at the shortest time scale. © Society for the Experimental Analysis of Behavior.
Evolution of Shanghai STOCK Market Based on Maximal Spanning Trees
Yang, Chunxia; Shen, Ying; Xia, Bingying
2013-01-01
In this paper, using a moving window to scan through every stock price time series over a period from 2 January 2001 to 11 March 2011 and mutual information to measure the statistical interdependence between stock prices, we construct a corresponding weighted network for 501 Shanghai stocks in every given window. Next, we extract its maximal spanning tree and understand the structure variation of Shanghai stock market by analyzing the average path length, the influence of the center node and the p-value for every maximal spanning tree. A further analysis of the structure properties of maximal spanning trees over different periods of Shanghai stock market is carried out. All the obtained results indicate that the periods around 8 August 2005, 17 October 2007 and 25 December 2008 are turning points of Shanghai stock market, at turning points, the topology structure of the maximal spanning tree changes obviously: the degree of separation between nodes increases; the structure becomes looser; the influence of the center node gets smaller, and the degree distribution of the maximal spanning tree is no longer a power-law distribution. Lastly, we give an analysis of the variations of the single-step and multi-step survival ratios for all maximal spanning trees and find that two stocks are closely bonded and hard to be broken in a short term, on the contrary, no pair of stocks remains closely bonded for a long time.
Frequent exercise:A healthy habit or a behavioral addiction?
Wan-Jing Chen
2016-01-01
It is well known that regular physical activity helps improve overall health and fitness and reduces the risk of many chronic diseases. However, excessive exercise might be harmful. Exercise addiction (EA) is a pattern of uncontrolled exercise that involves a craving for overwhelming exercise with addictive attributes. So far, little is known about this unique behavioral addiction. The aim of the current study is to introduce the diagnosis and assessment of EA, and to summarize several developing theoretical models. Eating disorders, body image disorder, low self-esteem, and high narcissism are related to high risk of EA. The paper also discusses the distinction between EA and highly involved physical activity.
Rukiye Aydın FEBO
2014-01-01
Full Text Available Objectives: To compare the level of conjunctival changes using conjunctival impression cytology in wearers of frequent replacement hydrogel (FRHL and frequent replacement silicone hydrogel contact lens FRSHL. Materials and Methods: Forty-two contact lens users who were seen at the Cornea and Contact Lens Unit, Department of Ophthalmology, Dokuz Eylül University were evaluated in this study. The first group consisted of wearers of FRHL used for minimum one year and maximum five years. The second group consisted of wearers who used FRSHL for minimum one year and maximum 5 years. Twenty healthy individuals with no contact lens history were included in the control group. Conjunctival impression cytology was applied to all contact lens users and the control group in order to evaluate the conjunctival changes, and the results of impression cytology were graded by the Nelson’s method. Results: In the comparison of the groups according to impression cytology scoring, there was no difference between the users of FRHL and FRSHL. Similar amounts of squamous metaplasia and goblet cell loss were encountered in both groups. Nonetheless, impression cytology grading was significantly lower in the control group than in the other two groups. Conclusion: In conclusion, the use of FRHL and FRSHL for over a year causes some histological changes in the conjunctiva such as squamous metaplasia and goblet cell loss eventually leading to dry eye symptoms. However, no differences were determined between FRHL and FRSHL users with regard to severity of conjunctival changes. (Turk J Ophthalmol 2014; 44: 47-52
基于频繁链表的频繁集的挖掘算法%An Algorithm of Mining Frequent Set Based on Frequent Link
袁鼎荣; 张师超
2003-01-01
The problem of mining frequent set is a key issue in data mining. In this paper, a new method of miningfrequent set based on the frequent link is proposed. The algorithm constructs alternate frequent link from the transac-tion, the alternate link is yielded by adding up the alternate frequent link which constructed by scanning the transac-tion database in proper order. The frequent link that comprises all the information is constructed with the frequentnode which is selected according requirement. Our algorithm need to scan the transaction database only once and easysupervises the change of frequent set in order to guarantee the right of association rule.
Pattern-Based Target Selection Applied to Fund Raising
W.H.L.M. Pijls (Wim); R. Potharst (Rob); U. Kaymak (Uzay)
2001-01-01
textabstractThis paper proposes a new algorithm for target selection. This algorithm collects all frequent patterns (equivalent to frequent item sets) in a training set. These patterns are stored e?ciently using a compact data structure called a trie. For each pattern the relative frequency of the t
A. Hak (Tony); J. Dul (Jan)
2009-01-01
textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern
Frequent hypermethylation of DBC1 in malignant lymphoproliferative neoplasms
Grønbæk, Karin Elmegård; Ralfkiaer, U.; Dahl, C.
2008-01-01
follicular lymphomas, 5 of 5 mantle cell lymphomas, 4 of 4 small lymphocytic lymphomas, 1 of 2 lymphoplasmacytoid lymphomas, and in 12 of 12 acute lymphoblastic leukemias, but was unmethylated in 1 case of splenic marginal zone lymphoma, in 12 of 12 multiple myelomas, in 24 of 24 reactive lymph nodes......Allelic loss at chromosome 9q31-34 is a frequent event in many lymphoproliferative malignancies. Here, we examined DBC1 at 9q33.1 as a potential target in lymphomagenesis. DBC1 is a putative tumor suppressor that has been shown to be involved in the regulation of cell growth and programmed cell...... death. The methylation status of the DBC1 promoter CpG island was examined by methylation-specific PCR, bisulfite sequencing, and methylation-specific melting curve analysis. DBC1 was hypermethylated in 5 of 5 B-cell-derived lymphoma cell lines, 41 of 42 diffuse large B-cell lymphomas, 24 of 24...
Chest Pain: The Need to Consider Less Frequent Diagnosis
Pedro Magalhães
2016-01-01
Full Text Available Chest pain is one of the most frequent patient’s complaints. The commonest underlying causes are well known, but, sometimes, in some clinical scenarios, it is necessary to consider other diagnoses. We report a case of a 68-year-old Caucasian male, chronically hypertensive, who complained of recurrent episodes of chest pain and fever with elevated acute phase reactants. The first investigation was negative for some of the most likely diagnosis and he quickly improved with anti-inflammatory drugs. Over a few months, his symptoms continued to recur periodically, his hypertension was aggravated, and he developed headaches and lower limbs claudication. After a temporal artery biopsy that was negative for vasculitis, he underwent a positron emission tomography suggestive of Takayasu Arteritis. Takayasu Arteritis is a rare chronic granulomatous vasculitis of the aorta and its first-order branches affecting mostly females up to 50 years old. Chest pain is experienced by >40% of the patients and results from the inflammation of the aorta, pulmonary artery, or coronaries.
Gnathostomiasis in a patient who frequently consumes sushi.
Jarell, Abel D; Dans, Michael J; Elston, Dirk M; Mathison, Blaine A; Ruben, Beth S
2011-12-01
A 45-year-old woman presented for evaluation of a solitary pruritic nodule on the abdomen that suddenly appeared 3 weeks before. She was healthy without a significant medical history, travel history, exposures, medications, or pets. She reported that she consumed sushi at least weekly in the city of San Francisco. A punch biopsy revealed a superficial and deep perivascular and interstitial infiltrates consisting of lymphocytes, plasma cells, and many eosinophils. Most notably, there was a parasite centered in the reticular dermis with prominent lateral chords, a well-developed muscular esophagus, and an intestine that contained a brush border and multinucleate cells. Evaluation of these histological sections by the Centers for Disease Control and Prevention determined the parasite to be a nematode of the genus Gnathostoma. The patient underwent a systemic work-up for gnathostomiasis, including imaging, and no other abnormalities were found. She completed a 3-week course of albendazole and has remained asymptomatic since the biopsy of her abdominal lesion. Although gnathostomiasis is often a systemic illness, this patient did well with apparently only localized cutaneous disease. Gnathostomiasis should be considered in patients who present with nonspecific papules and nodules, especially when there is a history of frequent consumption of raw fish.
Salt tolerance evolves more frequently in C4 grass lineages.
Bromham, L; Bennett, T H
2014-03-01
Salt tolerance has evolved many times in the grass family, and yet few cereal crops are salt tolerant. Why has it been so difficult to develop crops tolerant of saline soils when salt tolerance has evolved so frequently in nature? One possible explanation is that some grass lineages have traits that predispose them to developing salt tolerance and that without these background traits, salt tolerance is harder to achieve. One candidate background trait is photosynthetic pathway, which has also been remarkably labile in grasses. At least 22 independent origins of the C4 photosynthetic pathway have been suggested to occur within the grass family. It is possible that the evolution of C4 photosynthesis aids exploitation of saline environments, because it reduces transpiration, increases water-use efficiency and limits the uptake of toxic ions. But the observed link between the evolution of C4 photosynthesis and salt tolerance could simply be due to biases in phylogenetic distribution of halophytes or C4 species. Here, we use a phylogenetic analysis to investigate the association between photosynthetic pathway and salt tolerance in the grass family Poaceae. We find that salt tolerance is significantly more likely to occur in lineages with C4 photosynthesis than in C3 lineages. We discuss the possible links between C4 photosynthesis and salt tolerance and consider the limitations of inferring the direction of causality of this relationship.
Hypervascularity is more frequent in medullary thyroid carcinoma
Lai, Xingjian; Liu, Meijuan; Xia, Yu; Wang, Liang; Bi, Yalan; Li, Xiaoyi; Zhang, Bo; Yang, Meng; Dai, Qing; Jiang, Yuxin
2016-01-01
Abstract This study was designed to retrospectively compare the sonographic features of medullary thyroid carcinoma (MTC) and the features of papillary thyroid carcinoma (PTC). A total of 97 patients with 127 MTCs between January 2000 and January 2016 and 107 consecutive patients with 132 PTCs were included in this study. Two radiologists retrospectively determined the sonographic features and compared the findings of MTCs and PTCs. Compared with the patients with PTCs, the patients with MTCs were older (46.9 years vs 42.9 years, P = 0.016) and the male proportion was higher (53.6% vs 33.6%, P = 0.005). Most of the MTCs had an irregular shape (72.4%), a length/width ratio hypoechogenicity (96.9%), heterogeneous echotexture (76.4%), no cystic change (78.7%), calcification (63.8%), and hypervascularity (72.4%). There was no significant difference in the boundary, peripheral halo ring, echogenicity, and calcification between the MTCs and PTCs. However, compared with the PTCs, a larger size (2.2 vs 1.2 cm, P hypoechogenicity, the presence of microcalcifications, and increased intranodular vascularity. However, MTCs tend to possess these suspicious sonographic features less often than PTCs, with the exception of hypervascularity, which was more frequent in MTCs. PMID:27930537
Chest Pain: The Need to Consider Less Frequent Diagnosis
Morais, Anabela; Carvalho, Sofia; Cunha, Joana; Lima, Ana R.; Moreira, J. Ilídio; Faria, Trigo
2016-01-01
Chest pain is one of the most frequent patient's complaints. The commonest underlying causes are well known, but, sometimes, in some clinical scenarios, it is necessary to consider other diagnoses. We report a case of a 68-year-old Caucasian male, chronically hypertensive, who complained of recurrent episodes of chest pain and fever with elevated acute phase reactants. The first investigation was negative for some of the most likely diagnosis and he quickly improved with anti-inflammatory drugs. Over a few months, his symptoms continued to recur periodically, his hypertension was aggravated, and he developed headaches and lower limbs claudication. After a temporal artery biopsy that was negative for vasculitis, he underwent a positron emission tomography suggestive of Takayasu Arteritis. Takayasu Arteritis is a rare chronic granulomatous vasculitis of the aorta and its first-order branches affecting mostly females up to 50 years old. Chest pain is experienced by >40% of the patients and results from the inflammation of the aorta, pulmonary artery, or coronaries. PMID:27034853
Evidence and Implications of Frequent Fires in Ancient Shrub Tundra
Higuera, P E; Brubaker, L B; Anderson, P M; Brown, T A; Kennedy, A T; Hu, F S
2008-03-06
Understanding feedbacks between terrestrial and atmospheric systems is vital for predicting the consequences of global change, particularly in the rapidly changing Arctic. Fire is a key process in this context, but the consequences of altered fire regimes in tundra ecosystems are rarely considered, largely because tundra fires occur infrequently on the modern landscape. We present paleoecological data that indicate frequent tundra fires in northcentral Alaska between 14,000 and 10,000 years ago. Charcoal and pollen from lake sediments reveal that ancient birchdominated shrub tundra burned as often as modern boreal forests in the region, every 144 years on average (+/- 90 s.d.; n = 44). Although paleoclimate interpretations and data from modern tundra fires suggest that increased burning was aided by low effective moisture, vegetation cover clearly played a critical role in facilitating the paleo-fires by creating an abundance of fine fuels. These records suggest that greater fire activity will likely accompany temperature-related increases in shrub-dominated tundra predicted for the 21st century and beyond. Increased tundra burning will have broad impacts on physical and biological systems as well as land-atmosphere interactions in the Arctic, including the potential to release stored organic carbon to the atmosphere.
Frequently asked questions about family medicine in India.
Kumar, Raman
2016-01-01
Family medicine (FM) is an independent and distinct medical specialty in the developed countries such as USA, UK, Australia, and Canada since 1960s. FM teaching is imparted at undergraduate and postgraduate levels in countries such as Nepal, Pakistan, and Sri Lanka. Family practice is the practicing vocation of the majority doctors in India. The practitioners of FM include general practitioners, family physicians, FM specialists, and medical officers in the public sector. Medical students are largely unaware about FM career as this concept is not introduced at MBBS level. Faculty and senior doctors from other disciplines are also not able to answer the queries related to FM as they themselves also have gone through the same education system for last three decades, largely unexposed to the concept of academic family medicine. This article is a compilation of frequently asked questions, and their appropriate responses, presented here to dispel myths and misinformation about FM specialty. The answers are deliberated upon by Dr. Raman Kumar the founder president of the Academy of Family Physicians of India and the chief editor of the Journal of Family Medicine and Primary Care. This article was originally published as an interview in Docplexus, a popular online network and website for medical doctors in November 2015.
[Frequent causes of diarrhea: celiac disease and lactose intolerance].
Jankowiak, Carsten; Ludwig, Diether
2008-06-15
Celiac disease and lactose intolerance are both relatively frequent diseases with symptoms occurring after ingestion of certain food components. In celiac disease wheat gluten and related proteins of other cereals induce an inflammatory disease of the small intestine in predisposed individuals, leading to gastrointestinal and extraintestinal symptoms. Moreover, there is an association with many other diseases and besides classic symptoms (diarrhea, weight loss, malabsorption) atypical courses with less or lacking gastrointestinal symptoms exist. The prevalence is about 1 : 100 (Europe, USA) and higher than supposed earlier. Diagnostic criteria include serologic tests (tissue transglutaminase antibody, endomysial antibody) and characteristic small bowel histology (lymphocytic infiltration, villous atrophy). Therapy is a strict and lifelong gluten-free diet. Rarely, refractory disease or lack of compliance are associated with increased risk of malignancy and worse prognosis. Lactose intolerance is attributed to low intestinal lactase levels, due to reduced genetic expression or mucosal injury and consequent intolerance to dairy products. The frequency is varying in different ethnic groups, occurring in 10-15% of Northern European people. Intensity of clinical symptoms (diarrhea, abdominal pain, bloating) depends on the amount of ingested lactose and individual activity of intestinal lactase. The capacity of lactose malabsorption can be measured using the noninvasive lactose breath hydrogen test. The treatment is based on a reduced dietary lactose intake or in case of secondary form treatment of the underlying disease.
The semiology of febrile seizures: Focal features are frequent.
Takasu, Michihiko; Kubota, Tetsuo; Tsuji, Takeshi; Kurahashi, Hirokazu; Numoto, Shingo; Watanabe, Kazuyoshi; Okumura, Akihisa
2017-08-01
To clarify the semiology of febrile seizures (FS) and to determine the frequency of FS with symptoms suggestive of focal onset. FS symptoms in children were reported within 24h of seizure onset by the parents using a structured questionnaire consisting principally of closed-ended questions. We focused on events at seizure commencement, including changes in behavior and facial expression, and ocular and oral symptoms. We also investigated the autonomic and motor symptoms developing during seizures. The presence or absence of focal and limbic features was determined for each patient. The associations of certain focal and limbic features with patient characteristics were assessed. Information was obtained on FS in 106 children. Various events were recorded at seizure commencement. Behavioral changes were observed in 35 children, changes in facial expression in 53, ocular symptoms in 78, and oral symptoms in 90. In terms of events during seizures, autonomic symptoms were recognized in 78, and convulsive motor symptoms were recognized in 68 children. Focal features were evident in 81 children; 38 children had two or more such features. Limbic features were observed in 44 children, 9 of whom had two or more such features. There was no significant relationship between any patient characteristic and the numbers of focal or limbic features. The semiology of FS varied widely among children, and symptoms suggestive of focal onset were frequent. FS of focal onset may be more common than is generally thought. Copyright © 2017 Elsevier Inc. All rights reserved.
Sampling circulating tumor cells for clinical benefits: how frequent?
Leong, Sai Mun; Tan, Karen M L; Chua, Hui Wen; Tan, Doreen; Fareda, Delly; Osmany, Saabry; Li, Mo-Huang; Tucker, Steven; Koay, Evelyn S C
2015-06-25
Circulating tumor cells (CTCs) are cells shed from tumors or metastatic sites and are a potential biomarker for cancer diagnosis, management, and prognostication. The majority of current studies use single or infrequent CTC sampling points. This strategy assumes that changes in CTC number, as well as phenotypic and molecular characteristics, are gradual with time. In reality, little is known today about the actual kinetics of CTC dissemination and phenotypic and molecular changes in the blood of cancer patients. Herein, we show, using clinical case studies and hypothetical simulation models, how sub-optimal CTC sampling may result in misleading observations with clinical consequences, by missing out on significant CTC spikes that occur in between sampling times. Initial studies using highly frequent CTC sampling are necessary to understand the dynamics of CTC dissemination and phenotypic and molecular changes in the blood of cancer patients. Such an improved understanding will enable an optimal, study-specific sampling frequency to be assigned to individual research studies and clinical trials and better inform practical clinical decisions on cancer management strategies for patient benefits.
Maurice Schiff
1995-03-01
Full Text Available The traditional literature derives optimum and revenue-maximizing export taxes within two-country models. with one exporter and one importer (Johnson 1950-51, Tower 1977. In reality, most products, including primary products. are exported by several countries. In this paper, we present a theory of trade taxes in a three-country framework. This enables us to deal with strategic interactions among exporting countries. We show that (i if one of the countries is a Stackelberg leader, both countries improve their welfare relative to Nash equilibrium, and in the symmetric case, the follower's welfare is higher than that of the leader; (ii the revenue-maximizing Nash tax is larger than the optimum tax for each country; and (iii welfare may be higher in the revenue-maximizing Nash equilibrium than in the welfare-maximizing Nash equilibrium, a result which cannot arise in two-country models. The traditional literature derives optimum and revenue-maximizing export taxes within two-country models. with one exporter and one importer (Johnson 1950-51, Tower 1977. In reality, most products, including primary products. are exported by several countries. In this paper, we present a theory of trade taxes in a three-country framework. This enables us to deal with strategic interactions among exporting countries. We show that (i if one of the countries is a Stackelberg leader, both countries improve their welfare relative to Nash equilibrium, and in the symmetric case, the follower's welfare is higher than that of the leader; (ii the revenue-maximizing Nash tax is larger than the optimum tax for each country; and (iii welfare may be higher in the revenue-maximizing Nash equilibrium than in the welfare-maximizing Nash equilibrium, a result which cannot arise in two-country models.
Eleutherococcus senticosus (Rupr. & Maxim.) Maxim. (Araliaceae) as an adaptogen: a closer look.
Davydov, M; Krikorian, A D
2000-10-01
The adaptogen concept is examined from an historical, biological, chemical, pharmacological and medical perspective using a wide variety of primary and secondary literature. The definition of an adaptogen first proposed by Soviet scientists in the late 1950s, namely that an adaptogen is any substance that exerts effects on both sick and healthy individuals by 'correcting' any dysfunction(s) without producing unwanted side effects, was used as a point of departure. We attempted to identify critically what an adaptogen supposedly does and to determine whether the word embodies in and of itself any concept(s) acceptable to western conventional (allopathic) medicine. Special attention was paid to the reported pharmacological effects of the 'adaptogen-containing plant' Eleutherococcus senticosus (Rupr. & Maxim.) Maxim. (Araliaceae), referred to by some as 'Siberian ginseng', and to its secondary chemical composition. We conclude that so far as specific pharmacological activities are concerned there are a number of valid arguments for equating the action of so-called adaptogens with those of medicinal agents that have activities as anti-oxidants, and/or anti-cancerogenic, immunomodulatory and hypocholesteroletic as well as hypoglycemic and choleretic action. However, 'adaptogens' and 'anti-oxidants' etc. also show significant dissimilarities and these are discussed. Significantly, the classical definition of an adaptogen has much in common with views currently being invoked to describe and explain the 'placebo effect'. Nevertheless, the chemistry of the secondary compounds of Eleutherococcus isolated thus far and their pharmacological effects support our hypothesis that the reported beneficial effects of adaptogens derive from their capacity to exert protective and/or inhibitory action against free radicals. An inventory of the secondary substances contained in Eleutherococcus discloses a potential for a wide range of activities reported from work on cultured cell lines
Anthony, Christopher J; DiPerna, James C; Lei, Pui-Wa
2016-04-01
Measurement efficiency is an important consideration when developing behavior rating scales for use in research and practice. Although most published scales have been developed within a Classical Test Theory (CTT) framework, Item Response Theory (IRT) offers several advantages for developing scales that maximize measurement efficiency. The current study provides an example of using IRT to maximize rating scale efficiency with the Social Skills Improvement System - Teacher Rating Scale (SSIS - TRS), a measure of student social skills frequently used in practice and research. Based on IRT analyses, 27 items from the Social Skills subscales and 14 items from the Problem Behavior subscales of the SSIS - TRS were identified as maximally efficient. In addition to maintaining similar content coverage to the published version, these sets of maximally efficient items demonstrated similar psychometric properties to the published SSIS - TRS.
Calvert, Kristin
2015-01-01
Despite the prevalence of academic libraries adopting web-scale discovery tools, few studies have quantified their effect on the use of library collections. This study measures the impact that EBSCO Discovery Service has had on use of library resources through circulation statistics, use of electronic resources, and interlibrary loan requests.…
Calvert, Kristin
2015-01-01
Despite the prevalence of academic libraries adopting web-scale discovery tools, few studies have quantified their effect on the use of library collections. This study measures the impact that EBSCO Discovery Service has had on use of library resources through circulation statistics, use of electronic resources, and interlibrary loan requests.…
Gil eScaglioni
2016-02-01
Full Text Available This study aimed at testing the hypothesis that differences in neural activation strategy during submaximal but not maximal plantarflexions exist between young and older men. Eleven young men (YM, 26±4 yr and 13 OM (76±3 yr volunteered for the investigation. Maximal voluntary torque (MVT was 38.2%, lower (P<0.001 in OM than in YM, while voluntary activation was equivalent (~97%. The relationship between the interpolated twitch-torque and the voluntary torque (IT-VT relationship was composite (curvilinear+exponential for both age-groups. However, the OM showed accentuated concavity, as attested by the occurrence of the deviation from linearity at a lower contraction intensity (OM: 54.9 vs. YM: 71.9% MVT. In conclusion, ageing does not affect the capacity to fully activate the plantar flexors during maximal performances, but it alters the activation pattern for submaximal levels of effort. The greater age-related concavity of the IT-VT relationship suggests that, during submaximal contractions, OM need to reach a level of activation higher than YM to develop an equivalent relative torque.