Syntactic Methods Research Articles

Contemporary architecture and scientific development

In the last fifteen hundred years there has been a paradigmatic shift, science has replaced architectural treatises, and scientific methods are used to justify technical and even aesthetical decisions. The present issue of PARC – Research in Architecture and Construction – presents ten examples of the use of such methods for the production of buildings and the analysis of space. They range from the use of cognitive psychology for the conceptual phases of design and the simulation of human behavior by computer agents to the application of syntactic methods for the analysis of space. With this issue, we expect to contribute to the discussion about the effective contribution of science to the quality of the built space.

The Syntactical Pattern Recognition for the Leakage Current of Transmission-Line Insulators

For the current analytical method of the leakage current on the insulator, the online monitoring system could not be used to accurately judge the contamination severity on the surface of insulators, and a novel method, syntactical pattern recognition, was proposed in this paper. The geometric primitives were extracted by piecewise linearization from the leakage current signals. In accordance with the given grammar, these primitives are constituted into a language recognition unit with the name of finite automaton, where after the finite automaton, the leakage current signals were judged to be the corresponding pattern. The syntactical pattern-recognition module was embed into the “Acqs” software, and a series of experiments for validating this method's performance were made under the following three different conditions: 1) the leakage current of polluted insulators under the different humidity degrees; 2) the leakage current under the different voltage values with moderate humidity; and 3) the polarity effect. The results showed that the structure information of the leakage current could be roundly obtained by the syntactical pattern-recognition method. Consequently, the surface discharge characteristics of insulators could be deeply grasped and the polarity effect of the leakage current of insulators could be accurately and fully recognized.

A local tree alignment approach to relation extraction of multiple arguments

In this paper, we address the problem of relation extraction of multiple arguments where the relation of entities is framed by multiple attributes. Such complex relations are successfully extracted using a syntactic tree-based pattern matching method. While induced subtree patterns are typically used to model the relations of multiple entities, we argue that hard pattern matching between a pattern database and instance trees cannot allow us to examine similar tree structures. Thus, we explore a tree alignment-based soft pattern matching approach to improve the coverage of induced patterns. Our pattern learning algorithm iteratively searches the most influential dependency tree patterns as well as a control parameter for each pattern. The resulting method outperforms two baselines, a pairwise approach with the tree-kernel support vector machine and a hard pattern matching method, on two standard datasets for a complex relation extraction task.

POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION

We consider a simple modal logic whose nonmodal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4, and S5, such logics are useful, as shown in previous work by Baltag, Coecke, and the first author, for encoding and reasoning about information and misinformation in multiagent systems. For the propositional-only fragment of such a dynamic epistemic logic, we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of “nested” or “tree-sequent” calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario.

Design of Bowing-Activity Monitoring and Automatic Detection System Using 3-Axis Accelerometer

Abstract - In this paper, a new reliable portable activity monitoring device implemented with the buddhist-style bowing activity and walking step detection algorithm, is presented. In order to monitor the bowing and walking activities, miniaturized 3-axis accelerometer sensor with the sensitivity of 800 mV/g was used. After initial signal conditioning, vector magnitude of accelerometer signals was calculated. Syntactic peak detection method was used in order to feature points. All signal processing algorithms were implemented in ultra-low power microcontroller MSP430 with double precision floating point arithmetic. For evaluation, 19 young man(24.22±5.22 yrs) and woman(22.28±2.72 yrs) were involved. The accuracy of the proposed algorithms were 98.91%(±0.011) for walking step detection and 98.25%(±0.023) for buddhist-style bowing activity. Comparing to the commercialized pedometer accuracy, 87.1%(±0.058), the proposed walking step detection algorithms show more reliable accuracy. Key Words : 108 Bows, Pedometer, Walking Step, Bowing Activity, Wearable Monitor † 교신저자, 정회원 : 건국대 의료생명대 의학공학부 조교수, 건국대 의공학실용기술연구소・공박E-mail : jwlee95@kku.ac.kr* 정 회 원 : 건국대학교 의학공학부 박사과정** 비 회 원 : 경희대학교 체육대학 교수・체육과학박사*** 비 회 원 : (주)지우솔루션 기술연구소 접수일자 : 2010년 4월 26일 최종완료 : 2010년 5월 18일

