the study of slender structures in mechanical or civil/industrial constructions represents a continuous challenge from the view point of the risk factors identifying and offering sustainable solutions and methods to e...
详细信息
this paper considers a coordinated global shipment matching problem in which a global operator receives shipment requests from shippers and three local operators provide local transport services in different geographi...
详细信息
ISBN:
(数字)9781665490429
ISBN:
(纸本)9781665490429
this paper considers a coordinated global shipment matching problem in which a global operator receives shipment requests from shippers and three local operators provide local transport services in different geographical areas. While local operators make local matching decisions, the global operator combines the matched local services into itineraries to provide integrated transport for shipments. To handle the interconnecting constraints between different operators, a Lagrangian relaxation heuristic approach is developed. Under the proposed approach, the original problem is decomposed into local operator-related subproblems. these subproblems are optimized iteratively under local constraints as well as under the incentives imposed by the global operator to meet interconnecting constraints. the experiment results show that withthe proposed approach, global transport planning that requires coordination among different operators to achieve a common goal can be realized.
We consider a fleet of elementary robots that can be connected in different ways to transport loads of different types. For instance, a single robot can transport a small load and the association of two robots can eit...
详细信息
ISBN:
(数字)9781665490429
ISBN:
(纸本)9781665490429
We consider a fleet of elementary robots that can be connected in different ways to transport loads of different types. For instance, a single robot can transport a small load and the association of two robots can either transport a large load or two small loads. We seek to determine the number of robots necessary to transport a set of loads in a given time interval, at minimum cost. the cost is function of the number of robots and of the distance travelled by robots. the fleet sizing problem can be formulated by an integer linear problem. In the special case of two types of loads and two configurations, closed-form expressions for the minimum number of robots can be derived. Finally, we show how reconfigurability can allow to diminish the number of required robots.
Information security has become a major concern in today's digital world withthe rapid growth of the internet. To confront this challenge, various techniques like cryptography and steganography have developed in ...
详细信息
To remain competitive in a highly dynamic environment, manufacturing companies have to quickly react to disturbances or changing customer requirements. To enable manufacturing systems to cover these dynamics, the conc...
详细信息
ISBN:
(数字)9781665490429
ISBN:
(纸本)9781665490429
To remain competitive in a highly dynamic environment, manufacturing companies have to quickly react to disturbances or changing customer requirements. To enable manufacturing systems to cover these dynamics, the concept of reconfigurable manufacturing systems was introduced. From a technical point of view, this concept has been exploited the past 20 years, revealing several different design solutions. However, industrial application is still an exception. Our analysis led to the assumption that this is due to a lack of operator support for reconfiguration management. In addition, mostly individual aspects of reconfiguration are considered instead of exploiting the entire reconfiguration space at the system and machine level. therefore, in this paper we present a digital twin framework for reconfiguration management considering reconfiguration as a holistic problem and taking advantage of the digital twin concept to integrate heterogeneous data from different sources.
Endocrine-disrupting chemicals (EDCs) are widely used in consumer products and have been linked to health outcomes with high associated costs. Unfortunately, current methods to evaluate the potential health impacts ar...
详细信息
Far-ultraviolet C (UVC) light has demonstrated its ability to inactivate microbes on surfaces. However, the factors influencing the efficacy of far-UVC surface disinfection remain unclear. this study aimed to explore ...
详细信息
the main objective of this research, is to compare the performance of ResNet models when deployed on the images of Brain CT scans. In this research three ResNet models are selected withthe goal of identifying the mos...
详细信息
the advent of digital transformation has revolutionized the way businesses operate. Applications have become the focal point of this transformation, shifting the focus from being organization-centric to user-centric. ...
详细信息
Deep neural network (DNN) testing approaches have grown fast in recent years to test the correctness and robustness of DNNs. In particular, DNN coverage criteria are frequently used to evaluate the quality of a test s...
详细信息
ISBN:
(纸本)9781665457019
Deep neural network (DNN) testing approaches have grown fast in recent years to test the correctness and robustness of DNNs. In particular, DNN coverage criteria are frequently used to evaluate the quality of a test suite, and a number of coverage criteria based on neuron-wise, layer-wise, and path-/trace-wise coverage patterns have been published to date. However, we see that existing criteria are insufficient to represent how one neuron would influence subsequent neurons;hence, we lack a concept of how neurons, when functioning as causes and effects, might jointly make a DNN prediction. Given recent advances in interpreting DNN internals using causal inference, we present the first causality-aware DNN coverage criterion, which evaluates a test suite by quantifying the extent to which the suite provides new causal relations for testing DNNs. Performing standard causal inference on DNNs presents boththeoretical and practical hurdles. We introduce CC (causal coverage), a practical and efficient coverage criterion that integrates a set of optimizations using DNN domain-specific knowledge. We illustrate the efficacy of CC using diverse, real-world inputs and adversarial inputs, such as adversarial examples (AEs) and backdoor inputs. We demonstrate that CC outperforms previous DNN criteria under various settings with moderate cost.
暂无评论