Miracle-dz/UniFAR-FTUs huggingface dataset:
How to Increase Reach and Adherence of Web-Based Interventions: A Design Research Viewpoint

Nowadays, technology is increasingly used to increase people’s well-being. For example, many mobile and Web-based apps have been developed that can support people to become mentally fit or to manage their daily diet. However, analyses of current Web-based interventions show that many systems are only used by a specific group of users (eg, women, highly educated), and that even they often do not persist and drop out as the intervention unfolds. In this paper, we assess the impact of design features of Web-based interventions on reach and adherence and conclude that the power that design can have has not been used to its full potential. We propose looking at design research as a source of inspiration for new (to the field) design approaches. The paper goes on to specify and discuss three of these approaches: personalization, ambient information, and use of metaphors. Central to our viewpoint is the role of positive affect triggered by well-designed persuasive features to boost adherence and well-being. Finally, we discuss the future of persuasive eHealth interventions and suggest avenues for follow-up research.
Use of statistical outlier detection method in adaptive evolutionary algorithms

In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of performance and the interpretation of those measurements for purposes of adaptation. Several examples of measurements and statistical interpretations are provided. Probability value adaptation is tested using an EA with 10 search operators against 10 test problems with results indicating that both the type of measurement and its statistical interpretation play significant roles in EA performance. We also find that selecting operators based on the prevalence of outliers rather than on average performance is able to provide considerable improvements to adaptive methods and soundly outperforms the non-adaptive case.
Mostly-unsupervised statistical segmentation of Japanese kanji sequences

Given the lack of word delimiters in written Japanese, word segmentation is generally considered a crucial first step in processing Japanese texts. Typical Japanese segmentation algorithms rely either on a lexicon and syntactic analysis or on pre-segmented data; but these are labor-intensive, and the lexico-syntactic techniques are vulnerable to the unknown word problem. In contrast, we introduce a novel, more robust statistical method utilizing unsegmented training data. Despite its simplicity, the algorithm yields performance on long kanji sequences comparable to and sometimes surpassing that of state-of-the-art morphological analyzers over a variety of error metrics. The algorithm also outperforms another mostly-unsupervised statistical algorithm previously proposed for Chinese. Additionally, we present a two-level annotation scheme for Japanese to incorporate multiple segmentation granularities, and introduce two novel evaluation metrics, both based on the notion of a compatible bracket, that can account for multiple granularities simultaneously.
Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin a Comparison of Four Approaches to the Calculation of Conservation Laws a Comparison of Four Approaches to the Calculation of Conservation Laws

The paper compares computational aspects of four approaches to compute conservation laws of single diierential equations or systems of them, ODEs and PDEs. The only restriction, required by two of the four corresponding computer algebra programs, is that each DE has to be solvable for a leading derivative. Extra constraints may be given. Examples of new conservation laws include non-polynomial expressions, an explicit variable dependence and conservation laws involving arbitrary functions. Examples involve the
Temporal trends in disease outcomes related to Clostridium difficile infection in patients with inflammatory bowel disease

Background: Clostridium difficile has emerged as an important pathogen in patients with inflammatory bowel disease (IBD) and is associated with increased morbidity and mortality. No studies have examined the temporal change in severity of C. difficile infection (CDI) complicating IBD. Methods: Using data from the Nationwide Inpatient Sample, we identified all IBD‐related hospitalizations during the years 1998, 2004, and 2007 and examined hospitalizations with a coexisting diagnosis of C. difficile. We compared the absolute outcomes of in‐hospital mortality and colectomy in the C. difficile‐IBD cohort during these timepoints, and also examined these outcomes relative to non‐C. difficile IBD controls during each corresponding year. Results: During 1998, 2004, and 2007, approximately 1.4%, 2.3%, and 2.9% of all IBD hospitalizations nationwide were complicated by CDI (P < 0.001). The absolute mortality in the C. difficile‐IBD cohort increased from 5.9%–7.2% (P = 0.052) with a nonsignificant increase in colectomy rate from 3.8%–4.5% between 1998 and 2007. Compared to non‐C. difficile IBD controls, there was an increase in the relative mortality risk associated with C. difficile from 1998 (odds ratio [OR] 2.38, 95% confidence interval [CI]: 1.52–3.72) to 2007 (OR 3.38, 95% CI: 2.66–4.29) (P = 0.15) with a significant increase in total colectomy odds from 1998 (OR 1.39, 95% CI: 0.81–2.37) to 2007 (OR 2.51, 95% CI: 1.90–3.34) (P = 0.03). Conclusion: There has been a temporal increase nationwide in CDI complicating IBD hospitalizations. The excess morbidity associated with C. difficile infection in hospitalized IBD patients has increased between 1998 and 2007. (Inflamm Bowel Dis 2011;)
C++ Templates as Partial Evaluation

