scholarly journals Work-sensitive Dynamic Complexity of Formal Languages

2021 ◽  
pp. 490-509
Author(s):  
Jonas Schmidt ◽  
Thomas Schwentick ◽  
Till Tantau ◽  
Nils Vortmeier ◽  
Thomas Zeume
Keyword(s):  
Formal Languages ◽  
Constant Time ◽  
Range Queries ◽  
Dynamic Complexity ◽  
Descriptive Complexity ◽  
Query Result ◽  
Parallel Resources

AbstractWhich amount of parallel resources is needed for updating a query result after changing an input? In this work we study the amount of work required for dynamically answering membership and range queries for formal languages in parallel constant time with polynomially many processors. As a prerequisite, we propose a framework for specifying dynamic, parallel, constant-time programs that require small amounts of work. This framework is based on the dynamic descriptive complexity framework by Patnaik and Immerman.

scholarly journals Sleepwalk: Scalable and Energy-Efficient Processing of Continuous Range Queries for Location-Aware Mobile Computing

2015 ◽  
Vol 2015 ◽  
pp. 1-16
Author(s):  
MoonBae Song
Keyword(s):  
Motion Vector ◽  
Real Life ◽  
Search Space ◽  
Optimization Techniques ◽  
Range Queries ◽  
Processing Power ◽  
Query Result ◽  
Energy Conserving ◽  
Linear Movement ◽  
Continuous Range

Recently, monitoring queries are getting attention for various real-life applications such as safety, security, and personalization services. This work proposes a distributed sensing and monitoring technique (calledSleepwalk) for continuous range queries with energy- and computation-efficient optimizations. In our scheme, each mobile client (MC) is aware of its nearby monitoring queries by leveraging its processing power. The proposed Sleepwalk has three major contributions. First, withpiecewiselinear movement assumption and motion vectorv̅, it can locally preevaluate every possible query result in advancein bulkand sends them to the server at once. We also provide a timestamp-based invalidation technique for efficiently removing failed preevaluated results by computing the smallest valid timestamp. Second, an energy-conserving technique that repeatedly sleeps off MCs whenever possible is proposed by calculating thesafely sleepabletime. Third, we provide a set of localized query optimization techniques for MCs’ local query subset using plane-sweeping, which effectively minimize search space. Extensive experiments indicate that Sleepwalk technique remarkably outperforms existing state-of-the-art techniques in terms of server scalability, communication cost, and energy consumption of MCs.

scholarly journals The dynamic complexity of formal languages

2012 ◽  
Vol 13 (3) ◽  
pp. 1-36 ◽  
Author(s):  
Wouter Gelade ◽  
Marcel Marquardt ◽  
Thomas Schwentick
Keyword(s):  
Formal Languages ◽  
Dynamic Complexity

The Hundred Days of Sara Mata: Explaining Unnatural Death in Vanuatu

1984 ◽  
Vol 14 (2) ◽  
pp. 135-144
Author(s):  
Margaret Rodman ◽  
William Rodman
Keyword(s):  
Dynamic Complexity ◽  
Process Of Change ◽  
Unnatural Death ◽  
Structural Principles

Who or what killed Sara Mata? During the hundred days of mourning that followed the young woman's “unnatural” death, residents of Aoba, an island in Vanuatu, sought to discover the cause of Sara's death. Alternative local explanations of the death highlight the ambiguity that characterizes Aoban beliefs about people's ability to cause death by supernatural means. We show the conventional anthropological categories of poison, sorcery, and witchcraft may misrepresent the dynamic complexity of such indigenous beliefs. Finally, we discuss a process of change in Aoban ideas concerning unnatural death, a shift from a belief in sorcery to a belief in self-destruction by supernatural means. The possibility that a society can “rewrite” a transitive process of sorcery into a reflexive mode raises new questions about the theoretical relations between witchcraft, sorcery, and structural principles of society.

Sign in / Sign up

Export Citation Format

Share Document