Symbol Table Research Articles

Application of SAFARI in Prediction of Heart Disease

Cardiovascular disease has been the major cause of mortality worldwide for last several decades. Diagnosis of heart disease through traditional approaches is a complex, time consuming and error prone process. To address this issue, several techniques have been proposed to automate the process of diagnosing the heart disease accurately in timely manner. However these techniques report limited accuracy of diagnosing the disease. In this paper SAFARI algorithm is used to diagnose the heart disease. Safari uses rule based approach i.e. it extracts rules from a dataset and uses the extracted rules for diagnosis. The various attribute values are first discretised into specific ranges, each range corresponds to a symbol. This results in a symbol table. Safari extracts rules from this symbol table. The approach has been thoroughly tested on the heart disease dataset publicly available on UCI machine learning repository. The results obtained using this approach are compared with the results of various techniques reported by other authors, a significant improvement was observed.

Correlation, Collocation and Signification in Kurdish Language

This paper deals with tagged (The synergistic, complementary and coding in the indication of the Kurdish language); two parts or two important chapters and two basic language connotation and trading science Pragmatism in language. One of them correlation deals with the meaning of a word or term for a word or other term and it means the partnership with one word to another, which is inherent to it, according to the place and nature of social relations and the inherited customs and traditions, how to form an accompaniment between those two words and similarities. The difference and cross-comparison with the topics of inclusion and all with each other are within semantics. As for the second chapter, we refer to the subject of symbol and coding in language and its economic feasibility and intellectual on the language of the individual and what are the opinions and trends about the symbol in the connotation of the Kurdish language. It is almost the language of the times in living languages, especially developed languages and advanced on others. The subject of the symbol is one of the important topics that occupies a large area in linguistics and what is there is no doubt that since the ancient man used the symbol in various fields. We conclude the search with a table of common symbols between the languages of the world and the results of the most important things that we have come to this search with a list of sources that were used in writing this research.

AI in Human-Computer Interaction

The emergence of human-computer interaction as a concept can be attributed to the progress made in computer technology. Educated and technically proficient young adults often take part in research experiments related to human-computer interaction. The mental model in human-computer interaction is the main topic of this essay. One of the tactics used in this review study is to call attention to current theories, findings, and advancements in HCI. A second strategy is to look for study areas that haven't been explored yet but are falling behind. In order to produce better user-friendly products, this study emphasizes the importance of fidelity prototyping, which highlights the emotional intelligence of the user. This process is still being developed and designed as an automated method. The area of human-computer interaction explores the interactions between people and computers, focusing on the extent to which computers are designed to effectively accommodate human needs and preferences. A user- friendly method of computer access is speech and pattern recognition. The suggested system will launch the speech driver before capturing user input using the microphone. We'll translate the speech input into text. The text input is transformed into tokens by the lexical analyzer and saved in the symbol table. Tokens are fed into the parser, which creates a parse tree. This vocal input can be used to execute various Linux OS commands. The speech will be analyzed for keywords that apply to other activities, and the corresponding command will be carried out. The suggested system will function in both terminal and word processor modes. It will carry out both internal and external commands in terminal mode. When in word processor mode, it will carry out actions like open, type, save, and exit. Operations will be carried out by the system in response to oral commands. Keywords— Human Computer Interaction, Natural Language Processing, Application Program Interface, Speech to text, Emotional intelligence, Interactivity, Younger participants, Fidelity Prototyping.

A TABLE FOR ALL: Eucharist as Model for Radical Welcome and Community

This article considers the Eucharist as a framework for communal life. Rather than a place of privilege or exclusion, the table creates an inclusive vision for how the world should be. It is a ritual of imagination and transformation, reaching beyond the symbolic table into a material world of need. Drawing on the work of Clàudio Carvalhaes, as well as the Eucharistic instructions of Jesus and practices of the early church, I explore the political and communal contours of participating in the holy meal. In this way, Eucharist provides nourishment and sustenance for the work of justice in the world.

