136 resultados para sequential frequent pattern
Resumo:
The work reported in this paper is motivated by the need to investigate general methods for pattern transformation. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some agents in the pattern are introduced. The need for a mathematical tool and simulations for visualizing the behavior of a transformation method is highlighted. A mathematical method based on the Moebius transformation is proposed. The transformation method involves discretization of events for planning paths of individual robots in a pattern. Simulations on a particle physics simulator are used to validate the feasibility of the proposed method.
Resumo:
The work reported in this paper is motivated by the need for developing swarm pattern transformation methodologies. Two methods, namely a macroscopic method and a mathematical method are investigated for pattern transformation. The first method is based on macroscopic parameters while the second method is based on both microscopic and macroscopic parameters. A formal definition to pattern transformation considering four special cases of transformation is presented. Simulations on a physics simulation engine are used to confirm the feasibility of the proposed transformation methods. A brief comparison between the two methods is also presented.
Resumo:
The work reported in this paper is motivated by biomimetic inspiration - the transformation of patterns. The major issue addressed is the development of feasible methods for transformation based on a macroscopic tool. The general requirement for the feasibility of the transformation method is determined by classifying pattern formation approaches an their characteristics. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some robotic agents are introduced. A feasible method for transforming patterns geometrically, based on the macroscopic parameter operation of a swarm is considered. The transformation method is applied to a swarm model which lends itself to the transformation technique. Simulation studies are developed to validate the feasibility of the approach, and do indeed confirm the approach.
Resumo:
An approach to the automatic generation of efficient Field Programmable Gate Arrays (FPGAs) circuits for the Regular Expression-based (RegEx) Pattern Matching problems is presented. Using a novel design strategy, as proposed, circuits that are highly area-and-time-efficient can be automatically generated for arbitrary sets of regular expressions. This makes the technique suitable for applications that must handle very large sets of patterns at high speed, such as in the network security and intrusion detection application domains. We have combined several existing techniques to optimise our solution for such domains and proposed the way the whole process of dynamic generation of FPGAs for RegEX pattern matching could be automated efficiently.
Resumo:
This paper describes a proposed new approach to the Computer Network Security Intrusion Detection Systems (NIDS) application domain knowledge processing focused on a topic map technology-enabled representation of features of the threat pattern space as well as the knowledge of situated efficacy of alternative candidate algorithms for pattern recognition within the NIDS domain. Thus an integrative knowledge representation framework for virtualisation, data intelligence and learning loop architecting in the NIDS domain is described together with specific aspects of its deployment.
Resumo:
Abstract-The work reported in this paper is motivated by the need for developing swarm pattern transformation methodologies. Two methods, namely a macroscopic method and a mathematical method are investigated for pattern transformation. The first method is based on macroscopic parameters while the second method is based on both microscopic and macroscopic parameters. A formal definition to pattern transformation considering four special cases of transformation is presented. Simulations on a physics simulation engine are used to confirm the feasibility of the proposed transformation methods. A brief comparison between the two methods is also presented.
Resumo:
The work reported in this paper is motivated by the need to investigate general methods for pattern transformation. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some agents in the pattern are introduced. The need for a mathematical tool and simulations for visualizing the behavior of a transformation method is highlighted. A mathematical method based on the Moebius transformation is proposed. The transformation method involves discretization of events for planning paths of individual robots in a pattern. Simulations on a particle physics simulator are used to validate the feasibility of the proposed method.
Resumo:
Information systems for business are frequently heavily reliant on software. Two important feedback-related effects of embedding software in a business process are identified. First, the system dynamics of the software maintenance process can become complex, particularly in the number and scope of the feedback loops. Secondly, responsiveness to feedback can have a big effect on the evolvability of the information system. Ways have been explored to provide an effective mechanism for improving the quality of feedback between stakeholders during software maintenance. Understanding can be improved by using representations of information systems that are both service-based and architectural in scope. The conflicting forces that encourage change or stability can be resolved using patterns and pattern languages. A morphology of information systems pattern languages has been described to facilitate the identification and reuse of patterns and pattern languages. The kind of planning process needed to achieve consensus on a system's evolution is also considered.
Resumo:
Purpose: The purpose of this paper is to address a classic problem – pattern formation identified by researchers in the area of swarm robotic systems – and is also motivated by the need for mathematical foundations in swarm systems. Design/methodology/approach: The work is separated out as inspirations, applications, definitions, challenges and classifications of pattern formation in swarm systems based on recent literature. Further, the work proposes a mathematical model for swarm pattern formation and transformation. Findings: A swarm pattern formation model based on mathematical foundations and macroscopic primitives is proposed. A formal definition for swarm pattern transformation and four special cases of transformation are introduced. Two general methods for transforming patterns are investigated and a comparison of the two methods is presented. The validity of the proposed models, and the feasibility of the methods investigated are confirmed on the Traer Physics and Processing environment. Originality/value: This paper helps in understanding the limitations of existing research in pattern formation and the lack of mathematical foundations for swarm systems. The mathematical model and transformation methods introduce two key concepts, namely macroscopic primitives and a mathematical model. The exercise of implementing the proposed models on physics simulator is novel.
Resumo:
Diastereoselective conjugate addition of lithium (S)-N-allyl-N-alpha-methylbenzylamide to a range of alpha,beta-unsaturated esters followed by ring closing metathesis is used to afford efficiently a range of substituted cyclic beta-amino esters in high d.e. Alternatively, conjugate addition to alpha,beta-unsaturated Weinreb amides, functional group conversion and ring closing metathesis affords cyclic amines in high d.e. The further application of this methodology to the synthesis of a range of carbocyclic beta-amino esters via conjugate addition, enolate alkylation and ring closing metathesis is also described. Application of this methodology affords, after deprotection, (S)-homoproline, (S)-homopipecolic acid, (S)-coniine and (1S,2S)-trans-pentacin.
Resumo:
Research on the production of relative clauses (RCs) has shown that in English, although children start using intransitive RCs at an earlier age, more complex, bi-propositional object RCs appear later (Hamburger & Crain, 1982; Diessel and Tomasello, 2005), and children use resumptive pronouns both in acceptable and unacceptable ways (McKee, McDaniel, & Snedeker, 1998; McKee & McDaniel, 2001). To date, it is unclear whether or not the same picture emerges in Turkish, a language with an SOV word-order and overt case marking. Some studies suggested that subject RCs are more frequent in adults and children (Slobin, 1986) and yield a better performance than object RCs (Özcan, 1996), but others reported the opposite pattern (Ekmekçi, 1990). Our study addresses this issue in Turkish children and adults, and uses participants’ errors to account for the emerging asymmetry between subject and object RCs. 37 5-to-8 year old monolingual Turkish children and 23 adult controls participated in a novel elicitation task involving cards, each consisting of four different pictures (see Figure 1). There were two sets of cards, one for the participant and one for the researcher. The former had animals with accessories (e.g., a hat) whereas the latter had no accessories. Participants were instructed to hold their card without showing it to the researcher and describe the animals with particular accessories. This prompted the use of subject and object RCs. The researcher had to identify the animals in her card (see Figure 2). A preliminary repeated measures ANOVA with the factor Group (pre-school, primary-school children) showed no differences between the groups in the use of RCs (p>.1), who were therefore collapsed into one for further analyses. A repeated measures ANOVA with the factors Group (children, adults) and RC-Type (Subject, Object) showed that children used fewer RCs than adults (F(1,58)=7.54, p<.01), and both groups used fewer object than subject RCs (F(1,58)=22.46, p<.001), but there was no Group by RC-Type interaction (see Figure 3). A similar ANOVA on the rate of grammatical RCs showed a main effect of Group (F(1,58)=77.25, p<.001), a main effect of RC-Type (F(1,58)=66.33, p<.001), and an interaction of Group by RC-Type (F(1,58)=64.6, p<.001) (see Figure 4). Children made more errors than adults in object RCs (F(1,58)=87.01, p<.001), and children made more errors in object compared to subject RCs (F(1,36)=106.35, p<.001), but adults did not show this asymmetry. The error analysis revealed that children systematically avoided the object-relativizing morpheme –DIK, which requires possessive agreement with the genitive-marked subject. They also used resumptive pronouns and resumptive full-DPs in the extraction site similarly to English children (see Figure 5). These findings are in line with Slobin (1986) and Özcan (1996). Children’s errors suggest that they avoid morphosyntactic complexity of object RCs and try to preserve the canonical word order by inserting resumptive pronouns in the extraction site. Finally, cross-linguistic similarity in the acquisition of RCs in typologically different languages suggests a higher accessibility of subject RCs both at the structural (Keenan and Comrie, 1977) and conceptual level (Bock and Warren, 1986).