A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Reachability and the power of local ordering
1995
Theoretical Computer Science
Preserved Fulltext
We prove an upper bound on the power of TC over one-way locally ordered graphs, and three lower bounds on DTC. ...
On the other hand, in the absence of ordering, (FO + TC) is strictly more powerful than (FO -t DTC) (Grade1 and McColm, 1992). ...
Acknowledgements Thanks to Allan Borodin and Dexter Kozen for pointing out Facts 6.2 and 6.1 to us. ...
doi:10.1016/0304-3975(95)00034-t
fatcat:mbtxb5gterf65hah2objbycn6a
Reachability and the power of local ordering
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We prove an upper bound on the power of TC over one-way locally ordered graphs, and three lower bounds on DTC. ...
W e also show that DTC of rst-order formulas does not su ce to express reachability f o r t wo-way local ordered graphs without numbers. A preliminary version of this paper appeared as EI94a]. ...
We h a ve proved an interesting upper bound on the power of TC over one-way locally ordered graphs (Theorem 3.11), and three lower bounds on DTC (Theorems 2.7 and 5.5, and Corollary 6.3). ...
doi:10.1007/3-540-57785-8_136
fatcat:ir3dsde4y5hdlf3haj6rapggku
A fast local search method for minimum energy broadcast in wireless ad hoc networks
2009
Operations Research Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Abstract Local search methods are often used to reduce the power consumption of broadcast routing in wireless networks. ...
For a classic such method, sweep, the best available time complexity result is O(|V | 4 ). ...
This is the order in which the algorithm below processes the nodes, and hence the order is fixed before and throughout the processing. ...
doi:10.1016/j.orl.2009.01.004
fatcat:2ow7k6r6wzbyfk4ade5eppsokq
Detection of anomalies in smart meter data: A density-based approach
2017
2017 Smart Grid Conference (SGC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Smart grid is the next generation of power grid that provides two-way communication, both in sending and receiving information and in power transfer, among its programs, and using advanced technologies ...
One of the important aspects of maintaining security is on the consumption side, because maintaining the privacy of customers is important and neglecting that will cause an irreparable financial and social ...
Local Reachability Density The local reachability density ( ) of is the inverse of the average reachability density based on the -nearest neighbors of . ...
doi:10.1109/sgc.2017.8308852
fatcat:svwihb2x6zagjf6kwfn7amr4bq
A Generalized Probabilistic Topology Control for Wireless Sensor Networks
2009
IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It reduces the transmitting power of network nodes while the key network connectivity is preserved. ...
The communication overhead is O(|E| + |V |), the worst running time is O(|E|), and the space requirement is O(1) where E is the set of links and V is the set of nodes. ...
They use the initial power setting, typically with the poor link quality, as the input of the local network. ...
doi:10.1109/infcom.2009.5062230
dblp:conf/infocom/LiuN09
fatcat:sgfhgyc6prbdnipumrd3pofrk4
A Generalized Probabilistic Topology Control for Wireless Sensor Networks
2012
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It reduces the transmitting power of network nodes while the key network connectivity is preserved. ...
The communication overhead is O(|E| + |V |), the worst running time is O(|E|), and the space requirement is O(1) where E is the set of links and V is the set of nodes. ...
They use the initial power setting, typically with the poor link quality, as the input of the local network. ...
doi:10.1109/jsac.2012.121023
fatcat:werdyzqljff23jqjutuke4haoy
AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We focus on the arbitrary-order reachability matrix framework called AORM, which can handle directed and disconnected networks such as citation networks. ...
The experimental results show the advantages of the method in terms of both computational efficiency and approximation controllability. ...
reachability matrix produce the cycles that revisit the starting vertices. • Trail pruning: Some trails also occur in the powers of the reachability matrix as the number of powers (i.e., k-order) increases ...
doi:10.1109/access.2021.3077888
fatcat:dw6qm3xb65fsrpgqrh4uomoipi
Channel-based behavioral test synthesis for improved module reachability
1999
Proceedings of the conference on Design, automation and test in Europe - DATE '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Based on the notion of transparency channels, test justification and propagation bottlenecks are revealed for each module in the design. ...
We demonstrate our scheme on a representative example, unveiling the potential of path analysis based techniques to accurately identify and eliminate module reachability bottlenecks, thus guiding behavioral ...
Test paths & reachability templates In this section we demonstrate how the reachability analysis scheme of section 3 can be applied on the Post-RTL, in order to assist the local to global test translation ...
doi:10.1145/307418.307506
fatcat:z6pzt3rfsndd7probdmmxitfku
Cyber-Resilient Frequency Control of Power Grids with Energy Storage Systems
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The resilient operating constraints are found by using ellipsoidal approximations of the reachable set of the power system, leading to a convex optimization problem with linear matrix inequalities. ...
This paper proposes a defense methodology for the design of resilient operating constraints imposed on each generation and storage unit in order to prevent any attack sequence from driving the system's ...
CASE STUDY In order to illustrate the viability of the proposed approach, we consider a power system with a single area, two synchronous generators, and two energy storage systems. ...
arXiv:2207.12333v1
fatcat:sbdhbloawbcc5cfqvuaz4wd34e
Determination of finite automata accepting subregular languages
2009
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
as combinational languages, definite languages and variants thereof, (strictly) locally testable languages, star-free languages, ordered languages, prefix-, suffix-, and infix-closed languages, and prefix ...
Otherwise tight bounds in order of magnitude are shown. ...
In order to prove the above statement it is sufficient to show that all states of the power-set automaton A n are reachable and belong to different equivalence classes with respect to the Myhill-Nerode ...
doi:10.1016/j.tcs.2009.05.019
fatcat:6l2cv5qomfbavlvq3qv3rai7by
Interpretive Structural Analysis of Interrelationships among the Elements of Characteristic Agriculture Development in Chinese Rural Poverty Alleviation
2018
Sustainability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Furthermore, these elements were further categorized into four categories depending on their driving power and dependence power by using the cross-impact matrix multiplication applied to classification ...
This study intends to identify and quantify the elements affecting the Characteristic Agriculture Development (CAD) project implemented in area of Chinese poverty and reveals the interrelationships between ...
The drive power of an element can be obtained by adding up the number of ones in the rows from final reachability matrix. ...
doi:10.3390/su10030786
fatcat:ropd6fqqw5dbdfgpo3rnwt2kxe
Evaluate municipal solid waste management problems using hierarchical framework
2011
Procedia - Social and Behavioral Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The proposed hierarchical framework include four main steps: identifying the interrelationships among criteria, establishing the reachability matrix, determining the hierarchical levels of criteria, and ...
Our results show that the proposed criteria can be successfully constructed into a visual map via the driving and dependence power analysis (DDPA). Some implications are addressed. ...
of antecedent set and reachability set. ...
doi:10.1016/j.sbspro.2011.10.554
fatcat:3j6fk4gulnhrnfdu36jmhefwp4
Analyzing the scheduling system stage of production system life cycle
2015
Management Science Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
and indirect effects of each factor on the scheduling system. ...
The main objective of this paper is to identify and understand the relationship dynamics among the quality enabled factors affecting the scheduling stage of production system life cycle. ...
strategy for late orders, proper follow-up of the orders and proper utilization of scheduling tool and techniques possess weak driving power and strong dependence on other factors. ...
doi:10.5267/j.msl.2015.3.011
fatcat:5jcu7nmlljgj7pd46bfeiq55xa
Minimality and local state decompositions of a nonlinear state space realization using energy functions
2000
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Using the nonlinear analogue of the Kalman decomposition, connections are then established between minimality, singular value functions, balanced realizations, and various notions of reachability and observability ...
In this paper a set of sufficient conditions is developed in terms of controllability and observability functions under which a given statespace realization of a formal power series is minimal. ...
Remark 3.4: The above corollary is restricted by local requirements on Lc, since we need local asymptotic reachability from 0 in order to use Theorem 3.2. ...
doi:10.1109/9.887630
fatcat:es4lyun2nzedzmucxw4jde5xea
The Hierarchical Structure of Galactic Haloes: Classification and characterisation with Halo-OPTICS
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
for the automatic detection and extraction of all meaningful clusters between any two arbitrary sizes. ...
We then apply Halo-OPTICS to the 3D spatial positions of halo particles within four separate synthetic Milky Way type galaxies, classifying the stellar and dark matter structural hierarchies. ...
This research benefitted from computation resources in the form of the Argus Virtual Research Desktop environment which was provided through the University of Sydney's Information and Communication Technologies ...
arXiv:2012.04823v1
fatcat:kb6beqe73vhdfaql2wnu5rn6bi
« Previous
Showing results 1 — 15 out of 57,241 results