pinecone/core-2020-05-10-deduplication huggingface dataset:
ACL injuries identifiable for pre-participation imagiological analysis: Risk factors

Identification of pre-participation risk factors for noncontact anterior cruciate ligament (ACL) injuries has been attracting a great deal of interest in the sports medicine and traumatology communities. Appropriate methods that enable predicting which patients could benefit from pre- ventive strategies are most welcome. This would enable athlete-specific training and conditioning or tailored equipment in order to develop appropriate strategies to reduce incidence of injury. In order to accomplish these goals, the ideal system should be able to assess both anatomic and functional features. Complementarily, the screening method must be cost-effective and suited for widespread application. Anatomic study protocol requiring only standard X rays could answer some of such demands. Dynamic MRI/CT evaluation and electronically assisted pivot-shift evaluation can be powerful tools providing complementary information. These upcoming insights, when validated and properly combined, envision changing pre-participation knee examination in the near future. Herein different methods (validated or under research) aiming to improve the capacity to identify persons/athletes with higher risk for ACL injury are overviewed.
Blocked schur algorithms for computing the matrix square root

Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected Papers.The Schur method for computing a matrix square root reduces the matrix to Schur triangular form and then computes a square root of the triangular matrix. We show that by using either a standard blocking or recursive blocking the computation of the square root of the triangular matrix can be made rich in matrix multiplication. Numerical experiments making appropriate use of level 3 BLAS show significant speedups over the point algorithm, both in the square root phase and in the algorithm as a whole. In parallel implemetnations, recursive blocking is found to provide better performance than standard blocking when parallelism comes only from threaded BLAS, but the reverse is true when parallelism is explicitly expressed using OpenMP. The excellent numerical stability of the point algorithm is shown to be preserved by blocking. These results are extended to the real Schur method. Blocking is also shown to be effective for multiplying triangular matrices
Evaluation of Agents Interactions in a Context-Aware System

The evaluation of Multi-Agent Systems (MAS) is a complex problem and it does not have a single form. Much effort has been spent on suggesting and implementing new architectures of MAS. Often these new architectures are not even compared to any other existing architectures in order to evaluate their relative benefits. The present work focuses on interactions, the most important characteristic of any complex software as autonomous agents according to [25], as a problematic of evaluation. So, in this paper, we describe the assignment of evaluation values to Agents interaction in a specific MAS architecture. This evaluation is based on the weight of the messages brought by an interaction.Funded by projects CICYT TIN2008-06742-C02-02/TSI,CICYT TEC2008-06732-C02-02/TEC, SINPROB, CAM MADRINET S-0505/TIC/0255, and DPS2008-07029-C02-02.Publicad
Translating the idea of the egovernment one-stop-shop in Indonesia

Article from the Book:Information and Communication Technology, Springer 2013. Also available on SpringerLink:http://dx.doi.org/10.1007/978-3-642-36818-9_1This study aims to understand how the idea of an eGovernment one-
stop-shop (OSS) has been translated into a new setting. Since the beginning of
2000, this idea has been implemented in a variety of ways by Indonesian local
governments. Using an interpretive case study in the city of Yogyakarta, the
study revealed that the specificity of each setting influences the translation
process of the idea of OSS during its institutionalization. It also identified a set
of editing rules used during the translation process. These include the editing
rules concerning context (e.g., internal readiness); logic (e.g., corruption eradi-
cation); and formulation (e.g., standardized processes). The study also found
that the idea translation was not a single round process
Incremental learning for interactive sketch recognition

International audienceIn this paper, we present the integration of a classfi er, based on an incremental learning method, in an interactive sketch analyzer. The classfi er recognizes the symbol with a degree of con dence. Sometimes the analyzer considers that the response is insu ficient to make the right decision. The decision process then solicits the user to explicitly validate the right decision. The user associates the symbol to an existing class, to a newly created class or ignores this recognition. The classifi er learns during the interpretation phase. We can thus have a method for autoevolutionary interpretation of sketches. In fact, the user participation has a great impact to avoid error accumulation during the analysis. This paper demonstrates this integration in an interactive method based on a competitive breadth- first exploration of the analysis tree for interpreting the 2D architectural floor plans
Ancient Documents Denoising and Decomposition Using Aujol and Chambolle Algorithm

With the improvement of printing technology since the 15th century, there is a huge amount of printed documents published and distributed. These documents are degraded by the time and require to be preprocessed before being submitted to image indexing strategy, in order to enhance the quality of images. This paper proposes a new pre-processing that permits to denoise these documents, by using a Aujol and Chambolle algorithm. Aujol and Chambolle algorithm allows to extract meaningful components from image. In this case, we can extract shapes, textures and noise. Some examples of specific processings applied on each layer are illustrated in this paper
Spatio-structural Symbol Description with Statistical Feature Add-on

