Silver: An extensible attribute grammar system

Attribute grammar specification languages, like many domain-specific languages, offer significant advantages to their users, such as high-level declarative constructs and domain-specific analyses. Despite these advantages, attribute grammars are often not adopted to the degree that their proponents envision. One practical obstacle to their adoption is a perceived lack of both domain-specific and general purpose language features needed to address the many different aspects of a problem. Here we describe Silver, an extensible attribute grammar specification system, and show how it can be extended with general purpose features such as pattern matching and domain-specific features such as collection attributes and constructs for supporting data-flow analysis of imperative programs. The result is an attribute grammar specification language with a rich set of language features. Silver is implemented in itself by a Silver attribute grammar and utilizes forwarding to implement the extensions in a cost-effective manner.     

An attribute grammar approach to compiler optimization of intra-module interprocess communication

Earlier work has shown the effectiveness of hand-applied program transformations optimizing high-level interprocess communication mechanisms. This paper describes the static analysis techniques necessary to ensure correct compiler application of the optimizing transformations. These techniques include both dataflow analysis and interprocess analysis. This paper focuses on the analysis of communication mechanisms within program modules; however, the analysis techniques can be generalized to handle inter-module optimization analysis as well. The major contributions of this paper include the application of dataflow analysis and the extension of interprocedural analysis—interprocess analysis—to real concurrent programming languages and, more specifically, to the optimization of interprocess communication and synchronization mechanisms that use both static and dynamic channels. In addition, the use of attribute grammars to perform interprocess analysis is significant. This paper also describes an implementation of both intra-process dataflow and interprocess analysis techniques using attribute grammars.This work was supported by NSF under Grant Number CCR88-10617.     

Generic attribute revocation systems for attribute-based encryption in cloud storage

Frontiers of Information Technology & Electronic Engineering - Attribute-based encryption (ABE) has been a preferred encryption technology to solve the problems of data protection and access...     

Indifference threshold-based attribute ratio analysis: A method for assigning the weights to the attributes in multiple attribute decision making

In this paper, a new method called Indifference Threshold-based Attribute Ratio Analysis (ITARA for short) is proposed to assign the weights to the attributes in Multiple Attribute Decision Making (MADM) problems. The proposed method is based on the concept of “Indifference Threshold (IT)” and belongs to a group of techniques which are based on measuring data dispersion. The proposed technique is applied to solve a numerical example. Additionally, a simulation experiment is designed to investigate the performance of the proposed method and other relevant methods. The results indicate that the proposed method is substantially superior to other methods in almost all the cases studied.     

一种用于云存储的密文策略属性基加密方案

云存储的应用环境中存在缺乏细粒度访问控制、密钥管理难度大、难以抵御合谋攻击等问题,为此提出了一种新的用于云存储的密文策略属性基加密(ciphertext-policy attribute-based encryption,CP-ABE)方案。通过引入由数据属主独立控制的许可属性,构建不同属性域的CP-ABE方案,能够防止云存储系统特权用户的内部攻击,使数据属主能完全控制其他共享用户对其云数据的访问。实验结果表明,该方案在提供安全性的同时能极大地提高用户属性撤销的效率。最后,对该方案进行了安全分析,并证明了该方案在DBDH假设下是CPA,安全的。     

A comparison of storage optimizations in automatically-generated attribute evaluators

