BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Tokyo
X-LIC-LOCATION:Asia/Tokyo
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:JST
DTSTART:18871231T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260817T171531Z
LOCATION:Hall B5 (1)\, B Block\, Level 5
DTSTART;TZID=Asia/Tokyo:20241204T152700
DTEND;TZID=Asia/Tokyo:20241204T154100
UID:siggraphasia_SIGGRAPH Asia 2024_sess118_papers_619@linklings.com
SUMMARY:UFO Instruction Graphs Are Machine Knittable
DESCRIPTION:Jenny Lin (Carnegie Mellon University), Yuka Ikarashi (Massach
 usetts Institute of Technology), Gilbert Bernstein (University of Washingt
 on), and James McCann (Carnegie Mellon University)\n\nProgramming low-leve
 l controls for knitting machines is a meticulous, time-consuming task that
  demands specialized expertise. Recently, there has been a shift towards a
 utomatically generating low-level knitting machine programs from high-leve
 l knit representations that describe knit objects in a more intuitive, use
 r-friendly way. Current high-level systems trade off\nexpressivity for eas
 e-of-use, requiring ad-hoc trapdoors to access the full space of machine c
 apabilities, or eschewing completeness in the name of utility. Thus, advan
 ced techniques either require ad-hoc extensions from domain experts, or ar
 e entirely unsupported. Furthermore, errors may emerge during the compilat
 ion from knit object representations to machine instructions. While the ge
 nerated program may describe a valid machine control sequence, the fabrica
 ted object is topologically different from the specified input, with littl
 e recourse for understanding and fixing the issue.\n\nTo address these lim
 itations, we introduce instruction graphs, an intermediate representation 
 capable of capturing the full range of machine knitting programs. We defin
 e a semantic mapping from instruction graphs to fenced tangles, which make
  them compatible with the established formal semantics for machine knittin
 g instructions. We establish a semantics-preserving bijection between mach
 ine knittable instruction graphs and knit programs that proves three prope
 rties – upward, forward, and ordered (UFO) – are both necessary and suffic
 ient to ensure the existence of a machine knitting program that can fabric
 ate the fenced tangle denoted by the graph. As a proof-of-concept, we impl
 ement an instruction graph editor and compiler that allows a user to trans
 form an instruction graph into UFO presentation and then compile it to a m
 achine program, all while maintaining semantic equivalence. In addition, w
 e use the UFO properties to more precisely characterize the limitations of
  existing compilers. This work lays the groundwork for more expressive and
  reliable automated knitting machine programming systems by providing a fo
 rmal characterization of machine knittability.\n\nRegistration Category: F
 ull Access, Full Access Supporter\n\nLanguage Format: English Language\n\n
 Session Chair: Meng Zhang (Nanjing University of Science and Technology)\n
 \n
URL:https://asia.siggraph.org/2024/program/?id=papers_619&sess=sess118
END:VEVENT
END:VCALENDAR