Symbol Table Research Articles

The AHEAD Portal: A Gateway to European Historical Earthquake Data

Research Article| May 01, 2014 The AHEAD Portal: A Gateway to European Historical Earthquake Data Mario Locati; Mario Locati Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Search for other works by this author on: GSW Google Scholar Andrea Rovida; Andrea Rovida Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Search for other works by this author on: GSW Google Scholar Paola Albini; Paola Albini Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Search for other works by this author on: GSW Google Scholar Massimiliano Stucchi Massimiliano Stucchi Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Search for other works by this author on: GSW Google Scholar Author and Article Information Mario Locati Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Andrea Rovida Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Paola Albini Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Massimiliano Stucchi Istituto Nazionale di Geofisica e Vulcanologia (INGV), Sezione di Milano‐Pavia, Via Edoardo Bassini 15, 20133 Milano, Italymario.locati@mi.ingv.it Publisher: Seismological Society of America First Online: 14 Jul 2017 Online ISSN: 1938-2057 Print ISSN: 0895-0695 © 2014 by the Seismological Society of America Seismological Research Letters (2014) 85 (3): 727–734. https://doi.org/10.1785/0220130113 Article history First Online: 14 Jul 2017 Cite View This Citation Add to Citation Manager Share Icon Share Facebook Twitter LinkedIn MailTo Tools Icon Tools Get Permissions Search Site Citation Mario Locati, Andrea Rovida, Paola Albini, Massimiliano Stucchi; The AHEAD Portal: A Gateway to European Historical Earthquake Data. Seismological Research Letters 2014;; 85 (3): 727–734. doi: https://doi.org/10.1785/0220130113 Download citation file: Ris (Zotero) Refmanager EasyBib Bookends Mendeley Papers EndNote RefWorks BibTex toolbar search Search Dropdown Menu toolbar search search input Search input auto suggest filter your search All ContentBy SocietySeismological Research Letters Search Advanced Search The description of the seismicity of the European region is today fragmented into an increasing number of earthquake archives, databases, and catalogs related to individual countries or even to part of them. Therefore, the compilation of a comprehensive, European earthquake history requires dealing with a puzzle of partially overlapping, only partially public catalogs, the background of which is compiled according to varied schemes. One of the consequences is that earthquakes in the frontier areas are often interpreted in a conflicting way by the catalogs of the bordering countries. In the framework of the European Commission (EC), 2006–2010 Network of Research... You do not have access to this content, please speak to your institutional administrator if you feel you should have access.

Advanced research of social networks' communication

This paper presents the Symbols Research software (SR) - logical model and research tool that provides new opportunities in the field of empirical research of communication. SR collects and reviews the entire communication on social networks in a given time and social space and automatically detects the required content. In real time it sorts the material, creates basic overview, notices certain regularities and presents analytical findings. The model itself is a kind of artificial intelligence because it imitates the human brain: the operators who monitor the effectiveness of the so-called table of symbols (instrument for the content identification, classification and evaluation), continuously control its sensitivity and efficiency during the research process, enter corrections, and then these corrections are applied as a rule for future processing of material, which makes the instrument constantly improved. Almost in parallel, or with the postponement of a few seconds, the second and third level of processing are performed: simple analytics and results presentation, and then more complex analyses -multivariate and regression analysis as well as statistical procedure similar to the structural equation modeling. The SR concept and software can never be regarded as final and complete, or more precisely, they are and they must be flexible as well as the subject of continuous upgrading and improvements.

The Design of Activity Record in C Language Compile Process

Activity record is an important part of the compile process. C-based storage management strategy, the system uses the Eclipse integrated environment in Windows 7 system , using the Java language to implement process activity record analysis and processing of the C language. Program can handle variables stored procedure calls and nested execution jumps, and through vector symbol table to achieve compact build management. By applying stack storage management strategies,the storage activity can be clearly demonstrated.

Keyword Aggregate Query Based on Query Template

