We propose a transactional activity model (TAM) for speciication and management of open-ended cooperative activities. In contrast to each of the extended transaction models which focus more on a formal template for data processing patterns in an application, the activity model contains a set of formal templates, namely activity patterns, for capturing patterns of object interactions in an appli...

According to OWASP-2021, more than 3,00,000 web applications have been detected for unauthenticated and unauthorised access leading a breach of security trust. Security patterns are commonly used in address the problem broken access. Web developers not experts implementing patterns. Therefore, it is necessary verify that pattern has applied, specifying original intent pattern. In this paper, an...

A recurring observation in memory industries is declining prices of about 60-70 percent within the first year of production of a new chip generation. Two reasons are made responsible for this pattern: (i) firms climb down a learning curve that induces declining prices, and (ii) firms that enter the product market first earn oligopoly rents. The objective of this paper is to decompose declining ...

Packing several characters into one computer word is a simple and natural way to compress the representation of a string and to speed up its processing. Exploiting this idea, we propose an index for a packed string, based on a sparse suffix tree [8] with appropriately defined suffix links. Assuming, under the standard unit-cost RAM model, that a word can store up to logσ n characters (σ the alp...

Access control patterns describe access control mechanisms at a high level of abstraction. An access control pattern provides a general solution to a class of access control problems for the confidentiality, integrity and availability of the information resources of software systems. While there has been much literature describing the general solution as to how these patterns enforce access con...

Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively re-constructing intermediate WAP-trees, starting with their suffix subsequences. This paper proposes an efficient approach for using the preorder linked WAP-trees...