Search

Your search keyword '"Hacid, M"' showing total 67 results
Start Over Author "Hacid, M"

Refine your results

more »

more »

more »
67 results on '"Hacid, M"'

2. Run-Time Monitoring for Privacy-Agreement Compliance

Author

Benbernou, S., Meziane, H., Hacid, M. S., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Krämer, Bernd J., editor, Lin, Kwei-Jay, editor, and Narasimhan, Priya, editor

Published
2007
Full Text
View/download PDF

6. An Agent Model for Analysis of Human Performance Quality

Author

Klein, M.C.A., van Lambalgen, R.M., Treur, J., Huang, X.J., Ghorbani, A.A., Hacid, M.-S., Yamaguchi, T., Artificial intelligence, Social AI, Network Institute, Huang, X.J., Ghorbani, A.A., Hacid, M.-S., and Yamaguchi, T.

Subjects
Knowledge management, SDG 16 - Peace, human performance, Computer Networks and Communications, business.industry, Computer science, SDG 16 - Peace, Justice and Strong Institutions, agent model, support agent, Software quality, Justice and Strong Institutions, Task (project management), Risk analysis (engineering), Software agent, Human–computer interaction, Artificial Intelligence, cognitive energetics, business, Simulation, Software, Degradation (telecommunications), Performance quality
Abstract

A human's performance in a complex task is highly dependent on the demands of the task, in the sense that highly demanding situations will often cause a degradation of performance. To maintain performance quality usually extra effort has to be contributed. However, the resources for such extra effort available to the human are limited. In this paper an agent model is proposed in which different types of relations between effort, task demands and performance quality can be used to analyse the human's performance quality. It is illustrated how a support agent incorporating this model can support a human based on different performance criteria. The agent model thus allows to build agent applications that provide optimal support depending on a specific situation and goal of the task. © 2013 ? IOS Press and the authors. All rights reserved.

Published
2010
Full Text
View/download PDF

7. Business process compliance management : an integrated proactive approach

Author

Elgammal, A., Sebahi, S., Turetken, O., Hacid, M.-S., Papazoglou, M., van den Heuvel, W., Soliman, K.S., and Information Systems IE&IS

Subjects
ComputingMilieux_LEGALASPECTSOFCOMPUTING
Abstract

Today’s enterprises demand a high degree of compliance of business processes to meet regulations, such as Sarbanes-Oxley and Basel I-III. To ensure continuous guaranteed compliance, compliance management should be considered during all phases of the business process lifecycle; from the analysis and design to deployment, monitoring and evaluation. This paper introduces an integrated business process compliance management framework that incorporates design-time verification and runtime monitoring approaches. The nutshell of the approach is the Compliance Request Language (CRL), which is a high-level pattern-based language for the abstract specification of compliance requirements. From CRL expressions, formal compliance rules can be automatically generated, thereby eliminating the need for business and compliance experts to learn and use complex low-level formal languages. Formalized compliance rules enable automated approaches to be used for the static verification and dynamic monitoring of business processes. An integrated prototypical tool-suite is developed as a proof-of-concept to help validating the applicability of the approaches, and validated by experiment with two real-life case studies.

Published
2014

9. Selecting Web Services for Choreography Implementation: Compatibility Checking Approach with Access Control

Author

Emad Elabd, Coquery, E., Hacid, M. -S, SI LIRIS, Équipe gestionnaire des publications, Knowledge Systems Institute Graduate School, Base de Données (BD), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; Recently, Web services technologies are adapted for designing and implementing complex inter-enterprise business applications. Web services choreography defines the required behaviors of Web ser-vices which participate in implementing such applications with their interactions through message exchanges. The designer of the application collects the Web services that implement the defined choreography. The selected services must be compatible and per-form the required operations of the application. Therefore, check-ing the compatibility between Web services to guarantee that they can interact correctly is a main step in the verification process. This type of checking is based on the services descriptions. Enrich-ing services descriptions by including their behaviours is becoming more and more important. This behaviour can be described by business protocols (BP) representing the possible sequences of message exchanges. Since a lot of Web services use access control policies (ACP) to restrict the access to authorized consumers, these policies should be a part of the service description. Selecting compatible Web services for implementing service choreography is the main contribution of this work. This is achieved by modeling and checking the compatibility between Web services by analyzing their business protocols after assigning the access control policies. Access control policies will be presented using ontology.

