pinecone/core-2020-05-10-deduplication huggingface dataset:
Algorithms for solving rubik's cubes

The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also has a rich underlying algorithmic structure. Specifically, we show that the n ×n ×n Rubik’s Cube, as well as the n ×n ×1 variant, has a “God’s Number” (diameter of the configuration space) of Θ(n [superscript 2]/logn). The upper bound comes from effectively parallelizing standard Θ(n [superscript 2]) solution algorithms, while the lower bound follows from a counting argument. The upper bound gives an asymptotically optimal algorithm for solving a general Rubik’s Cube in the worst case. Given a specific starting state, we show how to find the shortest solution in an n ×O(1) ×O(1) Rubik’s Cube. Finally, we show that finding this optimal solution becomes NP-hard in an n ×n ×1 Rubik’s Cube when the positions and colors of some cubies are ignored (not used in determining whether the cube is solved).19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceeding
Towards a functional characterization of collaborative systems

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-23734-8_30Proceedings of 8th International Conference, CDVE 2011, Hong Kong, China, September 11-14, 2011.In this paper we present major results of a detailed study about the functionalities that are present in different collaborative systems, realized as collaborative components. We have used this study to establish a methodology for the automatic generation of collaborative applications supporting group needs. The methodology is directed to any community of end users, who do not need to have any programming skills.This research was partly funded by the Spanish National Plan of
R+D, project number TIN2008-02081/TIN and by the CAM (Autonomous
Community of Madrid), project number S2009/TIC-1650
Declarative serializable snapshot isolation

Snapshot isolation (SI) is a popular concurrency control protocol, but it permits non-serializable schedules that violate database integrity. The Serializable Snapshot Isolation (SSI) protocol ensures (view) serializability by preventing pivot structures in SI schedules. In this paper, we leverage the SSI approach and develop the Declarative Serializable Snapshot Isolation (DSSI) protocol, an SI protocol that guarantees serializable schedules. Our approach requires no analysis of application programs or changes to the underlying DBMS. We present an implementation and prove that it ensures serializability
Querying versioned software repositories

Large parts of today’s data is stored in text documents that undergo a series of changes during their lifetime. For instance during the development of a software product the source code changes frequently. Currently, managing such data relies on version control systems (VCSs). Extracting information from large documents and their different versions is a manual and tedious process. We present Qvestor, a system that allows to declaratively query documents. It leverages information about the structure of a document that is available as a context-free grammar and allows to declaratively query document versions through a grammar annotated with relational algebra expressions. We define and illustrate the annotation of grammars with relational algebra expressions and show how to translate the annotations to easy to use SQL views
A Novel Integrated Classifier for Handling Data  Warehouse Anomalies

Within databases employed in various commercial sectors, anomalies  continue to persist and hinder the overall integrity of data. Typically, Duplicate,  Wrong and Missed observations of spatial-temporal data causes the user to be not  able to accurately utilise recorded information. In literature, different methods  have been mentioned to clean data which fall into the category of either deterministic  and probabilistic approaches. However, we believe that to ensure the  maximum integrity, a data cleaning methodology must have properties of both of  these categories to effectively eliminate the anomalies. To realise this, we have  proposed a method which relies both on integrated deterministic and probabilistic  classifiers using fusion techniques. We have empirically evaluated the proposed  concept with state-of-the-art techniques and found that our approach improves  the integrity of the resulting data set.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Variable Granularity Space filling Curve for Indexing Multidimensional Data

Efficiently accessing multidimensional data is a challenge for building  modern database applications that involve many folds of data such as temporal,  spatial, data warehousing, bio-informatics, etc. This problem stems from the fact  that multidimensional data have no given order that preserves proximity. The majority  of the existing solutions to this problem cannot be easily integrated into the  current relational database systems since they require modifications to the kernel.  A prominent class of methods that can use existing access structures are 'space  filling curves'. In this study, we describe a method that is also based on the space  filling curve approach, but in contrast to earlier methods, it connects regions of  various sizes rather than points in multidimensional space. Our approach allows  an efficient transformation of interval queries into regions of data that results in  significant improvements when accessing the data. A detailed empirical study  demonstrates that the proposed method outperforms the best available off-theshelf  methods for accessing multidimensional data.Full Tex
Web Accessibility Requirements for Media Players

