Distributed Search

In this paper we introduce a public transit schedule and route planner application for urban public transportation. The application was developed for the Android Operating System. It works offline and does not need a permanent internet connection.While transport agencies usually make their schedules available online, browsing them outdoors is not always possible, or requires too much effort on the small screen of a mobile phone. The solutions of this problem are the GTFS databases, which describe the urban public transportation systems. Developers can create applications which use the GTFS databases. However, these databases are not applicable for fast processing needed for route planning on mobile devices with limited resources. Therefore we created a data structure from the GTFS database which is easier to manage, smaller and faster to process. The Android application uses this data structure.The application lists the departure times, journey times and the stops of the lines. It can display the lines on the map. It also shows the stops nearby with the name of the lines passing through. The user can choose one or more stops and view details about the lines passing through.The main function of the application is the route planner. It plans at least one route from a starting-point to a destination. Before the route planning the user can set parameters which are taken into account by the route planner.

show abstract

“…This is achieved using an A algorithm [15]. There is a one-to-one relation between stops and states.…”

Section: Planning Phasementioning

confidence: 99%

Public transit schedule and route planner application for mobile devices

Szincsák¹,

Vágner

2015

Proceedings of the 9th International Conference on Applied Informatics, Volume 2

View full text Add to dashboard Cite

show abstract

“…Distributed verification [18] uses the computing resources of several machines connected by a network, thus allowing to scale up the capabilities of verification tools. In the same objective, methods exploiting heuristic search [19] have been proposed for improving constraint satisfaction problem and more generally for optimizing the exploration for the behaviour of a model to verify.…”

Section: Related Workmentioning

confidence: 99%

Improving Model Checking with Context Modelling

Dhaussy

Boniol

Roger

et al. 2012

Advances in Software Engineering

View full text Add to dashboard Cite

This paper deals with the problem of the usage of formal techniques, based on model checking, where models are large and formal verification techniques face the combinatorial explosion issue. The goal of the approach is to express and verify requirements relative to certain context situations. The idea is to unroll the context into several scenarios and successively compose each scenario with the system and verify the resulting composition. We propose to specify the context in which the behavior occurs using a language called CDL (Context Description Language), based on activity and message sequence diagrams. The properties to be verified are specified with textual patterns and attached to specific regions in the context. The central idea is to automatically split each identified context into a set of smaller subcontexts and to compose them with the model to be validated. For that, we have implemented a recursive splitting algorithm in our toolset OBP (Observer-based Prover). This paper shows how this combinatorial explosion could be reduced by specifying the environment of the system to be validated.

show abstract

“…However, as there are a few paths among each node pair in WFN, we need to combine the breadth-first searching algorithm and tabu search [29] to determine a few noninteraction routes for each node pair.…”

Section: Routes Calculationmentioning

confidence: 99%

Layout-Independent Wireless Facility Constructing and Scheduling for Data Center Networks

Wei¹,

Sun²

2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The control packets in the data center networks (DCNs) have to contest with the data packets although they are usually much shorter in size and much more important in network management. Moreover, the uneven distribution of the packets may create potential traffic hotspots in the DCN which could degrade network performance drastically. To bridge these gaps, a layout-independent constructing algorithm and a scheduling method are put forward towards layout-independent wireless facility in data centers. First of all, a conflict aware spanning tree algorithm is developed to construct the wireless facility network (WFN). Secondly, a scheduling method which contains three steps, route calculation, traffic estimation, and flow scheduling, is presented. In the route calculation step, a route set between each node pair is calculated in advance for later usage. The scheduler estimates the traffic loads on the links on a regular basis in the traffic estimation step. Then, arrived data and control flows are scheduled according to multiple policies based on given route sets and scheduling objectives in the flow scheduling step. Finally, a series of experiments have been conducted on NS3 based on two typical data center layouts. Experimental results in both scenarios have validated our proposal' effectiveness.

show abstract

Distributed Search

Cited by 13 publications

References 0 publications

Public transit schedule and route planner application for mobile devices

Public transit schedule and route planner application for mobile devices

Improving Model Checking with Context Modelling

Layout-Independent Wireless Facility Constructing and Scheduling for Data Center Networks

Contact Info

Product

Resources

About