Learn More
In this work, we present three classes of methods to extract information from triangulated mobile phone signals, and describe applications with different goals in spatiotemporal analysis and urban modeling. Our first challenge is to relate extracted information from phone records (i.e., a set of time-stamped coordinates estimated from signal strengths) with(More)
The estimation of commuting flows at different spatial scales is a fundamental problem for different areas of study. Many current methods rely on parameters requiring calibration from empirical trip volumes. Their values are often not generalizable to cases without calibration data. To solve this problem we develop a statistical expression to calculate(More)
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. We propose a multiagent-based reinforcement learning algorithm, in which the interactions between travelers and the environment are considered to simulate temporal-spatial characteristics of activity-travel patterns in a city. Road(More)
We consider the impact of end-user decision-making on pricing of wireless resources when there is uncertainty in the Quality of Service (QoS) guarantees offered by the Service Provider (SP). Specifically, we consider a scenario where an SP tries to sell wireless broadband services to a potential customer when the advertised transmission rate cannot be fully(More)
Advances in cognitive radio networks have primarily focused on the design of spectrally agile radios and novel spectrum sharing techniques that are founded on expected utility theory (EUT). In this paper, we consider the development of novel spectrum sharing algorithms in such networks taking into account human psychological behavior of the end-users, which(More)
—Coordinated scheduling/beamforming (CS/CB) substantially mitigates the intercell interference (ICI), hence increasing the cell-edge throughput on the downlink (DL) of coordinated multipoint (CoMP) systems. To maximize the DL throughput, the cooperating base stations (BSs) jointly select the best set of users for DL scheduling and then jointly design a set(More)
This paper addresses the problem of neighborhood selection for Gaussian graphi-cal models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both algorithms are shown to be structurally(More)
AIM The aim of this study was to investigate the relationship between the expression of neutral endopeptidase (NEP) and dipeptidyl peptidase IV (DPP IV) proteins, and the clinical significance of the two proteins in patients with intrahepatic cholangiocarcinomas (IHCC). METHODS Expression patterns and subcellular localizations of NEP and DPP IV proteins(More)