The LALR Parser Implementation using Grammar Rules

Syntactic parsing deals with the syntactic structure of a sentence. It refers to the grammatical arrangement of words in a complete sentence. A syntactic analysis of English words will be presented using bottom-up parsing in which the LALR parser defines the best syntax analysis. A compiler is constructed that generates tokens of the identifiers that are characters, alphabets, etc. using a symbol table, checks for the syntax of sentences by dividing them into phrases, generating errors, debugging them, and giving us the correct sentence.

Design and implementation of an efficient program interpreter for industrial robot

Robot program interpreter is an important tool for robot to realize real-time control and fast feedback. In order to simplify the process of robot programming and improve the interpretation efficiency of robot program, an easy-to-use and efficient industrial robot program interpreter is designed and implemented in this paper. The interpreter divides the robot program into two parts: variable definition and instruction call. The process of interpretation includes lexical analysis, syntactic analysis, semantic analysis and instruction interpretation modules. Using flex and bison tools to assist in the generation of lexical and syntactic analysis programs, this paper proposes child-sibling notation (CSN) to construct a syntax tree. In semantic analysis, the red-black tree structure of the map container is used to create a symbol table and record variable information. By the way of presetting type checking codes, errors in the program can be reported and handled. Finally, the interpreter traverses the syntax tree with depth-first algorithm, and calls the corresponding control function while interpreting the instruction sentence to execute the motion of robot. The experimental results show that the designed interpreter has high efficiency and stability in interpreting the robot program and meets the operational requirements of industrial robots.

A Seat at the Table

A Seat at the Table

FSST

Strings are prevalent in real-world data sets. They often occupy a large fraction of the data and are slow to process. In this work, we present Fast Static Symbol Table (FSST), a lightweight compression scheme for strings. On text data, FSST offers decompression and compression speed similar to or better than the best speed-optimized compression methods, such as LZ4, yet offers significantly better compression factors. Moreover, its use of a static symbol table allows random access to individual, compressed strings, enabling lazy decompression and query processing on compressed data. We believe these features will make FSST a valuable piece in the standard compression toolbox.

Implementation of Lexical Analysis on Assignment Statements in C++ Programming Language