Published
2010

10. Timed transition discovery from Web service conversation logs

Author

Didier Devaurs, Musaraj, K., Marchi, F., Hacid, M. -S, School of Computer Science [Windsor], University of Windsor [Ca], Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Base de Données (BD), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), European Project: 215175,EC:FP7:ICT,FP7-ICT-2007-1,COMPAS(2008), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National des Sciences Appliquées de Lyon - INSA (FRANCE), Université Claude Bernard-Lyon I - UCBL (FRANCE), Ecole Centrale de Lyon (FRANCE), Université Lumière-Lyon 2 (FRANCE), Laboratoire d'Informatique en Images et Systèmes d'Information - LIRIS (Lyon, France), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Devaurs, Didier, and Compliance-driven Models, Languages, and Architectures for Services - COMPAS - - EC:FP7:ICT2008-02-01 - 2011-01-31 - 215175 - VALID

Subjects
temporal constraint, business protocol, Knowledge extraction, [INFO.INFO-WB] Computer Science [cs]/Web, Temporal constraint, Web service, [INFO.INFO-WB]Computer Science [cs]/Web, Traitement du signal et de l'image, knowledge extraction, Business protocol, Web
Abstract

International audience; Despite their importance, Web service business protocols are not always published with service interfaces, which hinders automatic management. A solution is to extract them from past executions. One of the raised issues is the discovery of temporal constraints called timed transitions, which are not explicitly recorded. In this paper we present our approach for discovering such transitions. We de ne a class of patterns called proper timeouts which are equivalent to timed transitions, and present a polynomial algorithm for extracting these patterns.

Published
2008

11. Domain Knowledge Based Queries for Multimedia Data Retrieval

Author

Benbernou, S., Hacid, M. -S, Hammiche, S., Lopez, B., Athina Vakali, SI LIRIS, Équipe gestionnaire des publications, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), and Thessaloniki University (Thessaloniki University)

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; This paper describes an approach for semantic description and retrieval of multimedia data described by means ofMPEG-7. This standard uses XML schema to define the descriptions. Therefore, it lacks ability to represent the data semanticsin a formal and concise way and it does not allow integration and use of domain specific knowledge. Moreover,inference mechanisms are not provided and hence the extraction of implicit information is not (always) possible. To addressthese issues, we propose to add a conceptual layer on top of MPEG-7 metadata layer, where the domain knowledgeis represented using a formal language. A set of mapping rules is proposed. They serve as a bridge between the twolayers.Querying MPEG-7 descriptions using XML query languages such as XPath or XQuery requires to know MPEG-7syntax and documents structure. To provide a flexible query formulation, we exploit the conceptual layer vocabularyto express user queries. A user query, making reference to terms specified at the conceptual level, is rewritten into anXQuery expression over MPEG-7 descriptions.

Published
2007

12. A General Framework for Covering Concepts using Terminologies

Author

Boualem Benatallah, Hacid, M. -S, Léger, A., Rey, C., Toumani, F., SI LIRIS, Équipe gestionnaire des publications, Diego Calvanese, Enrico Franconi, Volker Haarslev, Domenico Lembo, Boris Motik, Anni-Yasmin Turhan, Sergio Tessaris, Service Oriented Computing (SOC), Base de Données (BD), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), France Télécom Recherche & Développement (FT R&D), France Télécom, Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), Diego Calvanese, Enrico Franconi, Volker Haarslev, Domenico Lembo, Boris Motik, Anni-Yasmin Turhan, Sergio Tessaris, Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), and Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; We describe a general framework for covering concepts using terminologies and briefly present the already investigated instances of this framework. Then, we formalize the best covering problem in the context of the ALN language, in which the difference operation is not semantically unique, and sketches the technique to solve the underlying computation problems

Published
2007

13. Towards semantics driven, flexible and scalable framework for peering and querying e-atalog communities

Author

Benatallah, Boualem, Paik, Hye-Young, Hacid, M., Rey, Christophe, Toumani, Farouk, Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), and SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP)

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]
Published
2006

14. Towards Data warehouses for Natural Hazards

Author

Hajji, H., Hacid, M. -S, Hassan BADIR, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), and SI LIRIS, Équipe gestionnaire des publications

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2005

