pinecone/core-2020-05-10-deduplication huggingface dataset:
E-calculus at IZTECH

1st International Conference on Technologies for E-Learning and Digital Entertainment, Edutainment 2006; Hangzhou; China; 16 April 2006 through 19 April 2006In today's new economy, characterized by industrial revolutions, globalization and information technology changes traditional classroom and teaching methods. Calculus is the basic course for the fresher at university. Mathematics has a negative development at universities and colleges. The number of students taking mathematics courses and those successfully passing the exams are rapidly decreasing. To overturn this negative development, it may be necessary to teach in a different way. This is where new technology could play an important role. We create a web browser environment by using the webMathematica, which is a new technology based on Java Server Page, Tomcat and Mathematica, in learning calculus. The modules consist of topic modules linked with case study modules, to help learn calculus and see it in context. The aim of our project is to use new technology to present mathematics on the web, and create a pilot course for students and teachers available free on the web. The heart of our approach is the development of mathematical power: understanding, using, and appreciating mathematics. Students can reach any documents for calculus and solve their problems with webMathematica to check whether their results are correct or not. It is possible to reach our page at the following URL address: http://galois.iyte.edu.tr/calculus
Computer-assisted Teaching in Class Situation: a High-school Math Lab on Vectors

published as a volume in Lecture Notes in Computer ScienceInternational audienceThis paper presents our design and experiment of a computerassisted class laboratory on vectors in high-school. Our main goal is to improve the acquisition on notions by all pupils, from advanced level to remedial level. Our secondary goal is to improve the motivation of pupils toward maths and sciences. Our approach consists in making the pupils practice the notions included in a given set of pedagogic objectives, and to do it through real worldinspired problems. We draw on MobiNet, a platform that simulate programmable mobiles on screen and through the network. Our class laboratory consists of a set of pre-programmed interactive simulations, allowing the pupils to react on their errors and to validate each exercise in an autonomous way. This class laboratory was conducted in the same conditions and constraints than an ordinary math lab: same duration, and no preparation of the pupils (but the ordinary math course). Still, the autonomy of the exercises and the network ability would also allow the use with no teacher on place. In this paper, we describe our vector class laboratory experiment: objectives, design, conduction, and evaluation
Efficiently Maintaining Consistency Using Tree-Based P2P Network System in Distributed Network Games

There are two main approaches, conservative and optimistic, for maintaining consistency in distributed network games. Under the conservative approach, players may experience network latency, depending on packet transfer delay caused by the send-and-wait and acknowledging processes. Under the optimistic approach, the processes do not wait for other players' packets and advance to their own frames, hence there is no network latency. However, when inconsistency happens, the processes must roll back. This can cause irritation and confusion to players, and thus the game quality deteriorates. Overall, the optimistic approach may not be suitable for networked games. To overcome the network latency problem in the conservative approach, we propose a new system which can reduce the network latency and bandwidth requirements. Furthermore, the effect of the number of players in multiplayer game sessions is examined in detail with varying number of players. Experimental results with our proposed system confirm improved performances in latency and frame rate.Full Tex
Efficient Digital Pre-Filtering For Least-Squares Linear Approximation

In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter, which we demonstrate to be near-optimal, is applied to the signal before performing the usual linear interpolation. This leads to a non interpolating reconstruction of the signal, with good reconstruction quality and very limited computational cost. The basic formalism adopted to design the pre-filter has been derived from the framework introduced by Blu et Unser in [1]. To demonstrate the usability and the effectiveness of the approach, the proposed method has been applied to the problem of natural image resampling, which is typically applied when the image undergoes successive rotations. The performance obtained are very interesting, and the required computational effort is extremely low
Progressive contour coding in the wavelet domain

This paper presents a new wavelet-based image contour coding technique, suitable for representing either shapes or generic contour maps. Starting from a contour map (e.g. a segmentation map or the result of an edge detector process), a unique one-dimensional signal is generated from the set of contour points. Coordinate jumps between contour extremities when under a tolerance threshold represent signal discontinuities but they can still be compactly coded in the wavelet domain. Exceeding threshold discontinuities are coded as side information. This side information and the amount of remaining discontinuity are minimized by an optimized contour segment sequencing. The obtained 1D signal is decomposed and coded in the wavelet domain by using a 1D extension of the SPIHT algorithm. The described technique can efficiently code any kind of 2D contour map, from one to many unconnected contour segments. It guarantees a fully embedded progressive coding, state-of-art coding performance, good approximation capabilities for both open and closed contours, and graceful visual degradation at low bit-rates
A unifying framework for mutual information methods for use in non-linear optimisation

