Search results for "Algorithm"
showing 10 items of 4887 documents
A new algorithm for the kinetic data analysis
2000
Abstract In this paper, a new algorithm for the kinetic data analysis is presented. The main objective of the algorithm is to retrieve the maximum information concerned with a multi-response complex chemical system evolving in time, in order to retrieve the rate constants (calibration problem) or the initial concentration of species. As a difference with other data treatments found in the literature, the algorithm is able to estimate the uniqueness and reliability of the calculated rate constants. This task is carried out by analyzing of the principal components of the sensitivity coefficients with regard to the rate constants. The analysis allows understanding whether the located stationar…
Decentralization and heterogeneity in complex adaptative systems
2015
Purpose – Following a bacterial-based modeling approach, the authors want to model and analyze the impact of both decentralization and heterogeneity on group behavior and collective learning. The paper aims to discuss these issues. Design/methodology/approach – Inspired by bacterial conjugation, the authors have defined an artificial society in which agents’ strategies adapt to changes in resources location, allowing migration, and survival in a dynamic sugarscape-like scenario. To study the impact of these variables the authors have simulated a scenario in which resources are limited and localized. The authors also have defined three constraints in genetic information processing (inhibiti…
ERP lifecycle: When to retire your ERP system?
2011
Published version of a chapter in the book: Enterprise information systems, vol 219, part 3, 168-177. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-24358-5_17 A lot of research has been undertaken focusing on ERP systems lifecycles, but very little paid attention to retirement. ERP retirement means the replacement of an ERP with another. The aim of this research paper is to investigate why and when should organizations retire their ERP systems. A convenience case study of an SME has been selected from Egypt. The case study under investigation has retired their local ERP system and replaced it with SAP ERP. Results of our analysis indicated that reasons of retirem…
ERP Lifecycle
2000
A lot of research has been undertaken focusing on ERP systems lifecycles, but very little paid attention to retirement. ERP retirement means the replacement of an ERP with another. The aim of this research paper is to investigate why and when should organizations retire their ERP systems. A convenience case study of a SME has been selected from Egypt. The case study under investigation has retired their local ERP system and replaced it with SAP ERP. Results of the analysis indicate that reasons of retirement were: wrong selection, users were not involved in the selection process, and lack of an official implementation methodology. This is considered a new finding since main stream literatur…
Quantum Query Algorithms for Conjunctions
2010
Every Boolean function can be presented as a logical formula in conjunctive normal form. Fast algorithm for conjunction plays significant role in overall algorithm for computing arbitrary Boolean function. First, we present a quantum query algorithm for conjunction of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p = 4/5, that improves the previous result. Then, we present the main result - generalization of our approach to design efficient quantum algorithms for computing conjunction of two Boolean functions. Finally, we demonstrate another kind of an algorithm for conjunction of two bits, that has a correct answer probability p = 9/10. Th…
Economic lot scheduling on multiple production lines with resource constraints
2003
Abstract This paper deals with the multiple production line economic lot scheduling problem, where some items cannot be produced concurrently since they compete for some discrete resources. In particular, cyclic schedules are sought for a problem where identical production lines are present, lost sales are allowed, and minimization of the long-range production, setup, inventory, and shortage penalty costs are required. A heuristic procedure for this problem is introduced, a numerical example is worked out and some computational experiments are presented.
The linear saturated decentralized strategy for constrained flow control is asymptotically optimal
2013
We present an algorithm for constrained network flow control in the presence of an unknown demand. Our algorithm is decentralized in the sense that it is implemented by a team of agents, each controlling just the flow on a single arc of the network based only on the buffer levels at the nodes at the extremes of the arc, while ignoring the actions of other agents and the network topology. We prove that our algorithm is also stabilizing and steady-state optimal. Specifically, we show that it asymptotically produces the minimum-norm flow. We finally generalize our algorithm to networks with a linear dynamics and we prove that certain least-square optimality properties still hold.
Profiling in Algorithm-Based Decisions: An African Perspective
2023
The chapter explores the experience of algorithm-based decisions in Africa, and how non-African players are using artificial intelligence to enhance their presence in Africa. The chapter then looks at how some of the legal systems of Africa are adapting to deal with this phenomenon in the related jurisdictions.
From Requirements to Code in a Model Driven Way
2010
Though there is a lot of support for model driven development the support for complete model driven path from requirements to code is limited. The approach proposed in this paper offers such a path which is fully supported by model transformations. The starting point is semiformal requirements containing behaviour description in a controlled natural language. A chain of models is proposed including analysis, platform independent and platform specific models. A particular architecture style is chosen by means of selecting a set of appropriate design patterns for these models. It is shown how to define informally and then implement in model transformation language MOLA the required transforma…
Justification technique generalizations
2006
The justification technique was introduced various decades ago for the resource-constrained project scheduling problem, although it has rarely been used with the problem. Justification is a simple and quick technique which when applied to schedules produces a new schedule that is, at most, as long as the original schedule — and often shorter. A recent article (Valls et al, 2005), showed that incorporating justification in heuristic algorithms can produce a substancial improvement in the results obtained. These results have motivated us to generalise this technique in order to study it in greater depth. This paper proposes distinct forms and generalisations for the justification technique an…