Video Content continues to strenghten on the Web, because of that fact, it is neccessary to include video content with suitable accessibility requirements to be used by all people. User Agent (such as player, browser), also have to include accessibility requirements. In this paper a set of basic guidelines is included for professionals who want to embed video players on their Web.This research work is supported by the Research Network MAVIR (S2009/TIC-1542 (see wwwmavir.net/)), and GEMMA (TSI-020302-2010-141) and SAGAS (TSI-020100-2010-184) research projects
End-User support for information architecture analysis in interactive web applications

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-23768-3_71Proceedings of 13th IFIP TC 13 International Conference, Lisbon, Portugal, September 5-9, 2011, Part IVInformation Architects analyze conceptual models and descriptions concerning non-functional requirements that will be later on used by Analysts and Software Engineers to design software artifacts. However, this flow of information is sometimes difficult to automate due to conceptual knowledge differences in the information processed by each expert. To facilitate this flow, in this paper we propose a CASE tool called InterArch. Our tool bridges the gap between both professionals, and it automatically generates UML diagrams for Analysts from the conceptual diagrams created by the Information Architect.The work reported in this paper is being supported by the Spanish Ministry of Science and Technology, project ID: TIN2008-02081/TIN, the Madrid Research Council, project ID: S2009/TIC-1650 and, together with the UAM, project ID: CCG10-UAM/TIC-5772
Experimenting and improving perception of 3D rotation-based transitions between 2D visualizations

Part 1: Long and Short PapersInternational audienceExploring a multidimensional dataset with visualization requires to transition between points of view. In order to enable users to understand transitions, visualization can employ progressive 3D rotations. However, existing implementations of progressive 3D rotation exhibit some perception problems with visualization of cluttered scene. In this paper, we present a first experiment showing how existing 3D rotation is effective for tracking marks, and that cluttered scenes actually hinder perception of rotation. Then, we propose to set the axis of rotation on the graphical marks of interest, and ran a second experiment showing that focus-centered rotation improves perception of relative arrangement
HTML5 support for an accessible user-video-interaction on the Web

Multimedia content covers the Web, and we should provide access to all people. For this reason, it is very important to take into account accessibility requirements in the player to avoid barriers and to ensure access to this multimedia content as well as their resources. One of the most frequent barriers is the technological obstacle: the necessity for the user to install the required plug-ins in to order to access video. The new standard HTML5 provides a solution to this problem. However, it does not fully support accessibility requirements of W3C standards, including WCAG and interaction requirement of UAAG. This paper introduces an overall study of this new standard in relation to accessibility requirements for the players as well as an accessible HTML5 Media Player.This research work is supported by the Research Network MAVIR (S2009/TIC-1542 (www.mavir.net/)), GEMMA (TSI-020302-2010-141) and SAGAS (TSI-020100-2010- 184) research projects
OntoCompo: A Tool to Enhance Application Composition

Part 1: Long and Short PapersInternational audienceMash-ups emerged through the web 2.0 to juxtapose several applications and use them together. The next step after juxtaposition is the composition of existing applications to build a new one. A solution of this being born need is the reuse of parts from formers applications. To perform this composition and reuse in an easy and comfortable way, we propose a tool based on several extensions of selection to help the developer during his composition
Tensions in developing a secure collective information practice : the case of Agile Ridesharing

Free to read at publisher\ud
\ud
Many current HCI, social networking, ubiquitous computing, and context aware designs, in order for the design to function, have access to, or collect, significant personal information about the user. This raises concerns about privacy and security, in both the research community and main-stream media. From a practical perspective, in the social world, secrecy and security form an ongoing accomplishment rather than something that is set up and left alone. We explore how design can support privacy as practical action, and investigate the notion of collective information-practice of privacy and security concerns of participants of a mobile, social software for ride sharing. This paper contributes an understanding of HCI security and privacy tensions, discovered while “designing in use” using a Reflective, Agile, Iterative Design (RAID) method
What you see is what you (can) get? Designing for process transparency in financial advisory encounters

In this paper, we report on a study to establish process transparency in service encounters of financial advisors and their clients. To support their interaction, we implemented a cooperative software system for tabletops, building on transparency patterns suggested by the literature. In evaluations, however, we found that our design did not improve the perceived transparency and comprehensibility. Introducing the IT artifact into advisory failed to enhance the client?s overall experience and even seemed to negatively influence the client?s perception of the advisory process. Using the representational guidance of depicting the process and its activities as a navigable, interactive map made clients believe that interactions with their advisor were restricted to the system?s functionality, thus expecting that what they see is all they can get
U-Note: Capture the Class and Access it Everywhere

