Now showing items 1207-1226 of 1650

    • Rails Girls 54: Making Rails Girls Even More Fun 

      Abrahamsson P; Helmer S; Stan A (University of Lübeck, 2016)
      Rails Girls, which originated in Finland, is a workshop for young women and girls to learn web application development from scratch using Ruby on Rails, i.e., no prior knowledge in programming is required. Here, we want ...
    • Ranking of evolving stories through meta-aggregation 

      Gordevicius, J; Estrada, F; Lee, HC; Andritsos, P; Gamper, J (ACM, 2010)
      In this paper we focus on the problem of ranking news stories within their historical context by exploiting their content similarity. We observe that news stories evolve and thus have to be ranked in a time and query ...
    • Rate of convergence for a Galerkin scheme approximating a two-scale reaction-diffusion system with nonlinear transmission condition 

      Muntean A; Lakkis O (RIMS, 2010)
      We study a two-scale reaction-diffusion system with nonlinear reaction terms and a nonlinear transmission condition (remotely ressembling Henry's law) posed at air-liquid interfaces. We prove the rate of convergence of the ...
    • Rating Elicitation Strategies for Collaborative Filtering 

      Elahi M; Repsys V; Ricci F (Springer, 2011)
      The accuracy of collaborative filtering recommender systems largely depends on two factors: the quality of the recommendation algorithm and the nature of the available item ratings. In general, the more ratings are elicited ...
    • Reactive event calculus for monitoring global computing applications 

      Bragaglia S; Chesani F; Mello P; Montali M; Torroni P (Springer, 2012)
      In 1986 Kowalski and Sergot proposed a logic-based formalism named Event Calculus (EC), for specifying in a declarative manner how the happening of events affects some representation (the state) of the world. Since its ...
    • A Real-Time Error Resilient Video Streaming Scheme Exploiting the Late- and Early-Arrival Packets 

      Xiao JM; Tillo T; Lin CY; Zhang YG; Zhao Y (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2013)
      For real-time video streaming systems, the video packets arriving after the display deadline of their frames are considered as late-arrival packets, and typically they are discarded. This will affect the current frame and ...
    • Real-time forward error correction for video transmission 

      Xiao J; Tillo T; Lin C; Zhao Y (IEEE, 2011)
      When the video streams are transmitted over the unreliable networks, forward error correction (FEC) codes are usually used to protect them. Reed-Solomon codes are block-based FEC codes. On one hand, enlarging the block ...
    • Real-time macroblock level bits allocation for depth maps in 3-D video coding 

      Xiao J; Tillo T; Yuan H (Springer, 2012)
      In the texture-plus-depth 3-D video format, the texture videos and depth maps will affect the quality of the synthesized views, this makes bits allocation for the depth maps indispensable. The existing bits allocation ...
    • Real-time video streaming exploiting the late-arrival packets 

      Xiao J; Tillo T; Lin C; Zhao Y (IEEE, 2012)
      For real-time video applications, such as video telephony service, the allowed maximum end-to-end transmission delay is usually fixed. The packets arriving at the destination out of the maximum end-to-end delay are treated ...
    • Real-Time Video Streaming Using Randomized Expanding Reed-Solomon Code 

      Xiao JM; Tillo T; Zhao Y (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2013)
      Forward error correction (FEC) codes are widely studied to protect streamed video over unreliable networks. Typically, enlarging the FEC coding block size can improve the error correction performance. For video streaming ...
    • Reasoning about choice 

      Van Der Hoek W; Troquard N; Wooldridge M (Springer, 2013)
      We present a logic for reasoning about choice. Choice CTL (C-CTL) extends the well-known branching-time temporal logic ctl with choice modalities, "◇" and "□". An example C-CTL formula is ◇ AF happy, asserting that there ...
    • Reasoning about Explanations for Negative Query Answers in DL-Lite 

      Calvanese D; Ortiz M; Simkus M; Stefanoni G (2013)
      In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for Description Logics, where research has focused on the explanation of both ...
    • Reasoning about Relation Based Access Control 

      Artale, A; Crispo, B; Giunchiglia, F; Turkmen, F; Zhang, R (IEEE Computer Society, 2010)
      Relation Based Access Control (RelBAC) is an access control model that places permissions as first class concepts. Under this model, we discuss in this paper how to formalize typical access control policies with Description ...
    • Reasoning in Event-Based Distributed Systems 

      Helmer S; Poulovassilis A; Xhafa F (Springer, 2011)
      With the rapid expansion of the Internet over the last 20 years, event-based distributed systems are playing an increasingly important role in a broad range of application domains, including enterprise management, environmental ...
    • Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics 

      Borgwardt, S; Penaloza, R (Springer, 2015)
      Fuzzy Description Logics (FDLs) combine classical Description Logics with the semantics of Fuzzy Logics in order to represent and reason with vague knowledge. Most FDLs using truth values from the interval [0,1] have been ...
    • Reasoning in Expressive Gödel Description Logics 

      Borgwardt S; Peñaloza R (CEUR, 2016)
      Fuzzy description logics (FDLs) are knowledge representation formalisms capable of dealing with imprecise knowledge by allowing intermediate membership degrees in the interpretation of concepts and roles. One option for ...
    • Reasoning in fuzzy description logics using automata 

      Borgwardt, S; Penaloza, R (Elsevier, 2015)
      Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based ...
    • Reasoning in the Description Logic BEL using Bayesian Networks 

      Ceylan II; Peñaloza R (AAAI Press, 2014)
      We study the problem of reasoning in the probabilistic Description Logic ℬℲ. Using a novel structure, we show that probabilistic reasoning in this logic can be reduced in polynomial time to standard inferences over a ...
    • Reasoning on Incomplete Execution Traces Using Action Languages - A First Report 

      Francescomarino, CD; Ghidini, C; Tessaris, S; Sandoval, IV (Springer, 2015)
      In this paper we tackle the problem of reconstructing information about incomplete business process execution traces proposing an approach based on action languages.
    • Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness 

      De Giacomo G; De Masellis R; Montali M (AAAI Press, 2014)
      In this paper we study when an LTL formula on finite traces (LTL/ formula) is insensitive to infiniteness, that is, it can be correctly handled as a formula on infinite traces under the assumption that at a certain point ...