Epistemic two-dimensional semantics is a theory in the philosophy of language that provides an account of meaning which is sensitive to the distinction between necessity and apriority. While this theory is usually presented in an informal manner, I take some steps in formalizing it in this paper. To do so, I define a semantics for a propositional modal logic with operators for the modalities of...

We investigate a new application of DC (Difference of Convex functions) programming and DCA (DC Algorithm) in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reform...

This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perfor...

In this paper, we consider a multi-staged two-dimensional cutting stock problem (CSP) in a paper industry. Paper production relies on the sequential processes of various large machines (pulp preparation, paper formation, winding, and sheet cutting), which has various machine related constraints. In addition, there are the operational constraints from the real-world situation. The problem is mod...

We investigate a new application of DC (Difference of Convex functions) programming and DCA (DC Algorithm) in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reform...

In this paper, a two-dimensional cutting problem is considered in which a single plate (large object) has to be cut down into a set of small items of maximal value. As opposed to standard cutting problems, the large object contains a defect, which must not be covered by a small item. The problem is represented by means of an AND/OR-graph, and a Branch & Bound procedure (including heuristic modi...

In this paper, six different approaches using genetic algorithms (GA) and/or simulated annealing (SA) with improved bottom left (I-BL) algorithm [1] were applied for solution of two dimensional non-guillotine cutting problems. As examples, test problems including 29 individual rectangular pieces were used [2]. Performances of hybrid approaches on solutions of cutting problems were compared. Due...

Three-dimensional visualization is a new research field in information processing and VTK is a visualization toolkit with strong functions. Due to the fact that most two-dimensional microfabric models of coarse-aggregate materials are not accurate, three-dimensional model is needed. This study laid its focus on the theoretical model of three-dimensional visualization and the visualization techn...

Graeme Forbes (2011) raises some problems for two-dimensional semantic theories. The problems concern nested environments: linguistic environments where sentences are nested under both modal and epistemic operators. Closely related problems involving nested environments have been raised by Scott Soames (2005) and Josh Dever (2007). Soames (forthcoming) goes so far as to say that nested environm...