Based on regular expression matching of evaluation of the task performance in WSN: a queue theory approach.
Ontology highlight
ABSTRACT:
SUBMITTER: Wang J
PROVIDER: S-EPMC4226180 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:BackgroundWhile keyword based queries of databases such as Pubmed are frequently of great utility, the ability to use regular expressions in place of a keyword can often improve the results output by such databases. Regular expressions can allow for the identification of element types that cannot be readily specified by a single keyword and can allow for different words with similar character sequences to be distinguished.ResultsA Perl based utility was developed to allow the use of regular expressions in Pubmed searches, thereby improving the accuracy of the searches.ConclusionThis utility was then utilized to create a comprehensive listing of all DFN deafness mutations discussed in Pubmed records containing the keywords "human ear".
| S-EPMC2180167 | biostudies-literature
Project description:BackgroundRegular expression matching (REM) is widely employed as the major tool for deep packet inspection (DPI) applications. For automatic processing, the regular expression patterns need to be converted to a deterministic finite automata (DFA). However, with the ever-increasing scale and complexity of pattern sets, state explosion problem has brought a great challenge to the DFA based regular expression matching. Rule grouping is a direct method to solve the state explosion problem. The original rule set is divided into multiple disjoint groups, and each group is compiled to a separate DFA, thus to significantly restrain the severe state explosion problem when compiling all the rules to a single DFA.ObjectiveFor practical implementation, the total number of DFA states should be as few as possible, thus the data structures of these DFAs can be deployed on fast on-chip memories for rapid access. In addition, to support fast pattern update in some applications, the time cost for grouping should be as small as possible. In this study, we aimed to propose an efficient grouping method, which generates as few states as possible with as little time overhead as possible.MethodsWhen compiling multiple patterns into a single DFA, the number of DFA states is usually greater than the total number of states when compiling each pattern to a separate DFA. This is mainly caused by the semantic overlaps among different rules. By quantifying the interaction values for each pair of rules, the rule grouping problem can be reduced to the maximum k-cut graph partitioning problem. Then, we propose a heuristic algorithm called the one-step greedy (OSG) algorithm to solve this NP-hard problem. What's more, a subroutine named the heuristic initialization (HI) algorithm is devised to further optimize the grouping algorithms.ResultsWe employed three practical rule sets for the experimental evaluation. Results show that the OSG algorithm outperforms the state-of-the-art grouping solutions regarding both the total number of DFA states and time cost for grouping. The HI subroutine also demonstrates its significant optimization effect on the grouping algorithms.ConclusionsThe DFA state explosion problem has became the most challenging issue in the regular expression matching applications. Rule grouping is a practical direction by dividing the original rule sets into multiple disjoint groups. In this paper, we investigate the current grouping solutions, and propose a compact and efficient grouping algorithm. Experiments conducted on practical rule sets demonstrate the superiority of our proposal.
| S-EPMC6200238 | biostudies-literature
Project description:BackgroundThe Gene Ontology and its associated annotations are critical tools for interpreting lists of genes. Here, we introduce a method for evaluating the Gene Ontology annotations and structure based on the impact they have on gene set enrichment analysis, along with an example implementation. This task-based approach yields quantitative assessments grounded in experimental data and anchored tightly to the primary use of the annotations.ResultsApplied to specific areas of biological interest, our framework allowed us to understand the progress of annotation and structural ontology changes from 2004 to 2012. Our framework was also able to determine that the quality of annotations and structure in the area under test have been improving in their ability to recall underlying biological traits. Furthermore, we were able to distinguish between the impact of changes to the annotation sets and ontology structure.ConclusionOur framework and implementation lay the groundwork for a powerful tool in evaluating the usefulness of the Gene Ontology. We demonstrate both the flexibility and the power of this approach in evaluating the current and past state of the Gene Ontology as well as its applicability in developing new methods for creating gene annotations.
| S-EPMC3633003 | biostudies-literature
Project description:Exhaust gas recirculation (EGR) is one of the main methods of reducing NOX emissions and has been widely used in marine diesel engines. This paper proposes an optimized comprehensive assessment method based on multi-objective grey situation decision theory, grey relation theory and grey entropy analysis to evaluate the performance and optimize rate determination of EGR, which currently lack clear theoretical guidance. First, multi-objective grey situation decision theory is used to establish the initial decision-making model according to the main EGR parameters. The optimal compromise between diesel engine combustion and emission performance is transformed into a decision-making target weight problem. After establishing the initial model and considering the characteristics of EGR under different conditions, an optimized target weight algorithm based on grey relation theory and grey entropy analysis is applied to generate the comprehensive evaluation and decision-making model. Finally, the proposed method is successfully applied to a TBD234V12 turbocharged diesel engine, and the results clearly illustrate the feasibility of the proposed method for providing theoretical support and a reference for further EGR optimization.
| S-EPMC5788385 | biostudies-literature
Project description:Individuals vary greatly in their willingness to select and persist in effortful tasks, even when high-effort will knowingly result in high-reward. Individuals who select and successively complete effortful, goal-directed tasks can be described as industrious. Trying to increase one's industriousness is desirable from a productivity standpoint, yet intrinsically challenging given that effort expenditure is generally aversive. Here we show that in laboratory rats, a basic physical exercise regimen (20 min/day, five days/week) is sufficient to increase industriousness across a battery of subsequent testing tasks. Exercised rats outperformed their non-exercised counterparts in tasks designed to tax effort expenditure, strategic decision-making, problem solving and persistence. These increases in performance led to quicker reward obtainment and greater reward gain over time, and could not be accounted for simply by increased locomotor activity. Our results suggest that a basic exercise regimen can enhance effortful goal-directed behaviour in goal-directed tasks, which highlights a potential productivity benefit of staying physically active.
| S-EPMC4470589 | biostudies-literature
Project description:Expected utility models are often used as a normative baseline for human performance in motor tasks. However, this baseline ignores computational costs that are incurred when searching for the optimal strategy. In contrast, bounded rational decision-theory provides a normative baseline that takes computational effort into account, as it describes optimal behavior of an agent with limited information-processing capacity to change a prior motor strategy (before information-processing) into a posterior strategy (after information-processing). Here, we devised a pointing task where subjects had restricted reaction and movement time. In particular, we manipulated the permissible reaction time as a proxy for the amount of computation allowed for planning the movements. Moreover, we tested three different distributions over the target locations to induce different prior strategies that would influence the amount of required information-processing. We found that movement endpoint precision generally decreases with limited planning time and that non-uniform prior probabilities allow for more precise movements toward high-probability targets. Considering these constraints in a bounded rational decision model, we found that subjects were generally close to bounded optimal. We conclude that bounded rational decision theory may be a promising normative framework to analyze human sensorimotor performance.
| S-EPMC6302104 | biostudies-literature
Project description:Organisations rely upon group formation to solve complex tasks, and groups often adapt to the demands of the task they face by changing their composition periodically. Previous research has often employed experimental, survey-based, and fieldwork methods to study the effects of group adaptation on task performance. This paper, by contrast, employs an agent-based approach to study these effects. There are three reasons why we do so. First, agent-based modelling and simulation allows to take into account further factors that might moderate the relationship between group adaptation and task performance, such as individual learning and task complexity. Second, such an approach allows to study large variations in the variables of interest, which contributes to the generalisation of our results. Finally, by employing an agent-based approach, we are able to study the longitudinal effects of group adaptation on task performance. Longitudinal analyses are often missing in prior related research. Our results indicate that reorganising well-performing groups might be beneficial, but only if individual learning is restricted. However, there are also cases in which group adaptation might unfold adverse effects. We provide extensive analyses that shed additional light on and help explain the ambiguous results of previous research.
| S-EPMC10461837 | biostudies-literature
Project description:BACKGROUND: Several preprocessing methods are available for the analysis of Affymetrix Genechips arrays. The most popular algorithms analyze the measured fluorescence intensities with statistical methods. Here we focus on a novel algorithm, AffyILM, available from Bioconductor, which relies on inputs from hybridization thermodynamics and uses an extended Langmuir isotherm model to compute transcript concentrations. These concentrations are then employed in the statistical analysis. We compared the performance of AffyILM and other traditional methods both in the old and in the newest generation of GeneChips. RESULTS: Tissue mixture and Latin Square datasets (provided by Affymetrix) were used to assess the performances of the differential expression analysis depending on the preprocessing strategy. A correlation analysis conducted on the tissue mixture data reveals that the median-polish algorithm allows to best summarize AffyILM concentrations computed at the probe-level. Those correlation results are equivalent to the best correlations observed using popular preprocessing methods relying on intensity values. The performances of each tested preprocessing algorithm were quantified using the Latin Square HG-U133A dataset, thanks to the comparison of differential analysis results with the list of spiked genes. The figures of merit generated illustrates that the performances associated to AffyILM(medianpolish), inferred from the present statistical analysis, are comparable to the best performing strategies previously reported. CONCLUSIONS: Converting probe intensities to estimates of target concentrations prior to the statistical analysis, AffyILM(medianpolish) is one of the best performing strategy currently available. Using hybridization theory, probe-level estimates of target concentrations should be identically distributed. In the future, a probe-level multivariate analysis of the concentrations should be compared to the univariate analysis of probe-set summarized expression data.
| S-EPMC3267830 | biostudies-other
Project description:This data is part of a miRNA platform comparison study. We compared the performance characteristics of four commercial miRNA array technologies and found that all platforms performed well in separate measures of performance. The Ambion and Agilent platforms were more accurate, whereas the Illumina and Exiqon platforms were more specific. Furthermore, the data analysis approach had a large impact on the performance, predominantly by improving precision. Performance of four (4) commercially available miRNA platforms was evaluated using 7 placenta samples spiked with synthetic microRNA spikes (in Latin-square design) absent in placenta. Platforms were primarily evaluated for accuracy and specificity.
2010-06-23 | E-GEOD-19248 | biostudies-arrayexpress
Project description:As database management systems expand their array of analytical functionality, they become powerful research engines for biomedical data analysis and drug discovery. Databases can hold most of the data types commonly required in life sciences and consequently can be used as flexible platforms for the implementation of knowledgebases. Performing data analysis in the database simplifies data management by minimizing the movement of data from disks to memory, allowing pre-filtering and post-processing of datasets, and enabling data to remain in a secure, highly available environment. This article describes the Oracle Database 10g implementation of BLAST and Regular Expression Searches and provides case studies of their usage in bioinformatics. http://www.oracle.com/technology/software/index.html.
| S-EPMC540068 | biostudies-literature