Many variants of MI exist in the literature. These vary primarily in how the joint histogram is populated. This paper places the four main variants of MI: Standard sampling, Partial Volume Estimation (PVE), In-Parzen Windowing and Post-Parzen Windowing into a single mathematical framework. Jacobians and Hessians are derived in each case. A particular contribution is that the non-linearities implicit to standard sampling and post-Parzen windowing are explicitly dealt with. These non-linearities are a barrier to their use in optimisation. Side-by-side comparison of the MI variants is made using eight diverse data-sets, considering computational expense and convergence. In the experiments, PVE was generally the best performer, although standard sampling often performed nearly as well (if a higher sample rate was used). The widely used sum of squared differences metric performed as well as MI unless large occlusions and non-linear intensity relationships occurred. The binaries and scripts used for testing are available online
Tracking objects across cameras by incrementally learning inter-camera colour calibration and patterns of activity

This paper presents a scalable solution to the problem of tracking objects across spatially separated, uncalibrated, non-overlapping cameras. Unlike other approaches this technique uses an incremental learning method, to model both the colour variations and posterior probability distributions of spatio-temporal links between cameras. These operate in parallel and are then used with an appearance model of the object to track across spatially separated cameras. The approach requires no pre-calibration or batch preprocessing, is completely unsupervised, and becomes more accurate over time as evidence is accumulated
Real-time upper body detection and 3D pose estimation in monoscopic images

This paper presents a novel solution to the difficult task of both detecting and estimating the 3D pose of humans in monoscopic images. The approach consists of two parts. Firstly the location of a human is identified by a probabalistic assembly of detected body parts. Detectors for the face, torso and hands are learnt using adaBoost. A pose likliehood is then obtained using an a priori mixture model on body configuration and possible configurations assembled from available evidence using RANSAC. Once a human has been detected, the location is used to initialise a matching algorithm which matches the silhouette and edge map of a subject with a 3D model. This is done efficiently using chamfer matching, integral images and pose estimation from the initial detection stage. We demonstrate the application of the approach to large, cluttered natural images and at near framerate operation (16fps) on lower resolution video streams
Security-Mediated Certificateless Cryptography

We introduce the notion of security-mediated certificateless (SMC) cryptography. This allows more lightweight versions of mediated cryptography while maintaining the ability for instantaneous revocation of keys. Moreover, our solutions avoid key escrow, which has been used in all previous mediated cryptography algorithms. We provide a model of security against a fully-adaptive chosen ciphertext attacker, who may be a rogue key generation centre or any coalition of rogue users. We present a generic construction and also a concrete algorithm based on bilinear pairings. Our concrete scheme is more efficient than the identity-based mediated encryption scheme of Baek and Zheng in PKC 2004 which is provably secure in a comparable security model. In addition, our proposals can be easily extended to support distributed security mediators
On the foundations of universal sequence prediction

Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which sense universal (non-i.i.d.) sequence prediction solves various (philosophical) problems of traditional Bayesian sequence prediction. We show that Solomonoff’s model possesses many desirable properties: Fast convergence and strong bounds, and in contrast to most classical continuous prior densities has no zero p(oste)rior problem, i.e. can confirm universal hypotheses, is reparametrization and regrouping invariant, and avoids the old-evidence and updating problem. It even performs well (actually better) in non-computable environments
Building low-cost music controllers

This paper presents our work on building low-cost music controllers intended for educational and creative use. The main idea was to build an electronic music controller, including sensors and a sensor interface, on a "10 euro" budget. We have experimented with turning commercially available USB game controllers into generic sensor interfaces, and making sensors from cheap conductive materials such as latex, ink, porous materials, and video tape. Our prototype controller, the CheapStick, is comparable to interfaces built with commercially available sensors and interfaces, but at a fraction of the price.

The original publication is available at www.springerlink.co
A merging clustering algorithm for mobile ad hoc networks

ICCSA 2006: International Conference on Computational Science and Its Applications; Glasgow; United Kingdom; 8 May 2006 through 11 May 2006Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithm
Supporting resource-based analysis of task information needs