A compiler is a computer program that translates computer code written in one programming language (the source language) into another language (the target language). The name compiler is primarily used for programs that translate source code from a high-level programming language to a lower level language [7]. The three main processes of compilation are lexical analysis, syntax analysis and semantic analysis. A compiler has two components, front-end and back-end. Front-end portion of a compiler has to do to main tasks lexical analysis and syntax analysis. On the lexical analysis, input source code are scanned and tokenized into various tokens [6]. In the system, front-end portion of the compiler, lexical analysis is used. There are many token elements in C++ programming language. In this system, line break token, white space tokens (space and tab) and operators (+,-,*,/,=,+= and so on) are used as token elements for the assignment statements of C++ source program. This system is taken all the assignment statements of C++ program as input. Of course, the extracted assignment statements may be literals or values assignment statement (e.g. x=3; or pi= 3.142;), variable assignment statement (e.g. x=y; or x=z;) and expression assignment statement (e.g. a=b+c; or x=y*z; or a=b*(c+d); and produced symbol table, step by step recognized table by using finite state automata and lexeme table.

A light weight FFT based enciphering system for extending the lifetime of mobile ad hoc networks

Message security is most imperative in mobile ad hoc networks because of the applications in circumstances such as, disaster rescue, crisis management and military. Yet, due to the absence of a fixed framework and no centralized administration implementation of security is a testing prospect. Also certain attention must be paid to energy utilization constraints while designing a security mechanism for a mobile ad hoc network. This paper presents a method which considers aforementioned constraints and suggests a non-interactive light weight symmetric key cryptosystem using fast Fourier transform based hashing and generalised symbol table based polyalphabetic substitution. The key computation and secure hashing mechanism strengthen the proposed technique and is proved to be resilient enough against the non-legitimate users with less overhead to participating nodes. The analysis on the proposed technique is performed on various sets of data with different sized network to comprehend the level of security achieved.

New Results on Competitive Analysis of Move To Middle(MTM) List Update Algorithm using Doubly Linked List

On-line algorithm is an emerging area of research since last five decades with immense theoretical and practical significance. Here the sequence of inputs is received and processed by the algorithm one by one in order. At any instant of time, the algorithm has the knowledge of past and present inputs without knowledge of future inputs. Competitive analysis is a standard performance measure for on-line algorithms in which the performance of an on-line algorithm is compared with that of an optimum offline algorithm. List update problem is a well studied research problem in the area of on-line algorithms, which finds applications in data-compression, dictionary maintenance, collision resolution in hash table, symbol table organization in compiler and computing convex hull in computational geometry. From the literature it is known that Move To Front(MTF) is the best performing deterministic list update algorithm using singly linked list in all practical applications. In this paper, we study and analyse the performance of a deterministic on-line list update algorithm known as Move To Middle(MTM) using doubly linked list. We make a first attempt to find the competitive ratio of MTM algorithm, which was only experimentally studied in the literature. In our study by considering doubly linked list as the data structure and a new variant of standard full cost model, we obtain new competitive analysis result and prove that MTM is 2-competitive. From our competitive analysis result, we show that MTM outperforms MTF.

Design and Implementation of the Symbol Table for Object-Oriented Programming Language

Design and Implementation of the Symbol Table for Object-Oriented Programming Language

An adaptive approach for Linux memory analysis based on kernel code reconstruction

Memory forensics plays an important role in security and forensic investigations. Hence, numerous studies have investigated Windows memory forensics, and considerable progress has been made. In contrast, research on Linux memory forensics is relatively sparse, and the current knowledge does not meet the requirements of forensic investigators. Existing solutions are not especially sophisticated, and their complicated operation and limited treatment range are unsatisfactory. This paper describes an adaptive approach for Linux memory analysis that can automatically identify the kernel version and recovery symbol information from an image. In particular, given a memory image or a memory snapshot without any additional information, the proposed technique can automatically reconstruct the kernel code, identify the kernel version, recover symbol table files, and extract live system information. Experimental results indicate that our method runs satisfactorily across a wide range of operating system versions.

A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages

Parsing Expression Grammars are a popular foundation for describing syntax. Unfortunately, several syntax of programming languages are still hard to recognize with pure PEGs. Notorious cases appears: typedef-defined names in C/C++, indentation-based code layout in Python, and HERE document in many scripting languages. To recognize such PEG-hard syntax, we have addressed a declarative extension to PEGs. The "declarative" extension means no programmed semantic actions, which are traditionally used to realize the extended parsing behavior. Nez is our extended PEG language, including symbol tables and conditional parsing. This paper demonstrates that the use of Nez Extensions can realize many practical programming languages, such as C, C\#, Ruby, and Python, which involve PEG-hard syntax.

New trends and Challenges in Source Code Optimization

The front end of a compiler is generally responsible for creating an intermediate representation of the source program whereas the back end of the compiler constructs the desired target program from the intermediate representation and the information in the symbol table. Before the intermediate code is passed to the back end of the compiler, it is necessary to improve the intermediate code so that better target code will result. The code optimization phase in a compiler attempts to improve the target code without changing its output or without side-effects. Today, most of the compiler research is done in the optimization phase. There are many classical techniques (e.g. Eliminating common sub-expressions, Dead-Code elimination, Constant Folding etc.) that have been used in code optimization. However, the increasing size and complexity of software products and the use of these products in embedded, web-based and mobile systems results in the demand for more optimized versions of the source code. This research paper discusses the challenges involved in code optimization for such systems and some recently developed techniques in code optimization.

The Study on the Innovation Bicycle Design Using Functional Element Characteristics

The design method on bicycle’s functional elements proposed by this research is based on analysis on the winning work in the Global Bicycle Design Competition. Via analyzing its creative design on functional elements, our study is aimed to establish a creative design method on bicycle for designers to develop lots of creative ideas at the concept development stage. This research is divided into three stages, including analysis on bicycle’s creative design elements, construction of creative design method flow on bicycle’s functional elements, and case study on design prototype. For analysis on bicycle’s creative design elements, we have come up with a symbol table of bicycle’s creative functional elements (CFEs). As to construction of creative design method flow on bicycle’s functional elements, we first asked the designer to describe his/her design theme, and then picked bicycle’s CFEs according to the contents described. After CFEs were picked, we then conducted the space position arrangement of functional element symbols. Based on designer’s requirements, we produced several kinds of space arrangements on CFEs, and then we designed a new bicycle by referring to the symbol table of bicycle’s CFEs acquired. In the final step, we followed the flowchart of bicycle’s CFEs constructed by this research, and proceeded a case study prototype design.

Застосування шаблону проектування Composite та технології LINQ до задачі префіксного кодування тексту за допомогою алгоритму Хаффмана

The designed methods are the implementation of the object-oriented architecture as the class diagram corresponding to the implementation of the Composite design pattern according to the requirements of the flexible implementation of the Huffman tree, the method of the dynamic iterative Huffman tree building. This tree uses the dynamic collection of the node interface using the Visual C# language and the creation method of the initial set of the leaf nodes using the LINQ technology. The implementation methodologies are the idea of the Composite design pattern for the handling with the tree hierarchical structures, the possibilities of the Visual Studio 2010 integrated development environment and the possibilities of the .NET 4.0 Framework and the LINQ technology within Visual C# programming language. The research results are the object-oriented program code in Visual C# language and the class diagram in UML language that illustrates application of the design pattern and principles of inheritance, abstraction, polymorphism and encapsulation for the implementation of the flexible and scalable object architecture of the Huffman tree. The advantages of the mentioned software architecture, the examples of the organization and the storage of large arrays of the text data with the key for decoding symbol table are presented. This proves practical value of theShannonlemma in the field of information and coding theory.

Digital Hardware Design Formal Verification Based on HOL System

This article selects HOL theorem proving systems for hardware Trojan detection and gives the symbol and meaning of theorem proving systems, and then introduces the symbol table, item and the meaning of HOL theorem proving systems. In order to solve the theorem proving the application of the system in hardware Trojan detection requirements, this article analyses basic hardware Trojan detection methods which applies for theorem proving systems and introduces the implementation methods and process of theorem proving about hardware Trojan detection.

Compiler for Detection of Program Vulnerabilities

Program Vulnerabilities may be unwarranted for any organization and may lead to severe system failure. Due to the advancement of technology there has been increase in the area of vulnerability attacks which are exploited by hackers for getting access to the system or insertion of their malicious code. In this paper we present a proposal for compiler design which prevents some common vulnerability. The output result for our compiler would be compile time warning stating the possible vulnerability in the code. We will also look into the details about the different type of vulnerability and how the attacker can exploit those vulnerabilities in order to corrupt the system. The knowledge of various vulnerability creation areas have been used to design a compiler for vulnerability prevention. Compiler in this publication uses the symbol table generation mechanism for syntactically, semantically segregation of executable code and canary guard mechanism for the protection of cases of buffer overflow. Major work in this area deals with the simple scenarios for vulnerability detection but our aim is to check for various complicated scenarios and non common possibilities for program attack and designing a framework preventing such kinds of attacks. General Terms Lexical Analysis, Syntax Analysis, Parser, Token, Semantic Analyzer, Symbol table, Random XOR.

“He's not dead—I know he isn't”

“He's not dead—I know he isn't”