current products, especially in the automotive sector, pose complex technical systems having a multi-disciplinary mechatronic nature. Industrial standards supporting system engineering and production typically (i) add...
详细信息
ISBN:
(数字)9798350361230
ISBN:
(纸本)9798350361247
current products, especially in the automotive sector, pose complex technical systems having a multi-disciplinary mechatronic nature. Industrial standards supporting system engineering and production typically (i) address the production phase only, but do not cover the complete product life cycle, and (ii) focus on production processes and resources rather than the products themselves. the presented approach is motivated by incorporating the impacts of the end-of-life phase of the product life cycle into the engineering phase. this paper proposes a modeling approach coming up from the Product-Process-Resource (PPR) modeling paradigm. It combines requirements on (i) respecting the product structure as a basis for the model, and (ii) incorporates repairing, remanufacturing, or up cycling within cyber-physical production systems. the proposed model called PoPAN should accompany the product during the entire life cycle as a digital shadow encapsulated within the Asset Administration Shell of a product. To facilitate the adoption of the proposed paradigm, the paper also proposes serialization of the model in the AutomationML data format. the model is demonstrated on a use-case for disassembling electric vehicle batteries to support their remanufacturing for stationary battery applications.
this paper expands upon existing and introduces new formulations of Bennett's logical depth. A new notion based on pushdown compressors is developed. A pushdown deep sequence is constructed. the separation of (pre...
详细信息
ISBN:
(纸本)9783030389192;9783030389185
this paper expands upon existing and introduces new formulations of Bennett's logical depth. A new notion based on pushdown compressors is developed. A pushdown deep sequence is constructed. the separation of (previously published) finite-state based and pushdown based depth is shown. the previously published finite state depth notion is extended to an almost everywhere (a.e.) version. An a.e. finite-state deep sequence is shown to exist along with a sequence that is infinitely often (i.o.) but not a.e. finite-state deep. For both finite-state and pushdown, easy and random sequences with respect to each notion are shown to be non-deep, and that a slow growth law holds for pushdown depth.
the social, economic and environmental effects of natural disasters are increasing. It is widely demonstrated that the main cause is related to the climate change, and the latest predictions from the IPCC do not forec...
详细信息
this paper considers a game in which a single cop and a single robber take turns moving along the edges of a given graph G. If there exists a strategy for the cop which enables it to be positioned at the same vertex a...
详细信息
ISBN:
(纸本)9783030389192;9783030389185
this paper considers a game in which a single cop and a single robber take turns moving along the edges of a given graph G. If there exists a strategy for the cop which enables it to be positioned at the same vertex as the robber eventually, then G is called cop-win, and robber-win otherwise. In contrast to previous work, we study this classical combinatorial game on edge-periodic graphs. these are graphs with an infinite lifetime comprised of discrete time steps such that each edge e is assigned a bit pattern of length le, with a 1 in the i-th position of the pattern indicating the presence of edge e in the i-th step of each consecutive block of le steps. Utilising the known framework of reachability games, we obtain an O(LCM(L) . n(3)) time algorithm to decide if a given n-vertex edge-periodic graph Gt is cop-win or robber-win as well as compute a strategy for the winning player (here, L is the set of all edge pattern lengths le, and LCM(L) denotes the least common multiple of the set L). For the special case of edge-periodic cycles, we prove an upper bound of 2 . l . LCM(L) on the minimum length required of any edge-periodic cycle to ensure that it is robber-win, where l = 1 if LCM(L) = 2 . maxL, and l = 2 otherwise. Furthermore, we provide constructions of edge-periodic cycles that are cop-win and have length 1.5 . LCM(L) in the l = 1 case and length 3 . LCM(L) in the l = 2 case.
the competitive diffusion game is a game-theoretic model of information spreading on a graph proposed by Alon et al. (2010). In the model, a player chooses an initial vertex of the graph, from which information by the...
详细信息
ISBN:
(纸本)9783030389192;9783030389185
the competitive diffusion game is a game-theoretic model of information spreading on a graph proposed by Alon et al. (2010). In the model, a player chooses an initial vertex of the graph, from which information by the player spreads through the edges connected withthe initial vertex. If a vertex that is not yet influenced by any information receives information by a player, it is influenced by the information and it diffuses it to adjacent vertices. A vertex that simultaneously receives two or more types of information does not diffuse any type of information from then on. the objective of a player is to maximize the number of vertices influenced by the player's information. In this paper, we investigate the existence of a pure Nash equilibrium of the two-player competitive diffusion game on chordal and its related graphs. We show that a pure Nash equilibrium always exists on block graphs, split graphs and interval graphs, all of which are well-known subclasses of chordal graphs. On the other hand, we show that there is an instance with no pure Nash equilibrium on (strongly) chordal graphs;the boundary of the existence of a pure Nash equilibrium is found.
Sofsem'99 : theory and practice of informatics : 26thconference on currenttrends in theory and practice of informatics, Milovy, Czech Republic, November 27-December 4, 1999 : Proceedings by Sofsem (1999 : Milovy...
详细信息
Sofsem'99 : theory and practice of informatics : 26thconference on currenttrends in theory and practice of informatics, Milovy, Czech Republic, November 27-December 4, 1999 : Proceedings by Sofsem (1999 : Milovy, Czech Republic); Pavelka, Jan, 1948-; Tel, Gerard; Bartošek, Miroslav; published by Berlin ; New York : Springer
We consider the reachability problem for timed automata having diagonal constraints (like x − y dLU for timed automata with diagonal constraints. On the negative side, we show that deciding ZdLU Z is NP-complete. On t...
详细信息
Following the currenttrends in data driven solutions, this paper aims to explore a value-creation mechanism for open data of education sector. Dynamic data assigning algorithm for cluster identification is investigat...
详细信息
We survey current discussions about possibilities and risks associated with an artificial intelligence breakthrough on the level that puts humanity in the situation where we are no longer foremost on the planet in ter...
详细信息
the researches of reactive power compensation in distribution network mainly consist of two aspects:the research of reactive power compensation optimization theory and the research of reactive power compensation *** t...
详细信息
ISBN:
(纸本)9781509046584
the researches of reactive power compensation in distribution network mainly consist of two aspects:the research of reactive power compensation optimization theory and the research of reactive power compensation *** to certain configuration principle and optimization principle,the mode and capacity of reactive power compensation can be optimized,which can effectively reduce the system loss and improve the power quality of distribution *** present,reactive power compensation devices include shunt capacitor,static var compensator and static synchronous compensator(D-STATCOM).We could choose the appropriate reactive power compensation device to compensate the distribution network in the view of practice and *** article would introduce some aspects of reactive power compensation breifly,including several studies on compensation mode selection and capacity *** addition,we would also introduce the working principle and the reactive current detection technology of D-STATCOM which is the most advanced reactive power compensation device.
暂无评论