305,239 Hits in 7.6 sec

The Higher-Order Aggregate Update Problem [chapter]

Christos Dimoulas, Mitchell Wand
2008 Lecture Notes in Computer Science  
We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem.  ...  Also, it can handle programs that contain a mix of functional and destructive updates. Correctness of all the analyses and of the transformation itself is proved.  ...  Shankar [9] proposed a method for safe destructive update in strongly-typed higher-order functional languages with eager order of evaluation.  ... 
doi:10.1007/978-3-540-93900-9_8 fatcat:iz37k5spwnauzn34pxdh4hvgge

Steps on the Road to Component Evolvability [chapter]

Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez, Gianluigi Zavattaro
2012 Lecture Notes in Computer Science  
Central to these novel primitives is a restricted form of higher-order communication of processes involved in update operations.  ...  Here we overview these previous works, and discuss the motivations and design decisions that led us from higher-order process calculi to calculi for component evolvability.  ...  The study in [3, 9] thus suggests that key to the decidability of verification problems for higher-order process calculi is the kind of contexts allowed in higher-order actions.  ... 
doi:10.1007/978-3-642-27269-1_19 fatcat:3zgdocpymfcfjowwayqahbtlji

Towards Training Billion Parameter Graph Neural Networks for Atomic Simulations [article]

Anuroop Sriram, Abhishek Das, Brandon M. Wood, Siddharth Goyal, C. Lawrence Zitnick
2022 arXiv   pre-print
However, the GNNs that have proven most effective for this task are memory intensive as they model higher-order interactions in the graphs such as those between triplets or quadruplets of atoms, making  ...  We empirically evaluate our method by scaling up the number of parameters of the recently proposed DimeNet++ and GemNet models by over an order of magnitude.  ...  Each EGN block starts by updating the highest order interactions, which are then aggregated before updating the next highest order interaction.  ... 
arXiv:2203.09697v1 fatcat:p3c7royaund2tj7ctz24tby45a

Dynamic Graph Collaborative Filtering [article]

Xiaohan Li, Mengqi Zhang, Shu Wu, Zheng Liu, Liang Wang, Philip S. Yu
2021 arXiv   pre-print
We propose three update mechanisms: zero-order 'inheritance', first-order 'propagation', and second-order 'aggregation', to represent the impact on a user or item when a new interaction occurs.  ...  Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.  ...  Firstly, higher-order information may lead to over-smoothing problem [19] , which makes the node embeddings prone to be similar.  ... 
arXiv:2101.02844v1 fatcat:y64e6b2tdbbjxgwd2scm4wxs4a

Signed Link Representation in Continuous-Time Dynamic Signed Networks [article]

Mohit Raghavendra, Kartik Sharma, Anand Kumar M, Srijan Kumar
2022 arXiv   pre-print
Our model learns a Signed link's Evolution using Memory modules and Balanced Aggregation (hence, the name SEMBA).  ...  On the arrival of a new edge, each interacting node aggregates this signed information with its memories while exploiting balance theory.  ...  Embedding generation Higher-order neighborhood aggregation of updated memories is used to update node embeddings after each batch.  ... 
arXiv:2207.03408v1 fatcat:2f5my4dozratvm7hvo6os5ou6m

Incremental View Maintenance with Triple Lock Factorization Benefits [article]

Milos Nikolic, Dan Olteanu
2018 arXiv   pre-print
F-IVM is a higher-order IVM algorithm that reduces the maintenance of the given task to the maintenance of a hierarchy of increasingly simpler views.  ...  We show in a range of scenarios that it can outperform classical first-order IVM, DBToaster's fully recursive higher-order IVM, and plain recomputation by orders of magnitude while using less memory.  ...  The authors also acknowledge awards from Microsoft Azure via The Alan Turing Institute and from Fondation Wiener Anspach. If You Liked It, Then You Should Put A Ring On It. -Beyoncé.  ... 
arXiv:1703.07484v2 fatcat:j23lsuzwfvczzil64stb74duem

A novel consensus model for multi-attribute large-scale group decision making based on comprehensive behavior classification and adaptive weight updating

Zijian Shi, Xueqing Wang, Iván Palomares, Sijia Guo, Ru-Xi Ding
2018 Knowledge-Based Systems  
Second, decision weights in the next iteration of the CRP are updated using a uninorm aggregation operator to reward or penalize the behaviors of clusters.  ...  aggregation operator is used for decision weight updating, laying either award or penalty on decision makers in accordance with their modification behavior.  In order to lay stricter behavior supervision  ...  Acknowledgements The authors would like to thank the editors and anonymous reviewers for their insightful comments and suggestions. Special thanks to Ayanami Rei for the mental support.  ... 
doi:10.1016/j.knosys.2018.06.002 fatcat:mxqhemwyqndlnpiymznnqfdjhu

CSDA: Rule-based complex sensor data aggregation system for M2M gateway

