Supply chain management (SCM) environments are often dynamic markets providing a plethora of information, either complete or incomplete. It is, therefore, evident that such environments demand intelligent solutions, w...
详细信息
Supply chain management (SCM) environments are often dynamic markets providing a plethora of information, either complete or incomplete. It is, therefore, evident that such environments demand intelligent solutions, which can perceive variations and act in order to achieve maximum revenue. To do so, they must also provide some sophisticated mechanism for exploiting the full potential of the environments they inhabit. Advancing on the way autonomous solutions usually deal with the SCM process, we have built a robust and highly-adaptable mechanism for efficiently dealing with all SCM facets, while at the same time incorporating a module that exploits data mining technology in order to forecast the price of the winning bid in a given order and, thus, adjust its bidding strategy. The paper presents our agent, Mertacor, and focuses on the forecasting mechanism it incorporates, aiming to optimal agent efficiency
Service Function Chaining (SFC) paradigm consists in steering traffic flows through an ordered set of Service Functions (SFs) so that to realize complex end to end services. SFC architecture introduces all the logical...
详细信息
ISBN:
(数字)9781728144450
ISBN:
(纸本)9781728144467
Service Function Chaining (SFC) paradigm consists in steering traffic flows through an ordered set of Service Functions (SFs) so that to realize complex end to end services. SFC architecture introduces all the logical functions that need to be developed in order to provide the required service. The SFC overlay infrastructure can be built on top of many different underlay network technologies. The high flexibility and centrally controlled feature of Software Defined Networking (SDN), make SDN networks to be a perfect underlay to build the SFC architecture. Due to Ternary Content Address Memory (TCAM) limited size, SDN switches have a limitation in the number of flow rules that can be hosted. This constraint is particularly penalizing in case of the SFC classifier function, since it requires to manage a high number of different flows. The limitation imposed by the TCAM size on the SFC classifier can be a bottleneck for the number of SFC requests that the SDN-based SFC architecture can handle. In this paper we define the Dynamic Chain Request Classification Offloading (D-CRCO) problem, as the one of maximizing the number of accepted SFC requests, having the possibility of: i) implement the SFC classifier also in a node that is internal to the SDN-based SFC domain, and ii) install classification rules in a reactive fashion. Furthermore, we propose the Dynamic Nearest Node (DNN) heuristic to solve the D-CRCO problem. Performance evaluation shows that by using DNN heuristic it is possible to triple the number of accepted requests, with respect to existing solutions.
In complex and dynamic environments where interdependencies cannot monotonously determine causality, data mining techniques may be employed in order to analyze the problem, extract key features and identify pivotal fa...
详细信息
In complex and dynamic environments where interdependencies cannot monotonously determine causality, data mining techniques may be employed in order to analyze the problem, extract key features and identify pivotal factors. Typical cases of such complexity and dynamicity are supply chain networks, where a number of involved stakeholders struggle towards their own benefit. These stakeholders may be agents with varying degrees of autonomy and intelligence, in a constant effort to establish beneficiary contracts and maximize own revenue. In this paper, we illustrate the benefits of data mining analysis on a well-established agent supply chain management network. We apply data mining techniques, both at a macro and micro level, analyze the results and discuss them in the context of agent performance improvement.
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in...
详细信息
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a function of the content of the buffers, and the change of measure is determined using a cross-entropy-based adaptive procedure. This method yields asymptotically efficient estimation of overflow probabilities of queueing models for which it has been shown that methods using a state-independent change of measure are not asymptotically efficient. Numerical results demonstrating the effectiveness of the method are presented as well.
The increasing importance of information and communication technologies (ICT), new regulatory obligations (e.g. Basel II) and growing external risks (e.g. hacker attacks) put security risks in the management focus of ...
详细信息
The increasing importance of information and communication technologies (ICT), new regulatory obligations (e.g. Basel II) and growing external risks (e.g. hacker attacks) put security risks in the management focus of banking companies. The management has to decide whether to accept expected losses or to invest in technical security mechanisms in order to decrease the frequency of events or to invest in insurance policies in order to lower the severity of events. This paper contributes to the development of an optimization model that aims to determine the optimal amount to be invested in technical security mechanisms and insurance policies. Furthermore the model considers budget and risk limits as constraints and is supposed to help practitioners in controlling security risks.
The discovery of process information in natural language documents is hindered by the innate ambiguity of natural language. This issue is even more challenging when process information is spread throughout several doc...
详细信息
The discovery of process information in natural language documents is hindered by the innate ambiguity of natural language. This issue is even more challenging when process information is spread throughout several documents, each with the possibility of different formats, writers, and original purposes, that must be read and interpreted individually by a business analyst before their information can be uncovered. This work presents a semi-automated approach to process discovery from multiple documents simultaneously, making use of semantic similarity measures and natural language processing techniques to identify, gather, and extract process information from these documents. An experiment is conducted with this approach to demonstrate its use and results.
Computational and mathematical models are research subjects for solving engineering, computer science and computer vision problems. Image preprocessing usually needs to efficiently compute polygons related to some pre...
详细信息
For very large document collections or high volume streams of documents, finding relevant documents is a major information filtering problem. A major aid to information retrieval systems produces a word frequency meas...
详细信息
暂无评论