Euclidean 3D Stable Roommates is NP hard

We establish NP-completeness for the Euclidean 3D Stable Roommates problem . It asks whether a given set $V$ of $3n$ points can be partitioned into $n$ disjoint (unordered) triples such that $Pi$ is stable . No three points $x,y,z\inV$ are blocking $X,x,z,y_1,x_1+\delta(x,x) < $X_1) and $x_2+x$ are said to be blocking $Pi$. …

Euclidean 3D Stable Roommates is NP hard

We establish NP-completeness for the Euclidean 3D Stable Roommates problem . It asks whether a given set $V$ of $3n$ points can be partitioned into $n$ disjoint (unordered) triples such that $Pi$ is stable . No three points $x,y,z\inV$ are blocking $X,x,z,y_1,x_1+\delta(x,x) < $X_1) and $x_2+x$ are said to be blocking $Pi$. …

What makes my queries slow Subgroup Discovery for SQL Workload Analysis

Analycing queryworkloads to identify problems and improve performance is crucial . But it remains challenging to automatically identify subsets of queriesthat share some properties only (a pattern) and simultaneously foster sometarget measures, such as execution time . Patterns are defined on combinationsof query clauses, environment variables, database alerts and metrics and help answer questions like what makes SQL queries slow?…

Topological Art in Simple Galleries

The art gallery problem is looking for aminimum set of points (guards) that can see every point in $P$ . The Hausdorff distance makes $V(P)$ a metric space and thus atopological space . We show homotopy-universality, that is for everysemi-algebraic set $S$ there is a polygon $P $ is homotopopyequivalent to $S$.…

Organization and Understanding of a Tactile Information Dataset TacAct During Physical Human Robot Interactions

Tactile intelligence is an essential capability of perception and recognition from tactile information . Advanced service robots require superior tactile intelligence to guarantee human-contact safety . This report introduces a recently collected andorganized dataset “TacAct” that encloses real-time pressure distribution when ahuman subject touches the arms of a nursing-care robot .…

Online Multiobjective Minimax Optimization and Applications

We introduce a simple but general online learning framework . We give a simple algorithm that can compete with the setting in which the adversary must announce their action first, withoptimally diminishing regret . We demonstrate the power of our simple framework by using it to derive optimal bounds and algorithms across a variety of domains .…

Wisdom of the Crowd Voting Truthful Aggregation of Voter Information and Preferences

We consider two-alternative elections where voters’ preferences depend on a state variable that is not directly observable . Voters may be “contingent” with different preferences in different states; or predetermined with the same preference in every state . We present an easy-to-deploy mechanism that elicits and aggregates the private signals from the voters, and outputs the alternative that is favored by the majority .…

Topological Art in Simple Galleries

The art gallery problem is looking for aminimum set of points (guards) that can see every point in $P$ . The Hausdorff distance makes $V(P)$ a metric space and thus atopological space . We show homotopy-universality, that is for everysemi-algebraic set $S$ there is a polygon $P $ is homotopopyequivalent to $S$.…

Two Class r k Coloring Coloring with Service Guarantees

This paper introduces the Two-Class ($r$$k$)-Coloring problem . Given a fixednumber of $k$ colors, such that only $r$ of these colors allow conflicts, what is the minimal number of conflicts incurred by an optimal coloring of thegraph? We establish that the family of two-class problems isNP-complete for any $k \geq 2$ when $(r, k) \neq (0,2)$ is APX-complete .…

Efficient algorithms for collecting the statistics of large scale IP address data

Compiling statistics of large-scale IP address data is an essential task in network traffic measurement . The statistical results are used to evaluatethe potential impact of user behaviors on network traffic . The proposed solution takes into account the sparse nature of the statistics of IP addresses whilebuilding the hash function and maintain a dynamic balance among layered memoryblocks .…

Alignment of Tractography Streamlines using Deformation Transfer via Parallel Transport

We present a geometric framework for aligning white matter fiber tracts . Byregistering fiber tracts between brains, one expects to see overlap of anatomical structures that often provide meaningful comparisons acrosssubjects . The geometry of white matter tracts is highly heterogeneous, and finding direct tract-correspondence across multiple individuals remains achallenging problem .…

