Results 221 to 230 of about 77,472 (265)
Some of the next articles are maybe not open access.
2000
Flattening is a program transformation that eliminates nested parallel constructs, introducing flat parallel (vector) operations in their place. We define a sufficient syntactic condition for the correctness of flattening, providing a static approximation of Blelloch’s “containment”.
James Riely, Jan F. Prins
openaire +1 more source
Flattening is a program transformation that eliminates nested parallel constructs, introducing flat parallel (vector) operations in their place. We define a sufficient syntactic condition for the correctness of flattening, providing a static approximation of Blelloch’s “containment”.
James Riely, Jan F. Prins
openaire +1 more source
ON FLATTENING ELIMINATION RULES
The Review of Symbolic Logic, 2014AbstractIn proof-theoretic semantics of intuitionistic logic it is well known that elimination rules can be generated from introduction rules in a uniform way. If introduction rules discharge assumptions, the corresponding elimination rule is a rule of higher level, which allows one to discharge rules occurring as assumptions.
Grigory K. Olkhovikov +1 more
openaire +2 more sources
Optics Letters, 2013
We show that field-flattened strands may be added to and arbitrarily positioned within a field-flattened shell to create patterned, flattened modes. Patterning does not alter the effective index or flatness of the flattened mode but does alter the characteristics of other modes; we show that it can improve a flattened mode's bend performance ...
Michael J, Messerly +2 more
openaire +2 more sources
We show that field-flattened strands may be added to and arbitrarily positioned within a field-flattened shell to create patterned, flattened modes. Patterning does not alter the effective index or flatness of the flattened mode but does alter the characteristics of other modes; we show that it can improve a flattened mode's bend performance ...
Michael J, Messerly +2 more
openaire +2 more sources
2008
The problem of optimal surface flattening in 3-D finds many applications in engineering and manufacturing. However, previous algorithms for this problem are all heuristics without any quality guarantee and the computational complexity of the problem was not well understood. In this paper, we prove that the optimal surface flattening problem is NP-hard.
Danny Z. Chen, Ewa Misiolek
openaire +1 more source
The problem of optimal surface flattening in 3-D finds many applications in engineering and manufacturing. However, previous algorithms for this problem are all heuristics without any quality guarantee and the computational complexity of the problem was not well understood. In this paper, we prove that the optimal surface flattening problem is NP-hard.
Danny Z. Chen, Ewa Misiolek
openaire +1 more source
Flattening hierarchical scheduling
Proceedings of the tenth ACM international conference on Embedded software, 2012Recently, the application of virtual-machine technology to integrate real-time systems into a single host has received significant attention and caused controversy. Drawing two examples from mixed-criticality systems, we demonstrate that current virtualization technology, which handles guest scheduling as a black box, is incompatible with this modern ...
Adam Lackorzynski +3 more
openaire +1 more source
Nature, 1952
IT has long been known that when a fertilized egg is flattened between two plates it may cease to divide. Zeuthen1 has shown recently that although cell division is inhibited, nuclear division may continue, so that many nuclei may be present in a single flattened cell. I obtained essentially similar results during the summer of 1951, at Roscoff. It Was
openaire +2 more sources
IT has long been known that when a fertilized egg is flattened between two plates it may cease to divide. Zeuthen1 has shown recently that although cell division is inhibited, nuclear division may continue, so that many nuclei may be present in a single flattened cell. I obtained essentially similar results during the summer of 1951, at Roscoff. It Was
openaire +2 more sources
Shape Interpolation with Flattenings
2010 20th International Conference on Pattern Recognition, 2010This paper presents the binary flattenings of shapes, first as a connected operator suppressing particles or holes, second as an erosion in a particular lattice of shapes. Using this erosion, it is then possible to construct a distance from a shape to another and derive from it an interpolation function between shapes.
openaire +1 more source
Flattening Filter Free vs Flattened Beams for Breast Irradiation
International Journal of Radiation Oncology*Biology*Physics, 2013Flattening filter free (FFF) beams offer the potential for a higher dose rate, shorter treatment time, and lower peripheral dose. To investigate their role in large-field treatments, this study compared flattened and FFF beams for breast irradiation.Ten left breast clinical plans comprising 2 tangential beams and a medially located 3-field simultaneous
Spruijt, K.H. +6 more
openaire +4 more sources
Half Reification and Flattening
2011Usually propagation-based constraint solvers construct a constraint network as a conjunction of constraints. They provide propagators for each form of constraint c. In order to increase expressiveness, systems also usually provide propagators for reified forms of constraints.
Thibaut Feydy +2 more
openaire +1 more source
IT education in the flattening world
Proceedings of the 7th conference on Information technology education, 2006The irresistible wave of globalization is transforming our society and our educational institutions. Profound IT-related challenges and opportunities stimulate IT research and lead to constant IT curriculum changes. This paper discusses the significance and impact of globalization and emerging technologies on IT curriculum and IT education in general ...
openaire +1 more source