ppxscal/embedding_network huggingface dataset:
A Low-Cost Representation for Similarity Search of Time-Series Pattern Based on Minimum Bounding Rectangle
Authors: Mei-yu Sun, Jian-an Fang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A fundamental problem in whole sequence matching and subsequence matching is the problem of representation of time series. In the last decade many high level representations of time series have been proposed for data mining which involve a trade-off between accuracy and compactness. In this paper the author proposes a novel time series representation called GMBR based on Minimum Bounding Rectangle in which the binary idea is applied into the MBR. The experiments have been performed on synthetic, as well as real data sequences to evaluate the proposed method. The experiment demonstrates that 69-92 percent of irrelevant sequences are pruned using the proposed method.
Shape Matching Using a Novel Warping Distance Measure
Authors: Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper presents a novel distance measure, the Minimum Landscape Distance (MLD). MLD is a warping distance measure that provides a non-linear mapping between the elements in one sequence to those of another. Each element in one sequence is mapped to that with the highest neighborhood structural similarity (landscape) in the other sequence within a window. Different window sizes are tested on a number of datasets and a linear relationship between the window size and the sequence size is discovered. Experimental results obtained on the Kimia-99 and Kimia-216 datasets show that MLD is superior to the Euclidean, correlation, and Dynamic Time Warping (DTW) distance measures.
A Comparison of Methods for Recovering Intra-voxel White Matter Fiber Architecture from Clinical Diffusion Imaging Scans
Authors: Alonso Ramirez-Manzanares, Philip A. Cook, James C. Gee
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Diffusion tensor magnetic resonance imaging is widely used to study the structure of the fiber pathways of brain white matter. However, the diffusion tensor cannot capture complex intra-voxel fiber architecture such as fiber crossings. Consequently, a number of methods have been proposed to recover intra-voxel fiber bundle orientations from high angular-resolution diffusion imaging scans, which are optimized to resolve fiber crossings. In this work we study how multi-tensor, spherical deconvolution, analytical QBall and diffusion basis function methods perform under clinical scanning conditions. Our experiments indicate that it is feasible to apply some of these methods in clinical data sets.
Engineering Information Systems towards Facilitating Scrutable and Configurable Adaptation
Authors: Kevin Koidl, Owen Conlan
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

End users of Adaptive Hypermedia Systems (AHS) receive an experience that has been tailored towards their specific needs. Several AHS have produced favourable results showing benefits to the user experience [2]. However, the nature of AHS is that they tend to operate across a focused and fixed domain with a single body of content that is known a priori. This approach limits the user's freedom to choose other information sources and restricts the potential impact an adaptive systems may have. To provide more flexibility several service orientated approaches extending traditional AHS architectures have been introduced. This Ph.D. work proposes the re-engineering of information systems in order to support the portability of adaptive services, thus enabling them to personalize any information system on behalf of the user. This approach espouses user empowerment through this mobility and through a highly scrutable and configurable approach to such service-oriented adaptation.
Scaffolding On-Line Discussions with Past Discussions: An Analysis and Pilot Study of PedaBot
Authors: Jihie Kim, Erin Shaw, Sujith Ravi, Erin Tavano, Aniwat Arromratana, Pankaj Sarda
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

PedaBot is a new discussion scaffolding application designed to aid student knowledge acquisition, promote reflection about course topics and encourage student participation in discussions. It dynamically processes student discussions and presents related discussions from a knowledge base of past discussions. This paper describes the system and presents a comparative analysis of the information retrieval techniques used to respond to free-form student discussions, a combination of topic profiling, term frequency-inverse document frequency, and latent semantic analysis. Responses are presented as annotated links that students can follow and rate. We report a pilot study of PedaBot based on student viewings, student ratings, and a small survey. Initial results indicate that there is a high level of student interest in the feature and that its responses are moderately relevant to student discussions.
Some properties from q-Calculus
Authors: Daniel Florin Sofonea
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Our aim is to present new proofs of some results from q - Calculus. These results occur in many applications as physics, quantum theory, number theory, statistical mechanics, etc. Our proofs are based only on interpolation theory. See [5], [6], [7].
Multivariate Gaussian Random Number Generator Targeting Specific Resource Utilization in an FPGA
Authors: Chalermpol Saiprasert, Christos-Savvas Bouganis, George A. Constantinides
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Financial applications are one of many fields where a multivariate Gaussian random number generator plays a key role in performing computationally extensive simulations. Recent technological advances and today's requirements have led to the migration of the traditional software based multivariate Gaussian random number generator to a hardware based model. Field Programmable Gate Arrays (FPGA) are normally used as a target device due to their fine grain parallelism and reconfigurability. As well as the ability to achieve designs with high throughput it is also desirable to produce designs with the flexibility to control the resource usage in order to meet given resource constraints. This paper proposes an algorithm for a multivariate Gaussian random number generator implementation in an FPGA given a set of resources to be utilized. Experiments demonstrate the proposed algorithm's capability of producing a design that meets any given resource constraints.
Adaptive Particle Swarm Optimization
Authors: Zhi-Hui Zhan, Jun Zhang
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