This paper explores the relationship between C++ templates and partial evaluation. Templates were designed to support generic programming, but unintentionally provided the ability to perform compile-time computations and code generation. These features are completely accidental, and as a result their syntax is awkward. By recasting these features in terms of partial evaluation, a much simpler syntax can be achieved. C++ may be regarded as a two-level language in which types are first-class values. Template instantiation resembles an offline partial evaluator. This paper describes preliminary work toward a single mechanism based on Partial Evaluation which unifies generic programming, compile-time computation and code generation. The language Catat is introduced to illustrate these ideas.
Deciding security properties for cryptographic protocols. application to key cycles

There is a large amount of work dedicated to the formal verification of security protocols. In this article, we revisit and extend the NP-complete decision procedure for a bounded number of sessions. We use a, now standard, deducibility constraint formalism for modeling security protocols. Our first contribution is to give a simple set of constraint simplification rules, that allows to reduce any deducibility constraint to a set of solved forms, representing all solutions (within the bound on sessions). As a consequence, we prove that deciding the existence of key cycles is NP-complete for a bounded number of sessions. The problem of key-cycles has been put forward by recent works relating computational and symbolic models. The so-called soundness of the symbolic model requires indeed that no key cycle (e.g., enc(k, k)) ever occurs in the execution of the protocol. Otherwise, stronger security assumptions (such as KDM-security) are required. We show that our decision procedure can also be applied to prove again the decidability of authentication-like properties and the decidability of a significant fragment of protocols with timestamps.
Peculiarities of Enhancing Resistant Starch in Ruminants Using Chemical Methods: Opportunities and Challenges

High-producing ruminants are fed high amounts of cereal grains, at the expense of dietary fiber, to meet their high energy demands. Grains consist mainly of starch, which is easily degraded in the rumen by microbial glycosidases, providing energy for rapid growth of rumen microbes and short-chain fatty acids (SCFA) as the main energy source for the host. Yet, low dietary fiber contents and the rapid accumulation of SCFA lead to rumen disorders in cattle. The chemical processing of grains has become increasingly important to confer their starch resistances against rumen microbial glycosidases, hence generating ruminally resistant starch (RRS). In ruminants, unlike monogastric species, the strategy of enhancing resistant starch is useful, not only in lowering the amount of carbohydrate substrates available for digestion in the upper gut sections, but also in enhancing the net hepatic glucose supply, which can be utilized by the host more efficiently than the hepatic gluconeogenesis of SCFA. The use of chemical methods to enhance the RRS of grains and the feeding of RRS face challenges in the practice; therefore, the present article attempts to summarize the most important achievements in the chemical processing methods used to generate RRS, and review advantages and challenges of feeding RRS to ruminants.
Network information flow with correlated sources

Consider the following network communication setup, originating in a sensor networking application we refer to as the "sensor reachback" problem. We have a directed graph G=(V,E), where V={v/sub 0/v/sub 1/. v/sub n/} and E/spl sube/V/spl times/V. If (v/sub i/,v/sub j/)/spl isin/E, then node i can send messages to node j over a discrete memoryless channel (DMC) (X/sub ij/,p/sub ij/(y|x),Y/sub ij/), of capacity C/sub ij/. The channels are independent. Each node v/sub i/ gets to observe a source of information U/sub i/(i=0.M), with joint distribution p(U/sub 0/U/sub 1/.U/sub M/). Our goal is to solve an incast problem in G: nodes exchange messages with their neighbors, and after a finite number of communication rounds, one of the M+1 nodes (v/sub 0/ by convention) must have received enough information to reproduce the entire field of observations (U/sub 0/U/sub 1/.U/sub M/), with arbitrarily small probability of error. In this paper, we prove that such perfect reconstruction is possible if and only if H(U/sub s/ | U/sub S(c)/) < /spl Sigma//sub i/spl isin/S,j/spl isin/S(c)/ for all S/spl sube/{0.M},S/spl ne/O,0/spl isin/S(c). Our main finding is that in this setup, a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem surprising that separation holds in a fairly general network situation like the one we study. A closer look, however, reveals that the reason for this is that our model allows only for independent point-to-point channels between pairs of nodes, and not multiple-access and/or broadcast channels, for which separation is well known not to hold. This "information as flow" view provides an algorithmic interpretation for our results, among which perhaps the most important one is the optimality of implementing codes using a layered protocol stack.
Generative unbinding of names

