Rule File Research Articles

Network Security Threat Intelligence Prediction in Network Traffic Analysis Based on Machine Learning

Abstract With the increasingly complex network architecture under the development of information technology, it is more and more difficult to recognize various network traffic. Based on the direction of machine learning for network traffic anomaly detection, this paper proposes a three-stage CNN-LSTM attention mechanism model for feature extraction of original traffic and a PCA-based improvement for spatial feature learning of CNN to construct its anomaly traffic detection model. Meanwhile, based on the abnormal traffic detection, with discriminative network and generative network as the main parts, we propose the cyber security threat intelligence prediction model based on the use of a domain adaptive model to realize the shared representation of source and target domains. In the experiment of the abnormal traffic detection model, the accuracy rate of this paper’s detection model is 93.56%, the check-all rate is 99.2%, the F1 value is 84.9%, and the Kappa value is 80.66%. The detection level in the face of DOS attacks is the highest, with 98.28% and 99.63% checking full rate and checking accuracy, respectively. In the experiments of the network security threat intelligence prediction model, the prediction model of this paper reduces the time consumed by about 72% on average compared to rule file matching in dealing with large-scale network traffic. In high-risk cybersecurity threat attack types, it has an average prediction accuracy of 88.83% and a recall rate of over 90%.

Procedural crowd generation for semantically augmented virtual cities

Authoring meaningful crowds to populate a virtual city can be a cumbersome, time-consuming and an error-prone task. In this work, we present a new framework for authoring populated environments in an easier and faster way, by relying on the use of procedural techniques. Our framework consists of the procedural generation of semantically-augmented virtual cities to drive the procedural generation and simulation of crowds. The main novelty lies in the generation of agendas for each individual inhabitant (alone or as part of a family) by using a rule-based grammar that combines city semantics with the autonomous persons’ characteristics. A new population or city can be authored by editing rule files with the flexibility of reusing, combining or extending the rules of previous populations. The results show how logical and consistent sequences of whereabouts can be easily generated for a crowd providing a good starting point to bring virtual cities to life.

Network Intrusion Detection Method Based on PCA and Bayes Algorithm

Intrusion detection refers to monitoring network data information, quickly detecting intrusion behavior, can avoid the harm caused by intrusion to a certain extent. Traditional intrusion detection methods are mainly focused on rule files and data mining. They have the disadvantage of not being able to detect new types of attacks and have the slow detection speed. To address these issues, an intrusion detection method based on improved PCA combined with Gaussian Naive Bayes was proposed. By weighting the first few feature vectors of the traditional PCA, data pollution can be reduced. The number of final weighted principal components is 2 through sequential selection. The dimensionality reduction of the data is achieved through improved PCA. Finally, the intrusion behaviors were detected by using the Gaussian Naive Bayes classifier. The indexes of detection accuracy, detection time, precision rate, and recall rate were applied to evaluate the results. The experimental results show that, comparing with the traditional Bayes method, the method proposed in this article can reduce the detection time by 60%, shorten it to 0.5s, and increase the detection rate to 91.06%. The mean value of detection accuracy is about 86% by cross-validation.

A Compiled 9-bit 20-MS/s 3.5-fJ/conv.step SAR ADC in 28-nm FDSOI for Bluetooth Low Energy Receivers

This paper presents a low-power 9-bit compiled successive-approximation register (SAR) analog-to-digital converter (ADC) for Bluetooth low energy receivers. The ADC is compiled from a SPICE netlist, a technology rule file, and an object definition file into a design rule check and layout versus schematic clean layout and schematic in 28-nm FDSOI. The compiled SAR ADC reduces the design time necessary to port to a new technology, and to demonstrate technology porting the same SAR ADC architecture is compiled in 28-nm FDSOI with Input/Output (IO) transistors. This paper also includes a comparator clock generation loop that uses the bottom plate of the capacitive digital-to-analog converter. The proposed compiled core transistor SAR ADC achieves the state-of-the-art Figure of Merit (FoM) of 2.7 fJ/conv.step at 2 MS/s, and 3.5 fJ/conv.step at 20 MS/s with an area of 0.00312 mm2.