Second Order Defeaturing Error Estimator of Porosity on Structural Elastic Performance in Manufactured Metallic Components

Manufactured metallic components often contain non-uniformly distributedpores of complex morphologies . Porosity defects have significant influence on material behaviors and affect the usage in high-performance applications . In this work, agradient-enhanced porosity defeaturing estimator allows for the modelingof pore geometry and spatial distribution, is proposed within a generalelastostatic framework .…

Second Order Defeaturing Error Estimator of Porosity on Structural Elastic Performance in Manufactured Metallic Components

Manufactured metallic components often contain non-uniformly distributedpores of complex morphologies . Porosity defects have significant influence on material behaviors and affect the usage in high-performance applications . In this work, agradient-enhanced porosity defeaturing estimator allows for the modelingof pore geometry and spatial distribution, is proposed within a generalelastostatic framework .…

Approximation schemes for stochastic compliance based topology optimization with many loading scenarios

In this paper, approximation schemes are proposed for handling loaduncertainty in compliance-based topology optimization problems . Efficient approximate methods are proposed to approximately evaluate and differentiate either 1) the mean compliance, or a class of scalar-valuedfunction of the individual load compliances such as the weighted sum of themean and standard deviation .…

Constructing deterministic ω automata from examples by an extension of the RPNI algorithm

The RPNI algorithm constructs deterministic finiteautomata from finite sets of negative and positive example words . We proposeand analyze an extension of this algorithm to deterministic $\omega$-automatatawith different types of acceptance conditions . We prove that active learning with membership and equivalence queries is not easier for automata with aninformative right congruence than for general deterministic $omega-automatic $1-2-3-4 languages in the limit .…

Approximation schemes for stochastic compliance based topology optimization with many loading scenarios

In this paper, approximation schemes are proposed for handling loaduncertainty in compliance-based topology optimization problems . Efficient approximate methods are proposed to approximately evaluate and differentiate either 1) the mean compliance, or a class of scalar-valuedfunction of the individual load compliances such as the weighted sum of themean and standard deviation .…

Second Order Defeaturing Error Estimator of Porosity on Structural Elastic Performance in Manufactured Metallic Components

Manufactured metallic components often contain non-uniformly distributedpores of complex morphologies . Porosity defects have significant influence on material behaviors and affect the usage in high-performance applications . In this work, agradient-enhanced porosity defeaturing estimator allows for the modelingof pore geometry and spatial distribution, is proposed within a generalelastostatic framework .…

Equivalence of Models of Cake Cutting Protocols

The cake-cutting problem involves dividing a heterogeneous, divisible resource fairly between $n$ agents . Br.Nzei et al. [6] introduced a formal model for representingcake-cutting protocols as trees with “cut” and “choose” nodes corresponding to agents’ actions, and if-else statements . We show that the class of protocols we can represent using this model is invariant under certain modifications to its definition .…

Reduced Order Multiscale Modeling of Plastic Deformations in 3D Cast Metallic Alloys with Spatially Varying Microstructures

Cast aluminum alloys are increasingly utilized as light-weight materials inautomobile industry . A major challenge impeding the large-scale use of thesealloys in high-performance applications is the presence of manufacturing-induced, spatially varying porosity defects . The proposed model starts from a datacompression scheme which significantly reduces the number of unknown variables by agglomerating close-by finite element nodes into a limited number of nodes .…

Reduced Order Multiscale Modeling of Plastic Deformations in 3D Cast Metallic Alloys with Spatially Varying Microstructures

Cast aluminum alloys are increasingly utilized as light-weight materials inautomobile industry . A major challenge impeding the large-scale use of thesealloys in high-performance applications is the presence of manufacturing-induced, spatially varying porosity defects . The proposed model starts from a datacompression scheme which significantly reduces the number of unknown variables by agglomerating close-by finite element nodes into a limited number of nodes .…

Reduced Order Multiscale Modeling of Plastic Deformations in 3D Cast Metallic Alloys with Spatially Varying Microstructures

Cast aluminum alloys are increasingly utilized as light-weight materials inautomobile industry . A major challenge impeding the large-scale use of thesealloys in high-performance applications is the presence of manufacturing-induced, spatially varying porosity defects . The proposed model starts from a datacompression scheme which significantly reduces the number of unknown variables by agglomerating close-by finite element nodes into a limited number of nodes .…

