
	Where results make sense

Topic: Reachability

In the News (Tue 21 May 13)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	lee-xcast-reachability-00.txt
		Xcast reachability test MAY be performed before a sender node sends xcast data packets to the receiver node, so as to confirm that the provided transit networks can deliver them to the receiver node successfully.
		The failure of xcast reachability test means that at least one transit router on the one way delivery path between the tester node and the testee node is incapable of xcast routing or that the testee node itself is not xcast-receivable.
		Xcast reachability test has two kinds of results; one is an ICMP error message generated by the testee node, and the other is 'no message returned.' During the xcast routability test, the tester node will receive one or more ICMP error messages generated by the transit nodes before it finally obtains xcast reachability test result.
	www.potaroo.net /ietf/idref/draft-lee-xcast-reachability (2932 words)

	Net::Ping - check a remote host for reachability
		A ping object is first created with optional parameters, a variable number of hosts may be pinged multiple times and then the connection is closed.
		If the timeout is set too low under these conditions, it will appear that the remote host is not reachable (which is almost the truth).
		Reachability doesn't necessarily mean that the remote host is actually functioning beyond its ability to echo packets.
	www.xav.com /perl/lib/Net/Ping.html (848 words)

	Neighbor Reachability Phase (Site not responding. Last check: 2007-07-06)
		Two neighbors will be able to exchange network reachability information only if they are both in the UP state and know that they are both in the UP state.
		A neighbor is reachable when it moves to the UP state, which is indicated in the status field of these two messages.
		The Hello interval is 30 and the Poll interval is 120.
	www.ifb.pl /~mateo/bgp/ip/2917A-214.html (578 words)

	Reachability Distribution by Group Chart
		The Reachability Distribution by Group chart displays the percentage of time during the report period that each group operated within a reachability range.
		The height of a section on a bar is the percentage of daily average reachability values that were in each reachability range.
		Use the Availability, Reachability, and Latency supplemental report of the Health report to obtain the reachability for each element in a group.
	www.concord.com /help/files/reports/service/charts/ReachDistGrp.html (473 words)

	reachAbility - Volunteer (Site not responding. Last check: 2007-07-06)
		Becoming involved with reachAbility the entire community is able to share responsibility for achieving important community goals.
		There are many ways to be a part of reachAbility; from volunteering time, resources, etc. If you are interested in more information please call us, unless you are a member of the legal profession in which case we request you click on the lawyer link.
		reachAbility is dedicated to ensuring that quality legal and social representation is provided to people with disabilities.
	www.reachability.org /volunteer/volunteer.html (314 words)

	Reachability Distribution Chart
		The Reachability Distribution chart displays the percentage of elements that have a daily average reachability within each range on a daily, weekly, or monthly basis during the report period.
		The vertical axis is the percentage of daily average reachability values for the elements in the group or group list.
		The height of a section on a bar is the percentage of daily average values in a particular reachability range.
	www.concord.com /help/files/reports/service/charts/ReachDistAll.html (680 words)

	reachAbility (Site not responding. Last check: 2007-07-06)
		reachAbility (formerly Reach Nova Scotia) is a charitable organization providing access to equality and human rights - to enhance the quality of life of the entire community - through effective, innovative response re: access to equality for people living with disabilities - by providing new knowledge, leadership and partnership opportunities.
		At reachAbility, we are always focused on improving our services to the community, through our varied program initiatives, that improve access to Justice and Equality to all People across NS who are additionally challenged by a disability.
		As a grassroots organization we are listening to our constituency in order to improve and develop the ways in which we support people with disabilities across NS.
	www.reachability.org (521 words)

	Reachability Logic: An Efficient Fragment of Transitive Closure Logic - Alechina, Immerman (ResearchIndex) (Site not responding. Last check: 2007-07-06)
		Abstract: We define reachability logic (RL), a fragment of FO 2 (TC) (with boolean variables) that admits efficient model checking -- linear time with a small constant -- as a function of the size of the structure being checked.
		The model checking algorithm is also linear in the size of the formula, but exponential in the number of boolean variables occurring in it.
		Alechina and N. Immerman, "Reachability Logic: An Efficient Fragment of Transitive Closure Logic," Logic Journal of the IGPL 8(3) (2000), 325-338.
	citeseer.ist.psu.edu /333239.html (512 words)

	Formal System Verification - Improving Reachability Analysis of Hybrid Automata for Engine Control (Site not responding. Last check: 2007-07-06)
		The main contribution of the paper is a revised reachability computation that avoids the approximations caused by the union operation in the discretized flow tube estimation.
		Therefore, the new algorithm may correctly classify as unreachable states that are reachable according to the previous algorithm because of the looser over-approximations introduced by the union operation.
		We implemented the new reachability algorithm and tested it successfully on a real-life case modeling a hybrid model of a controlled car engine.
	fsv.dimi.uniud.it /papers/improving_EC2004 (241 words)

	Java Forums - Reachability question
		But when an object becomes not reachable and when it is enqueued don't seem to be directly related.
		Yes but reachable is a rather subjective term which does not define the exact process that a GC might take.
		For example even if neither is reachable only one might be collected on one run of the GC and the other might be collected later.
	forum.java.sun.com /thread.jspa?threadID=575095 (1351 words)

	Protocol Verification by Leaping Reachability Analysis (ResearchIndex) (Site not responding. Last check: 2007-07-06)
		This paper proposes a technique called leaping reachability analysis (LRA) as a relief strategy for verifying deadlock-freedom of protocols modeled as networks of communicating finite state machines (CFSMs).
		Unlike most existing relief strategies in the CFSM model, LRA does not restrain the number of state machines and their attributes, nor the topological structure of a...
		5 On improving simultaneous reachability analysis for the effi..
	citeseer.ist.psu.edu /28782.html (526 words)

	JEP-0152: Reachability Addresses
		Publish the reachability address(es) in the user's vCard (see vcard-temp [ 1 ]); this is convenient, but is not very dynamic (e.g., reachability addresses might change when the user moves to a new conference room in an office building).
		Publish the user's reachability status (but not addresses) as a feature bundle within Entity Capabilities [ 2 ] information; this is somewhat dynamic (subscribers can be informed when reachability information is available) but requires every interested subscriber to perform service discovery in order to determine the reachability address(es).
		Send the reachability address(es) within a stanza; this option is described in the Presence Broadcast section of this JEP and is consistent with Section 5.1.2 of RFC 3921 [ 3 ] since reachability is one aspect of a user's availability for communication.
	www.jabber.org /jeps/jep-0152.html (1150 words)

	On Reachability Under Uncertainty
		The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input disturbances that may also be interpreted as the action of an adversary in a game-theoretic setting.
		It defines possible notions of reachability under uncertainty emphasizing the differences between reachability under open-loop and closed-loop control.
		The basic relations are derived through the investigation of superpositions of value functions for appropriate sequential maxmin or minmax problems of control.
	epubs.siam.org /sam-bin/dbq/article/36109 (206 words)

	Reachability Graph generation using AToM3
		The tool takes any PN model and creates (by clicking a button) the corresponding reachability graph in a separate window.
		Reachability graph is a kind of FSA (Finite State Automata), with special meaning for the nodes and transitions:
		This method can be used to create a connection of the appropiate type from one node to other of the graph.
	moncs.cs.mcgill.ca /people/jlara/ATOM3MetaMod/ReachGraph/index.html (1133 words)

	Reachability and Distance Queries via 2-Hop Labels
		Reachability and Distance Queries via 2-Hop Labels: SIAM Journal on Computing Vol.
		Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems to Internet routing.
		Our experiments show that the total size of the labels is typically not much larger than the network itself, and is usually considerably smaller than an explicit representation of the transitive closure of the network.
	epubs.siam.org /sam-bin/dbq/article/40309 (317 words)

	Reachability Analysis
		In one scenario (for painting the F-117 aircraft), the reachability analysis tool determined the zones on the plane which could be reached and the corresponding zones of space where the base of the robot could be placed to reach those locations.
		Recognizing that it was unlikely we would be able to do this project on time and budget with the eyeball method, we turned to a concept partially developed a couple of years earlier.
		We dusted it off, filled it out and came up with a "reachability analysis tool." Given a task the robot must do (a path to follow), the reachability tool will calculate all the positions in space the robot can be placed and still reach everything.
	www.sandia.gov /isrc/reachanalysis.html (712 words)

	Timbuk Reachability Analysis and Tree Automata Calculations
		Timbuk is a collection of tools for achieving proofs of reachability over Term Rewriting Systems and for manipulating Tree Automata (bottom-up non-deterministic finite tree automata)
		Timbuk and reachability analysis can be used for program verification.
		For instance, Timbuk is currently used to verify Cryptographic Protocols (see some papers and in the examples of the distribution).
	www.irisa.fr /lande/genet/timbuk (543 words)

	Understanding NTP Reachability Statistics \| Linux Journal
		How to make sense out of reachability statistics to learn what and where the problem is.
		The answer is that the lower numerical values are caused by the left-shifting of the reachability register.
		If the next seven polls are successful, seven 1s are added from the right-hand side of the register, pushing the 0 representing the dropped packet further towards the left (and digital oblivion).
	www.linuxjournal.com /article/6812 (1631 words)

	8.1 End points and reachability (Site not responding. Last check: 2007-07-06)
		To determine whether a particular statement or end point is reachable, the compiler performs flow analysis according to the reachability rules defined for each statement.
		The block of a function member is always considered reachable.
		By successively evaluating the reachability rules of each statement in a block, the reachability of any given statement can be determined.
	www.asprelated.com /csharp/sharp-8_1.aspx (609 words)

	RFC 1273 (rfc1273) - Measurement Study of Changes in Service-Level Reachab
		To understand the evolution of this situation, we have designed a study to measure changes in Internet service-level reachability over a period of one year.
		The study considers upper layer service reachability instead of basic IP connectivity because the former indicates the willingness of organizations to participate in inter- organizational computing, which will be an important component of future wide area distributed applications.
		The study is concerned solely with the evolution of network connectivity and service reachability.
	www.faqs.org /rfcs/rfc1273.html (2320 words)

	Minimum-Cost Reachability for Priced Timed Automata
		For this model we consider the minimum-cost reachability problem: i.e.
		This problem generalizes the minimum-time reachability problem for ordinary timed automata.
		We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions.
	www.brics.dk /RS/01/3/index.html (112 words)

	On Removing the Pushdown Stack in Reachability Constructions (ResearchIndex)
		It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a 2-tape pushdown acceptor with reversal-bounded counters.
		We improve this result by showing that the stack can be removed from the acceptor, i.e., the binary reachability can be accepted by a 2-tape finite-state acceptor with reversal-bounded counters.
		Binary Reachability Analysis of Pushdown Timed Automata with Dense..
	citeseer.ist.psu.edu /448573.html (481 words)

	Person-level Routing in the Mobile People Architecture (Site not responding. Last check: 2007-07-06)
		Unfortunately a growing problem for these people is maintaining reachability: as network devices, applications, and accessible locations proliferate, it becomes less likely that other people (correspondents) can get in touch with a mobile person at any particular time.
		Furthermore, if Dan is temporarily unavailable by phone but is reachable by email, Jane, who may not be near an email terminal, cannot communicate with him until he is available by phone.
		Unfortunately, even in the case where Dan's cellular carrier allows him to forward his missed phone calls to his office email address, Dan will still be unreachable when he moves from his office to a conference room.
	mosquitonet.stanford.edu /publications/USITS1999/USITS1999.html (6170 words)

	Measuring Reachability Using the Ping Command (Site not responding. Last check: 2007-07-06)
		Trend reports for the Reachability variable show a gap when the element is not being polled.
		The Reachability chart of a Health report classifies that time as unknown.
		Reachability data is saved in the database only when a good poll occurs; reachability data that coincides with a bad poll, missed poll, or a reboot (a good poll that also indicates the device rebooted) is not saved in the database.
	scope.more.net /help/files/reports/general/rchPing.html (242 words)

	CPSC 513 BDD Reachability (Site not responding. Last check: 2007-07-06)
		Please email me your completed program and a brief description of your results (how many reachable states and how many iterations) on the ISCAS 89 benchmarks.
		I have written for you a program that computes the set of reachable states of a sequential circuit.
		However, the program is missing the core code that computes the reachability iteration we discussed in class.
	www.cs.ubc.ca /~ajh/courses/cpsc513/project_reach.html (295 words)

	Larchant: garbage collection in a cached distributed shared store with persistence by reachability
		To provide the illusion of a shared address space across the network, despite the fact that site memories are disjoint, Larchant implements a distributed shared memory mechanism.
		Reachability is accessed by tracing the pointer graph, starting from the persistent root, and reclaiming unreachable objects.
		The performance results from our Larchant prototype show that our design goals (scalability, coherence orthogonality, and good performance) are fulfilled.
	www-sor.inria.fr /publi/ferreira_thesis96.html (377 words)

	Reachability for MDPs Abstract (Site not responding. Last check: 2007-07-06)
		We develop a family of algorithms for structured reachability analysis of MDPs that are suitable when an initial state (or set of states) is known.
		Using compact, structured representations of MDPs (e.g., Bayesian networks), our methods, which vary in the tradeoff between complexity and accuracy, produce structured descriptions of (estimated) reachable states that can be used to eliminate variables or variable values from the problem description, reducing the size of the MDP and making it easier to solve.
		Another contribution is the illustration of how the compact representation of reachability constraints can be exploited by several existing (exact and approximate) abstraction algorithms for MDPs.
	www.cs.toronto.edu /~cebly/Papers/reachability-abs.html (176 words)

	Reachability analysis of real-time systems using time Petri nets. (Site not responding. Last check: 2007-07-06)
		The existing technique for reachability analysis of TPNs, however, is not suitable for timing property verification because one cannot derive end-to-end delay in task execution, an important issue for time-critical systems, from the reachability tree constructed using the technique.
		This paper presents a new reachability based analysis technique for TPNs for timing property analysis and verification that effectively addresses the problem.
		With the reachability tree generated based on CS-classes, the end-to-end time delay in task execution can be directly computed.
	www.informatik.uni-hamburg.de /TGI/pnbib/w/wang_j1.html (247 words)

	Define Graph
		If a vertex is reachable from another vertex then a path exists from the one vertex to the other vertex.
		Also, if vertex b is reachable from vertex a and vertex c is reachable from vertex b, then it follows that vertex c is reachable from vertex a.
		For instance, if vertex a is reachable from vertex b, vertex a may not be reachable from vertex b.
	www.cs.usask.ca /resources/tutorials/csconcepts/1999_8/tutorial/beginner/define/define.html (799 words)

	6bone.mail-2001-01: Re: reachability issue with 3ffe:80a::/32 (PAIX IX segment) (Site not responding. Last check: 2007-07-06)
		Re: reachability issue with 3ffe:80a::/32 (PAIX IX segment)
		Previous message: Stephen Stuart: "Re: reachability issue with 3ffe:80a::/32 (PAIX IX segment)"
		Maybe in reply to: Jun-ichiro itojun Hagino: "reachability issue with 3ffe:80a::/32 (PAIX IX segment)"
	dict.regex.info /ipv6/6bone/6bone.mail-2001-01/0066.html (203 words)

Try your search on: Qwika (all wikis)