We investigate here an approach to modelling the dynamic information requirements of a user performing a number of tasks, addressing both the provision and representation of information, viewing the information as being distributed across a set of resources. From knowledge of available resources at the user interface, and task information needs we can identify whether the system provides the user with adequate support for task execution. We look at how we can use tools to help reason about these issues, and illustrate their use through an example.We also consider a full range of analyses suggested using this approach which could potentially be supported by automated reasoning systems
Making outbound route selection robust to egress point failure

Offline inter-domain outbound Traffic Engineering (TE) can be formulated as an optimization problem whose objective is to determine primary egress points for traffic exiting a domain. However, when egress point failures happen, congestion may occur if secondary egress points are not carefully determined. In this paper, we formulate a bi-level outbound TE problem in order to make outbound route selection robust to egress point failures. We propose a tabu search heuristic to solve the problem and compare the performance to three alternative approaches. Simulation results demonstrate that the tabu search heuristic achieves the best performance in terms of our optimization objectives and also keeps traffic disruption to a minimum
Using distinguishing and UIO sequences together in a checking sequence

If a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence D, then there are methods that make use of D to construct checking sequences that are much shorter than the ones that would be constructed by using only the UIO sequences for M. The methods to applied when a distinguishing sequence exists, only make use of the distinguishing sequences. In this paper we show that, even if M has a distinguishing sequence D, the UIO sequences can still be used together with D to construct shorter checking sequences
Positive decomposition of transfer functions with multiple poles

We present new results on decomposing the transfer function t(z) of a linear, asymptotically stable, discrete-time SISO system as a difference t(z) = t(1)(z) - t(2)(z) of two positive linear systems. We extend the results of [4] to a class of transfer functions t(z) with multiple poles. One of the appearing positive systems is always 1-dimensional, while the other has dimension corresponding to the location and order of the poles of t(z). Recently, in [11], a universal approach was found, providing a decomposition for any asymptotically stable t(z). Our approach here gives lower dimensions than [11] in certain cases but, unfortunately, at present it can only be applied to a relatively small class of transfer functions, and it does not yield a general algorithm
A dominating set based clustering algorithm for mobile ad hoc networks

ICCS 2006: 6th International Conference on Computational Science; Reading; United Kingdom; 28 May 2006 through 31 May 2006We propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li's [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li's [14] algorithm especially in the case of dense networks
Delays in Biological Regulatory Networks

International audienceIn this article, we propose a refinement of the modeling of genetic regulatory networks based on the approach of René Thomas. The notion of delays of activation/inhibition are added in order to specify which variable is faster affected by a change of its regulators. The formalism of linear hybrid automata is well suited to allow such refinement. We then use HyTech for two purposes: (1) to find automatically all paths from a specified initial state to another one and (2) to synthesize co nstraints on the delay parameters in order to follow any specific path
Computation of the Adjoint Matrix

The best method for computing the adjoint matrix of an order $n$ matrix in an
arbitrary commutative ring requires $O(n^{\beta+1/3}\log n \log \log n)$
operations, provided the complexity of the algorithm for multiplying two
matrices is $\gamma n^\beta+o(n^\beta)$. For a commutative domain -- and under
the same assumptions -- the complexity of the best method is ${6\gamma
n^\beta}/{(2^{\beta}-2)}+o(n^\beta)$. In the present work a new method is
presented for the computation of the adjoint matrix in a commutative domain.
Despite the fact that the number of operations required is now 1.5 times more,
than that of the best method, this new method permits a better parallelization
of the computational process and may be successfully employed for computations
in parallel computational systems
Topology of Cell-Aggregated Planar Graphs

We present new algorithm for growth of non-clustered planar graphs by
aggregation of cells with given distribution of size and constraint of
connectivity k=3 per node. The emergent graph structures are controlled by two
parameters--chemical potential of the cell aggregation and the width of the
cell size distribution. We compute several statistical properties of these
graphs--fractal dimension of the perimeter, distribution of shortest paths
between pairs of nodes and topological betweenness of nodes and links. We show
how these topological properties depend on the control parameters of the
aggregation process and discuss their relevance for the conduction of current
in self-assembled nanopatterns.Comment: 8 pages, 5 figure
Collaborative tagging as a tripartite network