Detecting Qubit coupling Faults in Ion trap Quantum Computers

Ion-trap quantum computers offer a large number of possible qubit couplings, each requires individual calibration and can be misconfigured . Wedeveloped a strategy that diagnoses individual miscalibrated couplings using onlylog-many tests . This strategy is validated on a commercial ion-trap quantumcomputers, where we illustrate the process of debugging faulty quantum gates .…

Approximation schemes for stochastic compliance based topology optimization with many loading scenarios

In this paper, approximation schemes are proposed for handling loaduncertainty in compliance-based topology optimization problems . Efficient approximate methods are proposed to approximately evaluate and differentiate either 1) the mean compliance, or a class of scalar-valuedfunction of the individual load compliances such as the weighted sum of themean and standard deviation .…

Strictly Proper Contract Functions Can Be Arbitrage Free

The standard approach — using a scoring rule to separately reward each expert — is not robust to collusion . Experts may misreport their beliefs in a way that guarantees them a larger total reward no matter the outcome . Chun and Shachter (2011) termed any such collusion “arbitrage” and asked whether there is any truthful elicitation mechanism that makes arbitrage impossible .…

Building a Foundation for Data Driven Interpretable and Robust Policy Design using the AI Economist

Optimizing economic and public policy is critical to address socioeconomic issues and trade-offs, e.g., improving equality, productivity, or wellness . Existing approaches are often limited to narrowset of policy levers or objectives that are hard to measure . As of yet, real-worldpolicymaking has not seen adoption of machine learning methods at large, including RL and AI-driven simulations .…

On the Computational Complexity of Determining Value

We look at an algorithmic information theory based definition of value of acreative artifact . We discuss the computational difficulty associated with the creation or determination of value . We also discuss how likely an observer is to verify a claim that an object required significant effort on the creator’s part .…

Artificial Intelligence Driven Customized Manufacturing Factory Key Technologies Applications and Challenges

Artificial Intelligence (AI) enabling higher value-added manufacturing by accelerating the integration of manufacturing and information communication technologies . The characteristics of a customized smart factoryare to include self-perception, operations optimization, dynamicreconfiguration, and intelligent decision-making . The paper focuses on the implementation of AI in customized manufacturing(CM) The architecture of an AI-driven customized .…

Impressions of the GDMC AI Settlement Generation Challenge in Minecraft

The GDMC AI settlement generation challenge is a PCG competition about producing an algorithm that can create an “interesting” Minecraft settlement . This paper contains a collection of written experiences with the competition, by participants, judges, organizers and advisors . The aim of this paper is to offer a shareable and edited collection of experiences and feedback – which seem to contain a lot of insightson PCG and computational creativity, but would otherwise be lost once the competition was reduced to scalar performance values .…

Impressions of the GDMC AI Settlement Generation Challenge in Minecraft

The GDMC AI settlement generation challenge is a PCG competition about producing an algorithm that can create an “interesting” Minecraft settlement . This paper contains a collection of written experiences with the competition, by participants, judges, organizers and advisors . The aim of this paper is to offer a shareable and edited collection of experiences and feedback – which seem to contain a lot of insightson PCG and computational creativity, but would otherwise be lost once the competition was reduced to scalar performance values .…

Impressions of the GDMC AI Settlement Generation Challenge in Minecraft

The GDMC AI settlement generation challenge is a PCG competition about producing an algorithm that can create an “interesting” Minecraft settlement . This paper contains a collection of written experiences with the competition, by participants, judges, organizers and advisors . The aim of this paper is to offer a shareable and edited collection of experiences and feedback – which seem to contain a lot of insightson PCG and computational creativity, but would otherwise be lost once the competition was reduced to scalar performance values .…

JOET Sustainable Vehicle assisted Edge Computing for Internet of Vehicles

Task offloading in Internet of Vehicles involves numerous steps andoptimization variables such as: where to offload tasks, how to allocate resources and how to adjust offloading ratio and transmit power for offloading . In this paper, we provide a Mixed Integer NonlinearProgramming Problem (MINLP) formulation for such task offloading under energyand deadline constraints in IoV.…