Search results for "Computer and Information Science"
showing 10 items of 1335 documents
Designing the Business Conversation Corpus
2020
While the progress of machine translation of written text has come far in the past several years thanks to the increasing availability of parallel corpora and corpora-based training technologies, automatic translation of spoken text and dialogues remains challenging even for modern systems. In this paper, we aim to boost the machine translation quality of conversational texts by introducing a newly constructed Japanese-English business conversation parallel corpus. A detailed analysis of the corpus is provided along with challenging examples for automatic translation. We also experiment with adding the corpus in a machine translation training scenario and show how the resulting system benef…
Inducing the Lyndon Array
2019
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n)$ time using $\sigma + O(1)$ words of working space, where $n$ is the length of the text and $\sigma$ is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use $O(n)$ words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not onl…
Software Startup Practices -- Software Development in Startups through the Lens of the Essence Theory of Software Engineering
2020
Software startups continue to be important drivers of economy globally. As the initial investment required to found a new software company becomes smaller and smaller resulting from technological advances such as cloud technology, increasing numbers of new software startups are born. Typically, the main argument for studying software startups is that they differ from mature software organizations in various ways, thus making the findings of many existing studies not directly applicable to them. How, exactly, software startups really differ from other types of software organizations as an on-going debate. In this paper, we seek to better understand how software startups differ from mature so…
On the Inner Product Predicate and a Generalization of Matching Vector Families
2018
Motivated by cryptographic applications such as predicate encryption, we consider the problem of representing an arbitrary predicate as the inner product predicate on two vectors. Concretely, fix a Boolean function $P$ and some modulus $q$. We are interested in encoding $x$ to $\vec x$ and $y$ to $\vec y$ so that $$P(x,y) = 1 \Longleftrightarrow \langle\vec x,\vec y\rangle= 0 \bmod q,$$ where the vectors should be as short as possible. This problem can also be viewed as a generalization of matching vector families, which corresponds to the equality predicate. Matching vector families have been used in the constructions of Ramsey graphs, private information retrieval (PIR) protocols, and mor…
sj-docx-2-dhj-10.1177_20552076221074485 - Supplemental material for The role of age and digital competence on the use of online health and social car…
2022
Supplemental material, sj-docx-2-dhj-10.1177_20552076221074485 for The role of age and digital competence on the use of online health and social care services: A cross-sectional population-based survey by T Heponiemi, A-M Kaihlanen, A Kouvonen, L Leemann, S Taipale and K Gluschkoff in Digital Health
sj-docx-1-dhj-10.1177_20552076221074485 - Supplemental material for The role of age and digital competence on the use of online health and social car…
2022
Supplemental material, sj-docx-1-dhj-10.1177_20552076221074485 for The role of age and digital competence on the use of online health and social care services: A cross-sectional population-based survey by T Heponiemi, A-M Kaihlanen, A Kouvonen, L Leemann, S Taipale and K Gluschkoff in Digital Health
sj-docx-2-dhj-10.1177_20552076221074485 - Supplemental material for The role of age and digital competence on the use of online health and social car…
2022
Supplemental material, sj-docx-2-dhj-10.1177_20552076221074485 for The role of age and digital competence on the use of online health and social care services: A cross-sectional population-based survey by T Heponiemi, A-M Kaihlanen, A Kouvonen, L Leemann, S Taipale and K Gluschkoff in Digital Health
sj-docx-1-dhj-10.1177_20552076221074485 - Supplemental material for The role of age and digital competence on the use of online health and social car…
2022
Supplemental material, sj-docx-1-dhj-10.1177_20552076221074485 for The role of age and digital competence on the use of online health and social care services: A cross-sectional population-based survey by T Heponiemi, A-M Kaihlanen, A Kouvonen, L Leemann, S Taipale and K Gluschkoff in Digital Health
Active and inactive quarantine in epidemic spreading on adaptive activity-driven networks
2020
We consider an epidemic process on adaptive activity-driven temporal networks, with adaptive behaviour modelled as a change in activity and attractiveness due to infection. By using a mean-field approach, we derive an analytical estimate of the epidemic threshold for SIS and SIR epidemic models for a general adaptive strategy, which strongly depends on the correlations between activity and attractiveness in the susceptible and infected states. We focus on strong social distancing, implementing two types of quarantine inspired by recent real case studies: an active quarantine, in which the population compensates the loss of links rewiring the ineffective connections towards non-quarantining …
Combinatorial proofs of two theorems of Lutz and Stull
2021
Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…