International audienceWe present U-Note, an augmented teaching and learning system leveraging the advantages of paper while letting teachers and pupils benefit from the richness that digital media can bring to a lecture. U-Note provides automatic linking between the notes of the pupils' notebooks and various events that occurred during the class (such as opening digital documents, changing slides, writing text on an interactive whiteboard...). Pupils can thus explore their notes in conjunction with the digital documents that were presented by the teacher during the lesson. Additionally, they can also listen to what the teacher was saying when a given note was written. Finally, they can add their own comments and documents to their notebooks to extend their lecture notes. We interviewed teachers and deployed questionnaires to identify both teachers and pupils' habits: most of the teachers use (or would like to use) digital documents in their lectures but have problems in sharing these resources with their pupils. The results of this study also show that paper remains the primary medium used for knowledge keeping, sharing and editing by the pupils. Based on these observations, we designed U-Note, which is built on three modules. U-Teach captures the context of the class: audio recordings, the whiteboard contents, together with the web pages, videos and slideshows displayed during the lesson. U-Study binds pupils' paper notes (taken with an Anoto digital pen) with the data coming from U-Teach and lets pupils access the class materials at home, through their notebooks. U-Move lets pupils browse lecture materials on their smartphone when they are not in front of a computer
Novel fusion methods for pattern recognition

Over the last few years, several approaches have been proposed for information fusion including different variants of classifier level fusion (ensemble methods), stacking and multiple kernel learning (MKL). MKL has become a preferred choice for information fusion in object recognition. However, in the case of highly discriminative and complementary feature channels, it does not significantly improve upon its trivial baseline which averages the kernels. Alternative ways are stacking and classifier level fusion (CLF) which rely on a two phase approach. There is a significant amount of work on linear programming formulations of ensemble methods particularly in the case of binary classification. In this paper we propose a multiclass extension of binary ν-LPBoost, which learns the contribution of each class in each feature channel. The existing approaches of classifier fusion promote sparse features combinations, due to regularization based on ℓ1-norm, and lead to a selection of a subset of feature channels, which is not good in the case of informative channels. Therefore, we generalize existing classifier fusion formulations to arbitrary ℓ p -norm for binary and multiclass problems which results in more effective use of complementary information. We also extended stacking for both binary and multiclass datasets. We present an extensive evaluation of the fusion methods on four datasets involving kernels that are all informative and achieve state-of-the-art results on all of them
Datum-wise classification. A sequential Approach to sparsity

International audienceWe propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifying. Datum-Wise Classification extends naturally to multi-class tasks, and we describe a specific case where our inference has equivalent complexity to a traditional linear classifier, while still using a variable number of features. We compare our classifier to classical L 1 regularized linear models (L 1-SVM and LARS) on a set of common binary and multi-class datasets and show that for an equal average number of features used we can get improved performance using our method
Aggregating independent and dependent models to learn multi-label classifiers

European Conference, ECML PKDD 2011, Athens, Greece, September 5-9, 2011The aim of multi-label classi cation is to automatically obtain models able to tag objects with the labels that better describe them. Despite it could seem like any other classi cation task, it is widely known that exploiting the presence of certain correlations between labels helps to improve the classi cation performance. In other words, object descriptions are usually not enough to induce good models, also label information must be taken into account. This paper presents an aggregated approach that combines two groups of classi ers, one assuming independence between labels, and the other considering fully conditional dependence among them. The framework proposed here can be applied not only for multi-label classi cation, but also in multi-label ranking tasks. Experiments carried out over several datasets endorse the superiority of our approach with regard to other methods in terms of some evaluation measures, keeping competitiveness in terms of other
Symmetry breaking in numeric constraint problems

Trabajo presentado a la 17th International Conference CP 2011 celebrada en Perugia del 12 al 16 de septiembre.Symmetry-breaking constraints in the form of inequalities between variables have been proposed for a few kind of solution symmetries in numeric CSPs. We show that, for the variable symmetries among those, the proposed inequalities are but a specific case of a relaxation of the well-known LEX constraints extensively used for discrete CSPs. We discuss the merits of this relaxation and present experimental evidences of its practical interestPeer Reviewe
Solving Problems with CP: Four Common Pitfalls to Avoid