This paper proposes an adaptive particle swarm optimization (APSO) with adaptive parameters and elitist learning strategy (ELS) based on the evolutionary state estimation (ESE) approach. The ESE approach develops an `evolutionary factor' by using the population distribution information and relative particle fitness information in each generation, and estimates the evolutionary state through a fuzzy classification method. According to the identified state and taking into account various effects of the algorithm-controlling parameters, adaptive control strategies are developed for the inertia weight and acceleration coefficients for faster convergence speed. Further, an adaptive `elitist learning strategy' (ELS) is designed for the best particle to jump out of possible local optima and/or to refine its accuracy, resulting in substantially improved quality of global solutions. The APSO algorithm is tested on 6 unimodal and multimodal functions, and the experimental results demonstrate that the APSO generally outperforms the compared PSOs, in terms of solution accuracy, convergence speed and algorithm reliability.
Evaluating Performance and Quality of XML-Based Similarity Joins
Authors: Leonardo Ribeiro, Theo Härder
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

A similarity join correlating fragments in XML documents, which are similar in structure and content, can be used as the core algorithm to support data cleaning and data integration tasks. For this reason, built-in support for such an operator in an XML database management system (XDBMS) is very attractive. However, similarity assessment is especially difficult on XML datasets, because structure, besides textual information, may embody variations in XML documents representing the same real-world entity. Moreover, the similarity computation is considerably more expensive for tree-structured objects and should, therefore, be a prime optimization candidate. In this paper, we explore and optimize tree-based similarity joins and analyze their performance and accuracy when embedded in native XDBMSs.
Search Based Requirements Optimisation: Existing Work and Challenges
Authors: Yuanyuan Zhang, Anthony Finkelstein, Mark Harman
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

In this position paper, we argue that search based software engineering techniques can be applied to the optimisation problem during the requirements analysis phase. Search based techniques offer significant advantages; they can be used to seek robust, scalable solutions, to perform sensitivity analysis, to yield insight and provide feedback explaining choices to the decision maker. This position paper overviews existing achievements and sets out future challenges.
Motivations and Personality Traits in Decision-Making
Authors: Etienne Sevin
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

By modifying the intensity of the motivations to test the adaptability of our real-time model of action selection, we put in evidence a relation between motivations and personality traits. We can give to the virtual human some corresponding personality traits such as greedy, lazy or dirty in order to obtain more interesting and believable virtual humans.
Sampling Hypersurfaces through Diffusion
Authors: Hariharan Narayanan, Partha Niyogi
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the problem of generating random samples from smooth hypersurfaces that may be represented as the boundary $\partial A$ of a domain A ¿ ¿ d of Euclidean space. A is specified through a membership oracle and we assume access to a blackbox that can generate uniform random samples from A. By simulating a diffusion process with a suitably chosen time constant t, we are able to construct algorithms that can generate points (approximately) on $\partial A$ according to a (approximately) uniform distribution.We have two classes of related but distinct results. First, we consider A to be a convex body whose boundary is the union of finitely many smooth pieces, and provide an algorithm (Csample) that generates (almost) uniformly random points from the surface of this body, and prove that its complexity is $O^*(\frac{d^4}{\epsilon})$ per sample, where ¿ is the variation distance. Next, we consider A to be a potentially non-convex body whose boundary is a smooth (co-dimension one) manifold with a bound on its absolute curvature and diameter. We provide an algorithm (Msample) that generates almost uniformly random points from $\partial A$, and prove that its complexity is $O(\frac{R}{\sqrt{\epsilon}\tau})$ where $\frac{1}{\tau}$ is a bound on the curvature of $\partial A$, and R is the radius of a circumscribed ball.
Thermal and Flow Characteristics of Evaporating Capillary Pore Flows Ranging from 10-mm to 10-&mu;m Diameter
Authors: H. J. Kim, K. D. Kihm
Venue: Journal of Visualization (2005)

