Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailA Survey of Cooperative ITS for Next Generation Public Transport Systems
Seredynski, Marcin; Viti, Francesco UL

in Intelligent Transportation Systems (ITSC), 2016 IEEE 19th International Conference on (2016, November)

Detailed reference viewed: 150 (10 UL)
Full Text
Peer Reviewed
See detailA Survey of Evolutionary Computation for Resource Management of Processing in Cloud Computing
Guzek, Mateusz UL; Bouvry, Pascal UL; Talbi, El-Ghazali

in IEEE Computational Intelligence Magazine (2015), 10(2), 53-67

Cloud computing is significantly reshaping the computing industry. Individuals and small organizations can benefit from using state-of-the-art services and infrastructure, while large companies are ... [more ▼]

Cloud computing is significantly reshaping the computing industry. Individuals and small organizations can benefit from using state-of-the-art services and infrastructure, while large companies are attracted by the flexibility and the speed with which they can obtain the services. Service providers compete to offer the most attractive conditions at the lowest prices. However, the environmental impact and legal aspects of cloud solutions pose additional challenges. Indeed, the new cloud-related techniques for resource virtualization and sharing and the corresponding service level agreements call for new optimization models and solutions. It is important for computational intelligence researchers to understand the novelties introduced by cloud computing. The current survey highlights and classifies key research questions, the current state of the art, and open problems. [less ▲]

Detailed reference viewed: 149 (9 UL)
Full Text
Peer Reviewed
See detailA Survey of Formal Verification Techniques for Model Transformations: A Tridimensional Classification
Amrani, Moussa UL; Lúcio, Lévi; Selim, Gehan et al

in Journal of Technology (2014)

Detailed reference viewed: 230 (8 UL)
Full Text
See detailSurvey of Petri nets Slicing
Khan, Yasir Imtiaz UL; Guelfi, Nicolas UL

Report (2013)

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Different Petri nets slicing constructions are studied along with algorithms to compute them ... [more ▼]

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Different Petri nets slicing constructions are studied along with algorithms to compute them. Petri nets slicing was first developed to facilitate debugging but then devel- oped for alleviating the state space explosion problem for model checking Petri nets. This article has twofold objectives, the first is to unify all the existing slicing algorithms syntactically by the definition of a standard abstract syntax and rewriting of the studied slicing algorithms using the proposed syntax. The second is to discuss the contribution of each slicing construction and comparing the major differences between them. One of the interesting exploitation of the survey is for the selection and im- provement of slicing techniques for approaches concerned by optimizing verification of state event models. [less ▲]

Detailed reference viewed: 220 (10 UL)
Full Text
Peer Reviewed
See detailA Survey of Petri Nets Slicing
Khan, Yasir Imtiaz; Konios, Alexandros; Guelfi, Nicolas UL

in ACM Computing Surveys (2018), 51(5), 109

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Petri nets slicing was first developed to facilitate debugging but then used for the alleviation ... [more ▼]

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Petri nets slicing was first developed to facilitate debugging but then used for the alleviation of the state space explosion problem for the model checking of Petri nets. In this article, different slicing techniques are studied along with their algorithms introducing: i) a classification of Petri nets slicing algorithms based on their construction methodology and objective (such as improving state space analysis or testing), ii) a qualitative and quantitative discussion and comparison of major differences such as accuracy and efficiency, iii) a syntactic unification of slicing algorithms that improve state space analysis for easy and clear understanding, and iv) applications of slicing for multiple perspectives. Furthermore, some recent improvements to slicing algorithms are presented, which can certainly reduce the slice size even for strongly connected nets. A noteworthy use of this survey is for the selection and improvement of slicing techniques for optimizing the verification of state event models. [less ▲]

Detailed reference viewed: 69 (3 UL)
Full Text
See detailA survey of semiparametric efficiency bounds for some microeconometric models
Severini, Thomas A.; Tripathi, Gautam UL

E-print/Working paper (2013)

Detailed reference viewed: 67 (2 UL)
Peer Reviewed
See detailSurvey of traceability approaches in model-driven engineering
Galvao, I.; Göknil, Arda UL

in 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC) 2013-12-05 15:42:49 +0000 (2007)

Detailed reference viewed: 78 (1 UL)
Full Text
Peer Reviewed
See detailA survey of visualization tools for biological network analysis.
Pavlopoulos, Georgios A.; Wegener, A. L.; Schneider, Reinhard UL

in BioData Mining (2008)

The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount of data and their ... [more ▼]