An ontology-based search engine for protein-protein interactions.

BackgroundKeyword matching or ID matching is the most common searching method in a large database of protein-protein interactions. They are purely syntactic methods, and retrieve the records in the database that contain a keyword or ID specified in a query. Such syntactic search methods often retrieve too few search results or no results despite many potential matches present in the database.ResultsWe have developed a new method for representing protein-protein interactions and the Gene Ontology (GO) using modified Gödel numbers. This representation is hidden from users but enables a search engine using the representation to efficiently search protein-protein interactions in a biologically meaningful way. Given a query protein with optional search conditions expressed in one or more GO terms, the search engine finds all the interaction partners of the query protein by unique prime factorization of the modified Gödel numbers representing the query protein and the search conditions.ConclusionRepresenting the biological relations of proteins and their GO annotations by modified Gödel numbers makes a search engine efficiently find all protein-protein interactions by prime factorization of the numbers. Keyword matching or ID matching search methods often miss the interactions involving a protein that has no explicit annotations matching the search condition, but our search engine retrieves such interactions as well if they satisfy the search condition with a more specific term in the ontology.

Information Hiding: A Generic Approach

Problem statement: Privacy and security over communication channels are of primary concerns. Due to their complexity and diversity, there is a need for continuous improvements of the adopted solutions. In this study, we consider two of the adopted ones, namely, steganogrphy and cryptography and propose a new information hiding system. Approach: The proposed system was based on a generic approach that incorporates text-based steganography and cryptography methods in a way that permits their combined or stand alone adoption. Thus, achieving message encryption incorporated with its concealing inside another unsuspicious one. Furthermore, two steganography methods (the inter-word spaces method and syntactic methods) had been combined with a hybrid text-encoding in a form of binary representation of terns rewriting systems. Results: An information hiding system had been implemented. The system offered encrypting and hiding dynamic and static text within a cover-text. The conducted experiments using static texts had shown a non-noticeable increase (0.02%) in the size of their respective stego-texts. For the dynamic texts, cover- texts with a size proportional to the length of the secret messages were needed. Conclusion: A generic model for information hiding with a respective implementation framework had been used as an effective tool to develop a hybrid and scalable steganography system that combined good features from the existing ones.

Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction

The simplest proofs of the Church Rosser Property are usually done by the syntactic method of parallel reduction. On the other hand, reducibility is a semantic method which has been used to prove a number of properties in the λ -calculus and is well known to offer on one hand very general proofs which can be applied to a number of instantiations, and on the other hand, to be quite mysterious and inflexible. In this paper, we concentrate on simplifying a semantic method based on reducibility for proving Church-Rosser for both β - and βη -reduction. Interestingly, this simplification results in a syntactic method (so the semantic aspect disappears) which is nonetheless projectable into a semantic method. Our contributions are as follows: • We give a simplification of a semantic proof of CR for β -reduction which unlike some common proofs in the literature, avoids any type machinery and is solely carried out in a completely untyped setting. • We give a new proof of CR for βη -reduction which is a generalisation of our simple proof for β -reduction. • Our simplification of the semantic proof results into a syntactic proof which is projectable into a semantic method and can hence be used as a bridge between syntactic and semantic methods.

Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4 and S5, such logics are useful, as shown in previous work by Baltag, Coecke and the first author, for encoding and reasoning about information and misinformation in multi-agent systems. For such a logic we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of ''nested'' or ''tree-sequent'' calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario.

Display calculi and other modal calculi: a comparison