15. Automatic web service disco

Author

Benatallah, Boualem, Hacid, M., Rey, Christophe, Toumani, Farouk, Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS), and Seguy, Rose

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]
Published
2005

16. A hybrid approach to semantic web service discovery

Author

Benbernou, Salima, Canaud, E., Hacid, M., Toumani, Farouk, Seguy, Rose, Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), and Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]
Published
2004

17. A Study on Workload Characterization for a Web Proxy Server

Author

George Pallis, Vakali, A., Angelis, L., Saïd Hacid, M., Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), and SI LIRIS, Équipe gestionnaire des publications

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; The popularity of the World-Wide-Web has increaseddramatically in the past few years. Web proxy servershave an important role in reducing server loads, networktraffic, and client request latencies. This paper presentsa detailed workload characterization study of a busyWeb proxy server. The study aims in identifying themajor characteristics which will improve modelling ofWeb proxy accessing. A set of log files is processed forworkload characterization. Throughout the study,emphasis is given on identifying the criteria for a Webcaching model. A statistical analysis, based on theprevious criteria, is presented in order to characterizethe major workload parameters. Results of this analysisare presented and the paper concludes with a discussionabout workload characterization and content deliveryissues.

Published
2003

18. A Study on Workload Characterization for a Web Proxy Server

Author

Pallis, George C., Vakali, Athena I., Angelis, Lefteris, Saïd Hacid, M., Pallis, George C. [0000-0003-1815-5468], and Vakali, Athena I. [0000-0002-0666-6984]

Subjects
Mathematical models, Information retrieval systems, Data reduction, Routers, HTTP, Web Caching, Servers, Information technology, World Wide Web, Telecommunication traffic, Proxy servers, Web Data Workload Analysis, Web Technologies, Congestion control (communication), Pareto principle
Abstract

The popularity of the World-Wide-Web has increased dramatically in the past few years. Web proxy servers have an important role in reducing server loads, network traffic, and client request latencies. This paper presents a detailed workload characterization study of a busy Web proxy server. The study aims in identifying the major characteristics which will improve modelling of Web proxy accessing. A set of log files is processed for workload characterization. Throughout the study, emphasis is given on identifying the criteria for a Web caching model. A statistical analysis, based on the previous criteria, is presented in order to characterize the major workload parameters. Results of this analysis are presented and the paper concludes with a discussion about workload characterization and content delivery issues. 21 779 784 Sponsors: International Assoc. of Sc. and Technol. for Developm. (IASTED) Conference code: 62395 Cited By :3

Published
2003

19. Request rewriting based web service discovery

Author

Benatallah, Boualem, Hacid, M., Rey, C., Toumani, Farouk, Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), Seguy, Rose, and Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]
Published
2003

20. Constraint-Based Approach to Semistructured Data

Author

Hacid, M., Toumani, Farouk, Elmagradid, A., Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS), Seguy, Rose, and SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP)

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]
Published
2001

21. WS-CatalogNet: Building Peer-to-Peer e-Catalog

Author

Hacid, M S, Larsen, H L, Andreasen, T, Christiansen, H, Paik, Hye-Young, Benatallah, Boualem, Toumani, Farouk, Hacid, M S, Larsen, H L, Andreasen, T, Christiansen, H, Paik, Hye-Young, Benatallah, Boualem, and Toumani, Farouk

Published
2004

22. Emergent Semantics Systems

Author

Bouzeghoub, M, Goble, C, Kashyap, V, Spaccapietra, S, Aberer, K, Catarci, T, Cudre-Mauroux, P, Dillon, TS, Grimm, S, Hacid, M, Illarramendi, A, Jarrar, M, Mecella, M, Mena, E, Neuhold, EJ, Ouksel, AM, Risse, T, Scannapieco, M, Saltor, F, de Santis, L, Staab, S, Studer, R, De Troyer, O, Bouzeghoub, M, Goble, C, Kashyap, V, Spaccapietra, S, Aberer, K, Catarci, T, Cudre-Mauroux, P, Dillon, TS, Grimm, S, Hacid, M, Illarramendi, A, Jarrar, M, Mecella, M, Mena, E, Neuhold, EJ, Ouksel, AM, Risse, T, Scannapieco, M, Saltor, F, de Santis, L, Staab, S, Studer, R, and De Troyer, O