The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount of data and their heterogeneity provides a challenge for the visualization of the data. There are a wide variety of graph representations available, which most often map the data on 2D graphs to visualize biological interactions. These methods are applicable to a wide range of problems, nevertheless many of them reach a limit in terms of user friendliness when thousands of nodes and connections have to be analyzed and visualized. In this study we are reviewing visualization tools that are currently available for visualization of biological networks mainly invented in the latest past years. We comment on the functionality, the limitations and the specific strengths of these tools, and how these tools could be further developed in the direction of data integration and information sharing. [less ▲]

Detailed reference viewed: 101 (0 UL)
Full Text
Peer Reviewed
See detailSurvey on Broadcast Algorithms for Mobile Ad Hoc Networks
Ruiz, Patricia UL; Bouvry, Pascal UL

in ACM Computing Surveys (2015), 48(1),

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades ... [more ▼]

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades, many works have been proposed trying to make ad hoc networks a reality. The importance of broadcasting in networking and the broadcast nature of the wireless medium have encouraged researchers to join their efforts on designing efficient dissemination algorithms for Mobile Ad Hoc Networks (MANETs). The many different challenges that MANETs face, such as limited network resources, network partitions, or energy restrictions, gave rise to many different approaches to overcome one or more of those problems. Therefore, literature reveals a huge variety of techniques that have been proposed for efficient message dissemination. In this article, we make an in-depth review of the existing state-of-the-art techniques, as well as propose a new taxonomy that provides a global overview of the most relevant existing algorithms. [less ▲]

Detailed reference viewed: 149 (5 UL)
Full Text
See detailA Survey on Income Deprivation
D'Ambrosio, Conchita UL

in Silber, Jacques (Ed.) The Measurement of Individual Well-Being and Group Inequalities: Essays in Memory of Z.M. Berrebi (2010)

Detailed reference viewed: 87 (2 UL)
Full Text
See detailA Survey on Intersections of Maximal Partial Clones of Boolean Partial Functions
Couceiro, Miguel UL; Haddad, Lobna

in Multiple-Valued Logic (ISMVL), 2012 42nd IEEE International Symposium on (2012)

We survey known results and present some new ones about intersections of maximal partial clones on a 2-element set.

Detailed reference viewed: 62 (0 UL)
Full Text
Peer Reviewed
See detailA Survey on Mobile Crowdsensing Systems: Challenges, Solutions, and Opportunities
Capponi, Andrea UL; Fiandrino, Claudio UL; Kantarci, Burak et al

in IEEE Communications Surveys and Tutorials (2019), 21(3, thirdquarter 2019), 2419-2465

Mobile crowdsensing (MCS) has gained significant attention in recent years and has become an appealing paradigm for urban sensing. For data collection, MCS systems rely on contribution from mobile devices ... [more ▼]

Mobile crowdsensing (MCS) has gained significant attention in recent years and has become an appealing paradigm for urban sensing. For data collection, MCS systems rely on contribution from mobile devices of a large number of participants or a crowd. Smartphones, tablets, and wearable devices are deployed widely and already equipped with a rich set of sensors, making them an excellent source of information. Mobility and intelligence of humans guarantee higher coverage and better context awareness if compared to traditional sensor networks. At the same time, individuals may be reluctant to share data for privacy concerns. For this reason, MCS frameworks are specifically designed to include incentive mechanisms and address privacy concerns. Despite the growing interest in the research community, MCS solutions need a deeper investigation and categorization on many aspects that span from sensing and communication to system management and data storage. In this paper, we take the research on MCS a step further by presenting a survey on existing works in the domain and propose a detailed taxonomy to shed light on the current landscape and classify applications, methodologies, and architectures. Our objective is not only to analyze and consolidate past research but also to outline potential future research directions and synergies with other research areas. [less ▲]

Detailed reference viewed: 188 (15 UL)
See detailA survey on natural quantization
Poncin, Norbert UL

Presentation (2007)

Detailed reference viewed: 36 (2 UL)
Full Text
Peer Reviewed
See detailA survey on resource allocation in high performance distributed computing systems
Hussain, Hameed; Malik, Saif Ur Rehman; Hameed, Abdul et al

in Parallel Computing (2013), 39(11), 709-736

An efficient resource allocation is a fundamental requirement in high performance computing (HPC) systems. Many projects are dedicated to large-scale distributed computing systems that have designed and ... [more ▼]

