Conditional and Composite Temporal Constraints with Preferences

2006 ◽  
Author(s):  
M. Mouhoub ◽  
A. Sukpan
Keyword(s):  
Temporal Constraints

A CSP-Based Approach for Temporal Constraints in Temporal Planning

2012 ◽  
Vol 35 (8) ◽  
pp. 1759
Author(s):  
Li-Hua WU ◽  
Ai-Xiang CHEN ◽  
Yun-Fei JIANG ◽  
Rui BIAN
Keyword(s):  
Temporal Constraints ◽  
Temporal Planning

scholarly journals Physically Based Soap Bubble Synthesis for VR

2021 ◽  
Vol 11 (7) ◽  
pp. 3090
Author(s):  
Sangwook Yoo ◽  
Cheongho Lee ◽  
Seongah Chin
Keyword(s):  
Virtual Reality ◽  
Virtual Space ◽  
Soap Bubble ◽  
Temporal Constraints ◽  
High Expectations ◽  
Soap Bubbles ◽  
Physical Motion ◽  
Head Mounted Display ◽  
Interesting Topic ◽  
Physically Based

To experience a real soap bubble show, materials and tools are required, as are skilled performers who produce the show. However, in a virtual space where spatial and temporal constraints do not exist, bubble art can be performed without real materials and tools to give a sense of immersion. For this, the realistic expression of soap bubbles is an interesting topic for virtual reality (VR). However, the current performance of VR soap bubbles is not satisfying the high expectations of users. Therefore, in this study, we propose a physically based approach for reproducing the shape of the bubble by calculating the measured parameters required for bubble modeling and the physical motion of bubbles. In addition, we applied the change in the flow of the surface of the soap bubble measured in practice to the VR rendering. To improve users’ VR experience, we propose that they should experience a bubble show in a VR HMD (Head Mounted Display) environment.

scholarly journals A Study about the Temporal Constraints on the Martian Yardangs’ Development in Medusae Fossae Formation

2021 ◽  
Vol 13 (7) ◽  
pp. 1316
Author(s):  
Jia Liu ◽  
Zongyu Yue ◽  
Kaichang Di ◽  
Sheng Gou ◽  
Shengli Niu
Keyword(s):  
Size Distribution ◽  
Indirect Method ◽  
Common Method ◽  
Planetary Surface ◽  
Temporal Constraints ◽  
History Of Development ◽  
Long Duration ◽  
History Of ◽  
Dating Method

The age of Mars yardangs is significant in studying their development and the evolution of paleoclimate conditions. For planetary surface or landforms, a common method for dating is based on the frequency and size distribution of all the superposed craters after they are formed. However, there is usually a long duration for the yardangs’ formation, and they will alter the superposed craters, making it impossible to give a reliable dating result with the method. An indirect method by analyzing the ages of the superposed layered ejecta was devised in the research. First, the layered ejecta that are superposed on and not altered by the yardangs are identified and mapped. Then, the ages of the layered ejecta are derived according to the crater frequency and size distribution on them. These ages indicate that the yardangs ceased development by these times, and the ages are valuable for studying the evolution of the yardangs. This indirect dating method was applied to the areas of Martian yardangs in the Medusae Fossae Formation (MFF). The ages of the selected six layered ejecta range from ~0.50 Ga to ~1.5 Ga, indicating that the evolution of the corresponding yardangs had been ceased before these times. Analysis of more layered ejecta craters and superposed yardangs implies that yardangs in the MFF have a long history of development and some yardangs are still in active development.

scholarly journals Evaluation of Static Mapping for Dynamic Space-Shared Multi-task Processing on FPGAs

2021 ◽  
Author(s):  
Umar Ibrahim Minhas ◽  
Roger Woods ◽  
Georgios Karakonstantis
Keyword(s):  
High Performance ◽  
Design Space Exploration ◽  
Design Space ◽  
System Throughput ◽  
Design Parameters ◽  
Temporal Constraints ◽  
Shared Resources ◽  
Task Processing ◽  
High Level ◽  
Performance Computing

AbstractWhilst FPGAs have been used in cloud ecosystems, it is still extremely challenging to achieve high compute density when mapping heterogeneous multi-tasks on shared resources at runtime. This work addresses this by treating the FPGA resource as a service and employing multi-task processing at the high level, design space exploration and static off-line partitioning in order to allow more efficient mapping of heterogeneous tasks onto the FPGA. In addition, a new, comprehensive runtime functional simulator is used to evaluate the effect of various spatial and temporal constraints on both the existing and new approaches when varying system design parameters. A comprehensive suite of real high performance computing tasks was implemented on a Nallatech 385 FPGA card and show that our approach can provide on average 2.9 × and 2.3 × higher system throughput for compute and mixed intensity tasks, while 0.2 × lower for memory intensive tasks due to external memory access latency and bandwidth limitations. The work has been extended by introducing a novel scheduling scheme to enhance temporal utilization of resources when using the proposed approach. Additional results for large queues of mixed intensity tasks (compute and memory) show that the proposed partitioning and scheduling approach can provide higher than 3 × system speedup over previous schemes.

Sign in / Sign up

Export Citation Format

Share Document