In this paper we introduce and compare four different syntactic methods for generating sequent calculi for the main systems of modal logic: the multiple sequents method, the higher-arity sequents method, the tree-hypersequents method and the display method. More precisely we show how the first three methods can all be translated in the fourth one. This result sheds new light on these generalisations of the sequent calculus and raises issues that will be examined in the last section.

Taming Web Services from the Wild

Service-oriented computing is about building new cross-organizational applications by combining, composing, consuming, or interconnecting existing services. So, why do most composite Web service-based systems currently rely on pre-established relationships that aren't created by automated, dynamic discovery and integration? One perceived reason is the inconsistency in service-based interface descriptions and message names. Here, the authors investigate whether human nature - specifically, software developers' tendencies to name service descriptions in significantly consistent ways - can provide syntactical methods for service discovery..

Instrument for Soundscape Recognition, Identification and Evaluation (ISRIE): Signal Classification

ISRIE is a collaborative project between the universities of York and Newcastle and ISVR in Southampton. The work being undertaken at York is in its second year and focuses on signal separation and classification. Developing novel methods for classifying urban and other sounds into distinct categories (such as transportation, industrial, human, animal, etc.) is the focus of this project. The classification system will consist of two main parts: a feature extractor and a classifier. Both time and time-frequency domain techniques have been considered for feature extraction and it is anticipated that a combination of domains will be required for this complex task. To date only simple classifiers have been implemented and development is now focussed on syntactic pattern recognition. The project background and an overview of the techniques involved will be presented along with preliminary results for the classification of urban and other sounds using syntactic methods.

The New Upper-Middle Class Residential Experience: A Case Study of Apartment Flats in Jordan using the Logics of Burden, Hillier and Hanson

The city of Amman has embarked on development at every scale and the private housing market has become a strong industry. Although apartment living was not popular to the upper-middle class when it was first introduced during the 1970s, the sharp increase in the price of land together with other socio-economic factors made the flat the only possible choice to a large segment of Amman's population. This research aims to provide an understanding of this phenomenon. It questioned if the relentless invasion of new forms of housing is echoed by shifts in the traditional logic of space. The research concentrated on the architecture of apartment buildings built between 1975–2007, and explored the extent to which the spatial properties of the apartments are generic. This paper explores the logic of Amman's apartments and managed to put the recent residential experience into a spatially typed format by relating to Burden's elements for comprehending design forms, and by using Hillier and Hanson's syntactic methods of spatial analysis

Notice of Violation of IEEE Publication Principles: Modified Syntactic Method to Recognize Bengali Handwritten Characters

Notice of Violation of IEEE Publication Principles<br><br>"Modified Syntactic Method to Recognize Bengali Handwritten Characters"<br>by M.A. Rahman and A. El Saddik<br>in the IEEE Transactions on Instrumentation and Measurement, Vol 56, No. 6, December 2007, pp. 2623-2632<br><br>After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.<br><br>This paper includes substantial copied portions of the work cited below, without attribution (including appropriate references to the original author(s) and/or paper title) and permission. The lead author, M.A. Rahman, was found to be solely responsible for this violation.<br><br>Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references to this paper should also include a reference to the following article:<br><br>"Bengali Handwritten Character Recognition Using Modified Syntactic Method"<br>by M.B. Islam, M.M.B. Azadi, M.A. Rahman, and M.M.A. Hashem<br>in the Proceedings of 2nd National Conference on Computer Processing of Bangla, 2005, pp. 264-275<br><br> <br/> Several approaches have been proposed to recognize handwritten Bengali characters using different curve-fitting algorithms. The syntactic methods that are used to recognize printed Bengali alphabetic characters tend not to be suitable enough to properly distinguish Bengali handwritten characters. The proposed curve-fitting algorithm helps accurately recognize various strokes of different patterns (e.g., line and quadratic curve), thus drastically reducing the error elimination burden. As compared to existing approaches, the proposed modified syntactic method demonstrates significant improvement in recognizing Bengali handwritten characters.

An Algebraic Approach to the Disjunction Property of Substructural Logics

