نتایج جستجو برای: transfer station

تعداد نتایج: 335687  

2007
Sana Belmokhtar Alexandre Dolgui Xavier Delorme Ivan Ignatenko S. Belmokhtar A. Dolgui X. Delorme I. Ignatenko

A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints and cycle upper limit are respected and the line cost is minimal. The investigated lines have a mixed activation mode for the machining units of each station, i.e. the units of e...

2016
Shilpa Thakur Senthil Kumar S. Velmurugan

Wireless sensor networks are used in many domains. The main element of the WSN are the sensor nodes, the main purpose of sensor node is to collect information from the network after collecting this information it transfer to base station for further processing the main problem in WSN is the life time of network due to which the performance of WSN decreases. For increasing the working lifetime o...

1999
J. D. Bakker R. Prasad

A Virtual Cellular Network (VCN) [1] is a wireless cellular network wherein a single Mobile Station (MS) can be in simultaneous communication with more than one Base Station (BS). This paper presents the implementation of a handover protocol for a virtual cellular network. The proposed handover protocol is used in combination with a link protocol [2] and a multiple-access protocol [3]. The desi...

Journal: :IJCNS 2008
Hui Wang Kezhong Lu Xiaohui Lin

In wireless sensor networks, sensor nodes collect local data and transfer to the base station often relayed by other nodes. If deploying sensor nodes evenly, sensor nodes nearer to the base station will consume more energy and use up their energy faster that reduces system lifetime. By analyzing energy consumption, a density formula of deploying nodes is proposed. The ratio of whole energy of s...

2014
Hannah Bast Sabine Storandt

Public-transportation route-planning systems typically work as follows. The user specifies a source and a target location, as well as a departure time. The system then returns one or more optimal trips at or after that departure time. In this paper, we consider guidebook routing, where the goal is to provide timeindependent answers that are valid over long periods of time. An example answer cou...

Journal: :MONET 2006
Jaesheung Shin Kyounghwan Lee Aylin Yener Thomas F. La Porta

There has been much recent attention on using wireless relay networks to forward data from mobile nodes to a base station. This network architecture is motivated by performance improvements obtained by leveraging the highest quality links to a base station for data transfer. With the advent of agile radios it is possible to improve the performance of relay networks through intelligent frequency...

Journal: :Antarctic Science 2022

Abstract We report the first formal record of Indian meal moth Plodia interpunctella from a location within Antarctic Treaty area, with capture live adult male Brazilian Comandante Ferraz research station on King George Island, South Shetland Islands. This species is well-known pest stored products and widely recorded in synanthropic situations such as food stores globally. No other adults or i...

Journal: :Indonesian Journal of Electrical Engineering and Computer Science 2023

Air quality is a matter of concern these days due to its adverse effect on human health. Multiple new air pollution monitoring and prediction stations are being developed in smart cities tackle the issue. Recent advanced deep learning techniques show excellent performance for predictions but need sufficient training data model performance. The insufficiency issue at station can be resolved usin...

2011
Robert Geisberger

Many interesting route planning problems can be solved by computing shortest paths in a suitably modeled, weighted graph representing a transportation network. Such networks are naturally road networks or timetable networks of public transportation. For large networks, the classical Dijkstra algorithm to compute shortest paths is too slow. And therefore have faster algorithms been developed in ...

2011
Thorsten Mehrtens Stephanie Bley Mansoor Ali Khan D J Larson W Lefebvre

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید