pinecone/core-2020-05-10-deduplication huggingface dataset:
The related-key analysis of feistel constructions

Lecture Notes in Computer Science, Volume 8540, 2015.It is well known that the classical three- and four-round Feistel constructions are provably secure under chosen-plaintext and chosen-ciphertext attacks, respectively. However, irrespective of the
number of rounds, no Feistel construction can resist related-key attacks where the keys can be offset by a constant. In this paper we show that, under suitable reuse of round keys, security under related-key attacks can be provably attained. Our modification is substantially simpler and more efficient than alternatives obtained using generic transforms, namely the PRG transform of Bellare and Cash (CRYPTO 2010) and its random-oracle analogue outlined by Lucks (FSE 2004). Additionally we formalize Luck’s transform and show that it does not always work if related keys are derived in an oracle-dependent way, and then prove it sound under appropriate restrictions
A Simulation Model for Strategic Planning In Asset\ud
Management of Electricity Distribution Network

Asset management of electricity distribution network is required in\ud
order to improve the network reliability so as to reduce electricity energy\ud
distribution losses. Due to strategic asset management requires long-term\ud
predictions; it would require a simulation model. Simulation of asset\ud
management is an approach to predict the consequences of long-term financing\ud
on maintenance and renewal strategies in electrical energy distribution\ud
networks. In this research, the simulation method used is System Dynamics\ud
based on consideration that this method enables us to consider internal and\ud
external influenced factors. To obtain the model parameter, we utilized PLN\ud
Pamekasan for the case study. The results showed the reduction of low voltage\ud
network assets condition on average in the range 6% per year, the average\ud
decline in the transformer condition is approximately 6.6% per year, and the\ud
average decline in the condition of medium voltage network assets is\ud
approximately 4.4% per year. In general, the average technical losses average\ud
of 1,359,981.60 KWH / month or about 16,319,779.24 KWH / year
Business Process Maturity at Agricultural Commodities Company

The agricultural commodities company nowadays strive to keep\ud
transforming their business processes in accordance with the fast changing demands\ud
to survive the intense global competition.\ud
In an attempt to provide stakeholder with an insight business process, this paper investigates how to model \ud
business processes with Business Process Modelling Notation and assesses\ud
the process maturity using Gartner&#65533;s model.\ud
This research is based on an in-depth observation at purchasing and production\ud
division of agricultural commodities company.\ud
It is found the business process model presents the knowledge from business in\ud
existing context.The other findings show the maturity level of the  people is\ud
on phase 1, the maturity level of IT achieves phase including strategic alignment, culture and leadership, governance and methods have already arrived phase 2.\ud
These findings will  help company to do big planning for improvement in the future
Optimization of Auto Equip Function in Role-Playing Game Based on Standard Deviation of Characters Stats using Genetic Algorithm

Genetic algorithm is a well-known optimization solution for an unknown, complex case that cannot be solved using conventional methods.\ud
In Role-Playing Games (RPG), usually the main features are characters stats and equip items. Character has stats, namely strength, defense, speed, agility, life. Also, equip items that can boost characters stats. These items retrieved randomly when an enemy dead.\ud
A problem arise when the player have so many items that we cannot choose the best. Latest items doesnt always mean best, because usually in RPGs, items dont always boost all stats equally, but often it reduces certain stat while increasing the other.\ud
Based on this, a function is built in this research, to auto equip all items, based on the standard deviation of characters stats after equipping. The genetic algorithm will evaluate the best combination of gloves, armors and shoes. This algorithm involves the process of evaluating initial population (items combination), selection, crossover, mutation, elitism, creating new population. The algorithm stops when the best fitness is getting stable in successive 3 generations.\ud
After the auto equip process, the character is getting significantly stronger compared to using default equip items, measured by the remaining life after fighting with several enemies
Improving NFS for the discrete logarithm problem in non-prime finite fields

International audienceThe aim of this work is to investigate the hardness of the discrete logarithm problem in fields GF($p^n$) where $n$ is a small integer greater than $1$. Though less studied than the small characteristic case or the prime field case, the difficulty of this problem is at the heart of security valuations for torus-based and pairing-based cryptography. The best known method for solving this problem is the Number Field Sieve (NFS). A key ingredient in this algorithm is the ability to find good polynomials that define the extension fields used in NFS. We design two new methods for this task, modifying the asymptotic complexity and paving the way for record-breaking computations. We exemplify these results with the computation of discrete logarithms over a field GF($p^2$) whose cardinality is 180 digits (595 bits) long
Duality and universal models for the meet-implication fragment of IPC

