Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Pattern-matching engine.
Статті в журналах з теми "Pattern-matching engine"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Pattern-matching engine".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Peng, Zhan, Yuping Wang, and Wei Yue. "A Fast Engine for Multi-String Pattern Matching." International Journal of Pattern Recognition and Artificial Intelligence 31, no. 12 (September 17, 2017): 1750039. http://dx.doi.org/10.1142/s0218001417500392.
Повний текст джерелаАнотація:
Multi-string matching (MSM) is a core technique searching a text string for all occurrences of some string patterns. It is widely used in many applications. However, as the number of string patterns increases, most of the existing algorithms suffer from two issues: the long matching time, and the high memory consumption. To address these issues, in this paper, a fast matching engine is proposed for large-scale string matching problems. Our engine includes a filter module and a verification module. The filter module is based on several bitmaps which are responsible for quickly filtering out the invalid positions in the text, while for each potential matched position, the verification module confirms true pattern occurrence. In particular, we design a compact data structure called Adaptive Matching Tree (AMT) for the verification module, in which each tree node only saves some pattern fragments of the whole pattern set and the inner structure of each tree node is chosen adaptively according to the features of the corresponding pattern fragments. This makes the engine time and space efficient. The experiments indicate that, our matching engine performs better than the compared algorithms, especially for large pattern sets.
2
Ko, Kwang-Man, and Hong-Jin Park. "Development of the Pattern Matching Engine using Regular Expression." Journal of the Korea Contents Association 8, no. 2 (February 28, 2008): 33–40. http://dx.doi.org/10.5392/jkca.2008.8.2.033.
Повний текст джерела
3
LIU, Wei, Yuan-bo GUO, and Peng HUANG. "Pattern matching engine based on multi-dimensional bloom filters." Journal of Computer Applications 31, no. 1 (March 21, 2011): 107–9. http://dx.doi.org/10.3724/sp.j.1087.2011.00107.
Повний текст джерела
4
Chen, Z., Y. Zhang, Z. Chen, and A. Delis. "A Digest and Pattern Matching-Based Intrusion Detection Engine." Computer Journal 52, no. 6 (April 15, 2009): 699–723. http://dx.doi.org/10.1093/comjnl/bxp026.
Повний текст джерела
5
Tran, Thinh Ngoc. "CPM: CUCKOO-BASED PATTERN MATCHING APPLIED FOR NIDS." Science and Technology Development Journal 14, no. 2 (June 30, 2011): 53–61. http://dx.doi.org/10.32508/stdj.v14i2.1909.
Повний текст джерелаАнотація:
This paper describes the Cuckoo-based Pattern Matching (CPM) engine which based on a recently developed hashing algorithm called Cuckoo Hashing. We implemented the improved parallel Cuckoo Hashing suitable for hardware-based multi-pattern matching with arbitrary length. CPM is scalable with multi-character per clock cycle to sustain higher throughput rates with lower hardware resources. With the power of massively parallel processing, the speedup of CPM is up to 128X as compared with serial Cuckoo implementation. Compared to other hardware systems, CPM is far better in performance and save 30% of the area compared with the best system.
6
THINH, Tran Ngoc, Surin KITTITORNKUN, and Shigenori TOMIYAMA. "PAMELA: Pattern Matching Engine with Limited-Time Update for NIDS/NIPS." IEICE Transactions on Information and Systems E92-D, no. 5 (2009): 1049–61. http://dx.doi.org/10.1587/transinf.e92.d.1049.
Повний текст джерела
7
Hieu, Tran Trung, and Tran Ngoc Thinh. "mDFA: A Memory Efficient DFA-Based Pattern Matching Engine on FPGA." Wireless Personal Communications 78, no. 4 (September 2, 2014): 1833–47. http://dx.doi.org/10.1007/s11277-014-2047-x.
Повний текст джерела
8
Huang, Yu Hsiu, Richard Chun Hung Lin, Ying Chih Lin, and Cheng Yi Lin. "GPU Computation for Online Realtime Multi-Pattern Matching." Applied Mechanics and Materials 284-287 (January 2013): 3428–32. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.3428.
Повний текст джерелаАнотація:
Most applications of traditional full-text search, e.g., webpage search, are offline which exploit text search engine to preview the texts and set up related index. However, applications of online realtime full-text search, e.g., network Intrusion detection and prevention systems (IDPS) are too hard to implementation by using commodity hardware. They are expensive and inflexible for more and more occurrences of new virus patterns and the text cannot be previewed and the search must be complete realtime online. Additionally, IDPS needs multi-pattern matching, and then malicious packets can be removed immediately from normal ones without degrading the network performance. Considering the problem of realtime multi-pattern matching, we implement two sequential algorithms, Wu-Manber and Aho-Corasick, respectively over GPU parallel computation platform. Both pattern matching algorithms are quite suitable for the cases with a large amount of patterns. In addition, they are also easier extendable over GPU parallel computation platform to satisfy realtime requirement. Our experimental results show that the throughput of GPU implementation is about five to seven times faster than CPU. Therefore, pattern matching over GPU offers an attractive solution of IDPS to speed up malicious packets detection among the normal traffic by considering the lower cost, easy expansion and better performance.
9
Hoeltzel, D. A., and Wei-Hua Chieng. "Pattern Matching Synthesis as an Automated Approach to Mechanism Design." Journal of Mechanical Design 112, no. 2 (June 1, 1990): 190–99. http://dx.doi.org/10.1115/1.2912592.
Повний текст джерелаАнотація:
A new knowledge-based approach for the synthesis of mechanisms, referred to as Pattern Matching Synthesis, has been developed based on a combination of committee machine and Hopfield neutral network models of pattern classification and matching applied to coupler curves. Computational tests performed on a dimensionally-parameterized four bar mechanism have yielded 15 distinct coupler curve groups (patterns) from a total of 356 generated coupler curves. This innovative approach represents a first step toward the automation of mapping structure-to-function in mechanism design based on the application of artificial intelligence programing techniques. Demonstrative examples of its application to “real-world” mechanism synthesis problems, including the design and evaluation of a two-stroke pump mechanism and the redesign of a variable-stroke engine mechanism have been included, establishing its viability for creative mechanism synthesis.
10
Jing, Zhou. "Research on the Shift Strategy for the Traction Vehicle with Automatic Transmission." E3S Web of Conferences 198 (2020): 03029. http://dx.doi.org/10.1051/e3sconf/202019803029.
Повний текст джерелаАнотація:
Firstly, according to the working characteristic diagram of engine and hydraulic torque converter, the matching working point is found. On this basis, the theoretical model of gear shifting law is derived when the engine and the hydraulic torque converter work together by taking the acceleration of adjacent two gears equal as the shift point. Finally, the theoretical model is simulated, the shift pattern diagram of tractor automatic transmission is obtained and the shift pattern diagram is analyzed, and the results are of important reference value for further study of shift delay and other characteristics.
11
Zhou, Li Hua. "A Network Intrusion Detection System with Improved SBOM Algorithm." Applied Mechanics and Materials 336-338 (July 2013): 2419–22. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.2419.
Повний текст джерелаАнотація:
The efficiency of pattern matching algorithm used in detection engine decides the performance of intrusion detection system. This paper improves the data structure of SBOM Algorithm, which is well-known keyword matching algorithm, by adding or removing keywords dynamically. The results of experiments on 1999 DARPA intrusion Detection Evaluation Data Sets indicate that the implemented NIDS(Network Intrusion Detection System) is comparatively excellent for large keyword sets.
12
Domarco, David, and Ni Made Satvika Iswari. "Rancang Bangun Aplikasi Chatbot Sebagai Media Pencarian Informasi Anime Menggunakan Regular Expression Pattern Matching." Jurnal ULTIMATICS 9, no. 1 (August 7, 2017): 19–24. http://dx.doi.org/10.31937/ti.v9i1.559.
Повний текст джерелаАнотація:
Technology development has affected many areas of life, especially the entertainment field. One of the fastest growing entertainment industry is anime. Anime has evolved as a trend and a hobby, especially for the population in the regions of Asia. The number of anime fans grow every year and trying to dig up as much information about their favorite anime. Therefore, a chatbot application was developed in this study as anime information retrieval media using regular expression pattern matching method. This application is intended to facilitate the anime fans in searching for information about the anime they like. By using this application, user can gain a convenience and interactive anime data retrieval that can’t be found when searching for information via search engines. Chatbot application has successfully met the standards of information retrieval engine with a very good results, the value of 72% precision and 100% recall showing the harmonic mean of 83.7%. As the application of hedonic, chatbot already influencing Behavioral Intention to Use by 83% and Immersion by 82%.
Index Terms—anime, chatbot, information retrieval, Natural Language Processing (NLP), Regular Expression Pattern Matching
13
Wakaba, Yoichi, Shin'ichi Wakabayashi, Shinobu Nagayama, and Masato Inagi. "An Area Efficient Regular Expression Matching Engine Using Partial Reconfiguration for Quick Pattern Updating." IPSJ Transactions on System LSI Design Methodology 7 (2014): 110–18. http://dx.doi.org/10.2197/ipsjtsldm.7.110.
Повний текст джерела
14
Wang, Kai, and Jun Li. "FREME: A pattern partition based engine for fast and scalable regular expression matching in practice." Journal of Network and Computer Applications 55 (September 2015): 154–69. http://dx.doi.org/10.1016/j.jnca.2015.05.012.
Повний текст джерела
15
Wang, Shuang. "Research and Application of Network Aided Translation Method." Applied Mechanics and Materials 687-691 (November 2014): 1687–90. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.1687.
Повний текст джерелаАнотація:
The paper put forward a new aided translation's pattern, Bilingual Assisted Translation Search Engine. It's different from traditional machine translation, does not rely on the computer's automatic translation, but according to relevant translation list given by system, and get the correct translation by people. Compared with automatic translation machine, it has better quality; compared with artificial translation, it has more efficient. For users, the relevant translation we provide more accurate and matching unless there is a large corpus, so the core of the system is the construction of the bilingual corpus. The paper adopted the method of web data mining and search engine technology, completed the construction of large-scale corpus automatically.
16
Jamshidi, Kasra, and Keval Vora. "A Deeper Dive into Pattern-Aware Subgraph Exploration with PEREGRINE." ACM SIGOPS Operating Systems Review 55, no. 1 (June 2, 2021): 1–10. http://dx.doi.org/10.1145/3469379.3469381.
Повний текст джерелаАнотація:
Graph mining workloads aim to extract structural properties of a graph by exploring its subgraph structures. PEREGRINE is a general-purpose graph mining system that provides a generic runtime to efficiently explore subgraph structures of interest and perform various graph mining analyses. It takes a 'pattern-aware' approach by incorporating a pattern-based programming model along with efficient pattern matching strategies. The programming model enables easier expression of complex graph mining use cases and enables PEREGRINE to extract the semantics of patterns. By analyzing the patterns, PEREGRINE generates efficient exploration plans which it uses to guide its subgraph exploration. In this paper, we present an in-depth view of the patternanalysis techniques powering the matching engine of PEREGRINE. Beyond the theoretical foundations from prior research, we expose opportunities based on how the exploration plans are evaluated, and develop key techniques for computation reuse, enumeration depth reduction, and branch elimination. Our experiments show the importance of patternawareness for scalable and performant graph mining where the presented new techniques speed up the performance by up to two orders of magnitude on top of the benefits achieved from the prior theoretical foundations that generate the initial exploration plans.
17
Xiao, Fuyuan. "An Intelligent Complex Event Processing withDNumbers under Fuzzy Environment." Mathematical Problems in Engineering 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/3713518.
Повний текст джерелаАнотація:
Efficient matching of incoming mass events to persistent queries is fundamental to complex event processing systems. Event matching based on pattern rule is an important feature of complex event processing engine. However, the intrinsic uncertainty in pattern rules which are predecided by experts increases the difficulties of effective complex event processing. It inevitably involves various types of the intrinsic uncertainty, such as imprecision, fuzziness, and incompleteness, due to the inability of human beings subjective judgment. Nevertheless,Dnumbers is a new mathematic tool to model uncertainty, since it ignores the condition that elements on the frame must be mutually exclusive. To address the above issues, an intelligent complex event processing method withDnumbers under fuzzy environment is proposed based on the Technique for Order Preferences by Similarity to an Ideal Solution (TOPSIS) method. The novel method can fully support decision making in complex event processing systems. Finally, a numerical example is provided to evaluate the efficiency of the proposed method.
18
Liu, Rui, Yuqin Wang, and Jing Zou. "Research on the Transformation from Financial Accounting to Management Accounting Based on Drools Rule Engine." Computational Intelligence and Neuroscience 2022 (April 20, 2022): 1–8. http://dx.doi.org/10.1155/2022/9445776.
Повний текст джерелаАнотація:
With the development of Internet economy and the advent of artificial intelligence era, the transformation from financial accounting to management accounting has become an inevitable trend of financial management among companies. In this paper, the significance of the transformation from financial accounting to management accounting is expounded under the background of artificial intelligence, and the current situation, problems and reasons of the transition are analyzed. In addition, the development of self-management accounting system based on Drools rule engine is put forward, including rule management, rule engine and so on. The core processes such as pattern matching and auto-billing are analyzed, and then the core subsystems such as data receiving and processing, accounting rule engine are designed in detail. Finally, the technological advancement and structural stability of this system are discussed, which can provide reference for promoting the transformation from financial accounting to management accounting under artificial intelligence.
19
Kasinathan, Vinothini, Aida Mustapha, Mohamad Firdaus Che Abdul Rani, and Salama A. Mostafa. "The role of chatterbots in enhancing tourism: a case study of Penang tourism spots." IAES International Journal of Artificial Intelligence (IJ-AI) 9, no. 4 (December 1, 2020): 569. http://dx.doi.org/10.11591/ijai.v9.i4.pp569-575.
Повний текст джерелаАнотація:
Chatterbots have been widely used as a tool for conversational booking assistance mainly for hotels such as the Expedia. This paper extends the use of chatterbot beyond booking by presenting the proof of concept of a chatterbot expert system called the VIZARD. The proposed VIZARD is developed using an expert system shell called verbot. The core of Vertbot 5 is the natural language processing (NLP) engine based on pattern matching. The core Verbot 5 engine is responsible for finding matches to a given user input string and firing the appropriate rule. The findings from the user acceptance test concluded that majority of the respondents agreed that the VIZARD expert system stands at an unbiased state while being more aligned on supporting the usefulness of the system.
20
Nagarajan, R., S. Siva Balan, R. Sabarinathan, M. Kirti Vaishnavi, and K. Sekar. "Fragment Finder 2.0: a computing server to identify structurally similar fragments." Journal of Applied Crystallography 45, no. 2 (February 9, 2012): 332–34. http://dx.doi.org/10.1107/s0021889812001501.
Повний текст джерелаАнотація:
Fragment Finder 2.0is a web-based interactive computing server which can be used to retrieve structurally similar protein fragments from 25 and 90% nonredundant data sets. The computing server identifies structurally similar fragments using the protein backbone Cα angles. In addition, the identified fragments can be superimposed using either of the two structural superposition programs,STAMPandPROFIT, provided in the server. The freely available Java plug-inJmolhas been interfaced with the server for the visualization of the query and superposed fragments. The server is the updated version of a previously developed search engine and employs an in-house-developed fast pattern matching algorithm. This server can be accessed freely over the World Wide Web through the URL http://cluster.physics.iisc.ernet.in/ff/.
21
Verykokou, Styliani, Argyro-Maria Boutsi, and Charalabos Ioannidis. "Mobile Augmented Reality for Low-End Devices Based on Planar Surface Recognition and Optimized Vertex Data Rendering." Applied Sciences 11, no. 18 (September 20, 2021): 8750. http://dx.doi.org/10.3390/app11188750.
Повний текст джерелаАнотація:
Mobile Augmented Reality (MAR) is designed to keep pace with high-end mobile computing and their powerful sensors. This evolution excludes users with low-end devices and network constraints. This article presents ModAR, a hybrid Android prototype that expands the MAR experience to the aforementioned target group. It combines feature-based image matching and pose estimation with fast rendering of 3D textured models. Planar objects of the real environment are used as pattern images for overlaying users’ meshes or the app’s default ones. Since ModAR is based on the OpenCV C++ library at Android NDK and OpenGL ES 2.0 graphics API, there are no dependencies on additional software, operating system version or model-specific hardware. The developed 3D graphics engine implements optimized vertex-data rendering with a combination of data grouping, synchronization, sub-texture compression and instancing for limited CPU/GPU resources and a single-threaded approach. It achieves up to 3× speed-up compared to standard index rendering, and AR overlay of a 50 K vertices 3D model in less than 30 s. Several deployment scenarios on pose estimation demonstrate that the oriented FAST detector with an upper threshold of features per frame combined with the ORB descriptor yield best results in terms of robustness and efficiency, achieving a 90% reduction of image matching time compared to the time required by the AGAST detector and the BRISK descriptor, corresponding to pattern recognition accuracy of above 90% for a wide range of scale changes, regardless of any in-plane rotations and partial occlusions of the pattern.
22
Boutsi, A. M., S. Verykokou, S. Soile та C. Ioannidis. "Α PATTERN-BASED AUGMENTED REALITY APPLICATION FOR THE DISSEMINATION OF CULTURAL HERITAGE". ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences VIII-M-1-2021 (27 серпня 2021): 57–63. http://dx.doi.org/10.5194/isprs-annals-viii-m-1-2021-57-2021.
Повний текст джерелаАнотація:
Abstract. Augmented Reality (AR) is more than an added value for Cultural Heritage (CH); it is vital for its sustainability, promotion and dissemination, increasing accessibility in CH even during difficult periods of time, like the Covid-19 pandemic. In order to be meaningful and engaging, an AR application should have the following characteristics: easiness of use, high-quality representations and compatibility. This paper presents a marker-less mobile AR application for the display and inspection of high-resolution 3D cultural assets, overlayed on a particular location in the real-world scene. Instead of predefined markers, an image captured by the user is exploited as a pattern for real-time feature matching, pose estimation and scene augmentation. Our approach is based on pure computer vision and photogrammetric techniques, implemented using native C++ and Java code for Android mobile platforms. It is built with the use of the OpenCV library and the OpenGL ES graphics API without any dependencies of AR Software Development Kits (SDKs). Therefore, it supports cross-vendor portability regarding mobile model devices and hardware specifications. The evaluation of the developed application examines the performance of various matching techniques and the overall responsiveness of processing and 3D rendering on mid-range and low-end smartphones. The results showcase the reliability and responsiveness of the pattern recognition as well as the potential of the 3D graphics engine to render and overlay complex 3D models balancing between visual quality and time. The proposed methodology is applied to the Ciborium of the church of St. Charalabos, located at St. Stephen’s Monastery in Meteora, Greece.
23
Yang, Yi-Hua E., and Viktor K. Prasanna. "Software Toolchain for Large-Scale RE-NFA Construction on FPGA." International Journal of Reconfigurable Computing 2009 (2009): 1–10. http://dx.doi.org/10.1155/2009/301512.
Повний текст джерелаАнотація:
We present a software toolchain for constructing large-scaleregular expression matching(REM) on FPGA. The software automates the conversion of regular expressions into compact and high-performance nondeterministic finite automata (RE-NFA). Each RE-NFA is described as an RTL regular expression matching engine (REME) in VHDL for FPGA implementation. Assuming a fixed number of fan-out transitions per state, ann-statem-bytes-per-cycle RE-NFA can be constructed inO(n×m)time andO(n×m)memory by our software. A large number of RE-NFAs are placed onto a two-dimensionalstaged pipeline, allowing scalability to thousands of RE-NFAs with linear area increase and little clock rate penalty due to scaling. On a PC with a 2 GHz Athlon64 processor and 2 GB memory, our prototype software constructs hundreds of RE-NFAs used by Snort in less than 10 seconds. We also designed a benchmark generator which can produce RE-NFAs with configurable pattern complexity parameters, including state count, state fan-in, loop-back and feed-forward distances. Several regular expressions with various complexities are used to test the performance of our RE-NFA construction software.
24
Sawsaa, Ahlam F., and Joan Lu. "Modeling Domain Ontology for Occupational Therapy Resources Using Natural Language Programming (NLP) Technology to Model Domain Ontology of Occupational Therapy Resources." International Journal of Information Retrieval Research 3, no. 4 (October 2013): 104–19. http://dx.doi.org/10.4018/ijirr.2013100106.
Повний текст джерелаАнотація:
Creation and development of a formal domain ontology of Ocuupational Therapy (OT) requires the prescription and formal evaluation of the results through specific criteria. Methontology of development ontologies was followed to create OTO ontology, and was implemented by using Protégé- OWL. Accuracy of OTO ontology was assessed using a set of ontology design cretria. This paper describes a software engineering approach to model domain ontology for occupational therapy resources (OT) using Natural Language Programming (NLP) technology. The rules were written to annotate the domain concepts using Java Annotation Patterns Engine (JAPE) grammar. It is used to support regular expression matching and thus annotate OT concepts by using the GATE developer tool. This speeds up the time-consuming development of the ontology, which is important for experts in the domain facing time constraints and high workloads. The rules provide significant results: the pattern matching of OT concepts based on the lookup list produced 403 correct concepts and the accuracy was generally higher. Using NLP technique is a good approach to reducing the domain expert's work, and the results can be evaluated. This study contributes to the understanding of ontology development and evaluation methods to address the knowledge gap of using ontology in the decision support system component of occupational therepy.
25
Ghlala, Riadh, Zahra Kodia, and Lamjed Ben Said. "Enhancing Decision-Making Consistency in Business Process using a Rule-Based Approach." Journal of Telecommunications and the Digital Economy 10, no. 2 (June 10, 2022): 44–61. http://dx.doi.org/10.18080/jtde.v10n2.539.
Повний текст джерелаАнотація:
Decision-making in Business Process is a real challenge, given its technical complexity and organizational impact. Mostly, decision-making is based on business rules fired by an inference engine using facts reflecting the context of the current process task. Focus on a task alone and in isolation from the rest of the process can easily lead to inconsistency in decision-making. In this paper, we aim to improve the importance of consistency of decision-making throughout the process. To fulfill this aim, our contribution is to propose Consistency Working Memory RETE (CWM-RETE): a Framework based on the Rete Algorithm as a pattern-matching algorithm to simulate inference; and MongoDB as a document-oriented database to serialize business rules. This framework enables the compatibility of decision-making throughout the business process. The experimentation is based on the Business Intelligence process as a case study and it is shown that the decision-making process can generate different results depending on whether consistency functionality is enabled or not.
26
Fan, Wenfei, Tao He, Longbin Lai, Xue Li, Yong Li, Zhao Li, Zhengping Qian, et al. "GraphScope." Proceedings of the VLDB Endowment 14, no. 12 (July 2021): 2879–92. http://dx.doi.org/10.14778/3476311.3476369.
Повний текст джерелаАнотація:
GraphScope is a system and a set of language extensions that enable a new programming interface for large-scale distributed graph computing. It generalizes previous graph processing frameworks (e.g. , Pregel, GraphX) and distributed graph databases ( e.g ., Janus-Graph, Neptune) in two important ways: by exposing a unified programming interface to a wide variety of graph computations such as graph traversal, pattern matching, iterative algorithms and graph neural networks within a high-level programming language; and by supporting the seamless integration of a highly optimized graph engine in a general purpose data-parallel computing system. A GraphScope program is a sequential program composed of declarative data-parallel operators, and can be written using standard Python development tools. The system automatically handles the parallelization and distributed execution of programs on a cluster of machines. It outperforms current state-of-the-art systems by enabling a separate optimization (or family of optimizations) for each graph operation in one carefully designed coherent framework. We describe the design and implementation of GraphScope and evaluate system performance using several real-world applications.
27
Dozier, Charles M., and Noureddine Anibou. "An innovative EDXRD verification probe." Powder Diffraction 24, no. 2 (June 2009): 102–6. http://dx.doi.org/10.1154/1.3131802.
Повний текст джерелаАнотація:
Verification of materials is an increasingly important need in pharmaceutical distribution. XStream Systems, Inc. has developed an energy dispersive X-ray diffraction (EDXRD) system which can quickly verify crystalline pharmaceuticals in the distribution cycle. Materials may be in solid or powder form and the technique is nondestructive. Unlike angular X-ray diffraction (AXRD), a “white” X-ray beam between 20 and 80 keV is used. This energetic beam can penetrate through relatively thick materials, diffracting from crystallites within the samples. Materials can be observed even when they are located within opaque, sealed containers. That is, for most cases the drugs can be examined in their sealed, packaged vials without any sample preparation. The tabletop unit uses a confocal geometry to maximize the X-ray intensity from a relatively low-powered, air-cooled X-ray source. The beam is collimated by a circular slit assembly before the sample. A similar slit assembly after the sample collimates the diffracted beam. A single, state-of-the-art, CdTe solid-state detector with a multichannel analyzer is used to process the diffracted signal. This collimation system interrogates a doughnut-shaped volume within the sample under test. One of the design goals was to develop a unit that is capable of performing quick verification or detection of complex materials and mixtures at a number of points along the distribution paths yet can be operated by personnel with minimal scientific knowledge. Rapid identification of unknowns is possible using neural network search algorithms or pattern matching techniques. The Material Recognition Software Engine (MRSE) utilizes a localized SQL database to store and process the raw spectra data. The MRSE takes the sample data and determines if it matches any known patterns within its database. This engine has demonstrated that it can verify a number of drugs within 30 s with better than 97% accuracy.
28
Liu, Hui. "Study of High-Speed Processing for Network Intrusion Detection System." Advanced Materials Research 129-131 (August 2010): 1410–14. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.1410.
Повний текст джерелаАнотація:
With the flouring development of network-application, the importance of network security and its information security has become a greater concern for the computer users. This paper focuses on the study of the speed of detection, which is so far the most challenging problems in network intrusion detection. In practice, double-array hashing space method is applied in order to solve the problem of the big hashing space; according to features of data-package and those of attack-string, hashing -function is selected because of its high speed and efficiency; and the speed of detection is improve through the decrdasd of the times of detection to network package by applying various characteristic-string of the sane length with their corresponding pattern. There are many methods to achieve network security, and intrusion detection technology is a very effective mechanism [1]. It is a technology that could detect the current attack or attack happening inside computer system. At present, there are several different pattern match algorithms that are used for the attack detection of effective load for packet. No matter what optimization is made, they all could not get rid of a weakness: must match item by item for each mode that indicates attack characteristics [2-5]. So the packet to be detected shall be scanned for many times, and the scanning time is equal to the quality of mode; meanwhile, detection system also establish and manage heuristic function for each attack mode, and adjust detection order of attack mode, so system has rather big burden, and has difficulty to promote the detection efficiency. This is the fundamental problem causing low detection efficiency of effective load of packet [6]. Is it possible to design a detection algorithm which could build heuristic function from the perspective of whole attack model base and could detect all the attack models at the same time? This article uses hashing-method to discuss this problem, and finds that the attack probably existing could be found by several scanning for packet. In addition, network intrusion detection rule base is network IDS detection engine using model matching detection method, which is the standard for checking the captured packet. Snort is intrusion detection system based on network. This description method is simple, easy to achieve, and could describe most of the intrusion activities. Therefore, this article adopts the intrusion activity description method of Snort intrusion detection system, and introduces the rule base of Snort intrusion detection system as the rule base of this article for the foundation of design and demonstration of hashing detection scheme.
29
DONG, Qian. "Hardware Based Parallel Phrase Matching Engine in Dictionary Compressor." IEICE Transactions on Information and Systems E101.D, no. 12 (December 1, 2018): 2968–70. http://dx.doi.org/10.1587/transinf.2018pal0001.
Повний текст джерела
30
Tajima, Masanori, Takayuki Kawabata, Tomoe Tomiyama, and Tomohiro Takagi. "Query Expansion Using Conceptual Fuzzy Sets for Search Engines." Journal of Advanced Computational Intelligence and Intelligent Informatics 7, no. 1 (February 20, 2003): 2–5. http://dx.doi.org/10.20965/jaciii.2003.p0002.
Повний текст джерелаАнотація:
We propose a search engine which conceptually matches input keywords and text datas. The conceptual matching is realized by context-dependent keyword expansion using conceptual fuzzy sets. First, we show the necessity and also the problems of applying fuzzy sets to information retrieval. Next, we introduce the usefulness of conceptual fuzzy sets in overcoming those problems, and propose the realization of conceptual fuzzy sets using Hopfield Networks. We also propose the architecture of the search engine which can execute conceptual matching dealing with context-dependent word ambiguity. Finally, we evaluate our proposed method through a simulation of retrieving large number of article datas, and compare the proposed method with the ordinary TF-IDF method. We show that our method can correlate seemingly unrelated input keywords and produce matching text datas, whereas the TF-IDF method cannot.
31
Rexie, J. A. M., Kumudha Raimond, Mythily Murugaaboopathy, D. Brindha, and Henock Mulugeta. "Lightweight Pattern Matching Method for DNA Sequencing in Internet of Medical Things." Computational Intelligence and Neuroscience 2022 (September 8, 2022): 1–16. http://dx.doi.org/10.1155/2022/6980335.
Повний текст джерелаАнотація:
An area of medical science, that is, gaining prominence, is DNA sequencing. Genetic mutations responsible for the disease have been detected using DNA sequencing. The research is focusing on pattern identification methodologies for dealing with DNA-sequencing problems relating to various applications. A few examples of such problems are alignment and assembly of short reads from next generation sequencing (NGS), comparing DNA sequences, and determining the frequency of a pattern in a sequence. The approximate matching of DNA sequences is also well suited for many applications equivalent to the exact matching of the sequence since the DNA sequences are often subject to mutation. Consequently, recognizing pattern similarity becomes necessary. Furthermore, it can also be used in virtually every application that calls for pattern matching, for example, spell-checking, spam filtering, and search engines. According to the traditional approach, finding a similar pattern in the case where the sequence length is ls and the pattern length is lp occurs in O (ls ∗ lp). This heavy processing is caused by comparing every character of the sequence repeatedly with the pattern. The research intended to reduce the time complexity of the pattern matching by introducing an approach named “optimized pattern similarity identification” (OPSI). This methodology constructs a table, entitled “shift beyond for avoiding redundant comparison” (SBARC), to bypass the characters in the texts that are already compared with the pattern. The table pertains to the information about the character distance to be skipped in the matching. OPSI discovers at most spots of similar patterns occur in the sequence (by ignoring è mismatches). The experiment resulted in the time complexity identified as O (ls. è). In comparison to the size of the pattern, the allowed number of mismatches will be much smaller. Aspects such as scalability, generalizability, and performance of the OPSI algorithm are discussed. In comparison with the hamming distance-based approximate pattern matching algorithm, the proposed algorithm is found to be 69% more efficient.
32
Lu, Song Feng, and Hua Zhao. "Dynamic Generalized Suffix Arrays." Applied Mechanics and Materials 263-266 (December 2012): 1398–401. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1398.
Повний текст джерелаАнотація:
Document retrieval is the basic task of search engines, and seize amount of attention by the pattern matching community. In this paper, we focused on the dynamic version of this problem, in which the text insertion and deletion is allowable. By using the generalized suffix array and other data structure, we proposed a new index structure. Our scheme achieved better time complexity than the existing ones, and a bit more space overhead is needed as return.
33
S.DAWOOD, SARHAN. "EMPIRICAL PERFORMANCE EVALUATION OF KNUTH MORRIS PRATT AND BOYER MOORE STRING MATCHING ALGORITHMS." Journal of Duhok University 23, no. 1 (June 1, 2020): 134–43. http://dx.doi.org/10.26682/sjuod.2020.23.1.14.
Повний текст джерелаАнотація:
Manyalgorithms have been proposed for string matching in order to find a specific pattern in a given text. These algorithms have been used in many applications such as software editors, genetics, Internet search engines, natural language processing, etc. Theaim of this paper is to evaluate the performance of two popularalgorithms:BoyerMoore (BM) and KnuthMorrisPratt (KMP) in terms of execution time. The algorithms have been programmed usingJava and Java Microbenchmark Harnessto evaluatetheirexecution timeusinganumber of experimentaltest scenarios.Resultsshowthat the BMalgorithm outperformed the KMPalgorithm in all test scenarios
34
Dendooven, Tom, and Ben F. Luisi. "RNA search engines empower the bacterial intranet." Biochemical Society Transactions 45, no. 4 (July 14, 2017): 987–97. http://dx.doi.org/10.1042/bst20160373.
Повний текст джерелаАнотація:
RNA acts not only as an information bearer in the biogenesis of proteins from genes, but also as a regulator that participates in the control of gene expression. In bacteria, small RNA molecules (sRNAs) play controlling roles in numerous processes and help to orchestrate complex regulatory networks. Such processes include cell growth and development, response to stress and metabolic change, transcription termination, cell-to-cell communication, and the launching of programmes for host invasion. All these processes require recognition of target messenger RNAs by the sRNAs. This review summarizes recent results that have provided insights into how bacterial sRNAs are recruited into effector ribonucleoprotein complexes that can seek out and act upon target transcripts. The results hint at how sRNAs and their protein partners act as pattern-matching search engines that efficaciously regulate gene expression, by performing with specificity and speed while avoiding off-target effects. The requirements for efficient searches of RNA patterns appear to be common to all domains of life.
35
Wen, Tao, Li Sun, and Li Zhu. "The Discussion on the Improved Association Rules Algorithm in Data Mining." Advanced Materials Research 989-994 (July 2014): 1985–88. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1985.
Повний текст джерелаАнотація:
The data mining can help to extract the information and knowledge with potential application value from a huge amount of data. In order to do the date mining scientifically and efficiently, this article provides an improved algorithm based on the classical association rules Aprior algorithm, taking advantage of which, we can engage in the association rules mining of the database to obtain the useful information. The improved algorithm avoids pattern matching and reduces the number of times of visiting the database, thus improves the speed of date mining to some extend.
36
Wang, Xiaojun, and Brendan Cronin. "TCP/IP Reassembly in Network Intrusion Detection and Prevention Systems." International Journal of Information Security and Privacy 8, no. 3 (July 2014): 63–76. http://dx.doi.org/10.4018/ijisp.2014070104.
Повний текст джерелаАнотація:
Deep Packet Inspection (DPI) in Network Intrusion Detection and Prevention Systems (NIDPS) typically involves the matching of packet payloads against attack signatures in the form of fixed strings and regular expressions. As an attack pattern may span multiple IP fragments or TCP segments, accurate DPI requires that the traffic is reassembled prior to analysis of the payload data stream. Although hardware acceleration of the TCP layer, including reassembly, is well known in the form of TCP Offload Engines for Network Interface Cards, only limited research has been conducted into reassembly architectures suited to the particular requirements of DPI systems. The challenging requirements include the tracking and fragment/segment reordering of a potentially very large number of streams in addition to dealing with subtle ambiguities in IP fragmentation and TCP segmentation using target based reassembly or traffic normalization. In this article, the authors present a combined hardware and software architecture which harnesses the resources of the latest FPGA technology to improve on existing research proposals.
37
Semeráth, Oszkár, and Dániel Varró. "Evaluating Well-Formedness Constraints on Incomplete Models." Acta Cybernetica 23, no. 2 (2017): 687–713. http://dx.doi.org/10.14232/actacyb.23.2.2017.15.
Повний текст джерелаАнотація:
In modern modeling tools used for model-driven development, the validation of several well-formedness constraints is continuously been carried out by exploiting advanced graph query engines to highlight conceptual design aws. However, while models are still under development, they are frequently par- tial and incomplete. Validating constraints on incomplete, partial models may identify a large number of irrelevant problems. By switching o the val- idation of these constraints, one may fail to reveal problematic cases which are dicult to correct when the model becomes suciently detailed. Here, we propose a novel validation technique for evaluating well-formed- ness constraints on incomplete, partial models with may and must semantics, e.g. a constraint without a valid match is satisable if there is a completion of the partial model that may satisfy it. To this end, we map the problem of constraint evaluation over partial models into regular graph pattern matching over complete models by semantically equivalent rewrites of graph queries.
38
Liu, Guiqi, Zhihong Qian, and Xue Wang. "An Indoor WLAN Location Algorithm Based on Fingerprint Database Processing." International Journal of Pattern Recognition and Artificial Intelligence 34, no. 10 (January 8, 2020): 2050026. http://dx.doi.org/10.1142/s0218001420500263.
Повний текст джерелаАнотація:
Indoor positioning technology based on the Wireless Local Area Network (WLAN) fingerprinting method is becoming a promising choice as for ubiquitous WLAN infrastructure. The technology mainly compares the received signal strength (RSS) of a mobile device with an RSS fingerprint in the fingerprint database, and uses the matching rule to find the closest match as the estimated position of the device. The quality of the fingerprint database construction can directly affect the positioning results. This work proposes a three-stage fingerprint database processing method. In the first stage, the original fingerprint database is divided into several small sub-fingerprint databases according to the specified rules. In the second stage, every sub-fingerprint database is processed using the principal component analysis method to achieve a reduced dimension fingerprint dataset. In the third stage, the k-d tree method is used to process each dimension-reduced sub-fingerprint database for obtaining a hierarchical sub-fingerprint database. In addition, in the online phase, the best bin first (BBF) method is applied to the search engine of sub-fingerprint database to complete the location determination of the device. This method can improve positioning performance through simulation research.
39
Summers, Joshua D., Bernie Bettig, and Jami J. Shah. "The Design Exemplar: A New Data Structure for Embodiment Design Automation." Journal of Mechanical Design 126, no. 5 (September 1, 2004): 775–87. http://dx.doi.org/10.1115/1.1767179.
Повний текст джерелаАнотація:
A key issue in developing new intelligent computer aided design and manufacturing tools (CAD/CAM) is knowledge representation. Engineering knowledge has been represented in many forms, such as rule sets, design procedures, features, frames, and semantic networks. Some of these are domain dependent, some are query dependent, and some require specialized inferencing engines or solving algorithms, thus providing a severe limitation for exchange and re-use of design knowledge. A standard representation structure that is capable of encapsulating different types of knowledge would be a useful tool. The design exemplar provides a standard representation of mechanical engineering design problem knowledge based upon a canonically derived set of entities and relationships. The data structure of the design exemplar facilitates four basic design tasks: pattern matching, property extraction, design validation, and change propagation. This paper shows that it is possible to map the design exemplar to other representations (procedures, rules, and features). The concept of integrating atomic design exemplars into composite networks for performing complex design tasks is also introduced as a tool for developing and applying the design exemplar in engineering design automation.
40
Yaacob, Norhasniza, Ruzita Abd Talib, Amirah Ismail, and Mohd Izwan Mahmud. "Perceived Barriers to Digitising School- Based Obesity Intervention: An Exploratory Study." Malaysian Journal of Medical Sciences 29, no. 4 (August 29, 2022): 98–119. http://dx.doi.org/10.21315/mjms2022.29.4.10.
Повний текст джерелаАнотація:
Background: Schools serve as a focal point in which to engage students and school communities, including teachers, parents and other healthcare providers (e.g. nutritionists), in implementing obesity interventions. Bringing them together is beneficial to ensuring healthy eating among schoolchildren and to creating healthy school environments. However, there are barriers and success factors related to the implementation of such an intervention. Therefore, this study aimed to explore the barriers and success factors to school-based obesity interventions to improve obesity implementation. Methods: An exploratory case study with multiple units of analysis was conducted, including interviews, document analyses and a survey. The interview sessions involved six participants, including teachers and nutritionists. The survey was conducted among 121 participants involving 30 teachers, 78 parents and 13 school canteen operators. Pattern-matching techniques were employed to formulate the results. Results: The barriers consisted of the school system, parental awareness, staff availability, and children’s compliance. The success factors included the teachers’ role, the nutritional approach used, compliance with the healthy school canteen guidelines, and strong collaboration with the Parent-Teacher Association (PTA) and other agencies. Conclusion: It is necessary to digitise an obesity intervention module with some improvements, including strengthening the broader school community’s role and integrating nutrition education with technology to improve implementation.
41
Zhang, Zhongkai, Jiangjiang Liu, Rongfu Cai, Zhaojun Liu, Jiaming Lei, Ruolin Sun, Ningning Wu, Na Zhao, Bian Tian, and Libo Zhao. "High-Temperature-Sensing Smart Bolt Based on Indium Tin Oxide/In2O3 Thin-Film Thermocouples with Nickel-Based Single-Crystal Superalloy via Screen Printing." Chemosensors 10, no. 9 (August 23, 2022): 347. http://dx.doi.org/10.3390/chemosensors10090347.
Повний текст джерелаАнотація:
In this study, thin-film thermocouples (TFTCs) were combined with a smart bolt to design a smart bolt that can directly test high temperature in service monitoring and parameter calculation for gas turbine structure design. The first-principles calculation was used to analyze the design of the surface properties of nickel-based alloys and insulating layers, and finite element analysis was used to optimize dimension parameters by controlling the thermal stress matching of insulating layers and sensitive layers. The effect of the glass powder with different particle sizes on the microstructure of the ITO and In2O3 films was studied via SEM. The preferred particle size of the additive glass powder is 400 nm. The XRD pattern shows the (222) peak has the highest intensity. The intensities of the (222) and (622) peaks increase after the heat treatment. The calibration results show that the average Seebeck coefficient of the TFTCs can reach 64.9 μV/°C at 1100 °C with a maximum voltage of 71.4 mV. The repeatability error of the cycles of the sensor after heat treatment is ±1.05%. The repeatability of the sensor is up to 98.95%. The smart bolts were tested for application in small aero engines. It can be seen that under the impact of 1000 °C, the thermal response of the prepared smart bolt is better than that of the K-type armored thermocouple, and the thermal balance is achieved faster. The intelligent bolt sensor proposed in this work has better engineering application prospects owing to its convenience of installation in harsh environments.
42
Beebee, Martin D. "Song Sharing by Yellow Warblers Differs Between two Modes of Singing: Implications for Song Function." Condor 104, no. 1 (February 1, 2002): 146–55. http://dx.doi.org/10.1093/condor/104.1.146.
Повний текст джерелаАнотація:
Abstract I investigated the pattern of song sharing for the two singing modes (Type I and Type II) of Yellow Warblers (Dendroica petechia). There is indirect evidence that males use Type I singing to attract females, and Type II singing to interact with other males, but how males use these singing modes for these functions is unknown. One way in which males might use Type II singing to interact with neighboring males is through the use of “shared songs:” males might preferentially sing songs they share with neighboring males to engage in song type matching or repertoire matching. I tested the prediction that Yellow Warblers should share more of their Type II songs with neighbors compared to non-neighbors, but that there should be no such relationship for Type I songs. I found that males in a Pennsylvania population shared significantly more of their Type II song repertoire with neighbors than with non-neighbors, and that sharing between males declined with distance between their territories. There was no spatial relationship for sharing Type I song types. These results are consistent with the hypothesis that Yellow Warblers use Type II singing to interact with other males using strategies such as song type and repertoire matching. Dendroica petechia Comparte sus Cantos de Dos Modos Diferentes: Implicancias para la Función del Canto Resumen. Investigué el modo en que Dendroica petechia comparte sus cantos en relación a dos maneras de cantar (Tipo I y Tipo II). Existe evidencia indirecta que los machos usan cantos de Tipo I para atraer a las hembras y cantos de Tipo II para interactuar con otros machos, pero se desconoce cómo los machos usan estos cantos para estas funciones. Una manera en la que los machos podrían usar cantos de Tipo II para interactuar con machos vecinos es a través del uso de “canciones compartidas:” los machos podrían preferentemente cantar canciones que comparten con machos vecinos para establecer el uso de un tipo de canción o repertorio semejante. Puse a prueba la predicción que D. petechia debería compartir una mayor parte de sus canciones de Tipo II con machos vecinos que con no-vecinos, pero que no debería existir esta relación para canciones de Tipo I. Encontré que los machos de una población de Pensilvania comparten una parte significativamente mayor de su repertorio de canciones de Tipo II con vecinos que con no-vecinos, y que el grado en que los machos comparten canciones disminuye con la distancia entre sus territorios. No hubo una relación espacial en los tipos de canciones compartidas de Tipo I. Estos resultados son consistentes con la hipótesis que D. petechia usa canciones de Tipo II como estrategia para interactuar con otros machos empleando tipo de canciones o repertorios semejantes.
43
Anagnostopoulos, Theodoros. "A Predictive Vehicle Ride Sharing Recommendation System for Smart Cities Commuting." Smart Cities 4, no. 1 (January 27, 2021): 177–91. http://dx.doi.org/10.3390/smartcities4010010.
Повний текст джерелаАнотація:
Smart Cities (or Cities 2.0) are an evolution in citizen habitation. In such cities, transport commuting is changing rapidly with the proliferation of contemporary vehicular technology. New models of vehicle ride sharing systems are changing the way citizens commute in their daily movement schedule. The use of a private vehicle per single passenger transportation is no longer viable in sustainable Smart Cities (SC) because of the vehicles’ resource allocation and urban pollution. The current research on car ride sharing systems is widely expanding in a range of contemporary technologies, however, without covering a multidisciplinary approach. In this paper, the focus is on performing a multidisciplinary research on car riding systems taking into consideration personalized user mobility behavior by providing next destination prediction as well as a recommender system based on riders’ personalized information. Specifically, it proposes a predictive vehicle ride sharing system for commuting, which has impact on the SC green ecosystem. The adopted system also provides a recommendation to citizens to select the persons they would like to commute with. An Artificial Intelligence (AI)-enabled weighted pattern matching model is used to assess user movement behavior in SC and provide the best predicted recommendation list of commuting users. Citizens are then able to engage a current trip to next destination with the more suitable user provided by the list. An experimented is conducted with real data from the municipality of New Philadelphia, in SC of Athens, Greece, to implement the proposed system and observe certain user movement behavior. The results are promising for the incorporation of the adopted system to other SCs.
44
"Parallel Scalable Approximate Matching Algorithm for Network Intrusion Detection Systems." International Arab Journal of Information Technology 18, no. 1 (December 31, 2020). http://dx.doi.org/10.34028/iajit/18/1/9.
Повний текст джерелаАнотація:
Matching algorithms are working to find the exact or the approximate matching between text “T” and pattern “P”, due to the development of a computer processor, which currently contains a set of multi-cores, multitasks can be performed simultaneously. This technology makes these algorithms work in parallel to improve their speed matching performance. Several exact string matching and approximate matching algorithms have been developed to work in parallel to find the correspondence between text “T” and pattern “P”. This paper proposed two models: First, parallelized the Direct Matching Algorithm (PDMA) in multi-cores architecture using OpenMP technology. Second, the PDMA implemented in Network Intrusion Detection Systems (NIDS) to enhance the speed of the NIDS detection engine. The PDMA can be achieved more than 19.7% in parallel processing time compared with sequential matching processing. In addition, the performance of the NIDS detection engine improved for more than 8% compared to the current SNORT-NIDS detection engine
45
KUMARAN, P. MUTHU, R. V. ASHOK PRATHAP, and D. MATHAVAN. "AN EFFICIENT AND SYSTEMATIC VIRUS DETECTION PROCESSOR FOR EMBEDDED NETWORK SECURITY." International Journal of Computer and Communication Technology, July 2015, 185–90. http://dx.doi.org/10.47893/ijcct.2015.1301.
Повний текст джерелаАнотація:
Network security has always been an important issue and its application is ready to perform powerful pattern matching to protect against virus attacks, spam and Trojan horses. However, attacks such as spam, spyware, worms, viruses, and phishing target the application layer rather than the network layer. Therefore, traditional firewalls no longer provide enough protection. However, the solutions in the literature for firewalls are not scalable, and they do not address the difficulty of an antivirus. The goal is to provide a systematic virus detection hardware solution for network security for embedded systems. Instead of placing entire matching patterns on a chip, our solution is based on an antivirus processor that works as much of the filtering information as possible onto a chip. The infrequently accessing off-chip data to make the matching mechanism scalable to large pattern sets. In the first stage, the filtering engine can filter out more than 93.1% of data as safe, using a merged shift table. Only 6.9% or less of potentially unsafe data must be precisely checked in the second stage by the exact-matching engine from off-chip memory. To reduce the memory gap and to improve the performance, we also propose three algorithms are used: 1) a skipping algorithm; 2) a cache method; and 3) a prefetching mechanism.
46
Gong, Lei, Chao Wang, Haojun Xia, Xianglan Chen, Xi Li, and Xuehai Zhou. "Enabling Fast and Memory-efficient Acceleration for Pattern Matching Workloads: the Lightweight Automata Processing Engine." IEEE Transactions on Computers, 2022, 1–14. http://dx.doi.org/10.1109/tc.2022.3187338.
Повний текст джерела
47
SRILATHA, B., and KRISHNA KISHORE. "RECONFIGURABLE SELF-ADDRESSABLE MEMORY-BASED FSM A SCALABLE INTRUSION DETECTION ENGINE." International Journal of Smart Sensor and Adhoc Network., October 2012, 144–51. http://dx.doi.org/10.47893/ijssan.2012.1153.
Повний текст джерелаАнотація:
One way to detect and thwart a network attack is to compare each incoming packet with predefined patterns, also Called an attack pattern database, and raise an alert upon detecting a match. This article presents a novel pattern-matching Engine that exploits a memory-based, programmable state machine to achieve deterministic processing rates that are Independent of packet and pattern characteristics. Our engine is a self addressable memory based finite state machine (samFsm), whose current state coding exhibits all its possible next states. Moreover, it is fully reconfigurable in that new attack Patterns can be updated easily. A methodology was developed to program the memory and logic. Specifically, we merge “non-equivalent” states by introducing “super characters” on their inputs to further enhance memory efficiency without Adding labels. This is the most high speed self addressable memory based fsm.sam-fsm is one of the most storage-Efficient machines and reduces the memory requirement by 60 times. Experimental results are presented to demonstrate the Validity of sam-fsm.
48
Ren, Weijun, Zifeng Wu, and Rong Yang. "Research on Phase Synchronization Strategies for Diesel Engines to Startup Quickly." Journal of Engineering for Gas Turbines and Power 139, no. 5 (January 10, 2017). http://dx.doi.org/10.1115/1.4035227.
Повний текст джерелаАнотація:
Valid and quick phase synchronization is essential to diesel engine operation, with impacts on the starting time and emissions. This paper presents an innovative wheel shape of camshaft with four long teeth and four short teeth, which plays a fundamental role in the proposed phase synchronization strategies. A dynamic validity-check algorithm of camshaft and crankshaft sensor signals is developed as a premise. Specifically, the segment pattern matching method is used in the rapid phase synchronization strategy that is applicable given valid camshaft and crankshaft signals. A combination of trial injections and the pattern matching method is applied when either the camshaft or crankshaft sensor signal is missing in the limp home mode. Bench test results showed that phase synchronization could be realized within 180 crankshaft angles, and that the phase synchronization strategies in the limp home mode were feasible.
49
Narayanan, Govindarajan. "Probabilistic method for impact load estimation by Stochastic Model – a Fan Blade Off event." International Journal of Structural Integrity, August 30, 2022. http://dx.doi.org/10.1108/ijsi-05-2022-0064.
Повний текст джерелаАнотація:
PurposeThe front bearing mount structure in an aero engine has been severely loaded under the fan blade off (FBO) event since imbalance forces at high amplitude but low frequency is transformed to the engine front mount structure. The bearing mount structural forces are estimated by an integrated implicit-explicit analysis process of whole engine model of an aero engine. Since there are many dependent factors which are governing those predicted loads, experimental evidence on FBO is becoming necessary to validate the model used for the load prediction which is more expensive and also time consuming. This paper aims to discuss the above mentioned issues.Design/methodology/approachThe current paper deals with the high impact but low probability nature of FBO load prediction on the bearing mount structure by stochastic approach which could be replaced for FBO experiments which is highly essential for current economic conditions. Several influential factors on the predicted loads have been chosen in the stochastic model and sensitive analysis has also been performed to bring down the variation involved in the predicted load.FindingsThe predicted load by proposed stochastic model is then compared with the experimental results. The conclusion on the predicted load with various dependent influential factors is matching well with certain value of damage factor from planned FBO test event.Research limitations/implicationsLimitation of this paper could be that it does not cover with range of load amplitude and is only applicable for civil small and medium engines.Practical implicationsThe high amplitude but low frequency load pattern is assessed with impact condition by stochastic model.Originality/valueCombining experimental and probabilistic load prediction was never done before and read across from previous engine test program could be effectively performed with stochastic model approach.
50
Lynch, S. P., and K. A. Thole. "The Effect of Combustor-Turbine Interface Gap Leakage on the Endwall Heat Transfer for a Nozzle Guide Vane." Journal of Turbomachinery 130, no. 4 (August 4, 2008). http://dx.doi.org/10.1115/1.2812950.
Повний текст джерелаАнотація:
To enable turbine components to withstand high combustion temperatures, they are cooled by air routed from the compressor, which can leak through gaps between components. These gaps vary in size from thermal expansions that take place. The leakage flow between the interface of the combustor and the turbine, in particular, interacts with the flowfield along the endwall. This study presents measurements of adiabatic cooling effectiveness and heat transfer coefficients on the endwall of a first vane, with the presence of leakage flow through a flush slot upstream of the vane. The effect of axial contraction of the slot width due to thermal expansion of the engine was tested for two blowing rates. Contracting the slot width, while maintaining the slot mass flow, resulted in a larger coolant coverage area and higher effectiveness values, as well as slightly lower heat transfer coefficients. Matching the momentum flux ratio of the leakage flow from the nominal and contracted slot widths lowered both cooling effectiveness and heat transfer coefficients for the contracted slot flow. Comparison of the coolant coverage pattern to the measured endwall shear stress topology indicated that the trajectory of the slot coolant was dictated by the complex endwall flow.