Summary Attribute grammars are a value-oriented, non-procedural extension to context-free grammars that facilitate the specification of translations whose domain is described by the underlying context-free grammar. Just as parsers for context-free languages can be automatically constructed from a context-free grammar, so can translators, called attribute evaluators, be automatically generated from an attribute grammar. A major obstacle to generating efficient attribute evaluators is that they typically use large amounts of memory to represent the attributed parse tree. In this report we investigate the problem of efficient representation of the attributed parse tree by analyzing and comparing the strategies of two systems that have been used to automatically generate a translator from an attribute grammar: the GAG system developed at the Universitat de Karlsruhe and the LINGUIST-86 system written at Intel Corporation. Our analysis will characterize the two strategies and highlight their respective strengths and weaknesses. Drawing on the insights given by this analysis, we propose a strategy for storage optimization in automatically generated attribute evaluators that not only incorporates the best features of both GAG and LINGUIST-86, but also contains novel features that address aspects of the problem that are handled poorly by both systems.This research was partially supported by the National Science Foundation under grant DCR-83-10930, and partially supported by the Defense Advanced Research Projects Agency under contract number N00039-84-C-0165     

一种用于云存储的可撤销的属性加密方案

由于云存储用户数量大,成分复杂,云存储中数据的安全防护问题成为其发展的一大制约,近年来,基于属性加密技术解决云存储中数据安全存储问题成为研究热点,但传统的属性加密方案存在密文长度相对较大且属性撤销复杂等问题。引入代理重加密技术,针对以上问题提出一种可撤销的密文属性基加密方案,在缩短密文长度的同时实现属性撤销操作,并证明该方案在DBDH假设下CPA是安全的。     

Generating test as a web service (TaaWS) through a method-based attribute grammar

International Journal on Software Tools for Technology Transfer - Service-Oriented Architecture (SOA) is a technology for designing software systems. By using this architecture, new challenges...     

一种新的基于连续属性离散化的属性约简方法*

通过将连续属性离散化和属性约简结合起来,首先对连续型的属性列进行离散化,得到新的决策表;然后再对新的决策表作属性约简,解决了属性约简过程中由于不考虑连续属性而无法求出准确约简属性的问题。最后通过具体案例表明了该方法具有较好的实用性、有效性,可以很好地应用在含有大量连续属性的数据挖掘项目中。     

Discretization of continuous attributes through low frequency numerical values and attribute interdependency

Discretization is the process of converting numerical values into categorical values. There are many existing techniques for discretization. However, the existing techniques have various limitations such as the requirement of a user input on the number of categories and number of records in each category. Therefore, we propose a new discretization technique called low frequency discretizer (LFD) that does not require any user input. There are some existing techniques that do not require user input, but they rely on various assumptions such as the number of records in each interval is same, and the number of intervals is equal to the number of records in each interval. These assumptions are often difficult to justify. LFD does not require any assumptions. In LFD the number of categories and frequency of each category are not pre-defined, rather data driven. Other contributions of LFD are as follows. LFD uses low frequency values as cut points and thus reduces the information loss due to discretization. It uses all other categorical attributes and any numerical attribute that has already been categorized. It considers that the influence of an attribute in discretization of another attribute depends on the strength of their relationship. We evaluate LFD by comparing it with six (6) existing techniques on eight (8) datasets for three different types of evaluation, namely the classification accuracy, imputation accuracy and noise detection accuracy. Our experimental results indicate a significant improvement based on the sign test analysis.     

Two-level grammar as an implementable metalanguage for axiomatic semantics

Two-level grammars can define the syntax and the operational semantics of programming languages and these definitions are directly executable by interpretation. In this paper it is shown that axiomatic semantics can also be defined using a two-level grammar with the result being a partially automatic program verification system accomplished within the framework of a language definition. These results imply that a programming language can be defined operationally and axiomatically together in complementary definitions as advocated by Hoare and Lauer. Because two-level grammars are executable, these complementary definitions accomplish a system for interpreting and verifying programs.     

Global garbage collection for distributed heap storage systems

We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in which the processing elements (PEs) share only the communication medium. The algorithm is global, i.e., it involves all the PEs in the system. It allows space compaction, and it uses a system-wide marking phase to mark all accessible objects where a combination of parallel breadth-first/depth-first strategies is used for tracing the object-graphs according to a decentralized credit mechanism that regulates the number of garbage collection messages in the system. The credit mechanism is crucial for determining the space requirement of the garbage-collection messages. Also a variation of this algorithm is presented for systems with high locality of reference. It allows each PE to perform first its local garbage collection and only invokes the global garbage collection when the freed space by the local collector is insufficient.     