Some of the basic substructural logics are shown by Ono to have the disjunction property (DP) by using cut elimination of sequent calculi for these logics. On the other hand, this syntactic method works only for a limited number of substructural logics. Here we show that Maksimova's criterion on the DP of superintuitionistic logics can be naturally extended to one on the DP of substructural logics over FL. By using this, we show the DP for some of the substructural logics for which syntactic methods don't work well.

Formal description of sedimentary architecture of analogue models for use in 2D reservoir simulation

A formal method for describing data collected from field studies is used to generate stochastic geological models of sedimentary successions using a method based on syntactic pattern recognition. Using this method an analogue model developed from field data can be encoded as a grammar. The grammar is composed of symbols which represent geological entities. Valid patterns formed by the symbols are described by a set of production rules. In order to demonstrate the potential of the syntactic method, 2D simulations of interpreted cross-sections from Brushy Canyon outcrops are presented here, as well as 2D simulations of seismic facies from the Bengal Fan.

Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory

In this work we focus on a formalisation of the algorithms of lazy exact arithmetic a la Edalat-Potts in type theory. We choose the constructive type theory extended with coinductive types as our formal verification tool. We show examples of how infinite objects such as streams and expression trees can be formalised as coinductive types. We study the type theoretic notion of productivity which ensures the infiniteness of the outcome of the algorithms on infinite objects. Syntactical methods are not always strong enough to ensure the productivity. However, if some information about the complexity of a function is provided, one may be able to show the productivity of that function. In the case of the normalisation algorithm we show that such information can be obtained from the choice of real number representation that is used to represent the input and the output. Furthermore, we show how to employ this semantic information to formalise a restricted case of normalisation algorithm in our type theory.

An ontology‐assisted analysis in aligning business process with e‐commerce standards

PurposeThe purpose of this research is to articulate an analysis framework and a method for the cross‐national business‐to‐business integration electronic commerce (B2Bi EC) by exploring an ontology‐assisted schema and semantics resolution in the business process alignment with electronic commerce standards.Design/methodology/approachThe paper presents an ontology‐assisted analysis method and alignment model in the implementation of the B2B electronic commerce standard specification over the existing trading partners' public processes in the syntactic and semantic integration and interoperability. An application of the Unified Modeling Language is made to analyze the public process in the domain and in the standard. Terms, concepts, relations, and links are created from the analysis results and converted into an ontology representation. Web Ontology Language is introduced to formulate the analyzed knowledge and experience to align the domain and the standard. There are correspondences and conflicts in the process of alignment. They are resolved via the shared and reusable ontology which is a convergence of the domain ontology and the standard ontology. The converged and shared ontology is achieved via a set of rules and heuristics that are created in the research.FindingsThe key of success in the B2Bi EC lies in the ability to accomplish the process interoperability and the schema comparability. Three main tasks have to be achieved to fulfill the requirements. This research constructs a prototype to implement the method. The prototype is used to illustrate the feasibility and validity of the method. A set of starter experiments has been conducted in use of a straight‐through example of a purchase order process in the alignment with the RosettaNet standard and the ebXML standard. The starter experiment serves as the baseline to demonstrate that the method is feasible and valid.Originality/valueA syntactic and semantic analysis method and alignment model are developed and demonstrated in the research. Integration and interoperability are accomplished in use of the systematic and analytic method.

Definability and Interpolation in Non-Classical Logics

Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and also in extensions of Johansson's minimal logic. All these logics are strongly complete under algebraic semantics. It allows to combine syntactic methods with studying varieties of algebras and to flnd algebraic equivalents for interpolation and related properties. Moreover, we give exhaustive solution to interpolation and some related problems for many families of propositional logics and calculi.

Computing interpolants in implicational logics

I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like Prawitz’s, works on natural deductions rather than sequent derivations, and, unlike existing methods, always finds a ‘strongest’ interpolant under a certain restricted but reasonable notion of what counts as an ‘interpolant’.