The original publication is available at www.springerlink.comInternational audienceIn this paper, we present a method for symbol description based on both spatio-structural and statistical features computed on elementary visual parts, called 'vocabulary'. This extracted vocabulary is grouped by type (e.g., circle, corner ) and serves as a basis for an attributed relational graph where spatial relational descriptors formalise the links between the vertices, formed by these types, labelled with global shape descriptors. The obtained attributed relational graph description has interesting properties that allows it to be used efficiently for recognising structure and by comparing its attribute signatures. The method is experimentally validated in the context of electrical symbol recognition from wiring diagrams
Practical Everlasting Privacy

International audienceWill my vote remain secret in 20 years? This is a natural question in the context of electronic voting, where encrypted votes may be published on a bulletin board for verifiability purposes, but the strength of the encryption is eroded with the passage of time. The question has been addressed through a property referred to as everlasting privacy. Perfect everlasting privacy may be difficult or even impossible to achieve, in particular in remote electronic elections. In this paper, we propose a definition of practical everlasting privacy. The key idea is that in the future, an attacker will be more powerful in terms of computation (he may be able to break the cryptography) but less powerful in terms of the data he can operate on (transactions between a vote client and the vote server may not have been stored).\par We formalize our definition of everlasting privacy in the applied-pi calculus. We provide the means to characterize what an attacker can break in the future in several cases. In particular, we model this for perfectly hiding and computationally binding primitives (or the converse), such as Pedersen commitments, and for symmetric and asymmetric encryption primitives. We adapt existing tools, in order to allow us to automatically prove everlasting privacy. As an illustration, we show that several variants of Helios (including Helios with Pedersen commitments) and a protocol by Moran and Naor achieve practical everlasting privacy, using the ProVerif and the AKiSs tools
A differentially private mechanism of optimal utility for a region of priors

International audienceThe notion of differential privacy has emerged in the area of statistical databases as a measure of protection of the participants' sensitive information, which can be compromised by selected queries. Differential privacy is usually achieved by using mechanisms that add random noise to the query answer. Thus, privacy is obtained at the cost of reducing the accuracy, and therefore the "utility", of the answer. Since the utility depends on the user's side information, commonly modelled as a prior distribution, a natural goal is to design mechanisms that are optimal for every prior. However, it has been shown that such mechanisms do not exist for any query other than counting queries. Given the above negative result, in this paper we consider the problem of identifying a restricted class of priors for which an optimal mechanism does exist. Given an arbitrary query and a privacy parameter, we geometrically characterise a special region of priors as a convex polytope in the priors space. We then derive upper bounds for utility as well as for min-entropy leakage for the priors in this region. Finally we define what we call the "tight-constraints mechanism" and we discuss the conditions for its existence. This mechanism has the property of reaching the bounds for all the priors of the region, and thus it is optimal on the whole region
Singularities in ternary mixtures of k-core percolation

Heterogeneous k-core percolation is an extension of a percolation model which
has interesting applications to the resilience of networks under random damage.
In this model, the notion of node robustness is local, instead of global as in
uniform k-core percolation. One of the advantages of k-core percolation models
is the validity of an analytical mathematical framework for a large class of
network topologies. We study ternary mixtures of node types in random networks
and show the presence of a new type of critical phenomenon. This scenario may
have useful applications in the stability of large scale infrastructures and
the description of glass-forming systems.Comment: To appear in Complex Networks, Studies in Computational Intelligence,
  Proceedings of CompleNet 201
Search when the lie depends on the target

The following model is considered. There is exactly one unknown element in the n-element set. A question is a partition of S into three classes: (A,L,B). If x ∈ A then the answer is "yes" (or 1), if x ∈ B then the answer is "no" (or 0), finally if x ∈ L then the answer can be either "yes" or "no". In other words, if the answer "yes" is obtained then we know that x ∈ A ∪ L while in the case of "no" answer the conclusion is x ∈ B ∪ L. The mathematical problem is to minimize the minimum number of questions under certain assumptions on the sizes of A,B and L. This problem has been solved under the condition |L| ≥ k by the author and Krisztián Tichler in previous papers for both the adaptive and non-adaptive cases. In this paper we suggest to solve the problem under the conditions |A| ≤ a, |B| ≤ b. We exhibit some partial results for both the adaptive and non-adaptive cases. We also show that the problem is closely related to some known combinatorial problems. Let us mention that the case b = n - a has been more or less solved in earlier papers. © Springer-Verlag Berlin Heidelberg 2013
Strong Secrecy for Multiple Access Channels

