Results 81 to 90 of about 97,608 (330)

Some Challenges of Specifying Concurrent Program Components

, 2018
The purpose of this paper is to address some of the challenges of formally specifying components of shared-memory concurrent programs. The focus is to provide an abstract specification of a component that is suitable for use both by clients of the ...
Hayes, Ian J.
core   +1 more source

Beyond Truth‐Telling: A Replication Study on School Choice

Journal of Applied Econometrics, EarlyView.
ABSTRACT In a recent paper, Fack et al. (2019, American Economic Review) convincingly argue and theoretically demonstrate that there may be strong incentives for students to play non‐truth‐telling strategies when reporting preferences over schools, even when the celebrated deferred acceptance algorithm is employed.
Tommy Andersson, Dany Kessel, Nils Lager, Elisabet Olme, Simon Reese   +4 more
wiley   +1 more source

Scaling Emerging Healthcare Technology: Managing Paradoxical Tensions in A Connected Health Platform

Journal of Operations Management, EarlyView.
ABSTRACT To address growing geographical disparities in healthcare access and quality, connected health platforms (CHPs) have emerged as promising solutions. However, rapidly scaling CHPs poses significant challenges, particularly in managing tensions among multiple entities.
Yichuan Wang, Minhao Zhang, Jens K. Roehrich, Rui Ma, Yunkai Zhai   +4 more
wiley   +1 more source

Crafting a Real-Time Information Aggregator for Mobile Messaging

Journal of Computer Systems, Networks, and Communications, 2010
Mobile messaging is evolving beyond SMS (Short Message Service) text messaging with the introduction of MMS (Multimedia Messaging Service). In the past, such a scheme is used for peer-to-peer communication.
Jenq-Shiou Leu
doaj   +1 more source

An Infrastructure for the Dynamic Distribution of Web Applications and Services [PDF]

, 2000
This paper presents the design and implementation of an infrastructure that enables any Web application, regardless of its current state, to be stopped and uninstalled from a particular server, transferred to a new server, then installed, loaded, and ...
Bestavros, Azer, Duvos, Enrique
core   +1 more source

No App, No Entry: Conceptualizing Digital Technology Captivity in Service Access

Psychology &Marketing, EarlyView.
ABSTRACT We introduce Digital Technology Captivity (DTC), a form of consumer vulnerability that arises when digital technologies become the mandatory gateway to essential services. When access is tied to systems that feel unfamiliar, complex, or intimidating—and when preferred alternatives are limited—consumers may experience heightened vulnerability ...
Carolyn Wilson‐Nash, Rob Angell, Yuanming Qiu, Ismini Pavlopoulou, Dimitrios Kolyperas   +4 more
wiley   +1 more source

Efficiency comparison of message brokers

Journal of Computer Sciences Institute
The aim of the article is to compare three main brokers used in the development of web applications: RabbitMQ, Apache Kafka and Apache Pulsar. To conduct the research, a custom application was created to compare two key metrics in the context of message
Sebastian Dyjach, Małgorzata Plechawska-Wójcik   +1 more
doaj   +1 more source

TopoMAS: Large Language Model Driven Topological Materials Multi‐Agent System

Materials Genome Engineering Advances, EarlyView.
TopoMAS is an interactive multi‐agent framework that revolutionizes topological materials discovery through human–AI collaborative intelligence. The system integrates natural language processing, knowledge retrieval from literature and databases, crystal structure generation, and automated first‐principles calculations within a unified workflow.
Baohua Zhang, Xin Li, Huangchao Xu, Zhong Jin, Quansheng Wu, Ce Li   +5 more
wiley   +1 more source

An Exact Method for Reliable Shortest Path Problems With Correlation

Networks, EarlyView.
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva, Santiago Morales, Daniel Yamín, Andrés L. Medaglia   +3 more
wiley   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

Networks, EarlyView.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz, Ernestine Großmann, Christian Schulz   +2 more
wiley   +1 more source