Yuichi Nakamura, Akira Moriguchi, Toshihiro Yamauchi
2015 2015 Eighth International Conference on Mobile Computing and Ubiquitous Networking (ICMU)  
The CSDA also supports update modules, which download and overwrite aggregation rules from the server when the modification of data aggregation logic is required.  ...  In addition, modifying aggregation logic requires firmware updates, which are risky.  ...  The second problem arises when changing the data aggregation logic on the firmware. To change data aggregation logic, the firmware has to be updated.  ... 
doi:10.1109/icmu.2015.7061051 dblp:conf/icmu/NakamuraMY15 fatcat:nd6a4gb7gzguxovgjxy3zbajeq

Speculative Approximations for Terascale Analytics [article]

Chengjie Qin, Florin Rusu
2015 arXiv   pre-print
We design concurrent online aggregation estimators and define halting conditions to accurately and timely stop the execution.  ...  Online aggregation is applied to identify sub-optimal configurations early in the processing by incrementally sampling the training dataset and estimating the objective function corresponding to each configuration  ...  The work in this paper is supported by a Hellman Faculty Fellowship and a gift from LogicBlox.  ... 
arXiv:1501.00255v1 fatcat:72rhwixsp5el7op543z4z263hm

Computing histograms of local variables for real-time monitoring using aggregation trees

Dan Jurca, Rolf Stadler
2009 2009 IFIP/IEEE International Symposium on Integrated Network Management  
On this overlay, the protocol maintains a spanning tree and updates the histogram of the network state variables through incremental aggregation.  ...  Our aim is to provide a management station with the value distribution of the local variables across the network, by means of partial histogram aggregation, with minimum protocol overhead.  ...  Aggregation Protocol Notations The aggregation protocol sends message updates from children processes to their parents in order to aggregate the histogram of the local values at each level in the tree  ... 
doi:10.1109/inm.2009.5188837 dblp:conf/im/JurcaS09 fatcat:hbvuf2llv5hdnjzus7bpxvoqwq

AFLPC: An Asynchronous Federated Learning Privacy-Preserving Computing Model Applied to 5G-V2X

Jie Huang, Cheng Xu, Zhaohua Ji, Shan Xiao, Teng Liu, Nan Ma, Qinghui Zhou, Muhammad Arif
2022 Security and Communication Networks  
A weight-based asynchronous federated learning aggregation update method is proposed to reasonably control the proportion of parameters submitted by users with different training speeds in the aggregation  ...  There are problems such as single point of failure, privacy leakage, and deviation of aggregation parameters.  ...  And in order to overcome the aggregation problem of asynchronous federated learning based on exponential moving average in actual use, the aggregation ratio is biased toward fast nodes, and the outdated  ... 
doi:10.1155/2022/9334943 fatcat:nqw4mo5tifgmrfpguosr3f6rea

Strategic updating of threshold response in an agent-based market model [article]

Francois Ghoulmie
2004 arXiv   pre-print
This paper has been withdrawn by the author: it was a too preliminary version  ...  This problem deals with many agents interacting through an aggregate variable, the bar attendance. In the language of statistical physics, it is a mean field type problem.  ...  In the present work, we introduce a strategic updating scheme making a link between El Farol bar problem and financial markets.  ... 
arXiv:cond-mat/0406711v4 fatcat:mimmialj5vg7rhpczyj3ru6lqy

A two-stage market model for microgrid power transactions via aggregators

Hongseok Kim, Marina Thottan
2011 Bell Labs technical journal  
However, if the cost function of microgrids has a higher order term, aggregators may accumulate a large profit, which potentially raises the issue of the regulator's role in the market. © 2011 Alcatel-Lucent  ...  Thus, aggregators collect power from microgrids and resell it to the utility. From the microgrids' perspective, aggregators are buyers. From the utility's perspective, aggregators are sellers.  ...  Acknowledgements This work has been conducted under a joint research program between Alcatel-Lucent Bell Labs, Murray Hill, New Jersey and the Gachon Energy Research Institute (GERI), with support from  ... 
doi:10.1002/bltj.20524 fatcat:atad3j7mp5fxpjvzq7tccqyacu

Page 131 of Geographical Analysis Vol. 17, Issue 2 [page]

1985 Geographical Analysis  
Higher-order factor analysis appears to be the ideal tool for linking the concepts of industrial complexes and input-output aggregation.  ...  Higher-order factor analysis is then described followed by an application of the approach to data from Washington state.  ... 

Monitoring the Top-m Aggregation in a Sliding Window of Spatial Queries [article]

Farhana M. Choudhury, Zhifeng Bao, J. Shane Culpepper, Timos Sellis
2016 arXiv   pre-print
of objects to update in the top-m results.  ...  In order to solve this problem, we show how to upper and lower bound the rank of an object for any unseen query.  ...  Informally, rank aggregation is the problem of combining two or more rank orderings to produce a single "best" ordering.  ... 
arXiv:1610.03579v2 fatcat:gjypdixutnek7ofxtqrrc22m5y
« Previous Showing results 1 — 15 out of 305,239 results