This paper is concerned with a programming language construct for typed name binding that enforces αequivalence. It proves a new result about what operations on names can co-exist with this construct. The particular form of typed name binding studied is that used by the FreshML family of languages. Its characteristic feature is that a name binding is represented by an abstract (name,value)-pair that may only be deconstructed via the generation of fresh bound names. In FreshML the only observation one can make of names is to test whether or not they are equal. This restricted amount of observation was thought necessary to ensure that there is no observable difference between αequivalent name binders. Yet from an algorithmic point of view it would be desirable to allow other operations and relations on names, such as a total ordering. This paper shows that, contrary to expectations, one may add not just ordering, but almost any relation or numerical function on names without disturbing the fundamental correctness result about this form of typed name binding (that object-level αequivalence precisely corresponds to contextual equivalence at the programming meta-level), so long as one takes the state of dynamically created names into account.
Information Diffusion in Computer Science Citation Networks

The paper citation network is a traditional social medium for the exchange of ideas and knowledge. In this paper we examine information diffusion in citation networks by analyzing the correlations between various citation choices and the subsequent impact of the articles. We find that citing recent papers and papers within the same scholarly community garners a slightly larger number of citations on average. However, this correlation is weaker among well-cited papers implying that for high impact work citing within one's field is of lesser importance.
Two-Literal Logic Programs and Satisfiability Representation of Stable Models : A Comparison

Logic programming with the stable model semantics has been proposed as a constraint programming paradigm for solving constraint satisfaction and other combinatorial problems. In such a language one writes function-free logic programs with negation. Such a program is instantiated to a ground program from which the stable models are computed. In this paper, we identify a class of logic programs for which the current techniques in solving SAT problems can be adopted for the computation of stable models efficiently. These logic programs are called 2-literal programswhere each rule or constraint consists of at most two literals. Many logic programming encodings of graph-theoretic, combinatorial problems given in the literature fall into the class of 2-literal programs. We show that a 2-literal program can be translated to a SAT instance without using extra variables. We report and compare experimental results on solving a number of benchmarks by a stable model generator and by a SAT solver.
Complex Philosophy

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining “abstraction levels”. These are useful for representing regularities in nature. We define absolute being (observer independent, infinite) and relative being (observer dependent, finite), and notice the differences between them. We draw issues on relative causality and absolute causality among abstraction levels. We also make reflections on determinism. We reject the search for any absolute truth (because of their infinity), and prom ote the idea that all comprehensible truths are relative, since they were created in finite contexts. This leads us to suggest to search the less-incompleteness of ideas and contexts instead of their truths.
Could meltwater pulses have been sneaked unnoticed into the deep ocean during the last glacial?

The lack of climatic imprint left by the Meltwater Pulse‐1A (≃14.5 ka BP), equivalent to a sea‐level rise of 14 to 20 meters, is puzzling. Recent studies suggest the event might have occurred as a hyperpycnal flow in the Gulf of Mexico, preventing its detection in oceanic records throughout the North Atlantic. We present a suite of simulations with the LOVECLIM climate model, which mimic the effect of hyperpycnal flow under LGM conditions, in a first attempt to constrain its climatic effects. Analysing the ocean dynamics associated with the anomalous freshwater input, we show that the proposed mechanism is capable of sneaking a significant proportion of the MWP into the ocean (≃6 meters equivalent sea‐level rise using our model under LGM boundary conditions). We also demonstrate that, in our model, the meridional circulation is more sensitive to such inputs in the Arctic Ocean than in the Gulf of Mexico.
The Path towards Semantic Email: Summary and Outlook

In this paper we provide a summary of work that has been pursued in the area of Semantic Email, with a particular focus on our work in the area. The aim of this paper is to provide a status quo for this topic, as well as to generate ideas and discussions that could evolve the topic and take it to new heights. We finish off by outlining future directions for evaluation, improvement as well as extension of our current technologies.
Network Coding Security: Attacks and Countermeasures

By allowing intermediate nodes to perform non-trivial operations on packets, such as mixing data from multiple streams, network coding breaks with the ruling store and forward networking paradigm and opens a myriad of challenging security questions. Following a brief overview of emerging network coding protocols, we provide a taxonomy of their security vulnerabilities, which highlights the differences between attack scenarios in which network coding is particularly vulnerable and other relevant cases in which the intrinsic properties of network coding allow for stronger and more efficient security solutions than classical routing. Furthermore, we give practical examples where network coding can be combined with classical cryptography both for secure communication and secret key distribution. Throughout the paper we identify a number of research challenges deemed relevant towards the applicability of secure network coding in practical networks.
Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.
PR3-ANCA: A Promising Biomarker in Primary Sclerosing Cholangitis (PSC)