We show strongly secret achievable rate regions for two different wiretap
multiple-access channel coding problems. In the first problem, each encoder has
a private message and both together have a common message to transmit. The
encoders have entropy-limited access to common randomness. If no common
randomness is available, then the achievable region derived here does not allow
for the secret transmission of a common message. The second coding problem
assumes that the encoders do not have a common message nor access to common
randomness. However, they may have a conferencing link over which they may
iteratively exchange rate-limited information. This can be used to form a
common message and common randomness to reduce the second coding problem to the
first one. We give the example of a channel where the achievable region equals
zero without conferencing or common randomness and where conferencing
establishes the possibility of secret message transmission. Both coding
problems describe practically relevant networks which need to be secured
against eavesdropping attacks.Comment: 55 page
A Framework for Interpreting Bridging Anaphora

In this paper we present a novel framework for resolving bridging anaphora.We argue that anaphora, particularly bridging anaphora, is used as a shortcut device similar to the use of compound nouns. Hence, the two natural language usage phenomena would have to be based on the same theoretical framework. We use an existing theory on compound nouns to test its validity for anaphora usages. To do this, we used hu- man annotators to interpret indirect anaphora from naturally occurring discourses. The annotators were asked to classify the relations between anaphor-antecedent pairs into relation types that have been previously used to describe the relations between a modi er and the head noun of a compound noun. We obtained very encouraging results with an average Fleiss's value of 0.66 for inter-annotation agreement. The results were evaluated against other similar natural language interpretation annota- tion experiments and were found to compare well. In order to determine the prevalence of the proposed set of anaphora relations we did a detailed analysis of a subset 20 newspaper articles. The results obtained from this also indicated that a majority (98%) of the relations could be described by the relations in the framework. The results from this analysis also showed the distribution of the relation types in the genre of news paper article discourses
The structured phase of concurrency

This extended abstract summarizes the state-of-the-art solution to the structuring problem for models that describe existing real world or envisioned processes. Special attention is devoted to models that allow for the true concurrency semantics. Given a model of a process, the structuring problem deals with answering the question of whether there exists another model that describes the process and is solely composed of structured patterns, such as sequence, selection, option for simultaneous execution, and iteration. Methods and techniques for structuring developed by academia as well as products and standards proposed by industry are discussed. Expectations and recommendations on the future advancements of the structuring problem are suggested
We still don’t know how much BPMN is enough – but we are getting closer

Process models expressed in BPMN typically rely on a small subset of all available symbols. In our 2008 study, we examined the composition of these subsets, and found that the distribution of BPMN symbols in practice closely resembles the frequency distribution of words in natural language. We offered some suggestions based on our findings, how to make the use of BPMN more manageable and also outlined ideas for further development of BPMN. Since this paper was published it has provoked spirited debate in the BPM practitioner community, prompted the definition of a modeling standard in US government, and helped shape the next generation of the BPMN standard
On the instrumentation of OpenMP and OmpSs Tasking constructs