In this paper we investigate the fragment of intuitionistic logic which only
uses conjunction (meet) and implication, using finite duality for distributive
lattices and universal models. We give a description of the finitely generated
universal models of this fragment and give a complete characterization of the
up-sets of Kripke models of intuitionistic logic which can be defined by
meet-implication-formulas. We use these results to derive a new version of
subframe formulas for intuitionistic logic and to show that the uniform
interpolants of meet-implication-formulas are not necessarily uniform
interpolants in the full intuitionistic logic.Comment: 21 pages. To appear in the proceedings of the conference TbiLLC 201
Measuring sustainability performance within the Australian energy industry

Sustainability has become crucial for the energy industry as projects in this industry are extensively large and complex and have significant impacts on the environment, community and economy. It demands the energy industry to proactively incorporate sustainability ideas and commit to sustainable project development. This study aims to investigate how the Australian energy industry responds to sustainability requirements and in particular what indicators used to measure sustainability performance. To achieve this, content analysis of sustainability reports, vision statements and policy statements of Australian energy companies listed in the 2013 PLATTS Top 250 Global Energy Company Rankings and government reports relating to sustainability has been conducted. The findings show that the energy companies extensively discuss sustainability aspects within three dimensions, i.e. community, environment, and economy. Their primary goals in sustainability are supplying cleaner energy for future, and doing business in a way that improves outcomes for shareholders, employees, business partners and the communities. In particular, energy companies have valued the employees of the business as a one of the key area that needs to be considered. Furthermore, the energy industry has become increasingly aware of the importance of measuring sustainability performance to achieve sustainability goals. A number of sustainability indicators have been developed on the basis of the key themes beyond economic measures. It is envisaged that findings from this research will help stakeholders in the energy industry to adopt different indicators to evaluate and ultimately achieve sustainability performance
Sustainable construction trends in journal papers

Sustainable construction is gaining worldwide attention and has inspired research to identify and solve the problems involved in its implementation over a project lifecycle. While an impressive number of papers have been published on the topic to date, little has been done to review these papers to identify current research status or provide guidance for future research. This paper reviews existing sustainability papers in 12 internationally renowned construction journals. Based on a three-stage literature review, sustainability papers published in these journals from 2000 to 2012 are analyzed in terms of the annual number of papers published and the research interests involved. The number of sustainability-related papers in construction increases from 30 papers in 2000 to 127 papers in 2012, which shows an increasing trend in sustainability topics. A content analysis identifies seven major research interest in sustainability, including: \ud
\ud
(1) sustainable project management; \ud
\ud
(2) sustainability assessment/evaluation; \ud
\ud
(3) sustainable technology/innovation implementation; \ud
\ud
(4) sustainable building/infrastructure performance; \ud
\ud
(5) government policy on sustainability; \ud
\ud
(6) enterprise sustainability, and; \ud
\ud
(7) sustainability education. \ud
\ud
The results of this study provide a reference for scholars and academics to understand the current status of sustainability research in major construction journals
Semantic interoperability in astrophysics for workflows extraction from heterogeneous services

