Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2024
Probabilistic Graph Queries for Design Space Exploration Under Uncertainty
MODELS Companion '24: Proceedings of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and SystemsPages 142–148https://doi.org/10.1145/3652620.3688199Critical cyber-physical systems have an increasingly significant role in the world, and ensuring their safety is a high priority objective. State of the art approaches and engineering tools can support the development process from very early stages, with ...
- research-articleJuly 2024
Lifting Directional Fields to Minimal Sections
ACM Transactions on Graphics (TOG), Volume 43, Issue 4Article No.: 60, Pages 1–20https://doi.org/10.1145/3658198Directional fields, including unit vector, line, and cross fields, are essential tools in the geometry processing toolkit. The topology of directional fields is characterized by their singularities. While singularities play an important role in ...
- ArticleMay 2024
- research-articleMay 2024
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities
INFORMS Journal on Computing (INFORMS-IJOC), Volume 36, Issue 3Pages 884–899https://doi.org/10.1287/ijoc.2022.0230Recently a class of second-order cone representable convex inequalities called lifted bilinear cover inequalities were introduced, which are valid for a set described by a separable bilinear constraint together with bounds on variables. In this paper, we ...
- research-articleNovember 2024
Program Lifting using Gray-Box Behavior
PACT '21: Proceedings of the 30th International Conference on Parallel Architectures and Compilation TechniquesPages 60–74https://doi.org/10.1109/PACT52795.2021.00012Porting specialized application components to new platforms is difficult. This is particularly true if the components depend on proprietary libraries, or specific hardware. To tackle this, existing work has sought to recover high-level descriptions of ...
-
- research-articleJune 2021
A case study on occupational back-support exoskeletons versatility in lifting and carrying
- Tommaso Poliero,
- Matteo Iurato,
- Matteo Sposito,
- Christian Di Natali,
- Stefano Toxiri,
- Sara Anastasi,
- Francesco Draicchio,
- Luigi Monica,
- Darwin G. Caldwell,
- Vittorio Sanguineti,
- Jesús Ortiz
PETRA '21: Proceedings of the 14th PErvasive Technologies Related to Assistive Environments ConferencePages 210–217https://doi.org/10.1145/3453892.3453901To prevent workers performing manual material handling from developing musculoskeletal disorders, occupational back-support exoskeletons are becoming more and more common in industrial scenarios. However, while their beneficial effects on weight ...
- research-articleJanuary 2021
Query-to-Communication Lifting Using Low-Discrepancy Gadgets
SIAM Journal on Computing (SICOMP), Volume 50, Issue 1Pages 171–210https://doi.org/10.1137/19M1310153Lifting theorems are theorems that relate the query complexity of a function $f:\{0,1\}^{n}\to \{0,1\}$ to the communication complexity of the composed function $f\circ g^{n}$ for some “gadget” $g:\{ 0,1\}^{b}\times \{0,1\}^{b}\to \{0,1\}$. Such theorems ...
- research-articleJanuary 2021
Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization
SIAM Journal on Optimization (SIOPT), Volume 31, Issue 3Pages 1897–1925https://doi.org/10.1137/19M1306233We consider the problem of estimating the true values of a Wiener process given noisy observations corrupted by outliers. In this paper we show how to improve existing mixed-integer quadratic optimization formulations for this problem. Specifically, we ...
- research-articleJanuary 2020
Query-to-Communication Lifting for BPP
SIAM Journal on Computing (SICOMP), Volume 49, Issue 4Pages FOCS17-441–FOCS17-461https://doi.org/10.1137/17M115339XFor any $n$-bit boolean function $f$, we show that the randomized communication complexity of the composed function $f\circ g^n$, where $g$ is an index gadget, is characterized by the randomized decision tree complexity of $f$. In particular, this means ...
- research-articleFebruary 2020
Get rid of inline assembly through verification-oriented lifting
ASE '19: Proceedings of the 34th IEEE/ACM International Conference on Automated Software EngineeringPages 577–589https://doi.org/10.1109/ASE.2019.00060Formal methods for software development have made great strides in the last two decades, to the point that their application in safety-critical embedded software is an undeniable success. Their extension to non-critical software is one of the notable ...
- articleMay 2017
A Polyhedral Study of Binary Polynomial Programs
Mathematics of Operations Research (MOOR), Volume 42, Issue 2Pages 389–410https://doi.org/10.1287/moor.2016.0804We study the polyhedral convex hull of a mixed-integer set 𝒮 defined by a collection of multilinear equations over the unit hypercube. Such sets appear frequently in the factorable reformulation of mixed-integer nonlinear optimization problems. In ...
- articleAugust 2016
Risk-Averse Shortest Path Interdiction
We consider a Stackelberg game in a network where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a ...
- articleAugust 2016
Risk-Averse Shortest Path Interdiction
We consider a Stackelberg game in a network where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a risk-...
- articleAugust 2016
Risk-Averse Shortest Path Interdiction
We consider a Stackelberg game in a network where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a ...
- articleAugust 2016
Risk-Averse Shortest Path Interdiction
We consider a Stackelberg game in a network where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a risk-...
- articleJuly 2016
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
Flow cover inequalities are among the most effective valid inequalities for capacitated fixed-charge network flow problems. These valid inequalities are based on implications for the flow quantity on the cut arcs of a two-partitioning of the network, ...
- research-articleJanuary 2016
Analysis of the Incompatibility Operator and Application in Intrinsic Elasticity with Dislocations
SIAM Journal on Mathematical Analysis (SIMA), Volume 48, Issue 1Pages 320–348https://doi.org/10.1137/15M1020113The incompatibility operator arises in the modeling of elastic materials with dislocations and in the intrinsic approach to elasticity, where it is related to the Riemannian curvature of the elastic metric. It consists of applying successively the curl to ...
- ArticleApril 2015
Image Compression with Average Interpolating Lifting Scheme on Triangular Lattice
ITNG '15: Proceedings of the 2015 12th International Conference on Information Technology - New GenerationsPages 335–340https://doi.org/10.1109/ITNG.2015.60We present two-dimensional nonseparable wavelets defined on a triangular lattice using an average interpolating lifting scheme. With the update-first form of the lifting scheme, a primal scaling function and three dual wavelets are found to be based on ...
- articleFebruary 2015
Single-Car Routing in Rail Freight Transport
Transportation Science (TRNPS), Volume 49, Issue 1Pages 130–148https://doi.org/10.1287/trsc.2013.0486Single cars in rail freight service are bundled into trains at classification yards. On the way from their respective origins via intermediate yards to their destinations, they are reclassified several times, which is a time-consuming and personally ...
- research-articleJanuary 2015
Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
SIAM Journal on Imaging Sciences (SJISBI), Volume 8, Issue 4Pages 2203–2238https://doi.org/10.1137/141002165In this paper we analyze the blind deconvolution of an image and an unknown blur in a coded imaging system. The measurements consist of subsampled convolution of an unknown blurring kernel with multiple random binary modulations (coded masks) of the image. ...