Detection of Real-Time Event in Intelligent Traffic System Based on RFID

To solve the demand of real-time event detection in the RFID-based Intelligent Transportation Systems , using Complex Event Processing technology to establish a rule model to detect events.The model allows users to customize the Basic Events and Complex Events, using the rule files describe the complex events modes, clearly expressed the timing and gradation relationships between RFID events, meeting the needs of real-time event detection in the Intelligent Transportation System ,achieving the appropriate rules engine,. Finally, test and verify the effectiveness of the rules file and the rules engine model by experiments.

A Framework-Based Approach for Fault-Tolerant Service Robots

Recently the component-based approach has become a major trend in intelligent service robot development due to its reusability and productivity. The framework in a component-based system should provide essential services for application components. However, to our knowledge the existing robot frameworks do not yet support fault tolerance service. Moreover, it is often believed that faults can be handled only at the application level. In this paper, by extending the robot framework with the fault tolerance function, we argue that the framework-based fault tolerance approach is feasible and even has many benefits, including that: 1) the system integrators can build fault tolerance applications from non-fault-aware components; 2) the constraints of the components and the operating environment can be considered at the time of integration, which – cannot be anticipated eaily at the time of component development; 3) consistency in system reliability can be obtained even in spite of diverse application component sources. In the proposed construction, we build XML rule files defining the rules for probing and determining the fault conditions of each component, contamination cases from a faulty component, and the possible recovery and safety methods. The rule files are established by a system integrator and the fault manager in the framework controls the fault tolerance process according to the rules. We demonstrate that the fault-tolerant framework can incorporate widely accepted fault tolerance techniques. The effectiveness and real-time performance of the framework-based approach and its techniques are examined by testing an autonomous mobile robot in typical fault scenarios.

Data Driven CMP Manufacturing Modeling for Process and Design Optimization

A hybrid model for CMP process recipe and IC design optimization is introduced. It combines data mining techniques, CMP physical aspects, and uses existing CMP metrology data. The model has been validated to within 7% of the actual thickness measurements on a test chip, and the simulated topography profiles closely match those measured by an AFM. The hybrid model provides intermediate results for all the process steps, including ECD, bulk, touchdown and barrier removal and runs an order of magnitude faster than physical based model. The calibrated hybrid model has been used for wafer level CMP hotspots detection, CMP process recipe change, optimization, dummy fill generation, and rule file development. A novel CMP metal fill tool is also developed to incorporate a field solver for critical nets RC parasitic and timing impact estimation, and a mechanical model for ultra-low k dielectric mechanical strength consideration in addition to a hybrid model.

Free/Open-Source Resources in the Apertium Platform for Machine Translation Research and Development

Free/Open-Source Resources in the Apertium Platform for Machine Translation Research and DevelopmentThis paper describes the resources available in the Apertium platform, a free/open-source framework for creating rule-based machine translation systems. Resources within the platform take the form of finite-state morphologies for morphological analysis and generation, bilingual transfer lexica, probabilistic part-of-speech taggers and transfer rule files, all in standardised formats. These resources are described and some examples are given of their reuse and recycling in combination with other machine translation systems.

A Bi-directional Bi-Lingual Translation Braille-Text System

Visually impaired people are an integral part of the society. However, their disabilities have made them to have less access to computers, the Internet, and high quality educational software than the people with clear vision. Consequently, they have not been able to improve on their own knowledge, and have significant influence and impact on the economic, commercial, and educational ventures in the society. One way to narrow this widening gap and see a reversal of this trend is to develop a system, within their economic reach, and which will empower them to communicate freely and widely using the Internet or any other information infrastructure. Over time, the Braille system has been used by the visually impaired for communication and contact with the outside world. Translation between one language and another, using the Braille coding system, has been limited, problematic, and in many cases, one-directional.This paper describes an Arabic Braille bi-directional and bi-lingual translation/editor system that does not need expensive equipments. With appropriate rule file for any other languages, this system can be generalized to facilitate communication among literate people regardless of their disabilities (visually impaired or sighted), income, languages, and geographical locations.

Mubser: a bilingual Braille to text translation with an Arabic interface

Purpose – The purpose of this paper is to describe the development of a system called Mubser to translate Arabic and English Braille into normal text. The system can automatically detect the source language and the Braille grade.Design/methodology/approach – Mubser system was designed under the MS‐Windows environment and implemented using Visual C# 2.0 with an Arabic interface. The system uses the concept of rule file to translate supported languages from Braille to text. The rule file is based on XML format. The identification of the source language and grade is based on a statistical approach.Findings – From the literature review, the authors found that most researches and products do not support bilingual translation from Braille to text in either contracted or un‐contracted Braille. Mubser system is a robust system that fills that gap. It helps both visually impaired and sighted people, especially Arabic native speakers, to translate from Braille to text.Research limitations/implications – Mubser is b...

A Rule-Based Expert System for Automatic Error Interpretation Within Ultrasonic Flaw Model Simulators

This paper describes the development of a novel rule-based expert system application that automatically runs a set of theoretical models used to simulate test procedures for ultrasonic testing methods in nondestructive evaluation and interprets their results. Theoretical modeling is an essential tool in verifying that the test procedures are fit for their intended purpose of defect detection. Four validated models are available to simulate theoretical ultrasonic flaw modeling scenarios. Under certain conditions, the models may break down and produce warning flags indicating that results may not be considered accurate. A considerable level of expertise in the theoretical background of the models is required to interpret these flags. The expert system addresses any warning flags encountered by adjusting the original simulation parameters and rerunning the test in order to produce a valid simulation. Warning flags are addressed by a rule file, which contains formal rules developed from knowledge-elicitation sessions with suitably qualified engineers. The rule file represents the action an engineer would adopt to counter highlighted warning flags. A description of the system and rule-base design is given as well as how the system and its performance were validated

Automatic Transformation of Kinetic Equations into S-System and GMA Forms

Canonical models in S-system or GMA form are sets of differential equations which are consistent with a number of specific features of biochemical systems as well as with observations that are common to other branches of biology [3]. While these models are advantageous for their light-weighted structures which let us instantly derive steady-state concentrations of the metabolic intermediates involved, the accurate derivation of the parameters required — the kinetic orders and the rate constants — can become extremely time-consuming and a laborious task to perform manually. For these reasons, we have developed an automation tool to convert the kinetic models written in E-Cell [4] rule files into GMA formed models to be run in PLAS [3].

Design and Development of Software Environment for Whole-Cell Simulation

We have been developing E-CELL3 (E-CELL Simulation Environment Version 3.x) with the goal of establishing a technical framework for whole cell simulation. In this poster, we will describe the design and development of E-CELL3 front-ends, and the mathematical analysis methods of E-CELL3. E-CELL 3 is being developed through reconsideration of the fundamental design and implementation methods for E-CELL 1, which was released two years ago. E-CELL3, as a whole-cell simulation platform, is designed so that development and management may continuously be carried out. E-CELL3 includes many new functions, such as compatibility in a distributed environment, modularized implementation, support of parallel computing, and description of geometric information. E-CELL3 front-ends are written in Python language, and are composed of the following three parts. Session management which manages the processes of simulation and analysis, user interfaces such as GUI and CUI, and various mathematical analysis modules. We are also developing EML (E-CELL Model description Language), which is a language for describing cell models using E-CELL3 simulation environment. In E-CELL1, cell models were constructed using a primitive method of editing the original rule file written via a spread sheet. EML is defined as a subset language of XML. It is able to perform advanced processing, such as error check of a model and compatibility of the data with other MDLs (SBML, CellML and etc ...). In order to show the validity of a cell model, a technique for mathematically verifying a model is required. Therefore, the introduction of various mathematical analysis techniques is indispensable. We have carried out forefront research on mathematical analysis techniques, such as time series analysis / metabolism control theory, and optimization techniques. These methods are implemented as a part of E-CELL 3 front-end. As a result, E-CELL 3 is not just a simulator, but is an integrated software environment for construction and analysis of a cell model. ADDITIONAL AUTHORS Masaru Tomita (Institute for Advanced Biosciences,Department of Environment Information, email address: mt@sfc.keio.ac.jp) REFERENCES [1] Tomita, M., Hashimoto, K., Takahashi, K., Shimizu, T., Matsuzaki, Y., Miyoshi, F., Saito, K., Tanida, S., Yugi, K., Venter, J.C. and huntchison, C., “E-CELL Software environment for whole cell simulation”, Bioinformatics 15(1):72-84, 1999. [2] E-CELL Project: http://www.e-cell.org. [3] Systems Biology Markup Language: http://www.cds.caltech.edu/erato/. [4] CellML: http://www.cellml.org.