Flow and thermal characteristics are studied for capillary pore cavities with free surfaces ranging from 10-mm to 10-&mu;m diameter. Also the effect of micro gravity is investigated. A standard finite volume method (FVM), in association with the well-established boundary fitted coordinate transformation (BFCT), is used to numerically solve the governing equations for primitive scalar variables of velocity components, pressure and temperature. Calculation results show that the convection-driven circulation and the thermocapillary phoresis effect dominate the flow and thermal fields of larger pores, bigger than 1.0-mm diameter. With decreasing pore diameter, the flow circulation diminishes and the interfacial evaporation dominates to establish nearly stratified flow patterns parallel to the pore wall. Micro-scale capillary pores, less than 1.0-mm diameter, show no flow circulation with almost horizontally stratified temperature fields. Micro gravity condition shifts this transition which is from convection-driven to interfacial flow dominated flow regime to bigger pore diameter.
Survey and Analysis on Security Control Schemes for Operational System Evaluation
Authors: Kab-Seung Kou, Seung-Yong Hur, Gang-Soo Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In developed countries, there are many concerns for security management by development of Information security system. And there is evaluate information security product or system for safe management. Therefore, some each advanced countries are achieving information security activity, and evaluate CMVP (cryptographic module validation program), CC (Common Criteria) and ISMS (Information Security Management System). And evaluation activity for operating system evaluation do that all. Also operational systems are lots of schemes for operational system assurance actability. And we see duplication and inefficiency about various information assurance schemes for operational system. Thus, we need survey and analysis on security control schemes in information assurance criteria for operational system evaluation.
Integrating social software into blended-learning courses: a delphi study of instructional-design processes
Authors: Elena Kays
Venue:  (2008)

A review of the literature revealed a lack of knowledge about which instructional-design processes and criteria are being used to make decisions about integrating social software into blended-learning courses. The purpose of this study was to identify these processes including procedures, practices and methods and the reasons instructional-design professionals choose or do not choose to use the processes. This study addressed two research questions: (a) What are the instructional-design processes that are more or less important for integrating social software into blended-learning courses? (b) What criteria are more or less important to instructional designers for integrating social software into blended learning? A three-round Delphi was conducted to investigate the processes and criteria. The Delphi panel included instructional-design professionals who are using social software in blended-learning. The respondents were professionals from the American Society for Training and Development (ASTD), Philadelphia chapter. The Delphi was selected because of the exploratory nature of the research and because the research sought to expose underlying assumptions and generate a consensus reliant on expert judgments. The consensus of the experts, after three-rounds of investigation, supported 42 processes that were more important for integrating social software into blended-learning courses. There were also five main themes that emerged. The following criteria were considered to have primary importance in determining whether a particular instructional design process would be used to integrate social software into blended-learning courses: (a) whether it has the ability to impact the quality of instruction, (b) whether it was thought to take too much time to develop, (c) whether it allowed flexibility, (d) whether the instructional designer was familiar with it, and (e) whether it was adaptable to new technologies. Based on the analysis of the findings of this study a model of attributes for the development of newinstructional-design processes emerged.
Regulation and Information Security: Can Y2K Lessons Help Us?
Authors: Jeffery E. Payne
Venue: IEEE Security and Privacy (2004)

Regulation. The mention of the word often sends shivers down the spines of business executives and IT professionals. Yet, a recent rash of crippling worms and viruses, coupled with the continued threat of a serious cyber attack on our information infrastructure, has once again elevated the notion of federally mandated security regulation to the forefront. Will regulation solve this problem?
Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder
Authors: Michael Kirkedal Thomsen, Holger Bock Axelsen
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