Modern instruments in astrophysics lead to a growing amount of data and more and more specific observations, among which scientists must be able to identify and retrieve useful information for their own specific research. The Virtual Observatory ( http://www.ivoa.net/deployers/intro_to_vo_concepts.html ) architecture has been designed to achieve this goal. It allows the joint use of data taken from different instruments. Retrieving and cross-matching those data is in progress, but it’s impossible today to find a sequence resolving a given science case needing a combination of existing services of whom the user doesn’t knows the specifications. The goal of this work is to propose the basis of an architecture leading to automatic composition of workflows that implement scientific use cases
Introducing a socio-technical perspective on business processes into Enterprise Interoperability Frameworks

Abstract. This paper looks at enterprise interoperability (EI), specifically pro-cess-level interoperability, and suggests that the inherent non-determinacy of human-centred business processes introduces another ingredient into the EI puzzle that has thus far been understated in EIF ontologies. A conceptualisation of business process based on socio-technical concepts is presented. It is argued that this provides a better way to accommodate human agency factors, and un-der the influence of these factors, how business processes inevitably evolve over time, potentially affecting their interoperability. We suggest the extant body of knowledge on the theory of dynamic capabilities is relevant to under-standing how organisations can control this potentially undirected process evo-lution and thereby sustain interoperability. Some initial observations are made concerning how this new ontological element could be accommodated into ex-isting EIFs. The paper aims to stimulate discussion in this area and make a con-tribution to the EI body of knowledge
L-Convex Polyominoes are Recognizable in Real Time by 2D Cellular
  Automata

A polyomino is said to be L-convex if any two of its cells are connected by a
4-connected inner path that changes direction at most once. The 2-dimensional
language representing such polyominoes has been recently proved to be
recognizable by tiling systems by S. Brocchi, A. Frosini, R. Pinzani and S.
Rinaldi. In an attempt to compare recognition power of tiling systems and
cellular automata, we have proved that this language can be recognized by
2-dimensional cellular automata working on the von Neumann neighborhood in real
time.
  Although the construction uses a characterization of L-convex polyominoes
that is similar to the one used for tiling systems, the real time constraint
which has no equivalent in terms of tilings requires the use of techniques that
are specific to cellular automata
Non-crossing dependencies: Least effort, not grammar

The use of null hypotheses (in a statistical sense) is common in hard sciences but not in theoretical linguistics. Here the null hypothesis that the low frequency of syntactic dependency crossings is expected by an arbitrary ordering of words is rejected. It is shown that this would require star dependency structures, which are both unrealistic and too restrictive. The hypothesis of the limited resources of the human brain is revisited. Stronger null hypotheses taking into account actual dependency lengths for the likelihood of crossings are presented. Those hypotheses suggests that crossings are likely to reduce when dependencies are shortened. A hypothesis based on pressure to reduce dependency lengths is more parsimonious than a principle of minimization of crossings or a grammatical ban that is totally dissociated from the general and non-linguistic principle of economy.Postprint (author's final draft
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words

International audienceWe prove that there exist some 1-counter Büchi automata A_n for which some elementary properties are independent of theories like T_n =: ZFC + " There exist (at least) n inaccessible cardinals " , for integers n ≥ 1. In particular , if T_n is consistent, then " L(A_n) is Borel " , " L(A_n) is arithmetical " , " L(A_n) is ω-regular " , " L(A_n) is deterministic " , and " L(A_n) is unambiguous " are provable from ZFC + " There exist (at least) n+1 inaccessible cardinals " but not from ZFC + " There exist (at least) n inaccessible cardinals ". We prove similar results for infinitary rational relations accepted by 2-tape Büchi automata
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time

We generalise the hyperplane separation technique (Chatterjee and Velner,
2013) from multi-dimensional mean-payoff to energy games, and achieve an
algorithm for solving the latter whose running time is exponential only in the
dimension, but not in the number of vertices of the game graph. This answers an
open question whether energy games with arbitrary initial credit can be solved
in pseudo-polynomial time for fixed dimensions 3 or larger (Chaloupka, 2013).
It also improves the complexity of solving multi-dimensional energy games with
given initial credit from non-elementary (Br\'azdil, Jan\v{c}ar, and
Ku\v{c}era, 2010) to 2EXPTIME, thus establishing their 2EXPTIME-completeness.Comment: Corrected proof of Lemma 6.2 (thanks to Dmitry Chistikov for spotting
  an error in the previous proof
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms

International audienceWe investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous networks, approximate consensus is solvable if and only if the communication graph in each round has a rooted spanning tree. Interestingly, the class of averaging algorithms, which have the benefit of being memory- less and requiring no process identifiers, entirely captures the solvability issue of approximate consensus in that the problem is solvable if and only if it can be solved using any averaging algorithm. We develop a proof strategy which for each positive result consists in a reduction to the nonsplit networks. It dramatically improves the best known upper bound on the decision times of averaging algorithms and yields a quadratic time non-averaging algorithm for approximate consensus in non-anonymous networks. We also prove that a general upper bound on the decision times of averaging algorithms have to be exponential, shedding light on the price of anonymity. Finally we apply our results to networked systems with a fixed topology and benign fault models to show that with n processes, up to 2n−3 of link faults per round can be tolerated for approximate consensus, increasingby a factor 2 the bound of Santoro and Widmayer for exact consensus
On the diameter of hyperbolic random graphs

Large real-world networks are typically scale-free. Recent research has shown
that such graphs are described best in a geometric space. More precisely, the
internet can be mapped to a hyperbolic space such that geometric greedy routing
performs close to optimal (Bogun\'a, Papadopoulos, and Krioukov. Nature
Communications, 1:62, 2010). This observation pushed the interest in hyperbolic
networks as a natural model for scale-free networks. Hyperbolic random graphs
follow a power-law degree distribution with controllable exponent $\beta$ and
show high clustering (Gugelmann, Panagiotou, and Peter. ICALP, pp. 573-585,
2012).
  For understanding the structure of the resulting graphs and for analyzing the
behavior of network algorithms, the next question is bounding the size of the
diameter. The only known explicit bound is $\mathcal O((\log
n)^{32/((3-\beta)(5-\beta)) + 1})$ (Kiwi and Mitsche. ANALCO, pp. 26-39, 2015).
We present two much simpler proofs for an improved upper bound of $\mathcal
O((\log n)^{2/(3-\beta)})$ and a lower bound of $\Omega(\log n)$
Provenance Circuits for Trees and Treelike Instances (Extended Version)

Query evaluation in monadic second-order logic (MSO) is tractable on trees
and treelike instances, even though it is hard for arbitrary instances. This
tractability result has been extended to several tasks related to query
evaluation, such as counting query results [3] or performing query evaluation
on probabilistic trees [10]. These are two examples of the more general problem
of computing augmented query output, that is referred to as provenance. This
article presents a provenance framework for trees and treelike instances, by
describing a linear-time construction of a circuit provenance representation
for MSO queries. We show how this provenance can be connected to the usual
definitions of semiring provenance on relational instances [20], even though we
compute it in an unusual way, using tree automata; we do so via intrinsic
definitions of provenance for general semirings, independent of the operational
details of query evaluation. We show applications of this provenance to capture
existing counting and probabilistic results on trees and treelike instances,
and give novel consequences for probability evaluation.Comment: 48 pages. Presented at ICALP'1
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

International audienceIn this work we focus on a natural class of population protocols whose dynamics are modelled by the discrete version of Lotka-Volterra equations. In such protocols, when an agent $a$ of type (species) $i$ interacts with an agent $b$ of type (species) $j$  with $a$ as the initiator, then $b$'s type becomes $i$ with probability $P_{ij}$. In such an interaction, we think of $a$ as the predator, $b$ as the prey, and the type of the prey is either converted to that of the predator or stays as is. Such protocols capture the dynamics of some opinion spreading models andgeneralize the well-known Rock-Paper-Scissors discrete dynamics. We consider the pairwise interactions among agents that are scheduled uniformly at random.We start by considering the convergence time and show that any Lotka-Volterra-type protocol on an $n$-agent population converges to some absorbing state in time polynomial in $n$, w.h.p., when any pair of agents is allowed to interact. By contrast, when the interaction graph is a star, even the Rock-Paper-Scissors protocol requires exponential time to converge. We then study threshold effects exhibited by Lotka-Volterra-type protocols with 3 and more species under interactions between any pair of agents. We start by presenting a simple 4-type protocol in which the probability difference of reaching the two possible absorbing states is strongly amplified by the ratio of the initial populations of the two other types, which are transient, but ``control'' convergence. We then prove that the Rock-Paper-Scissors protocol reaches each of its three possible absorbing states with almost equal probability, starting from any configuration satisfying some sub-linear lower bound on the initial size of each species. That is, Rock-Paper-Scissors is a realization of a ``coin-flip consensus'' in a distributed system. Some of our techniques may be of independent value
On Temporal Graph Exploration

A temporal graph is a graph in which the edge set can change from step to step. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. We consider only temporal graphs that are connected at each step. For such temporal graphs with $n$ nodes, we show that it is $\NP$-hard to approximate TEXP with ratio $O(n^{1-\epsilon})$ for any $\epsilon>0$. We also provide an explicit construction of temporal graphs that require $\Theta(n^2)$ steps to be explored. We then consider TEXP under the assumption that the underlying graph (i.e. the graph that contains all edges that are present in the temporal graph in at least one step) belongs to a specific class of graphs. Among other results, we show that temporal graphs can be explored in $O(n^{1.5}k^2\log n)$ steps if the underlying graph has treewidth $k$ and in $O(n\log^3 n)$ steps if the underlying graph is a $2\times n$ grid. Finally, we show that sparse temporal graphs with regularly present edges can always be explored in $O(n)$ steps.Peer-reviewedPost-printICALP, Kyot
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree

"In the Steiner tree problem, we are given as input a connected n-vertex graph with edge weights in {1,2,...,W}, and a subset of k terminal vertices. Our task is to compute a minimum-weight tree that contains all the terminals. We give an algorithm for this problem with running time O(7.97^k n^4 log W) using O(n^3 log nW log k) space. This is the first single-exponential time, polynomial-space FPT algorithm for the weighted Steiner tree problem."
PLEASE NOTE:This is an author-created version that the author has self-archived to the "Aaltodoc" (aaltodoc.aalto.fi) faculty-level repository at Aalto University. The final publication is available at link.springer.com via the link http://dx.doi.org/10.1007/978-3-662-47672-7_40Peer reviewe