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:20250110T023312Z
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:Technical Papers\n\nJenny Lin (Carnegie Mellon University), Yu
 ka Ikarashi (Massachusetts Institute of Technology), Gilbert Bernstein (Un
 iversity of Washington), and James McCann (Carnegie Mellon University)\n\n
 Programming low-level controls for knitting machines is a meticulous, time
 -consuming task that demands specialized expertise. Recently, there has be
 en a shift towards automatically generating low-level knitting machine pro
 grams from high-level knit representations that describe knit objects in a
  more intuitive, user-friendly way. Current high-level systems trade off\n
 expressivity for ease-of-use, requiring ad-hoc trapdoors to access the ful
 l space of machine capabilities, or eschewing completeness in the name of 
 utility. Thus, advanced techniques either require ad-hoc extensions from d
 omain experts, or are entirely unsupported. Furthermore, errors may emerge
  during the compilation from knit object representations to machine instru
 ctions. While the generated program may describe a valid machine control s
 equence, the fabricated object is topologically different from the specifi
 ed input, with little recourse for understanding and fixing the issue.\n\n
 To address these limitations, we introduce instruction graphs, an intermed
 iate representation capable of capturing the full range of machine knittin
 g programs. We define a semantic mapping from instruction graphs to fenced
  tangles, which make them compatible with the established formal semantics
  for machine knitting instructions. We establish a semantics-preserving bi
 jection between machine knittable instruction graphs and knit programs tha
 t proves three properties – upward, forward, and ordered (UFO) – are both 
 necessary and sufficient to ensure the existence of a machine knitting pro
 gram that can fabricate the fenced tangle denoted by the graph. As a proof
 -of-concept, we implement an instruction graph editor and compiler that al
 lows a user to transform an instruction graph into UFO presentation and th
 en compile it to a machine program, all while maintaining semantic equival
 ence. In addition, we use the UFO properties to more precisely characteriz
 e the limitations of existing compilers. This work lays the groundwork for
  more expressive and reliable automated knitting machine programming syste
 ms by providing a formal characterization of machine knittability.\n\nRegi
 stration Category: Full Access, Full Access Supporter\n\nLanguage Format: 
 English Language\n\nSession Chair: Meng Zhang (Nanjing University of Scien
 ce and Technology)
URL:https://asia.siggraph.org/2024/program/?id=papers_619&sess=sess118
END:VEVENT
END:VCALENDAR