The design of fast arithmetic logic circuits is an important research topic for reversible and quantum computing. A special challenge in this setting is the computation of standard arithmetical functions without the generation of garbage. The CDKM-adder is a recent garbage-less reversible (quantum) ripple-carry adder. We optimize this design with a novel parallelization scheme wherein m parallel k-bit CDKM-adders are combined to form a reversible mk-bit ripple-block carry adder with logic depth $\mathcal{O}(m+k)$ for a minimal logic depth $\mathcal{O}(\sqrt{mk})$, thus improving on the mk-bit CDKM-adder logic depth $\mathcal{O}(m\cdot k)$. We also show designs for garbage-less reversible set-less-than circuits. We compare the circuit costs of the CDKM and parallel adder in measures of circuit delay, width, gate and transistor count, and find that the parallelized adder offers significant speedups at realistic word sizes with modest parallelization overhead.
Not So Many Runs in Strings
Authors: Mathieu Giraud
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Since the work of Kolpakov and Kucherov in [5,6], it is known that ρ(n), the maximal number of runs in a string, is linear in the length n of the string. A lower bound of $3/(1 + \sqrt{5})n \sim 0.927n$ has been given by Franek and al. [3,4], and upper bounds have been recently provided by Rytter, Puglisi and al., and Crochemore and Ilie (1.6n) [8.7.1]. However, very few properties are known for the ρ(n)/n function. We show here by a simple argument that lim n ¿ ¿ ρ(n)/n exists and that this limit is never reached. Moreover, we further study the asymptotic behavior of ρ p (n), the maximal number of runs with period at most p. We provide a new bound for some microruns : we show that there is no more than 0.971 n runs of period at most 9 in binary strings. Finally, this technique improves the previous best known upper bound, showing that the total number of runs in a binary string of length n is below 1.52n.
Understandability measurement in an early usability evaluation for model-driven development: an empirical study
Authors: Jose Ignacio Panach, Nelly Condori-Fernández, Francisco Valverde, Nathalie Aquino, Óscar Pastor
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Traditionally, usability has been evaluated taking into account the user's satisfaction when interacting with the software system. However, in a Model-Driven Development (MDD) process, where conceptual models are the main resource for software system generation, the usability can potentially be evaluated at earlier stages. This work goes one step further proposing that certain usability attributes, specifically internal understandability attributes, can be measured from Conceptual Models. This work presents an empirical study carried out to evaluate the proposal. The goal of this study is to evaluate whether the value measured using our proposal is related to the understandability value perceived by the end user. From the analysis of the empirical results obtained, several weaknesses of the proposal are stated.
Chronemic Cues and Sex Differences in Relational E-Mail
Authors: Andrew M. Ledbetter
Venue: Social Science Computer Review (2008)

Although major computer-mediated communication theories incorporate assumptions about the potency of chronemic cues, the claim that chronemic cues shape online message interpretation has received little empirical attention. This article reports the results of two studies designed to assess the influence of reply rate in benign and complex relational e-mail. Study 1 demonstrates that reply rate functions as an immediacy cue, with some evidence for overall sex differences in the perception of e-mail. Nevertheless, Study 2 demonstrates that reply rate is not directly associated with perceived quality of social support e-mail, instead finding a three-way interaction between emotional empathy, participant sex, and reply rate on message quality. Among the more important implications of these results is that although chronemic cues are significantly associated with online message interpretation, obtained effect sizes suggest that the influence of these cues is not as potent as some dominant computer-mediated communication theories imply.
Structure and linear-time recognition of 4-leaf powers
Authors: Andreas Brandstädt, Van Bang Le, R. Sritharan
Venue: ACM Transactions on Algorithms (TALG) (2008)

A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-leaf root of G. This notion was introduced and studied by Nishimura, Ragde, and Thilikos [2002], motivated by the search for underlying phylogenetic trees. Their results imply an O(n3)-time recognition algorithm for 4-leaf powers. Recently, Rautenbach [2006] as well as Dom et al. [2005] characterized 4-leaf powers without true twins in terms of forbidden subgraphs. We give new characterizations for 4-leaf powers and squares of trees by a complete structural analysis. As a consequence, we obtain a conceptually simple linear-time recognition of 4-leaf powers.
Learning and Memorizing Models of Logical Theories in a Hybrid Learning Device
Authors: Helmar Gust, Kai-Uwe Kühnberger, Peter Geibel
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Although there are several attempts to resolve the obvious tension between neural network learning and symbolic reasoning devices, no generally acceptable resolution of this problem is available. In this paper, we propose a hybrid neuro-symbolic architecture that bridges this gap (in one direction), first, by translating a first-order input into a variable-free topos representation and second, by learning models of logical theories on the neural level by equations induced by this topos. As a side-effect of this approach the network memorizes a whole model of the training input and allows to build the core of a framework for integrated cognition.