International audienceConstraint Programming (CP) is a general technique for solving combinatorial optimization problems. Real world problems are quite complex and solving them requires to divide work into different parts. Mainly, there are: the abstraction of interesting and relevant sub-parts, the definition of benchmarks and design of a global model and the application of a particular search strategy. We propose to identify for each of these parts some common pitfalls and to discuss them. We will successively consider undivided model, rigid search, biased benchmarking and wrong abstraction
Pruning rules for constrained optimisation for conditional preferences

A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a CP-net). This involves checking at each leaf node if the corresponding solution of the CSP is dominated by any of the optimal solutions found so far; if not, then we add this solution to the set of optimal solutions. This kind of algorithm can clearly be computationally expensive if the number of solutions is large. At a node N of the search tree, with associated assignment b to a subset of the variables B, it may happen that, for some previously found solution a, either (a) a dominates all extensions of b; or (b) a does not dominate any extension of b. The algorithm can be significantly improved if we can find sufficient conditions for (a) and (b) that can be efficiently checked. In case (a), we can backtrack since we need not continue the search below N; in case (b), α does not need to be considered in any node below the current node N. We derive a sufficient condition for (b), and three sufficient conditions for (a). Our experimental testing indicates that this can make a major difference to the efficiency of constrained optimisation for conditional preference theories including CP-nets
An integrated wireless communication architecture for maritime sector

Published version of a chapter in the book:  Multiple Access Communications. Also available from the publisher at http://dx.doi.org/10.1007/978-3-642-23795-9_17The rapid evolution of terrestrial wireless systems has brought mobile users more and more desired communication services. Maritime customers are asking for the same, such as the concepts of “Broadband at Sea” and “Maritime Internet”. Quite a lot of research work has focused on the development of new and better maritime communication technologies, but less attention has been paid on interworking of multiple maritime wireless networks or on satisfying service provisioning. To address this, an integrated wireless Communication Architecture for Maritime Sector (CAMS) has been introduced in this article. CAMS is aimed at 1) granting maritime customers uninterrupted connectivity through the best available network and 2) providing them with the best-provisioned communication services in terms of mobility, security and Quality of Experience (QoE). To address mobility challenge, the IEEE 802.21 standard is recommended to be used in CAMS in order to achieve seamless handover. CAMS provides application-level QoE support attending to the limited communication resources (e.g. bandwidth) at sea. Certain security considerations have also been proposed to supplement this architecture
A scaling limit theorem for the parabolic Anderson model with exponential potential

The parabolic Anderson problem is the Cauchy problem for the heat equation with random potential and localized initial condition. In this paper, we consider potentials which are constant in time and independent exponentially distributed in space. We study the growth rate of the total mass of the solution in terms of weak and almost sure limit theorems, and the spatial spread of the mass in terms of a scaling limit theorem. The latter result shows that in this case, just like in the case of heavy tailed potentials, the mass gets trapped in a single relevant island with high probability
Quantitative information flow, with a view

We put forward a general model intended for assessment of system security against passive eavesdroppers, both quantitatively ( how much information is leaked) and qualitatively ( what properties are leaked). To this purpose, we extend information hiding systems ( ihs ), a model where the secret-observable relation is represented as a noisy channel, with views : basically, partitions of the state-space. Given a view W and n independent observations of the system, one is interested in the probability that a Bayesian adversary wrongly predicts the class of W the underlying secret belongs to. We offer results that allow one to easily characterise the behaviour of this error probability as a function of the number of observations, in terms of the channel matrices defining the ihs and the view W . In particular, we provide expressions for the limit value as n → ∞, show by tight bounds that convergence is exponential, and also characterise the rate of convergence to predefined error thresholds. We then show a few instances of statistical attacks that can be assessed by a direct application of our model: attacks against modular exponentiation that exploit timing leaks, against anonymity in mix-nets and against privacy in sparse datasets
Asymmetric spray and multi-forwarding for delay tolerant networks

The framework of Delay Tolerant Networks (DTNs) has received an extensive attention from academic community because of its application ranging from Wireless Sensor Networks (WSNs) to interplanetary networks. It has a promising future in military affairs, scientific research and exploration. Due to the characteristic of long delay, intermittent connectivity and limited network resource, the traditional routing algorithms do not perform well in DTNs. In this paper, our proposed algorithm is based on an asymmetric spray mechanism combining with the concept of message classes. For each message class, a corresponding forwarding queue is designed and these queues are scheduled according to their priorities. Together with other designed assistant functions, our proposed algorithm outperforms other state of the art algorithms in terms of delivery ratio, overhead ratio, average latency as well as energy consumption