Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Regex matching“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Regex matching" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Regex matching"
1
Turoňová, Lenka, Lukáš Holík, Ondřej Lengál, Olli Saarikivi, Margus Veanes und Tomáš Vojnar. „Regex matching with counting-set automata“. Proceedings of the ACM on Programming Languages 4, OOPSLA (13.11.2020): 1–30. http://dx.doi.org/10.1145/3428286.
Der volle Inhalt der Quelle
2
Sopaheluwakan, Christian Ronaldo, und Dian Widiyanto Chandra. „Anti-WebShell PHP Backdoor Scanner pada Linux Server“. ILKOM Jurnal Ilmiah 12, Nr. 2 (27.08.2020): 143–53. http://dx.doi.org/10.33096/ilkom.v12i2.596.143-153.
Der volle Inhalt der QuelleAnnotation:
Backdoor or commonly also known as web shell is one of the malicious software that hackers use to maintain access systems that they have entered. Relatively few programs like Anti Web-Shell, PHP Backdoor Scanner circulating on the Internet, and can be obtained free of charge to deal with the issues above. But most of these programs have no actual database of signature behavior to deal with PHP backdoor / Shell nowadays. Then comes the contemporary Anti Web-Shell program that can deal with today's backdoor shell. This study uses an experimental method concerning previous similar studies and is implemented directly into the world of cyber security professional industries. By enriching the Regex dictionary signature and String Array Matching the actualized Anti Web-Shell program can detect more backdoor than similar programs that have existed in the past. The results of this study are in the form of a web application software in PHP extension. The application can minimize 100% of false positives and is twice as fast in scanning files because it is more specific in heuristic analysis scan.
3
MCAREAVEY, KEVIN, WEIRU LIU, PAUL MILLER und KEDIAN MU. „MEASURING INCONSISTENCY IN A NETWORK INTRUSION DETECTION RULE SET BASED ON SNORT“. International Journal of Semantic Computing 05, Nr. 03 (September 2011): 281–322. http://dx.doi.org/10.1142/s1793351x11001274.
Der volle Inhalt der QuelleAnnotation:
In this preliminary study, we investigate how inconsistency in a network intrusion detection rule set can be measured. To achieve this, we first examine the structure of these rules which are based on Snort and incorporate regular expression (Regex) pattern matching. We then identify primitive elements in these rules in order to translate the rules into their (equivalent) logical forms and to establish connections between them. Additional rules from background knowledge are also introduced to make the correlations among rules more explicit. We measure the degree of inconsistency in formulae of such a rule set (using the Scoring function, Shapley inconsistency values and Blame measure for prioritized knowledge) and compare the informativeness of these measures. Finally, we propose a new measure of inconsistency for prioritized knowledge which incorporates the normalized number of atoms in a language involved in inconsistency to provide a deeper inspection of inconsistent formulae. We conclude that such measures are useful for the network intrusion domain assuming that introducing expert knowledge for correlation of rules is feasible.
4
Zhang, Kevin, und Dina Demner-Fushman. „Automated classification of eligibility criteria in clinical trials to facilitate patient-trial matching for specific patient populations“. Journal of the American Medical Informatics Association 24, Nr. 4 (19.02.2017): 781–87. http://dx.doi.org/10.1093/jamia/ocw176.
Der volle Inhalt der QuelleAnnotation:
Abstract Objective:To develop automated classification methods for eligibility criteria in ClinicalTrials.gov to facilitate patient-trial matching for specific populations such as persons living with HIV or pregnant women. Materials and Methods:We annotated 891 interventional cancer trials from ClinicalTrials.gov based on their eligibility for human immunodeficiency virus (HIV)-positive patients using their eligibility criteria. These annotations were used to develop classifiers based on regular expressions and machine learning (ML). After evaluating classification of cancer trials for eligibility of HIV-positive patients, we sought to evaluate the generalizability of our approach to more general diseases and conditions. We annotated the eligibility criteria for 1570 of the most recent interventional trials from ClinicalTrials.gov for HIV-positive and pregnancy eligibility, and the classifiers were retrained and reevaluated using these data. Results:On the cancer-HIV dataset, the baseline regex model, the bag-of-words ML classifier, and the ML classifier with named entity recognition (NER) achieved macro-averaged F2 scores of 0.77, 0.87, and 0.87, respectively; the addition of NER did not result in a significant performance improvement. On the general dataset, ML + NER achieved macro-averaged F2 scores of 0.91 and 0.85 for HIV and pregnancy, respectively. Discussion and Conclusion:The eligibility status of specific patient populations, such as persons living with HIV and pregnant women, for clinical trials is of interest to both patients and clinicians. We show that it is feasible to develop a high-performing, automated trial classification system for eligibility status that can be integrated into consumer-facing search engines as well as patient-trial matching systems.
5
SCHMIDT-SCHAUß, MANFRED. „Linear pattern matching of compressed terms and polynomial rewriting“. Mathematical Structures in Computer Science 28, Nr. 8 (02.08.2018): 1415–50. http://dx.doi.org/10.1017/s0960129518000208.
Der volle Inhalt der QuelleAnnotation:
We consider term rewriting under sharing in the form of compression by singleton tree grammars (STG), which is more general than the term dags. Algorithms for the subtasks of rewriting are analysed: finding a redex for rewriting by locating a position for a match, performing a rewrite step by constructing the compressed result and executing a sequence of rewrite steps. The first main result is that locating a match of a linear termsin another termtcan be performed in polynomial time ifs,tare both STG-compressed. This generalizes results on matching of STG-compressed terms, matching of straight-line-program-compressed strings with character-variables, where every variable occurs at most once, and on fully compressed matching of strings. Also, for the case wheresis directed-acyclic-graph (DAG)-compressed, it is shown that submatching can be performed in polynomial time. The general case of compressed submatching can be computed in non-deterministic polynomial time, and an algorithm is described that may be exponential in the worst case, its complexity isnO(k), wherekis the number of variables with double occurrences insandnis the size of the input. The second main result is that in case there is an oracle for the redex position, a sequence ofmparallel or single-step rewriting steps under STG-compression can be performed in polynomial time. This generalizes results on DAG-compressed rewriting sequences. Combining these results implies that for an STG-compressed term rewrite system with left-linear rules,mparallel or single-step term rewrite steps can be performed in polynomial time in the input sizenandm.
6
Pereira, Antonio Gualberto, und Luís Eduardo Afonso. „Automatic enrollment and employer match: an experiment with the choice of pension plans“. Revista de Gestão 27, Nr. 3 (02.06.2020): 281–99. http://dx.doi.org/10.1108/rege-07-2019-0077.
Der volle Inhalt der QuelleAnnotation:
PurposeThe purpose of this study is to identify arrangements of fully funded defined contribution (FF-DC) pension plans associated with the continuity of retirement savings.Design/methodology/approachThe authors adopted an experimental design composed of a control group and two treatment groups. In all groups, individuals made decisions throughout nine periods: five during the working period and four at the postretirement stage. The authors asked participants if they wanted to join a pension plan, and which plan. The authors offered three plans with different risk profiles: plan 1 (high risk), plan 2 (moderate) and plan 3 (low risk) and one risk-free plan, plan 4. In treatment groups 1 and 2, there was an automatic enrollment of the participants in the default plan (moderate risk), and in the following periods they had to decide whether to continue contributing, and in this case, to which plan, with a defined percentage.FindingsIn treatment scenarios, participants chose the riskiest plan in all periods of the experiment, and most of them chose the risk-free plan in period 5. These findings suggest that pension plans with automatic enrollment, employer matching and low risk foster the continuation of retirement savings.Research limitations/implicationsThe research has as limitation the fact that the sample is not representative of the population and therefore does not allow generalizations. This is because the authors use social media ads to prospect respondents.Practical implicationsThe research's findings can be relevant for the design of public policies for private pension plans, suggesting that compulsory automatic enrollment can be used as default in plans offered by the employers. The results encourage the inclusion of behavioral elements in the design of the pension system, paying attention to the nudges. In this sense, it is possible to increase participation in the pension plan and develop low cost programs to increase the amount accumulated by people before retirement.Social implicationsDecision-making architecture, such as automatic enrollment, can improve individuals' retirement decisions, affecting savings and welfare in the long run.Originality/valueAlthough the effect of pension plan designs is widely studied in other countries, such as the United States and United Kingdom, the authors are unaware of a national empirical research that seeks to understand how different arrangements affect an individual choice through an experiment.
7
Kang, M. B., und K. A. Thole. „Flowfield Measurements in the Endwall Region of a Stator Vane“. Journal of Turbomachinery 122, Nr. 3 (01.02.1999): 458–66. http://dx.doi.org/10.1115/1.1303703.
Der volle Inhalt der QuelleAnnotation:
A first-stage stator vane experiences high heat transfer rates, particularly near the endwall, where strong secondary flows occur. In order to improve numerical predictions of the complex endwall flow at low-speed conditions, benchmark quality experimental data are required. This study documents the flowfield in the endwall region of a stator vane that has been scaled up by a factor of nine while matching an engine exit Reynolds number of Reex=1.2×106. Laser Doppler velocimeter (LDV) measurements of all three components of the mean and fluctuating velocities are presented for several flow planes normal to the turbine vane. Measurements indicate that downstream of the minimum static pressure location on the suction surface of the vane, an attenuated suction side leg of the horseshoe vortex still exists. At this location, the peak turbulent kinetic energy coincides with the center of the passage vortex location. These flowfield measurements were also related to previously reported convective heat transfer coefficients on the endwall showing that high Stanton numbers occur where the passage vortex brings mainstream fluid toward the vane surface. [S0889-504X(00)00803-5]
8
Bürger, G. „On the verification of climate reconstructions“. Climate of the Past 3, Nr. 3 (11.07.2007): 397–409. http://dx.doi.org/10.5194/cp-3-397-2007.
Der volle Inhalt der QuelleAnnotation:
Abstract. The skill of proxy-based reconstructions of Northern hemisphere temperature is reassessed. Using an almost complete set of proxy and instrumental data of the past 130 years a multi-crossvalidation is conducted of a number of statistical methods, producing a distribution of verification skill scores. Among the methods are multiple regression, multiple inverse regression, total least squares, RegEM, all considered with and without variance matching. For all of them the scores show considerable variation, but previous estimates, such as a 50% reduction of error (RE), appear as outliers and more realistic estimates vary about 25%. It is shown that the overestimation of skill is possible in the presence of strong persistence (trends). In that case, the classical "early" or "late" calibration sets are not representative for the intended (instrumental, millennial) domain. As a consequence, RE scores are generally inflated, and the proxy predictions are easily outperformed by stochastic, a priori skill-less predictions. To obtain robust significance levels the multi-crossvalidation is repeated using stochastic predictors. Comparing the score distributions it turns out that the proxies perform significantly better for almost all methods. The scores of the stochastic predictors do not vanish, nonetheless, with an estimated 10% of spurious skill based on representative samples. I argue that this residual score is due to the limited sample size of 130 years, where the memory of the processes degrades the independence of calibration and validation sets. It is likely that proxy prediction scores are similarly inflated and have to be downgraded further, leading to a final overall skill that for the best methods lies around 20%. The consequences of the limited verification skill for millennial reconstructions is briefly discussed.
9
Kratzer, André, Linda Karrer, Nikolas Dietzel, Franziska Wolff, Manuela Hess, Peter Kolominsky-Rabas und Elmar Gräßel. „Symptombelastung, Inanspruchnahme des Gesundheitssystems und Todesumstände von Menschen mit Demenz in der letzten Lebensphase: der Bayerische Demenz Survey (BayDem)“. Das Gesundheitswesen 82, Nr. 01 (20.12.2019): 50–58. http://dx.doi.org/10.1055/a-1033-7159.
Der volle Inhalt der QuelleAnnotation:
Zusammenfassung Hintergrund Demenz ist in der Regel eine lebenslimitierende Erkrankung. Dennoch fehlen derzeit evidenzbasierte Leitlinien für eine angemessene Palliativversorgung von Menschen mit Demenz (MmD). Ein Grund hierfür ist der Mangel an belastbaren empirischen Daten zu MmD in der letzten Lebensphase. Ziel dieser Untersuchung ist daher, Symptombelastung, Inanspruchnahme des Gesundheitssystems sowie Todesumstände von MmD in der letzten Lebensphase zu beschreiben. Methodik Der Bayerische Demenz Survey (BayDem) war eine multizentrische Längsschnittstudie, die in 3 Regionen Bayerns (Dachau, Erlangen, Kronach) durchgeführt wurde. Teilnehmende waren MmD nach ICD-10 sowie deren pflegende Angehörige. Die Verlaufsdaten wurden in standardisierten, persönlichen Interviews vor Ort erhoben. Es erfolgte ein 1:1-Propensity Score Matching zwischen verstorbenen und nicht verstorbenen MmD. Zur statistischen Analyse wurden McNemar-Tests sowie t-Tests für verbundene Stichproben verwendet. Ergebnisse In der vorliegenden Analyse wurden 58 im Studienzeitraum verstorbene und 58 nicht verstorbene MmD untersucht (n=116). In den meisten Fällen sind MmD zuhause (36,2%), im Krankenhaus (25,9%) oder im Alten-/Pflegeheim (19,0%) verstorben, nie im Rahmen einer Palliativversorgung. Todesursachen waren meist Komplikationen des respiratorischen Systems (13,8%), kardiovaskuläre Komplikationen (12,1%) sowie Schlaganfälle (12,1%). MmD in der letzten Lebensphase wiesen stärker ausgeprägte körperliche Komorbiditäten auf als die übrigen MmD (Charlson-Index: M=2,75 vs. M=1,80; p=0,030, Cohen’s d=0,425) und wurden dementsprechend häufiger in ein Krankenhaus eingewiesen (46,6 vs. 12,1%, p<0,001, OR=6,250) und in einer Notaufnahme (22,4 vs. 3,4%, p=0,007, OR=6,500) behandelt. Psychische und Verhaltensauffälligkeiten waren stark ausgeprägt (NPI-Wert: M=31,67 vs. M=24,77, p=0,118, Cohen’s d=0,303). Ambulante Angebote wurden jedoch selten in Anspruch genommen. Schlussfolgerungen Die Ergebnisse unterstreichen die Notwendigkeit, evidenzbasierte Leitlinien für eine angemessene, den speziellen Bedürfnissen von MmD in der letzten Lebensphase entsprechende, Palliativversorgung zu entwickeln. Die starke Ausprägung an psychischen und Verhaltensauffälligkeiten sollte dabei ebenso wie die stark ausgeprägten körperlichen Komorbiditäten berücksichtigt werden. Angesichts häufiger Krankenhausaufenthalte sollte zudem ein Fokus auf die Entwicklung fachlicher Empfehlungen für den stationären Bereich (Akutkrankenhaus, Palliativstation) gelegt werden.
10
FILINSKI, ANDRZEJ. „Proof-directed program transformation: A functional account of efficient regular expression matching“. Journal of Functional Programming 31 (2021). http://dx.doi.org/10.1017/s0956796820000295.
Der volle Inhalt der QuelleAnnotation:
Abstract We show how to systematically derive an efficient regular expression (regex) matcher using a variety of program transformation techniques, but very little specialized formal language and automata theory. Starting from the standard specification of the set-theoretic semantics of regular expressions, we proceed via a continuation-based backtracking matcher, to a classical, table-driven state machine. All steps of the development are supported by self-contained (and machine-verified) equational correctness proofs.
Dissertationen zum Thema "Regex matching"
1
Horký, Michal. „Rychlejší než grep pomocí čítačů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445473.
Der volle Inhalt der QuelleAnnotation:
Vyhledávání regulárních výrazů má ve vývoji softwaru nezastupitelné místo. Rychlost vyhledávání může ovlivnit použitelnost softwaru, a proto je na ni kladen velký důraz. Pro určité druhy regulárních výrazů mají standardní přístupy pro vyhledávání vysokou složitost. Kvůli tomu jsou náchylné k útokům založeným na vysoké náročnosti vyhledávání regulárních výrazů (takzvané ReDoS útoky). Regulární výrazy s omezeným opakováním, které se v praxi často vyskytují, jsou jedním z těchto druhů. Efektivní reprezentace a rychlé vyhledávání těchto regulárních výrazů je možné s použítím automatu s čítači. V této práci představujeme implementaci vyhledávání regulárních výrazů založeném na automatech s čítači v C++. Vyhledávání je implementováno v rámci RE2, rychlé moderní knihovny pro vyhledávání regulárních výrazů. V práci jsme provedli experimenty na v praxi používaných regulárních výrazech. Výsledky experimentů ukázaly, že implementace v rámci nástroje RE2 je rychleší než původní implementace v jazyce C#.
2
Carlsson, Emil. „Matching in MySQL : A comparison between REGEXP and LIKE“. Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20598.
Der volle Inhalt der QuelleAnnotation:
When needing to search for data in multiple datasets there is a risk that not all da-tasets are of the same type. Some might be in XML-format; others might use a re-lational database. This could frighten developers from using two separate datasets to search for the data in, because of the fact that crafting different search methods for different datasets can be time consuming. One option that is greatly overlooked is the usage of regular expressions. If a search expression is created it can be used in a majority of database engines as a “WHERE” statement and also in other form of data sources such as XML. This option is however, at best, poorly documented and few tests have been made in how it performs against traditional search methods in databases such as “LIKE”. Multiple experiments comparing “LIKE” and “REGEXP” in MySQL have been performed for this paper. The results of these experiments show that the possible overhead by using regular expressions can be motivated when considering the gain of only using one search phrase over several data sources.När behovet att söka over flertalet typer av datakällor finns det alltid en risk att inte alla datakällor är av samma typ. Några kan vara i XML-format; andra kan vara i form av en relationsdatabas. Detta kan avskräcka utvecklare ifrån att använda två oberoende datakällor för att söka efter data, detta för att det kan vara väldigt tidskrävande att utveckla två olika vis att skapa sökmetoderna. Ett alternativ som ofta är förbisett är att använda sig av reguljära uttryck. Om ett sökuttryck är skapat i reguljära uttryck så kan det användas i en majoritet av data-basmotorerna på marknaden som ett ”WHERE” påstående, men det kan även an-vändas i andra typer av datakällor så som XML. Detta alternativ är allt som ofta dåligt dokumenterat och väldigt få tester har ut-förts på prestandan i jämförelse med ”LIKE”. Som grund för denna uppsats har flertalet experiment utförs där ”LIKE” och ”REGEXP” jämförs i en MySQL databas. Försöken visar på att den eventuella försämringen i prestanda kan betala sig vid användande av multipla datatyper.
Bücher zum Thema "Regex matching"
1
Aroraa, Gaurav. Learn C# in 7 days: Get up and running with C# 7 with async main, tuples, pattern matching, LINQ, regex, indexers, and more. Packt Publishing - ebooks Account, 2017.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Regex matching"
1
Alevoor, Praveen, Pratik Sarda und Kalpesh Kapoor. „On Decidability and Matching Issues for Regex Languages“. In Advances in Intelligent Systems and Computing, 137–45. New Delhi: Springer India, 2013. http://dx.doi.org/10.1007/978-81-322-0740-5_18.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Regex matching"
1
Deaton, Sean, David Brownfield, Leonard Kosta, Zhaozhong Zhu und Suzanne J. Matthews. „Real-time regex matching with apache spark“. In 2017 IEEE High-Performance Extreme Computing Conference (HPEC). IEEE, 2017. http://dx.doi.org/10.1109/hpec.2017.8091063.
Der volle Inhalt der Quelle
2
Haghighat, Mohammad Hashem, und Jun Li. „Toward Fast Regex Pattern Matching Using Simple Patterns“. In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2018. http://dx.doi.org/10.1109/padsw.2018.8644606.
Der volle Inhalt der Quelle
3
Kang, M. B., und K. A. Thole. „Flowfield Measurements in the Endwall Region of a Stator Vane“. In ASME 1999 International Gas Turbine and Aeroengine Congress and Exhibition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/99-gt-188.
Der volle Inhalt der QuelleAnnotation:
A first stage stator vane experiences high heat transfer rates particularly near the end wall where strong secondary flows occur. In order to improve numerical predictions of the complex endwall flow at low speed conditions, benchmark quality experimental data are required. This study documents the flowfield in the endwall region of a stator vane that has been scaled up by a factor of nine while matching an engine exit Reynolds number of Reex = 1.2·106. Laser Doppler velocimeter (LDV) measurements of all three components of the mean and fluctuating velocities are presented for several flow planes normal to the turbine vane. Measurements indicate that downstream of the minimum static pressure location on the suction surface of the vane, an attenuated suction side leg of the horseshoe vortex still exists. At this location, the peak turbulent kinetic energy coincides with the center of the passage vortex location. These flowfield measurements were also related to previously reported convective heat transfer coefficients on the endwall showing that high Stanton numbers occur where the passage vortex brings mainstream fluid towards the vane surface.