Abstract

With new standards like RDF or OWL paving the way for the much anticipated Semantic Web, a new breed of very large scale semantic systems is about to appear. Traditional semantic reconciliation techniques, dependent upon shared vocabularies or global ontologies, cannot be used in such open and dynamic environments. Instead, new heuristics based on emerging properties and local consensuses have to be exploited in order to foster semantic interoperability in the large. In this paper, we outline the main di.erences between traditional semantic reconciliation methods and these new heuristics. Also, we characterize the resulting emergent semantics systems and provide a couple of hints vis-`a-vis their potential applications.

Published
2004

46. On the midpoint of a set of XML documents

Author

Alberto Abello, Palol, X., Hacid, M. -S, Universitat Politècnica de Catalunya [Barcelona] (UPC), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, [INFO]Computer Science [cs]
Abstract

International audience; The WWW contains a huge amount of documents. Some of them share the subject, but are generated by different people or even organizations. To guarantee the interchange of such documents, we can use XML, which allows to share documents that do not have the same structure. However, it makes difficult to understand the core of such heterogeneous documents (in general, schema is not available). In this paper, we offer a characterization and algorithm to obtain the midpoint (in terms of a resemblance function) of a set of semi-structured, heterogeneous documents without optional elements. The trivial case of midpoint would be the common elements to all documents. Nevertheless, in cases with several heterogeneous documents this may result in an empty set. Thus, we consider that those elements present in a given amount of documents belong to the midpoint. A exact schema could always be found generating optional elements. However, the exact schema of the whole set may result in overspecialization (lots of optional elements), which would make it useless.

Full Text
View/download PDF

47. JoDS volume VIII

Author

Shvaiko, P., Hacid, M. -S, Mylopoulos, J., Barbara Pernici, Trujillo, J., Atzeni, P., Kifer, M., Spaccapietra, S., Fages, F., and Zaihrayeu, I.

48. Business process compliance management: An integrated proactive approach

Author

Elgammal, A., Sebahi, S., Turetken, O., Hacid, M. -S, Michael Papazoglou, Den Heuvel, W. -J, Department of Management, and Research Group: Information & Supply Chain Management

Subjects
ComputingMilieux_LEGALASPECTSOFCOMPUTING
Abstract

Today’s enterprises demand a high degree of compliance of business processes to meet regulations, such as Sarbanes-Oxley and Basel I-III. To ensure continuous guaranteed compliance, compliance management should be considered during all phases of the business process lifecycle; from the analysis and design to deployment, monitoring and evaluation. This paper introduces an integrated business process compliance management framework that incorporates design-time verification and runtime monitoring approaches. The nutshell of the approach is the Compliance Request Language (CRL), which is a high-level pattern-based language for the abstract specification of compliance requirements. From CRL expressions, formal compliance rules can be automatically generated, thereby eliminating the need for business and compliance experts to learn and use complex low-level formal languages. Formalized compliance rules enable automated approaches to be used for the static verification and dynamic monitoring of business processes. An integrated prototypical tool-suite is developed as a proof-of-concept to help validating the applicability of the approaches, and validated by experiment with two real-life case studies.

49. Using Negotiation to Reduce Redundant Autonomous Mobile Program Movements

Author

Huang, JX, Ghorbani, AA, Hacid, M-S, Yamaguchi, T, Chechina, Natalia, King, P., Trinder, P., Huang, JX, Ghorbani, AA, Hacid, M-S, Yamaguchi, T, Chechina, Natalia, King, P., and Trinder, P.

Abstract

Distributed load managers exhibit thrashing where tasks are repeatedly moved between locations due to incomplete global load information. This paper shows that systems of Autonomous Mobile Programs (AMPs) exhibit the same behaviour, identifying two types of redundant movement and terming them greedy effects. AMPs are unusual in that, in place of some external load management system, each AMP periodically recalculates network and program parameters and may independently move to a better execution environment. Load management emerges from the behaviour of collections of AMPs. The paper explores the extent of greedy effects by simulation, and then proposes negotiating AMPs (NAMPs) to ameliorate the problem. We present the design of AMPs with a competitive negotiation scheme (cNAMPs), and compare their performance with AMPs by simulation.

Catalog

Books, media, physical & digital resources
See catalog results