For keywords query, we propose a keyword aggregate query method based on query template. During the keywords processing, symbol table is used to locate the position of the keywords in the database to get a series of query items. In the query template generating stage, we design a heuristic query template generation algorithm. We use the improved scoring rules to rate the query templates, and select the optimal query template. The experimental results have shown that the aggregate query method is effective.

Macros Development for Create the Reusable Programs and Generate Customize Result in Clinical Data Reporting

The article is mainly describe the purpose of the macro facility and efficiency of macrobased applications in clinical domain for create, tests and provides resolution to bugs, defects and other changes to the SAS macro library. It mainly focus on fundamental concept of program flow, tokenization, %INCLUDE statement, %LET statement, macro triggers, macro statements, macro variables, global and local symbol tables, automatic macro variables, macro variable reference, substitution within a macro statement, substitution within a SAS literal, unresolved reference, substitution within SAS code, referencing macro variables, combining macro variables with text. It will give the brief idea about macro functions, defining a macro, macro compilation, calling a macro ,macro storage, macro parameters, SYMPUT routine, creating a series of macro variables, creating macro variables in SQL, the need for macro-level programming, conditional processing, monitoring macro execution, macro syntax errors, parameter validation, developing macro-based applications, iterative processing, the SYMPUTX routine, rules for creating and updating variables, rules for resolving variables, multiple local tables. This article shows complete concept of the macro system.

DNA Sequences as a Medium for Steganography Method of Codon Frequency with Character Frequency

The present study included an application of new method of steganography using DNA sequence as a medium for hiding. This method is considered as a secret cover for the secret message (text, image), avoid attention of unauthorized person in addition to be inextricable since it needs high effort, long time and well background in biology. A Sequence of DNA has been synthesized chemically depending on the text secret message via using tables of symbols formed from English letter, numbers and special characters. Each symbol has been represented on codon and the symbols were arranged in the table in descending order depending on English letter frequency and codon frequency (Genes). The DNA sequence has been synthesized by Korean Bioneer Company (sender), then the sequence has been read in university of fatih (the receiver) by DNA Sequence 3310, the results revealed high similarity between sequence of the sender and receiver. And proved that the method is protected very well against analysis and stegoanalysis.

Comparison among information hiding methods in DNA Sequences

By research, three methods for hiding secret message were proposed. In the first one the secret message was hid in a known DNA sequence belongs to prokaryotic organism Escherichia Coli k12 (E.Coli ) DNA sequence obtained from EBI location (European Bioinformatics Institute), Among the DNA molecule characters, one of the mutant ability types, that is the silent mutant, was chosen to hide a secret message within the sequence. The second method, a sequence of DNA has been synthesized chemically depending on the text secret message via using tables of symbols formed from English letter, numbers and special characters, each symbols represents codon and the symbols were arranged in the table in descending order depending on English letter frequency codon frequency (Genes). While in the third method the secret message was hid in E.Coli bacteria with known nitrogen base sequence in EBI using complementary character. The proposed methods applied in Matlab program and C# . Results of study revealed that DNA sequence has a high ratio for hiding secret message. The results reached 100% and the error rate to 0%.

Integrated symbol table, engine and heap memory management in multi-engine prolog

We describe an integrated solution to symbol, heap and logic engine memory management in a context where exchanges of arbitrary Prolog terms occur between multiple dynamically created engines, implemented in a new Java-based experimental Prolog system. As our symbols represent not just Prolog atoms, but also handles to Java objects (including arbitrary size integers and decimals), everything is centered around a symbol garbage collection algorithm ensuring that external objects are shared and exchanged between logic engines efficiently. Taking advantage of a tag-on-data heap representation of Prolog terms, our algorithm performs in-place updates of live symbol references directly on heap cells. With appropriate fine tuning of collection policies our algorithm provides an integrated memory management solution for Prolog systems, with amortized cost dominated by normally occurring heap garbage collection costs.

A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages

A compiler translates and/or compiles a program written in a suitable source language into an equivalent target language through a number of stages. Starting with recognition of token through target code generation provide a basis for communication interface between a user and a processor in significant amount of time. A new approach GLAP model for design and time complexity analysis of lexical analyzer is proposed in this paper. In the model different steps of tokenizer (generation of tokens) through lexemes, and better input system implementation have been introduced. Disk access and state machine driven Lex are also reflected in the model towards its complete utility. The model also introduces generation of parser. Implementation of symbol table and its interface using stack is another innovation of the model in acceptance with both theoretically and in implementation widely. General Terms Compiler, Language Processor.

Simple and safe SQL queries with C++ templates

Most large software applications rely on an external relational database for storing and managing persistent data. Typically, such applications interact with the database by first constructing strings that represent SQL statements, and then submitting these for execution by the database engine. The fact that these statements are only checked for correctness at runtime is a source for many potential defects, including type and syntax errors and vulnerability to injection attacks. The AraRat system presented here offers a method for dealing with these difficulties by coercing the host C++ compiler to do the necessary checks of the generated strings. A library of templates and preprocessor directives is used to embed in C++ a little language representing an augmented relational algebra formalism. Type checking of this embedded language, carried out by our template library, assures, at compile-time, the correctness and safety of the generated SQL strings. All SQL statements constructed by AraRat are guaranteed to be syntactically correct, and type safe with respect to the database schema. Moreover, AraRat statically ensures that the generated statements are immune to all injection attacks. The standard techniques of “ expression templates” and “ compile-time symbolic derivation” for compile-time representation of symbolic structures, are enhanced in our system. We demonstrate the support of a type system and a symbol table lookup of the symbolic structure. A key observation of this work is that type equivalence of instantiated nominally typed generics in C++ (as well as other languages, e.g., Java) is structural rather than nominal. This makes it possible to embed the structural type system, characteristic to persistent data management, in the nominal type system of C++. For some of its advanced features, AraRat relies on two small extensions to the standard C++ language: the typeof pseudo operator and the __COUNTER__ preprocessor macro.