The ANALYZE rulebase for supporting LP analysis

This paper describes how to design rules to support linear programming analysis in three functional categories: postoptimal sensitivity, debugging, and model management. The ANALYZE system is used to illustrate the behavior of the rules with a variety of examples. Postoptimal sensitivity analysis answers not only the paradigmWhat if …? question, but also the more frequently askedWhy …? question. The latter is static, asking why some solution value is what it is, or why it is not something else. The former is dynamic, asking how the solution changes if some element is changed. Debugging can mean a variety of things; here the focus is on diagnosing an infeasible instance. Model management includes documentation, verification, and validation. Rules are illustrated to provide support in each of these related functions, including some that require reasoning about the linear program's structure. Another model management function is to conduct a periodic review, with one of the goals being to simplify the model, if possible. The last illustration is how to test new rule files, where there is a variety of ways to communicate a result to someone who is not expert in linear programming.

Formal definitions of edge-based geometric design rules

A structured method for geometric design rule definitions is presented in terms of edge-based constraints. Using this approach, intralayer design rules such as width and spacing of single layers, and interlayer design rules such as clearance, margin, extension, and overlap of two different layers can be specified in terms of two high-level design rule macros only. The tedious and complicated task of specifying detailed design rules in the technology file is thereby eliminated and placed by a simple macro rule file giving a much better overview of the design rules. Efficient rule compilers have been developed to expand these macro descriptions of the design rules onto basic checks for Magic and for corner-based design rule checking. As an example, the MOSIS scalable CMOS design rule set can be described in terms of the two design rule macros only. More complicated design rules, such as conditional and conjunctive design rules, are also discussed. >

Number format conversion: algorithm and VLSI module generator

An algorithm, an architecture and an automatic parametric VLSI design in the form of a module generator for a number format converter used in data processing applications is presented. It converts any fixed point number format to an expansion of the I.E.E.E. standard extended format for floating point number representation and vice versa. The generator accepts any standard cell library and design rule file and can produce the layout, net-list, footprint and delay of the converter for any bit size of the numbers involved.

Rule-based optimization and query processing in an extensible geometric database system

Gral is an extensible database system, based on the formal concept of a many-sorted relational algebra. Many-sorted algebra is used to define any application's query language, its query execution language, and its optimiztion rules. In this paper we describe Gral's optimization component. It provides (1) a sophisticated rule language—rules are transformations of abstract algebra expressions, (2) a general optimization framework under which more specific optimization algorithms can be implemented, and (3) several control mechanisms for the application of rules. An optimization algorithm can be specified as a series of steps. Each step is defined by its own collection of rules together with a selected control strategy. The general facilities are illustrated by the complete design of an example optimizer—in the form of a rule file—for a small nonstandard query language and an associated execution language. The query language includes selection, join, ordering, embedding derived values, aggregate functions, and several geometric operations. The example shows in particular how the special processing techniques of a geometric database systems, such as spatial join methods and geometric index structures, can be integrated into query processing and optimization of a relational database system. A similar, though larger, optimizer is fully functional within the geometric database system implemented as a Gral prototype.