A method of determining attribute weights in evidential reasoning approach based on incompatibility among attributes

Decisions on attribute weights are important problems in multiple attribute decision making. Many methods have been proposed to create attribute weights which are used to aggregate attributes in a simple additive weighting way. In this paper, a method of deriving attribute weights from incompatibility among attributes and possible constraints on the weights is developed based on the evidential reasoning approach in which attribute aggregation is nonlinear rather than linear. The incompatibility is a flexible combination of deviation incompatibility and decision incompatibility with a relaxation coefficient. The deviation incompatibility measures differences between assessments of alternatives on each attribute and the decision incompatibility quantifies differences between assessments of alternatives on one attribute and the aggregated assessments of the alternatives. For a specific alternative, two pairs of optimization problems with a constraint on the difference between potential weights and the combination of deviation incompatibility and decision incompatibility are designed to generate the favorable intervals of attribute weights and those of utilities of assessment grades. A problem of car performance assessment is investigated to demonstrate the applicability of the proposed method. The method is validated by comparison with other methods of producing attribute weights using the problem.     

基于多授权中心属性基加密的多域云访问控制方案

针对多授权属性基加密方案的合谋攻击和多域共享数据问题,提出了一种基于多授权中心属性基加密的多域云访问控制方案。中央认证机构不参与用户私钥的生成过程,有效避免了用户与授权机构之间的联合攻击;通过线性秘密共享方案和代理重加密技术,云服务器对上传的数据文件进行重加密,实现了单域和多域用户数据的共享。分析结果表明,新方案在用户私钥生成和文件加/解密上具有较高的性能,并在q parallel BDHE假设下是自适应性安全的。     

A programming language with an expandable grammar

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 147–155, May–June, 1993.     

A multiple attributes decision making method using individual and collaborative attribute data in a fuzzy environment

Although multiple attribute decision making (MADM) problems with both individual attribute data of a single alternative and collaborative attribute data of pairwise alternatives exist in the real world, they have seldom been a focus of research. This paper proposes a MADM method using individual and collaborative attribute data in a fuzzy environment, in which experts use linguistic variables to express their opinions. In the method, first, the evaluation matrix of individual attributes date and the judgment matrix of collaborative attributes data are constructed. Then, the central dominance of one alternative outranking other all alternatives is defined for aggregating the collaborative data. From this, an integrated decision matrix incorporating individual and collaborative attribute data is constructed. Further, based on an extended TOPSIS, the fuzzy positive-ideal solution (FPIS) and the fuzzy negative-ideal solution (FNIS) are determined, and the relative closeness of each alternative to the FPIS and FNIS is calculated to determine the ranking order of all alternatives. Finally, two examples are used to illustrate the applicability of the proposed method.     

ANTLRWorks: an ANTLR grammar development environment

Programmers tend to avoid using language tools, resorting to ad hoc methods, because tools can be hard to use, their parsing strategies can be difficult to understand and debug, and their generated parsers can be opaque black‐boxes. In particular, there are two very common difficulties encountered by grammar developers: understanding why a grammar fragment results in a parser non‐determinism and determining why a generated parser incorrectly interprets an input sentence. This paper describes ANTLRWorks, a complete development environment for ANTLR grammars that attempts to resolve these difficulties and, in general, make grammar development more accessible to the average programmer. The main components are a grammar editor with refactoring and navigation features, a grammar interpreter, and a domain‐specific grammar debugger. ANTLRWorks' primary contributions are a parser non‐determinism visualizer based on syntax diagrams and a time‐traveling debugger that pays special attention to parser decision‐making by visualizing lookahead usage and speculative parsing during backtracking. Copyright © 2008 John Wiley & Sons, Ltd.