Correction to “A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications” [Dec 08 5500-5510

In the above titled paper (ibid., vol 54, no. 12, pp. 5500-5510, Dec 08), the table containing the list of symbols was corrupted during the publication process. The proper symbol table is presented here.

Plant model generation for PLC simulation

This paper reports an automated procedure for constructing a plant model for PLC simulation. Since PLC programs contain only the control logic without information on the plant model, it is necessary to build the corresponding plant model to perform the simulation. Conventionally, a plant model for PLC simulation has been constructed manually, which requires much effort and in-depth knowledge of the simulation. As a remedy for this problem, we propose an automated procedure for generating a plant model from the symbol table of a PLC program. To do so, we propose a naming rule for PLC symbols so that the symbol names include sufficient information on the plant model. By analysing such symbol names, we extract a plant model automatically. The proposed methodology has been implemented and test runs performed.

Quasistatic shared libraries and XIP for memory footprint reduction in MMU-less embedded systems

Despite a rapid decrease in the price of solid state memory devices, system memory is still a very precious resource in embedded systems. The use of shared libraries and execution-in-place (XIP) is known to be effective in significantly reducing memory usage. Unfortunately, many resource-constrained embedded systems lack an MMU, making it extremely difficult to support these techniques. To address this problem, we propose a novel shared library technique called a quasi-static shared library and an XIP, both based on our enhanced position independent code technique. In our quasistatic shared libraries, global symbols are bound to pseudoaddresses at linking time and actual physical addresses are bound at loading time. Unlike conventional shared libraries, they do not require symbol tables that take up valuable memory space and, therefore, allow for expedited address translation at runtime. Our XIP technique is facilitated by our enhanced position independent code where a data section can be arbitrarily located. Both the shared library and XIP techniques are made possible by emulating an MMU's memory mapping feature with a data section base register (DSBR) and a data section base table (DSBT). We have implemented these proposed techniques in a commercial ADSL (Asymmetric Digital Subscriber Line) home network gateway equipped with an MMU-less ARM7TDMI processor core, 2MB flash memory, and 16MB RAM. We measured its memory usage and evaluated its performance overhead by conducting a series of experiments. These experiments clearly demonstrate the effectiveness of our techniques in reducing memory usage. The results are impressive: 35% reduction in flash memory usage when using only the shared library and 30% reduction in RAM usage when using the shared library and XIP together. These results were achieved with only a negligible performance penalty of less than 4%. Even though these techniques were applied to uClinux-based embedded systems, they can be used for any MMU-less real-time operating system.

Fusing a Transformation Language with an Open Compiler

Program transformation systems provide powerful analysis and transformation frameworks as well as concise languages for language processing, but instantiating them for every subject language is an arduous task, most often resulting in half-completed frontends. Compilers provide mature frontends with robust parsers and type checkers, but solving language processing problems in general-purpose languages without transformation libraries is tedious. Reusing these frontends with existing transformation systems is therefore attractive. However, for this reuse to be optimal, the functional logic found in the frontend should be exposed to the transformation system – simple data serialization of the abstract syntax tree is not enough, since this fails to expose important compiler functionality, such as import graphs, symbol tables and the type checker.In this paper, we introduce a novel and general technique for combining term-based transformation systems with existing language frontends. The technique is presented in the context of a scriptable analysis and transformation framework for Java built on top of the Eclipse Java compiler. The framework consists of an adapter automatically extracted from the abstract syntax tree of the compiler and an interpreter for the Stratego program transformation language. The adapter allows the Stratego interpreter to rewrite directly on the compiler AST. We illustrate the applicability of our system with scripts written in Stratego that perform framework and library-specific analyses and transformations.

IDL compiler API design, application and validation based on XML API

In order to adapt different languages and platforms, the paper discusses how to process and validate IDL symbol table and intermediate code by XML API. It puts emphasis on IDL API extension towards DOM API based on the idea of combining XML with IDL compilers. At last, the IDL compiler designing framework based on XML API is given, in which compiler front end can be managed and validated by some XML techniques and tools, IDL API can be validated on the basis of test, so IDL intermediate code is provided with maintainability, portability and generation. IDL compiler can be developed and extended by XML-based API, which realizes versatility and portability of modern compiler.

An Alchemy of Mind: The Marvel and Mystery of the Brain

Back to table of contents Previous article Next article Book ReviewFull AccessAn Alchemy of Mind: The Marvel and Mystery of the BrainNada L. Stotland M.D., M.P.H.Nada L. Stotland M.D., M.P.H.Search for more papers by this authorPublished Online:1 Mar 2007https://doi.org/10.1176/ps.2007.58.3.417AboutSectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack Citations ShareShare onFacebookTwitterLinked InEmail Diane Ackerman, the best-selling author of A Natural History of the Senses , tells us in An Alchemy of Mind , "I've always trekked through imaginary worlds, lived on my senses, and fiddled with words. Writing is my form of celebration and prayer, but it is also the way I organize and inquire about the world. Driven by an intense, nomadic curiosity, I may find myself in a state of rapture about a field and rapidly coming down with a book…. I also love playing with ideas, looking at something from as many sides as possible, lifting up an observation, and shaking it to see if a revelation might fall out." This is not how we might expect the author of a book on the brain to explain her work, nor might we expect her to confess, or brag, that she had flunked her college course in logic. Her book is written in a poetic style, full of rich analogies and metaphors. The endmatter includes not only diagrams, notes, and references but also a table of alchemical symbols. The title is evocative, but the subtitle explains what the book is about. There are chapters on evolution, the physical brain, memory, the self and other fictions, emotions, language, and "the world we share." The chapters are divided into sections with poetic names, such as "Sweet Dreams of Reason," "The World is Breaking Someone Else's Heart," and "Never a Dull Torment." Each chapter begins with a literary quotation.The author frequently refers to her own history, family, experiences, and style. At first, despite a sense of relief that this is not a dense, dry text, the poetics make for tough going, and the personal information seems gratuitous and self-involved. After all, Ackerman has a lot of scientific ground to cover.However, her ability to reference materials from a wide variety of fields and bring them to bear upon each other is also refreshing and thought provoking. The images have lasting power. In another example, she illustrates the reason for the title. "Creative ideas are forged in an alchemy of mind, as the brain uses electrochemistry to confect ideas, and then more electrochemistry to think about those ideas, and so on in an endless hall of mirrors. This rarely happens in a tidy sequence. The brain can hold an idea in its stockroom for years, occasionally checking to see if it has changed at all, revising it a little, and then putting it back on the shelf, taking it down again when it seems to have evolved like a lemur from its original form." Chemistry, stockrooms, and lemurs don't usually find themselves in the same paragraph.By the end, the book had reminded me of some neuroanatomy, neurochemistry, and neurophysiology and had insinuated itself into my thoughts. Not only did I find myself reflecting, but I reflected on what "reflecting" means and how it works. That's what this book is all about.Dr. Stotland is professor of psychiatry at Rush Medical College, Chicago. FiguresReferencesCited byDetailsCited ByNone Volume 58Issue 3 March, 2007Pages 417-417PSYCHIATRIC SERVICES March 2007 Volume 58 Number 3 Metrics PDF download History Published online 1 March 2007 Published in print 1 March 2007

TRICK

Compilers, during compilation, analyze the application being compiled and build up extensive knowledge about the program. This knowledge is essential for the compiler to produce correct object code. Though some part of this knowledge is retained in the generated object files as symbol table information to be used by the linker and/or debugger, most of it is discarded after the compilation is done. In this paper, we introduce the TRICK framework, which is an attempt to retain and reuse this internal information generated by the compiler as part of its program analysis, in building new tools or enhancing existing tools as well for reuse by the compiler for continuous program optimization. We present examples of how development and maintenance of various program analysis tools can be simplified by using the TRICK framework describing tools developed by our group as well as how TRICK framework can be employed in continuous program optimization by the compiler. TRICK framework can be part of both static and dynamic compilation system, though our current usage model is in the context of a static compilation system,

Ensuring termination by typability

A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π -calculus processes. The systems are obtained by successive refinements of the types of the simply typed π -calculus. For all (but one of) the type systems we also present upper bounds to the number of steps well-typed processes take to terminate. The termination proofs use techniques from term rewriting systems. We show the usefulness of the type systems on some non-trivial examples: the encodings of primitive recursive functions, the protocol for encoding separate choice in terms of parallel composition, a symbol table implemented as a dynamic chain of cells.

Text to speech synthesizer with facial character reading assignment unit

There is provided a text analyzer for analyzing Japanese text data, a facial character reading assignment unit for assigning facial character readings to character string portions of text analysis results determined to correspond to facial characters, and a speech synthesizer for outputting synthesized speech based on the analysis results of the text analyzer. The facial character reading assignment unit is constituted by a facial character determining unit for determining whether or not a symbol is a symbol constituting a facial character using an outline symbol table, a characteristic extraction unit for extracting characteristic symbols used in facial characters from character strings determined to be facial characters, and a reading selection unit for outputting readings allotted to the extracted reading numbers. Here, readings are assigned to the facial character strings according to the number of times characteristic symbols appear in facial characters.

Working with Unix Tools

Line-oriented textual data streams are the lowest useful common denominator for a lot of data that passes through our hands. We can use such streams to represent program source code, Web server log data, version control history, file lists, symbol tables, archive contents, error messages, profiling data, and so on. For many routine, everyday tasks, we might be tempted to process the data using a "Swiss army knife" scripting language such as Perl, Python, or Ruby. However, doing that often requires writing a small, self-contained program and saving it into a file. By that point, we've lost interest in the task and end up doing the work manually, if at all. Often, it's more effective to combine Unix tool chest programs into a short and sweet pipeline that we can run from our shell's command prompt. With modern shell command-line editing facilities, we can build our command bit by bit, until it molds into exactly the form that suits us. Nowadays, many different systems--including GNU/Linux, Mac OS X, and Microsoft Windows--offer the original Unix tools, so there's no reason to not add this approach to your arsenal. Many one-liners that you'll build around the Unix tools follow a pattern that goes roughly like this: fetching, selection, processing, and summarization. You'll also need to install some plumbing to unify these parts. This column will give you a quick overview.