Background and Aims The only recognized biomarker for primary sclerosing cholangitis (PSC) is atypical anti-neutrophil cytoplasmic antibodies (aANCA), which, in addition to having low sensitivity and specificity, is an indirect immunofluorescence (IIF) test lacking the advantages of high throughput and objectivity. Recent reports have shown that antibodies to proteinase-3 (PR3-ANCA) might add diagnostic value in inflammatory bowel disease (IBD), specifically in ulcerative colitis (UC). As PSC is associated with IBD, the objective of this study was to evaluate the frequency and clinical significance of PR3-ANCA in a large cohort of patients. Methods A total of 244 PSC and 254 control [autoimmune hepatitis (AIH), primary biliary cirrhosis (PBC), hepatitis C viral infection (HCV), hepatitis B viral infection (HBV), and healthy controls] sera and their clinical correlations were retrospectively analyzed for PR3-ANCA determined by ELISA and a new chemiluminescence immunoassay (CIA). Testing was also performed for aANCA by IIF. Results When measured by CIA, PR3-ANCA was detected in 38.5% (94/244) of PSC patients compared to 10.6% (27/254) controls (p<0.0001). By ELISA, PR3-ANCA was detected in 23.4% (57/244) of PSC patients compared to 2.7% (6/254) controls (p<0.0001). PR3-ANCA in PSC patients was not associated with the presence or type of underlying IBD, and, in fact, it was more frequent in Crohn's disease (CD) patients with PSC than previously reported in CD alone. PR3-ANCA in PSC measured by CIA correlated with higher liver enzymes. Conclusion PR3-ANCA is detected in a significant proportion of PSC patients compared to other liver diseases including PBC and AIH. PR3-ANCA is associated with higher liver enzyme levels in PSC, and is not solely related to underlying IBD.
The Association of Acetabulum Fracture and Mechanism of Injury with BMI, Days Spent in Hospital, Blood Loss, and Surgery Time: A Retrospective Analysis of 67 Patients

Background and Objectives: The objective of this retrospective study was to investigate the association between acetabulum fractures; the mechanism of injury; and variables such as BMI, duration of hospital stay, blood loss, and surgery time. By exploring these factors, we aim to enhance our understanding of them and their impact on the healing process and the subsequent management of pelvic fractures. Materials and Methods: This study included 67 of 136 consecutive patients who were admitted for pelvic ring fracture surgery between 2017 and 2022. The data were collected prospectively at a single trauma center. The inclusion criteria were acetabulum fractures and indications for operative treatment. The exclusion criteria were non-operative treatment for acetabular and pelvic ring fractures, fractures requiring primary total hip arthroplasty (THA), and periprosthetic acetabular fractures. Upon admission, all patients underwent evaluation using X-ray and computed tomography (CT) scans of the pelvis. Results: The present study found no statistically significant differences between the examined groups of patients with pelvic fractures in terms of BMI, surgery duration, length of hospital stay, and blood transfusion. However, two notable findings approached statistical significance. Firstly, patients who experienced a fall from height while sustaining a pelvic fracture required a higher number of blood transfusions (2.3 units) than those with other mechanisms of injury which was close to achieving statistical significance (p = 0.07). Secondly, patients undergoing posterior wall stabilization required a significantly lower number of blood transfusions than those with other specific pelvic injuries (0.33 units per patient), approaching statistical significance (p = 0.056). Conclusions: The findings indicated that factors such as BMI, time of surgery, blood loss, and the duration of hospital stay were not directly correlated with the morphology of acetabular fractures, the presence of additional trauma, or the mechanism of injury. However, in the studied group, the patients whose mechanism of trauma involved falling from height had an increased number of blood transfusions compared to other groups. Moreover, the patients who had surgery due to posterior wall acetabulum fracture had decreased blood transfusions compared to those with other Judet and Letournel types of fractures. Additionally, they had the shortest duration of surgery.
A New Adaptive Data Distribution Model for Consistency Maintenance in Collaborative Virtual Environments

Ensuring that all the users see the same state of a Collaborative Virtual Environment (CVE) at the same time is very important to provide effective collaboration between these users. Absolute consistency is nearly impossible to achieve because it would prejudice the system responsiveness during user interactions. Consequently, existing solutions make a trade-off between consistency and system responsiveness according to their own requirements. We propose a new adaptive data distribution model that is able to dynamically change data distribution according to application requirements, user's actions and functions that virtual objects fulfill in the virtual environment. Our solutions can deal with several kinds of requirements imposed by various applications and network constraints. The choice of the data distribution can be made at the object level because all the objects of a virtual environment do not necessarily have the same need for consistency. Finally, we evaluate this model for collaborative scientific data visualization using a client/server architecture and HTTP/HTTPS connections. The results show that our model can minimize both interaction latency and gap in consistency between users, so it enables users to always perform real-time interactions in a consistent CVE.