Loading...
Search for: network-users
0.006 seconds

    A large-scale temporal analysis of user lifespan durability on the reddit social media platform

    , Article 31st ACM Web Conference, WWW 2022, 25 April 2022 ; 2022 , Pages 677-685 ; 9781450391306 (ISBN) Nadiri, A ; Takes, F. W ; ACM SIGWEB ; Sharif University of Technology
    Association for Computing Machinery, Inc  2022
    Abstract
    Social media platforms thrive upon the intertwined combination of user-created content and social interaction between these users. In this paper, we aim to understand what early user activity patterns fuel an ultimately durable user lifespan. We do so by analyzing what behavior causes potentially durable contributors to abandon their "social career"at an early stage, despite a strong start. We use a uniquely processed temporal dataset of over 6 billion Reddit user interactions on covering over 14 years, which we make available together with this paper. The temporal data allows us to assess both user content creation activity and the way in which this content is perceived. We do so in three... 

    Rate regions of secret key sharing in a new source model

    , Article IET Communications ; Volume 5, Issue 4 , March , 2011 , Pages 443-455 ; 17518628 (ISSN) Salimi, S ; Salmasizadeh, M ; Aref, M. R ; Sharif University of Technology
    2011
    Abstract
    A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, while at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information... 

    Artificial neural networks to predict 3D spinal posture in reaching and lifting activities; Applications in biomechanical models

    , Article Journal of Biomechanics ; Volume 49, Issue 13 , Volume 49, Issue 13 , 2016 , Pages 2946-2952 ; 00219290 (ISSN) Gholipour, A ; Arjmand, N ; Sharif University of Technology
    Elsevier Ltd 
    Abstract
    Spinal posture is a crucial input in biomechanical models and an essential factor in ergonomics investigations to evaluate risk of low back injury. In vivo measurement of spinal posture through the common motion capture techniques is limited to equipped laboratories and thus impractical for workplace applications. Posture prediction models are therefore considered indispensable tools. This study aims to investigate the capability of artificial neural networks (ANNs) in predicting the three-dimensional posture of the spine (S1, T12 and T1 orientations) in various activities. Two ANNs were trained and tested using measurements from spinal postures of 40 male subjects by an inertial tracking... 

    Reliability-based network flow estimation with day-to-day variation: A model validation on real large-scale urban networks

    , Article Journal of Intelligent Transportation Systems: Technology, Planning, and Operations ; 2017 , Pages 1-23 ; 15472450 (ISSN) Torkjazi, M ; Sadat Mirjafari, P ; Poorzahedy, H ; Sharif University of Technology
    Abstract
    Day-to-day variation in the travel times of congested urban transportation networks is a frustrating phenomenon to the users of these networks. These users look pessimistically at the path travel times, and learn to spend additional time to safeguard against serious penalties that await late arrivals at the destinations. These additional expenses are charges similar to the tolls in system equilibrium flow problem, but may not be collected. With this conjecture, the user equilibrium (UE) formulation of congested network flow problem would lack some necessary factors in addressing appropriate path choices. This study, following a previous work proposing pessimistic UE (PUE) flow, aims to show... 

    Inbound e-marketing using neural network based visual and phonetic user experience analytics

    , Article 2018 4th International Conference on Web Research, ICWR 2018 ; 15 June , 2018 , Pages 12-18 ; 9781538653647 (ISBN) Nedaei, D ; Khanzadi, P ; Majidi, B ; Movaghar, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    Inbound marketing is the process of attracting the probable customers to a business before they have any intention to become customers. An effective method for inbound marketing is creation of a positive psychological business environment to attract the customers. A significant portion of traditional business environment is moving online and the new business environment is the company website. One of the major elements in online inbound marketing is the website address and the website logo, which are the first factors of brand personality that the visitor to the company website encounters when looking up the website in a search engine. In this paper, a framework for inbound e-marketing using... 

    Design of a reliable hub-and-spoke network using an interactive fuzzy goal programming

    , Article IEEE International Conference on Fuzzy Systems, 27 June 2011 through 30 June 2011, Taipei ; 2011 , Pages 2955-2959 ; 10987584 (ISSN) ; 9781424473175 (ISBN) Zarandi, M. H. F ; Davari, S ; Sisakht, A. H ; Sharif University of Technology
    2011
    Abstract
    A Hub Location Problem (HLP) deals with finding the locations of hub facilities and assignment of demand nodes to established facilities. Hubs play a central role in many networks such as telecommunication networks and their unavailability may lead to network breakdown or poor service levels. An objective in design of a hub-and-spoke network is maximization of reliability to transfer flows. This paper puts forward design of a reliable single-allocation hub-and-spoke network using an interactive fuzzy goal programming. To model and solve the problem, a fuzzy goal programming approach was developed for design of network in an interactive manner between decision maker and the model. To validate... 

    A shortest path problem in an urban transportation network based on driver perceived travel time

    , Article Scientia Iranica ; Volume 17, Issue 4 A , August , 2010 , Pages 285-296 ; 10263098 (ISSN) Ramazani, H ; Shafahi, Y ; Seyedabrishami, S. E ; Sharif University of Technology
    2010
    Abstract
    This paper proposes a method to solve shortest path problems in route choice processes when each link's travel time is a fuzzy number, called the Perceived Travel Time (PTT). The PTT is a subjective travel time perceived by a driver. The algorithm solves the fuzzy shortest path problem (FSPA) for drivers in the presence of uncertainty regarding route travel time. For congested networks, the method is able to find the shortest path in terms of perceived travel time and degree of saturation (congestion) along routes at the same time. The FSPA can be used to support the fuzzification of traffic assignment algorithms. The applicability of the resulting FSPA for the traffic assignment was tested... 

    Secret key sharing in a new source model: Rate regions

    , Article 2010 Australian Communications Theory Workshop, AusCTW 2010, Canberra, ACT, 3 February 2010 through 5 February 2010 ; 2010 , Pages 117-122 ; 9781424454334 (ISBN) Salimi, S ; Salmasizadeh, M ; Aref, M. R ; ANU - The Australian National University; ACoRN - ARC Communications Research Network; NICTA; UniSA; CSIRO ; Sharif University of Technology
    2010
    Abstract
    A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via public channels where three users can observe i.i.d outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (forward key strategy) and from user 3 to users 1 and 2 (backward key strategy). This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In... 

    Reliability-based network flow estimation with day-to-day variation: a model validation on real large-scale urban networks

    , Article Journal of Intelligent Transportation Systems: Technology, Planning, and Operations ; Volume 22, Issue 2 , 2018 , Pages 121-143 ; 15472450 (ISSN) Torkjazi, M ; Mirjafari, P. S ; Poorzahedy, H ; Sharif University of Technology
    Taylor and Francis Inc  2018
    Abstract
    Day-to-day variation in the travel times of congested urban transportation networks is a frustrating phenomenon to the users of these networks. These users look pessimistically at the path travel times, and learn to spend additional time to safeguard against serious penalties that await late arrivals at the destinations. These additional expenses are charges similar to the tolls in system equilibrium flow problem, but may not be collected. With this conjecture, the user equilibrium (UE) formulation of congested network flow problem would lack some necessary factors in addressing appropriate path choices. This study, following a previous work proposing pessimistic UE (PUE) flow, aims to show... 

    Optimal placement of access points in cellular visible light communication networks: an adaptive gradient projection method

    , Article IEEE Transactions on Wireless Communications ; Volume 19, Issue 10 , 2020 , Pages 6813-6825 Dastgheib, M. A ; Beyranvand, H ; Salehi, J. A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2020
    Abstract
    In this paper, a new approach toward the optimization of Access Point (AP) placement in cellular Visible light Communication (VLC) networks is proposed based on the projected gradient algorithm. The objective of the optimal placement problem is to maximize the average throughput of the network subject to constraints on the minimum illumination level and the minimum rate of the users. This optimization framework gives the enhanced AP deployment in case of users with static, nomadic, or completely mobile behavior. Taking the distribution of users, the receiver's field of view, reflection from walls and interference from neighboring APs into account makes the deployment problem complicated. To... 

    A distributed interest management scheme for massively multi-user virtual environments

    , Article 2008 IEEE International Conference on Virtual Environments, Human-Computer Interfaces, and Measurement Systems, IEEE VECIMS 2008, Istanbul, 14 July 2008 through 16 July 2008 ; 2008 , Pages 111-115 ; 9781424419289 (ISBN) Hariri, B ; Shirmohammadi, S ; Pakravan, M. R ; Sharif University of Technology
    2008
    Abstract
    Massively multi user virtual environment (MMVE) applications must deal with the challenge of update message exchange among a large set of nodes distributed over the Internet. Therefore design of scalable network protocols is a major concern in such large scale distributed architectures. Several approaches have been proposed to aid update exchange in MMVEs. Message localization has always been a key point in the design of such distributed network protocols. Area of Interest Management (AoIM) mainly deals with the issues related to the update message localization with respect to the user's interest. As the number of users in the virtual environment increases, update message localization... 

    Encrypted internet traffic classification using a supervised spiking neural network

    , Article Neurocomputing ; Volume 503 , 2022 , Pages 272-282 ; 09252312 (ISSN) Rasteh, A ; Delpech, F ; Aguilar Melchor, C ; Zimmer, R ; Shouraki, S. B ; Masquelier, T ; Sharif University of Technology
    Elsevier B.V  2022
    Abstract
    Internet traffic recognition is essential for access providers since it helps them define adapted priorities in order to enhance user experience, e.g., a high priority for an audio conference and a low priority for a file transfer. As internet traffic becomes increasingly encrypted, the main classic traffic recognition technique, payload inspection, is rendered ineffective. Hence this paper uses machine learning techniques looking only at packet size and time of arrival. For the first time, Spiking neural networks (SNNs), which are inspired by biological neurons, were used for this task for two reasons. Firstly, they can recognize time-related data packet features. Secondly, they can be... 

    ChOracle: A unified statistical framework for churn prediction

    , Article IEEE Transactions on Knowledge and Data Engineering ; Volume 34, Issue 4 , 2022 , Pages 1656-1666 ; 10414347 (ISSN) Khodadadi, A ; Hosseini, S. A ; Pajouheshgar, E ; Mansouri, F ; Rabiee, H. R ; Sharif University of Technology
    IEEE Computer Society  2022
    Abstract
    User churn is an important issue in online services that threatens the health and profitability of services. Most of the previous works on churn prediction convert the problem into a binary classification task where the users are labeled as churned and non-churned. More recently, some works have tried to convert the user churn prediction problem into the prediction of user return time. In this approach which is more realistic in real world online services, at each time-step the model predicts the user return time instead of predicting a churn label. However, the previous works in this category suffer from lack of generality and require high computational complexity. In this paper, we...