Works of art on paper: history, conservation, and recommendations

Studio research.MFA candidate.2002 Fall.Includes bibliographic references (page 21).As an artist excited about the possibilities of painting on paper, I am increasingly aware of the importance of conservational concerns, which surround my own artwork. Although it is the work of art conservators to preserve existing works of art, it is the responsibility of the artist to be aware of conservation issues in regards to their chosen medium, and thereby to take steps to improve the quality of their own artwork. An informed artist will seek to educate themselves, not only about the history of their given medium, but also about the properties of the materials utilized in the process. The process of researching this essay involved extensive library and internet research, as well as informal, yet informative discussions with professors and colleagues. The research laid out in this essay has provided me with a valuable learning experience, which has already informed my own artwork, in terms of choice of materials and artwork storage. It is my sincere desire to share this research with my colleagues, and to pass along my newfound knowledge to future students who exhibit similar interests in working on paper. "Go on working, freely and furiously and you will make progress." -Paul Gauguin

ESPER 2, an improvised oscilloscope music set

Musical work for the Dossier “A quarter of century of Pd: past, present and future” [note by editor]Link #1: https://youtube.com/playlist?list=PLXdYuKtwUhUrirWQ0B2X7XhfrBCGJVlG

Reductions and Abstractions for Optimization of Modular Timed Automata

Time optimization of concurrent sequences of operations is in this paper solved by timed automata. To reduce the complexity of this classical problem, including applications such as planning and scheduling, an abstraction method has recently been proposed based on local optimization (Hagebring and Lennartson, 2019). In a modular subsystem, local paths without any communication with other subsystems are optimized with respect to time, and when subsystems are synchronized more local behavior appears. The proposed method has shown to be successful, drastically reducing computational complexity for important classes of planning problems. The only drawback is that the synchronous composition includes a heuristic non-standard synchronous composition procedure to achieve true con currency. In this paper a simple solution to this problem is presented based on the original synchronous composition of timed automata. In the transformation of the timed automaton to an ordinary automaton, where time weights are generated, it is first observed that the state space often increases dramatically in this transformation. To solve this complexity problem, an efficient reduction is proposed as a complement to local optimization, and both methods are demonstrated to be very efficient when they are applied to realistic benchmark examples. Copyright (C) 2022 The Authors

Modeling and Optimization of Synchronous Behavior for Packaging Machines

This paper proposes a new modeling solution for the synchronous behavior of packaging machines, and a strategy for maximizing the production rate based on a formal model. A common modeling platform is recommended to handle information exchange and to develop a collaborative workflow, in this paper involving mechanical design and software development. The modeling solution for the synchronous behavior is developed in SysML (Systems Modeling Language), being the common platform. Then a formal modeling language called Sequence Planner Language (SPL) is interfaced with SysML, to overcome some limitations of SysML. The synchronous behavior of the packaging machine is also developed in SPL, from which the optimization problem is defined. The result of the optimization shows that it is possible to improve the efficiency of packaging machines with new configurations compared to more conventional design. The proposed strategy is evaluated for a filling machine at Tetra Pak

Energy optimization of trajectories for high level scheduling

Minimization of energy consumption is today an issue of utmost importance in manufacturing industry. A previously presented technique for scheduling of robot cells, which exploits variable execution time for the individual robot operations, has shown promising results in energy minimization. In order to slow down a manipulator's movement the method utilizes a linear time scaling of the time optimal trajectory. This paper attempts to improve the scheduling method by generating energy optimal data using dynamic time scaling. Dynamic programming can be applied to an existing trajectory and generate a new energy optimal trajectory that follows the same path but with another execution time. With the new method, it is possible to solve the optimization problem for a range of execution times in one run. A simple two-joint planar example is presented in which energy optimal dynamic time scaling is compared to linear time scaling. The results show a small decrease in energy usage for minor scaling, but a significant reduction for longer execution times

Numerical sensitivity of Linear Matrix Inequalities for shorter sampling periods

The numerical sensitivity of Linear Matrix Inequalities (LMIs) arising in the H∞ norm computation in discrete time is analyzed. Rapid sampling scenarios are examined comparing both shift and delta operator formulations of the equations. The shift operator formulation is shown in general to be arbitrarily poorly conditioned as the sampling rate increases. The delta operator formulation includes both recentering (to avoid cancellation problems) and rescaling, and avoids these difficulties. However, it is also shown that rescaling of the shift operator formulation gives substantial improvements in numerical conditioning, whilst recentering is of more limited benefit

A Universal Framework for Lean Design and Control of Automated Material Handling Systems

Lean design and control of an automated material handling system is investigated in this study. A universal framework for modeling and analysis of different types of material handling mechanisms is introduced to obtain a minimum number of resources in a system design and fulfill a desired throughput. This framework is developed in a discrete event simulation environment and applied to a case study based on a real pallet system technology. The minimal design of the pallet system is realized by devising the system universal model

Sustainable and robust Control of Cyclic Pallet Systems

A proper control of a system to get a desired function and increase the system lifetime is a crucial step towards the sustainable paradigm. In this paper, such a control is designed for a cyclic pallet system to achieve a minimal force on its drive unit, meet safety conditions on the system chain tension force and the momentum of pallets, and fulfill the desired production rate. The optimal values of the control parameters, namely number of pallets and conveyor velocity, are obtained through solving a linear optimization model. The objective function in the model defines the average force on the drive unit in a cycle production. In addition, the related constraints characterize the pallet system properties such as cyclic and dynamic behavior, buffer size, constant work in process, and safety specifications. The robustness of the optimal control is analyzed, using a worst but safe control strategy. The optimal control and the robustness analysis are applied to some case studies, and the results are evaluated and discussed