Parallelism has become more and more commonplace with\ud
the advent of the multicore processors. Although different parallel pro-\ud
gramming models have arisen to exploit the computing capabilities of\ud
such processors, developing applications that take benefit of these pro-\ud
cessors may not be easy. And what is worse, the performance achieved\ud
by the parallel version of the application may not be what the developer\ud
expected, as a result of a dubious ut\ud
ilization of the resources offered by\ud
the processor.\ud
We present in this paper a fruitful synergy of a shared memory parallel\ud
compiler and runtime, and a performance extraction library. The objective of this work is not only to reduce the performance analysis life-cycle when doing the parallelization of an application, but also to extend the\ud
analysis experience of the parallel application by incorporating data that\ud
is only known in the compiler and runtime side. Additionally we present\ud
performance results obtained with the execution of instrumented application and evaluate the overhead of the instrumentation.Peer ReviewedPostprint (published version
Best practices for HPM-assisted performance engineering on modern
  multicore processors

Many tools and libraries employ hardware performance monitoring (HPM) on
modern processors, and using this data for performance assessment and as a
starting point for code optimizations is very popular. However, such data is
only useful if it is interpreted with care, and if the right metrics are chosen
for the right purpose. We demonstrate the sensible use of hardware performance
counters in the context of a structured performance engineering approach for
applications in computational science. Typical performance patterns and their
respective metric signatures are defined, and some of them are illustrated
using case studies. Although these generic concepts do not depend on specific
tools or environments, we restrict ourselves to modern x86-based multicore
processors and use the likwid-perfctr tool under the Linux OS.Comment: 10 pages, 2 figure
Substitution Networks: Performance Collapse due to Overhead in Communication Times

International audienceA substitution network is a wireless solution whose purpose is to bring back connectivity or to provide additional bandwidth capac- ity to a network that just suffered a failure or a dramatic surge in its workload. We analyze the performance of the simplest possible multihop topology for a substitution network, i.e., the multihop chain subject to traffic transmitted in both directions. Clearly, the potential capacity of a substitution network, whose technology should be embedded in mobile routers, is very likely to be far much smaller than the prior base network. We investigate the actual performance attained by such a substitution network under various conditions of the chain length and the carrier sensing range. Our results show that the capacity, viz. its maximum at- tainable throughput, reaches a peak at a given workload and then, for larger values of workload, decreases towards an asymptote which value can be drastically lower than the peak value. We give insights into this performance collapse and show the need for a suitable admission control
DTD based costs for Tree-Edit distance in Structured Information Retrieval

In this paper we present a Structured Information Retrieval (SIR) model based on graph matching. Our approach combines content propagation, which handles sibling relationships, with a document-query structure matching process. The latter is based on Tree-Edit Distance (TED) which is the minimum set of insert, delete, and replace operations to turn one tree to another. To our knowledge this algorithm has never been used in ad-hoc SIR. As the effectiveness of TED relies both on the input tree and the edit costs, we first present a focused subtree extraction technique which selects the most representative elements of the document w.r.t the query. We then describe our TED costs setting based on the Document Type Definition (DTD). Finally we discuss our results according to the type of the collection (data-oriented or text-oriented). Experiments are conducted on two INEX test sets: the 2010 Datacentric collection and the 2005 Ad-hoc one
Predicting Information Diffusion in Social Networks using Content and User's Profiles

International audiencePredicting the diffusion of information on social networks is a key problem for applications like Opinion Leader Detection, Buzz Detection or Viral Marketing. Many recent diffusion models are direct extensions of the Cascade and Threshold models, initially proposed for epidemiology and social studies. In such models, the diffusion process is based on the dynamics of interactions between neighbor nodes in the network (the social pressure), and largely ignores important dimensions as the content of the piece of information diffused. We propose here a new family of probabilistic models that aims at predicting how a con- tent diffuses in a network by making use of additional dimensions: the content of the piece of information diffused, user's profile and willing- ness to diffuse. These models are illustrated and compared with other approaches on two blog datasets. The experimental results obtained on these datasets show that taking into account the content of the piece of information diffused is important to accurately model the diffusion process
How small and medium enterprises are using social networks? Evidence from the Algarve region

The evolution of internet created new opportunities for small and medium enterprises (SME), among which are social networks. This work aims at analyzing the potential of these networks for the SME in Algarve, creating a questionnaire for the purpose. The empirical study revealed that some firms have already an integrated business strategy with social networks, as well as a group in the firm responsible for it. Most of their managers consider that social networks enhance performance, but few really measure these results. A categorical principal component analysis identified two dimensions of social networks’ use: social networks for product-client interaction and knowledge; and social networks with potential for marketing. A supplementary analysis (hierarchical clustering) identified three patterns of SME’s involvement in social networks: cluster Social Net Level 1, cluster Social Net Level 2 and cluster Social Net Level 3. These groups validated the results described above, indicating a sustainable methodological approach
Pervasive intelligent decision support system: technology acceptance in intensive care units

Intensive Care Units are considered a critical environment where the
decision needs to be carefully taken. The real-time recognition of the condition
of the patient is important to drive the decision process efficiently. In order to
help the decision process, a Pervasive Intelligent Decision Support System
(PIDSS) was developed. To provide a better comprehension of the acceptance
of the PIDSS it is very important to assess how the users accept the system at
level of usability and their importance in the Decision Making Process. This
assessment was made using the four constructs proposed by the Technology
Acceptance Methodology and a questionnaire-based approach guided by the
Delphi Methodology. The results obtained so far show that although the users
are satisfied with the offered information recognizing its importance, they
demand for a faster system.Fundação para a Ciência e a Tecnologia (FCT
Evaluating web site structure based on navigation profiles and site topology

This work aims at pointing out the benefits of a topology-oriented wide scope, but differentiated, profile analysis. The goal was to conciliate advanced common website usage profiling techniques with the analysis of the website's topology information, outputting valuable knowledge in an intuitive and comprehensible way. Server load balancing, crawler activity evaluation and Web site restructuring are the primary analysis concerns and, in this regard, experiments over six month data of a real-world Web site were considered successful.Fundação para a Ciência e a Tecnologia (FCT