We describe online collaborative communities by tripartite networks, the
nodes being persons, items and tags. We introduce projection methods in order
to uncover the structures of the networks, i.e. communities of users, genre
families...
  To do so, we focus on the correlations between the nodes, depending on their
profiles, and use percolation techniques that consist in removing less
correlated links and observing the shaping of disconnected islands. The
structuring of the network is visualised by using a tree representation. The
notion of diversity in the system is also discussed
Integrating Text Retrieval and Image Retrieval in XML Document Searching

Many XML documents contain a mixture of text and images. Images play an important role in webpage or article presentation.  However, popular In-formation Retrieval systems still largely depend on pure text retrieval as it is be-lieved that text descriptions including body text and the caption of images con-tain precise information.  On the other hand, images are more attractive and easier to understand than pure text. We assume that if the image content is used in addition to the pure text-based retrieval, the retrieval result should be better than text-only or image-only retrieval.  We test this hypothesis by doing a series of experiments using the Lonely Planet XML document collection. Two search engines, an XML document search engine using both content and structure based on text, and a content-based image search engine were used at the same time. The results generated by these two search engines were merged together to form a new result.  This paper presents our current work, initial results and vision into future work
A Software Reliability Model Based on a Geometric Sequence of Failure
  Rates

Software reliability models are an important tool in quality management and
release planning. There is a large number of different models that often
exhibit strengths in different areas. This paper proposes a model that is based
on a geometric sequence (or progression) of the failure rates of faults. This
property of the failure process was observed in practice at Siemens among
others and led to the development of the proposed model. It is described in
detail and evaluated using standard criteria. Most importantly, the model
performs constantly well over several projects in terms of its predictive
validity.Comment: 12 pages, 3 figure
Model-driven Enterprise Systems Configuration

Enterprise Systems potentially lead to significant efficiency gains but require a well-conducted configuration process. A promising idea to manage and simplify the configuration process is based on the premise of using reference models for this task. Our paper continues along this idea and delivers a two-fold contribution: first, we present a generic process for the task of model-driven Enterprise Systems configuration including the steps of (a) Specification of configurable reference models, (b) Configuration of configurable reference models, (c) Transformation of configured reference models to regular build time models, (d) Deployment of the generated build time models, (e) Controlling of implementation models to provide input to the configuration, and (f) Consolidation of implementation models to provide input to reference model specification. We discuss inputs and outputs as well as the involvement of different roles and validation mechanisms. Second, we present an instantiation case of this generic process for Enterprise Systems configuration based on Configurable EPCs
Translating Standard Process Models to BPEL

Standardisation of languages in the field of business process management has long been an elusive goal. Recently though, consensus has built around one process implementation language, namely BPEL, and two fundamentally similar process modelling notations, namely UML Activity Diagram (UML AD) and BPMN. This paper presents a technique for generating BPEL code from process models expressed in a core subset of BPMN and UML AD. This model-to-code translation is a necessary ingredient to the emergence of model-driven business process development environments based on these standards. The proposed translation has been implemented as an open source tool
A Study of the Evolution of the Representational Capabilities of Process Modeling Grammars

A plethora of process modeling techniques has been proposed over the years. One way of evaluating and comparing the scope and completeness of techniques is by way of representational analysis. The purpose of this paper is to examine how process modeling techniques have developed over the last four decades. The basis of the comparison is the Bunge-Wand-Weber representation model, a benchmark used for the analysis of grammars that purport to model the real world and the interactions within it. This paper presents a comparison of representational analyses of several popular process modeling techniques and has two main outcomes. First, it provides insights, within the boundaries of a representational analysis, into the extent to which process modeling techniques have developed over time. Second, the findings also indicate areas in which the underlying theory seems to be over-engineered or lacking in specialization
Secure Password-based Authenticated Group Key Agreement for Data-Sharing Peer-to-Peer Networks

We explore authenticated group key agreement in data-sharing Peer-to-Peer networks. We first propose a novel password-based authenticated group key agreement protocol with key confirmation. We present a formal statement of its security in a variant of the Bresson et al. security model adapted for the password-based setting. A discussion of the limitations of our protocol in the case where the group size becomes large is then presented. We conclude the paper with an enhanced version of the protocol, using a CAPTCHA technique, designed to make it more robust against online password guessing attacks