An efficient resource allocation is a fundamental requirement in high performance computing (HPC) systems. Many projects are dedicated to large-scale distributed computing systems that have designed and developed resource allocation mechanisms with a variety of architectures and services. In our study, through analysis, a comprehensive survey for describing resource allocation in various HPCs is reported. The aim of the work is to aggregate under a joint framework, the existing solutions for HPC to provide a thorough analysis and characteristics of the resource management and allocation strategies. Resource allocation mechanisms and strategies play a vital role towards the performance improvement of all the HPCs classifications. Therefore, a comprehensive discussion of widely used resource allocation strategies deployed in HPC environment is required, which is one of the motivations of this survey. Moreover, we have classified the HPC systems into three broad categories, namely: (a) cluster, (b) grid, and (c) cloud systems and define the characteristics of each class by extracting sets of common attributes. All of the aforementioned systems are cataloged into pure software and hybrid/hardware solutions. The system classification is used to identify approaches followed by the implementation of existing resource allocation strategies that are widely presented in the literature. [less ▲]

Detailed reference viewed: 276 (7 UL)
Full Text
Peer Reviewed
See detailSurvey on Signaling Techniques for Cognitive Networks
Kliazovich, Dzmitry UL; Granelli, Fabrizio; Fonseca, Nelson L. S.

in Survey on Signaling Techniques for Cognitive Networks (2011)

Detailed reference viewed: 62 (0 UL)
Full Text
Peer Reviewed
See detailA Survey on Stability and Rigidity Results for Lie algebras
Crainic, Marius; Struchiner, Ivan; Schatz, Florian UL

in Indagationes Mathematicae (2014), 25(5), 957-976

We give simple and unified proofs of the known stability and rigidity results for Lie algebras, Lie subalgebras and Lie algebra homomorphisms. Moreover, we investigate when a Lie algebra homomorphism is ... [more ▼]

We give simple and unified proofs of the known stability and rigidity results for Lie algebras, Lie subalgebras and Lie algebra homomorphisms. Moreover, we investigate when a Lie algebra homomorphism is stable under all automorphisms of the codomain (including outer automorphisms). [less ▲]

Detailed reference viewed: 87 (4 UL)
Full Text
Peer Reviewed
See detailA survey on the arity gap
Couceiro, Miguel UL; Lehtonen, Erkko UL; Waldhauser, Tamás UL

in 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011) (2011)

The arity gap of a function of several variables is defined as the minimum decrease in the number of essential variables when essential variables are identified. We present a brief survey on the research ... [more ▼]

The arity gap of a function of several variables is defined as the minimum decrease in the number of essential variables when essential variables are identified. We present a brief survey on the research done on the arity gap, from the first studies of this notion up to recent developments. [less ▲]

Detailed reference viewed: 27 (0 UL)
Full Text
See detailA Survey on the Performance of Commercial Mobile Access Networks
Frank, Raphaël UL; Forster, Markus UL; Mario, Gerla et al

Report (2012)

Detailed reference viewed: 89 (4 UL)
Peer Reviewed
See detailSurvey response characteristics as indicators for detection of falsifications
Menold, N.; Kemper, Christoph UL

Scientific Conference (2011, July)

Detailed reference viewed: 23 (0 UL)
Full Text
See detailA survey: Scheduling of Automated Guided Vehicles in Flexible (Re-)Manufacturing Systems
Groß, Sebastian UL; Gerke, Wolfgang; Plapper, Peter UL

in Müller, Rainer; Brüls, Oliver; Abba, Gabriel (Eds.) et al Robotix-Academy Conference for Industrial Robotics (RACIR) 2019 (2019, June)

This work gives a state-of-the-art overview regarding the scheduling of Automated Guided Vehicles (AGV) in Flexible (Re-)Manufacturing Systems (FMS/FRMS). Different, general approaches are available to ... [more ▼]

This work gives a state-of-the-art overview regarding the scheduling of Automated Guided Vehicles (AGV) in Flexible (Re-)Manufacturing Systems (FMS/FRMS). Different, general approaches are available to solve this task. In this regard an overview of currently available fleet management software and research in this field as well as the simultaneous scheduling of machines and AGVs is given. Production scheduling and transport scheduling have been vastly studied by many researchers, but most of the works address these both problems separately. However, these two problems are closely linked and influence each other. By looking at them together, it is possible to achieve an improvement in the overall scheduling. The different works are examined regarding the consideration of one available machine for each tasks, or if alternative machines are available and if the approaches are static or dynamic. Especially the appropriability of the presented works regarding the use in remanufacturing systems is examined. Remanufacturing is a process for used products to make them “as good as new or better”. Due to unknown condition of the used products many challenges occur during the remanufacturing process which are special to the domain of remanufacturing and not know from manufacturing. The resulting stochastic routing of products and material in particular places special demands on the flexibility and dynamic of the scheduling and control of the remanufacturing system. In order to meet the challenges of a real remanufacturing system, the scheduling algorithm should consider alternative machines as well as be dynamic. None of the approaches examined can meet these requirements, which is why new methods have to be developed. [less ▲]

Detailed reference viewed: 133 (0 UL)