Filters








36 Hits in 6.7 sec

Latency Constrained Aggregation in Chain Networks Admits a PTAS [chapter]

Tim Nonner, Alexander Souza
2009 Lecture Notes in Computer Science  
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a given time interval, called  ...  This is in particular interesting, since we prove that this problem becomes APX-hard if we consider tree networks instead of chain networks, even for the case of unit length due intervals.  ...  In this paper, we mostly consider networks where the underlying tree structure is a chain, called chain networks.  ... 
doi:10.1007/978-3-642-02158-9_24 fatcat:tktvvfkjbncwvitfznl6xrhi3q

Light-weight trust-enhanced on-demand multi-path routing in mobile ad hoc networks

Hui Xia, Jia Yu, Cheng-liang Tian, Zhen-kuan Pan, Edwin Sha
2016 Journal of Network and Computer Applications  
We make a detailed analysis of our model in Section 6. As an extension of our trust model, we propose an improved SCGM(1,1)-Markov chain prediction method in Section 7.  ...  Mobile ad hoc networks (MANETs) are originally designed for a cooperative environment, which are vulnerable to a wide variety of attacks due to their intrinsic characteristics.  ...  For the purpose of minimizing the overhead in a resource-constrained environment as that of a MANET, we have used only passive monitoring to evaluate the behaviors of a node.  ... 
doi:10.1016/j.jnca.2015.12.005 fatcat:3yscbgwnfnhkvhlt5cn4xxhlde

A survey of pipelined workflow scheduling

Anne Benoit, Ümit V. Çatalyürek, Yves Robert, Erik Saule
2013 ACM Computing Surveys  
A large class of applications need to execute the same workflow on different data sets of identical size.  ...  The scheduling problem that encompasses all of these techniques is called pipelined workflow scheduling, and it has been widely studied in the last decade.  ...  This work was supported in parts by the DOE grant DE-FC02-06ER2775; by AFRL/DAGSI Ohio Student-Faculty Research Fellowship RY6-OSU-08-3; by the NSF grants CNS-0643969, OCI-0904809, and OCI-0904802, and  ... 
doi:10.1145/2501654.2501664 fatcat:avzu434g2zbptm532lii42bqx4

Memory-processor co-scheduling in fixed priority systems

Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Giorgio Buttazzo
2015 Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15  
A major obstacle towards the adoption of multi-core platforms for real-time systems is given by the di culties in characterizing the interference due to memory contention.  ...  In this paper, we take a further step towards the design of smart co-scheduling algorithms for sporadic real-time tasks complying with the M/C (memory-computation) model.  ...  Recently, a PTAS has also been proposed in [35] . SYSTEM MODEL We consider a set T of n periodic and sporadic real-time tasks ⌧1, . . . , ⌧n.  ... 
doi:10.1145/2834848.2834854 dblp:conf/rtns/MelaniBBMB15 fatcat:o4zaeyclebc3npdpu5u2y3a2ey

Networked Slepian-Wolf: Theory and Algorithms [chapter]

Răzvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli
2004 Lecture Notes in Computer Science  
The minimization of cost functions which are the product of a function of the rate and a function of the path weight is considered, for both the data-gathering scenario, which is relevant in sensor networks  ...  Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources.  ...  If the weights of the graph are the Euclidean distances ( for all ), then the problem becomes the Euclidean Steiner tree problem, and it admits a polynomial time approximation scheme (PTAS) [3] (that  ... 
doi:10.1007/978-3-540-24606-0_4 fatcat:vzdb4k3oczhrxilsoaxq6ti5z4

Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws

R. Cristescu, B. Beferull-Lozano, M. Vetterli
2005 IEEE Transactions on Information Theory  
The minimization of cost functions which are the product of a function of the rate and a function of the path weight is considered, for both the data-gathering scenario, which is relevant in sensor networks  ...  Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources.  ...  If the weights of the graph are the Euclidean distances ( for all ), then the problem becomes the Euclidean Steiner tree problem, and it admits a polynomial time approximation scheme (PTAS) [3] (that  ... 
doi:10.1109/tit.2005.858980 fatcat:uwsrgpnyu5fqdmqduqcsctepz4

Portuguese SKA White Book [article]

Domingos Barbosa, Sonia Antón, João Paulo Barraca, Miguel Bergano, Alexandre C. M. Correia, Dalmiro Maia, Valério A. R. M. Ribeiro
2020 arXiv   pre-print
The meeting was very successful in providing a detailed overview of the SKA status, vision and goals and describes most of the Portuguese contributions to science, technology and the related industry aspirations  ...  ACKNOWLEDGMENTS ACKNOWLEDGMENTS We warmly thank Francisco Colomer (JIVE -Joint Institute for VLBI in Europe ERIC) and Leonid Gurvitz (JIVE and Astrodynamics and Space Missions, TU Delft) for the long  ...  ACKNOWLEDGMENTS We warmly thank Francisco Colomer (JIVE -Joint Institute for VLBI in Europe ERIC) and Leonid Gurvitz (JIVE and Astrodynamics and Space Missions, TU Delft) for the full and comprehensive  ... 
arXiv:2005.01140v1 fatcat:gijmylrmvfcj3i7dt3wbsr6vhm

Public-Key Infrastructure [chapter]

2013 Wireless Mobile Internet Security  
Nevertheless, constructing effective, practical, secure and low cost means for assuring authenticity and validity of public keys used in large-scale networked services remains both a technological and  ...  In response to the EuroPKI 2008 call for papers, a total of 37 paper proposals were received.  ...  This work was in part funded by Landesstiftung Baden-Württemberg in the scope of the Spontaneous Virtual Networks (SpoVNet) project. Acknowledgments.  ... 
doi:10.1002/9781118512920.ch7 fatcat:hocfzfhi4rbuhmssop2hkwbc64

Minimum color‐degree perfect b ‐matchings

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs
2020 Networks  
then possibly someone will ask a question just to fill in the horrible silence, and then other questions may follow.  ...  If no-one asks, you can start off the debate by asking a session yourself. In any case, keep all slots to exactly 30 minutes (parallel sessions regime).  ...  The benchmark we consider consists in the standard MultiStart (MS) Algorithm, in which a starting point is randomly generated and a local algorithm, i.e., a procedure producing solutions with local optimal  ... 
doi:10.1002/net.21974 fatcat:4qgtutmxrrcy7anvxks4fivcii

Applying Common Identity and Bond Theory to Design of Online Communities

Yuqing Ren, Robert Kraut, Sara Kiesler
2007 Organization Studies  
Common identity theory makes predictions about the causes and consequences of people's attachment to the group as a whole.  ...  We then show how design decisions, such as those focused on recruiting newcomers versus retaining existing members, constraining or promoting off-topic discussion, and limiting group size or allowing uncontrolled  ...  The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the National Science Foundation  ... 
doi:10.1177/0170840607076007 fatcat:mvjyan7lzvcarfk55d3vfxnx2y

ACRT-SCTS Scholar Abstracts

2010 Clinical and Translational Science  
Males (OR 10.6) and females (OR 2.7) <1yr were more likely to be admitted than males and females 1-<2yrs.  ...  These alleles were associated with a 40-90% increase in the risk of bacterial vaginosis.  ...  For TASC II A (short) lesions angioplasty with stenting (PTA/S) has shown to be effective. For TASC II D (long occlusion) open bypass (OB) is superior to PTA/S in patency and long term outcome.  ... 
doi:10.1111/j.1752-8062.2010.00181_2.x fatcat:lwvd6nteozgezazejeqpjupawu

Technical report for Collaborative Research Center SFB 876 - Graduate School

Katharina Morik, Wolfgang Rhode, Technische Universität Dortmund, Technische Universität Dortmund
2018
In contrast, aggregation queries produce an aggregate result for a particular feature of data.  ...  Among these, the use of priced timed automata (PTA) models for resource models is a wide-spread approach [1, 3] .  ...  Introduction Streaming algorithms aim at solving problems in a setting where the input is given as a stream of items like numerical values, points in Euclidean space or edges of a graph and moreover it  ... 
doi:10.17877/de290r-19168 fatcat:ghcmm7bvbfhmzkdv5id3j63r5e

Three-dimensional point-cloud room model in room acoustics simulations

Milos Markovic, So/ren K. Olesen, Dorte Hammersho/i
2013 Journal of the Acoustical Society of America  
in the whole nerve depends on the number of aggregated spike trains.  ...  A numerical model of this complete chain is useful to understand and control the various parameters involved in this process.  ...  This paper offers a comparison of both systematic and random walk exploration for generating samples within a constrained prior.  ... 
doi:10.1121/1.4806371 fatcat:ln4w6j7cjvchrckf2gzfmeiwoi

FUNDAMENTAL AUTARCHICAL SCREENING AND MICROBES EXERTION OF GERMANE SYLVESTRE

Johns H., Department of Plant and Agricultural Sciences The University of Bristol University in Bristol, England UK
2021 SCIENCE AND MODERN SOCIETY: CURRENT ISSUES, ACHIEVEMENTS AND INNOVATIONS   unpublished
The autarchical investigation completed uncovered the presence of alkaloids, phenolic compounds, flavonoids, glycosides, tannins and tri terpenoids in this restorative plant.  ...  The MIC estimations of the plant extricates were resolved against the chose test life forms utilizing the techniques as depicted by National Committee for Chemical Laboratory Standard and the in vitro  ...  Note: A -amplitude, SPI -speed of impulse conduction along motor fibers, DLdistal latency, F L -latency of the F-wave, CB -conduction block, TSP -total sensitive potential, N -norm,% patol. res. -% of  ... 
doi:10.37547/iscrc-intconf04-01 fatcat:gng45nbmgndpzhv3rhnmggwemi

S: Haemodialysis (technique, adequacy, outcome, complications)

1999 Nephrology, Dialysis and Transplantation  
Useful AVF artery flow 300 mL/ min was achieved in group A and group C after one week, in group B between 3 and 8 weeks, and in group D between 8 and 12 weeks. Conclusions.  ...  Patency rate after surgery in group of pts with AID > 0.16 cm was 93% (85/91) (group A), and in group with AID £ 0.16 cm 32% (8/25)(p<.01) (group B).  ...  Percutaneous procedures consisting of angioplasty (PTA) or PTA plus stent deployment when the PTA were insufficient.  ... 
doi:10.1093/ndt/14.9.a162 fatcat:mnxfmqvqzvhyho2itxkkhwjzke
« Previous Showing results 1 — 15 out of 36 results