ppxscal/embedding_network huggingface dataset:
Spatial data analysis of finite strain data across a thrust sheet using R
Authors: N. Iranpanah, M. Mohammadzadeh, M. Q. Vahidi Asl, A. Yassaghi
Venue: Computers Geosciences (2009)

In this paper, the finite strain data (FSD) collected from a Sheeprock thrust sheet in Utah are spatially analyzed. The steps and special manner of spatial analysis of these data are examined due to the importance and influence of data characteristics on spatial prediction accuracy. To do so, the exponential and spherical parametric variogram models with and without nugget effects are fitted by maximum likelihood and restricted maximum likelihood methods on original and normally transformed data. We also fitted other models to classical and robust empirical variograms by ordinary least squares and weighted least squares methods. Next, these models are applied on data and edited data by using robust kriging. Finally, the accuracy of the obtained results are compared with Mukul's model by cross-validation in order to choose the best variogram model for FSD and also specify the importance of attention to characteristics of the data in spatial data analysis.
Analysis of classification margin for classification accuracy with applications
Authors: Qutang Cai, Changshui Zhang, Chunyi Peng
Venue: Neurocomputing (2009)

Classification margin is commonly used for describing the classification capability of a committee of classifiers. In this paper, we study the relation between classification margin and misclassification error, focusing on exploring useful information about misclassification error from the known classification margin. We propose a max-min type bound concerning the minimal misclassification rate, and present some useful properties. Finally, we seek the way to improve classification performance by incorporating the classification margins, and devise an algorithm for improving average classification accuracy based on the proposed bound. Experimental results show the effectiveness of the proposed algorithm and also validate our analytic results.
The internet usages and exploring capability: a case study on regional culture knowledge of primary school students in Taiwan
Authors: Che-Chern Lin, Wen-Shun Chen, Shen-Chien Chen
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we present a case study to discuss the internet usages of primary school students and the exploring capabilities of using internet on regional culture course. 226 students of grade five from a primary school in Taiwan were selected as samples. We designed a questionnaire to analyze the internet usages and behaviors of these sampled students including time spending in internet, frequency, location, and reason of using internet, internet activity, and recognition of internet functionality. We designed questions for the regional culture test and conducted experiments to find the relationships between the internet usages and the scores of the regional culture test. We also discuss the relationships between the internet usages and four main learning fields in primary schools including language, mathematics, nature science and living technology, and sociology. Concluding remarks and the suggestions for future studies are also provided at the end of this paper.
Projected equation methods for approximate solution of large linear systems
Authors: Dimitri P. Bertsekas, Huizhen Yu
Venue: Journal of Computational and Applied Mathematics (2009)

We consider linear systems of equations and solution approximations derived by projection on a low-dimensional subspace. We propose stochastic iterative algorithms, based on simulation, which converge to the approximate solution and are suitable for very large-dimensional problems. The algorithms are extensions of recent approximate dynamic programming methods, known as temporal difference methods, which solve a projected form of Bellman's equation by using simulation-based approximations to this equation, or by using a projected value iteration method.
Determination of sympathovagal balance in ventricular tachiarrythmia patients with implanted cardioverter defibrillators using wavelet transform and MLPNN
Authors: Suleyman Bilgin, Omer Halil Çolak, Ovunc Polat, Etem Koklukaya
Venue: Digital Signal Processing (2009)

HRV is a nonstationary signal that includes sympathovagal balance (SB) information related to LF/HF ratio between the sympathetic and parasympathetic nervous systems. In this paper, a solution based on Daubechies wavelet transform (dbN) and multilayer perceptron neural network (MLPNN) has been presented for the determination of SB. HRV database obtained MIT-BIH arrhythmia database consisting of pairs of RR interval time series, recorded by implanted cardioverter defibrillators in 78 subjects. RMS values of approximation and detail components (Arms and Drms) obtained from dbN wavelet transform of HRV signals have been used as training data for MLPNN. Trains were realized in 5 different dbN with only Arms components, only Drms components and both of them and results were compared. Train accuracy and test accuracy results have been reached very successful percentage values that might be valuable for clinical applications.
Towards a Theory of Extractable Functions
Authors: Ran Canetti, Ronny Ramzi Dakdouk
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledge is captured by the existence of an efficient extractor that recovers the preimage from the internal state of the adversary. Extractability of functions was defined by the authors (ICALP'08) in the context of perfectly one-way functions. It can be regarded as an abstraction from specific knowledge assumptions, such as the Knowledge of Exponent assumption (Hada and Tanaka, Crypto 1998).We initiate a more general study of extractable functions. We explore two different approaches. The first approach is aimed at understanding the concept of extractability in of itself; in particular we demonstrate that a weak notion of extraction implies a strong one, and make rigorous the intuition that extraction and obfuscation are complementary notions.In the second approach, we study the possibility of constructing cryptographic primitives from simpler or weaker ones while maintaining extractability. Results are generally positive. Specifically, we show that several cryptographic reductions are either "knowledge-preserving" or can be modified to be so. Examples include reductions from extractable weak one-way functions to extractable strong ones, from extractable pseudorandom generators to extractable pseudorandom functions, and from extractable one-way functions to extractable commitments. Other questions, such as constructing extractable pseudorandom generators from extractable one way functions, remain open.
A Jacobian-free Newton-Krylov algorithm for compressible turbulent fluid flows
Authors: Todd T. Chisholm, David W. Zingg
Venue: Journal of Computational Physics (2009)

Despite becoming increasingly popular in many branches of computational physics, Jacobian-free Newton-Krylov (JFNK) methods have not become the approach of choice in the solution of the compressible Navier-Stokes equations for turbulent aerodynamic flows. To a degree, this is related to some subtle aspects of JFNK methods that are not well understood, and, if poorly handled, can lead to inefficient and unreliable performance. These are described here, along with strategies for addressing them, leading to an efficient JFNK algorithm for turbulent aerodynamic flows applicable to multi-block structured grids and a one-equation turbulence model. Development of globalization strategies for field-equation turbulence models represents one of the key contributions of the paper. Numerous examples of subsonic and transonic flows over single and multi-element airfoils are presented in order to demonstrate the efficiency and reliability of the algorithm. In addition, a number of guidelines are presented to aid in diagnosing problems with JFNK algorithms.
A software framework for fine grain parallelization of cellular models with OpenMP: Application to fire spread
Authors: Eric Innocenti, Xavier Silvani, Alexandre Muzy, David R. C. Hill
Venue: Environmental Modelling Software (2009)

We are dealing here with the parallelization of fire spreading simulations following detailed physical experiments. The proposal presented in this paper has been tested and evaluated in collaboration with physicists to meet their requirements in terms of both performance and precision. For this purpose, an object-oriented framework using two abstraction levels has been developed. A first level considers the simulation as a global phenomenon which evolves in space and time. A local level describes the phenomena occurring on elementary parts of the domain. In order to develop an extensible and modular architecture, the cellular automata paradigm, the DEVS discrete event system formalism and design patterns have been used. Simulation treatments are limited to a set of active elements to improve execution times. A new kind of model, called Active-DEVS is then specified. The model is computed with a fine grain parallelization very efficient for present day multi-core processors which are elementary units of modern computing clusters and computing grids. In this paper, the parallelization with Open MultiProcessing (OpenMP) standard directives on Symmetric MultiProcessing (SMP) architectures is discussed and the efficiency of the retained solution is studied.
Quantified Equilibrium Logic and Foundations for Answer Set Programs
Authors: David Pearce, Agustín Valverde
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

QHT is a first-order super-intuitionistic logic that provides a foundation for answer set programming (ASP) and a useful tool for analysing and transforming non-ground programs. We recall some properties of QHT and its nonmonotonic extension, quantified equilibrium logic (QEL). We show how the proof theory of QHT can be used to extend to non-ground programs previous results on the completeness of &theta;-subsumption. We also establish a reduction of QHT to classical logic and show how this can be used to obtain and extend classical encodings for concepts such as the strong equivalence of programs and theories. We pay special attention to a class of general (disjunctive) logic programs that capture all universal theories in QEL.
Super-fit control adaptation in memetic differential evolution frameworks
Authors: Andrea Caponio, Ferrante Neri, Ville Tirronen
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

This paper proposes the super-fit memetic differential evolution (SFMDE). This algorithm employs a differential evolution (DE) framework hybridized with three meta-heuristics, each having different roles and features. Particle Swarm Optimization assists the DE in the beginning of the optimization process by helping to generate a super-fit individual. The two other meta-heuristics are local searchers adaptively coordinated by means of an index measuring quality of the super-fit individual with respect to the rest of the population. The choice of the local searcher and its application is then executed by means of a probabilistic scheme which makes use of the generalized beta distribution. These two local searchers are the Nelder mead algorithm and the Rosenbrock Algorithm. The SFMDE has been tested on two engineering problems; the first application is the optimal control drive design for a direct current (DC) motor, the second is the design of a digital filter for image processing purposes. Numerical results show that the SFMDE is a flexible and promising approach which has a high performance standard in terms of both final solutions detected and convergence speed.
QoS-Enabled Information Transport: Yet Another Operator Service
Authors: Antonio Cuevas, Jose Ignacio Moreno, Rui Aguiar
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

IMS and other service platforms embrace the current trend of respecting the Internet paradigm of transport and application layers separation, yet building interfaces between both domains. We push forward this concept and consider "information transport" as any other service. By information transport service we refer to the task of making the information flow from one end of the network to the other. Descriptive factors of this service are the possible Quality of Service (QoS) warranties (e.g.bandwidth) and the tariffs, not necessarily exposed to the end user, but yes impacting the commercial parameters. AAA (Authentication, Authorization and Accounting) and composition systems in Service Platforms will then deal with "information transport" as with any other (billable) service like downloading an mp3 song. One of the main advantages is the widened applicability. Existing service management and composition techniques could be employed resulting on increased flexibility, new business possibilities and a better end service. We also discuss a Next Generation Network (NGN) architecture illustrating our approach.
An effective learning environment for teaching problem solving in software architecture
Authors: Kirti Garg, Vasudeva Varma
Venue: Proceedings of the 2nd India software engineering conference (2009)

A software architect engages in solving Software Engineering (SE) problems throughout his career. Thus inculcating problem solving skills should be one of the learning objectives of SE academic and training programs. But structured problem solving is usually latent or missing in most of the current curriculum. In this paper, we describe an effective learning environment for SE education and training with problem solving as an integral part. The learning environment is in accordance with Learning Sciences theory and practices. Our study strengthens our belief that such a problem based environment will help to create professionals well versed with theory and practice of software architecture and problem solving, and thus more productive and useful for the industry.
Analysis of communication delay bounds for network on chips
Authors: Yue Qian, Zhonghai Lu, Wenhua Dou
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource contention scenarios. In this paper, we present an analysis technique to derive the communication delay bound for individual flows. Based on a network contention model, this technique, which is topology independent, employs the network calculus theory to first compute the equivalent service curve for individual flows and then calculate their packet delay bound. To exemplify our method, we also present the derivation of a closed-form formula to calculate the delay bound for all-to-one gather communication. Our experimental results demonstrate the theoretical bounds are correct and tight.
An integrated network-based mechanistic model for tumor growth dynamics under drug administration
Authors: Danilo Ribeiro, Jose M. Pinto
Venue: Computers in Biology and Medicine (2009)

Cancer chemotherapy complexity ranges from the routes that the drug must follow before reaching the tumor site (pharmacokinetics), to the drug effects on tumor depletion (pharmacodynamics). Previous researchers, in their majority, have focused either on the pharmacokinetics (PK) or on the pharmacodynamics (PD) aspects of chemotherapy. Moreover, models that account for the molecular mechanisms of cancer development have limited scope in addressing the protein signals involved in tumor progression. For instance, the recently developed models for the p53 network, for which a number of mutations have been reported, must be integrated for further understanding of the disease. Here, we propose an integrated model that is composed of a compartmental PK/PD representation for drug therapy that incorporates p53 and cell cycle regulation. In particular, the dynamics of p53 and its network components, such as Mdm2, pRb, cyclin-cdk's, are modeled under drug administration. The results show that the proposed model is a realistic representation of the physiological expectations in a multi-scale, integrative approach.
Optimized point cloud triangulation for 3D scanning systems
Authors: Robert Sitnik, Maciej Karaszewski
Venue: Machine Graphics Vision International Journal (2008)

This article deals with a new Mesh3D algorithm used for triangulation of point clouds obtained from real 3D objects via optical scanning systems. The algorithm is characterized by a high level of automation. Triangle meshes obtained by using this algorithm are of a better quality than those created through the application of popular algorithms. Procedures used for areas with large shape gradients allow us to obtain a higher accuracy of a geometric object representation. It is also a very efficient method even when the procedure of point clouds smoothing is applied initially. The implementation of this kind of a complex mesh quality assessment system enables us to improve the smoothness and continuity of the mesh, which allows us to obtain more realistic and visually better reconstructions of objects.
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
Authors: Ali Çivril, Malik Magdon-Ismail
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Given a matrix A &epsilon; ℝ m &times;n of rank r, and an integer k < r, the top k singular vectors provide the best rank-k approximation to A. When the columns of A have specific meaning, it is desirable to find (provably) "good" approximations to A k which use only a small number of columns in A. Proposed solutions to this problem have thus far focused on randomized algorithms. Our main result is a simple greedy deterministic algorithm with guarantees on the performance and the number of columns chosen. Specifically, our greedy algorithm chooses c columns from A with $c=O \left({{k^2\log k} \over {\epsilon^2}} \mu^2(A)\ln\left({\sqrt{k}\|{A_k}\|_F} \over {\epsilon}\|{A-A_k}\|_F\right)\right)$ such that $${\|A-C_{gr}C_{gr}^+A\|}_F \leq \left(1+\epsilon \right)\|{A-A_k}_F,$$ where C gr is the matrix composed of the c columns, $C_{gr}^+$ is the pseudo-inverse of C gr ($C_{gr}C_{gr}^+A$ is the best reconstruction of A from C gr), and &frac14;(A) is a measure of the coherence in the normalized columns of A. The running time of the algorithm is O(SVD(A k) + mnc) where SVD(A k) is the running time complexity of computing the first k singular vectors of A. To the best of our knowledge, this is the first deterministic algorithm with performance guarantees on the number of columns and a (1 + &epsilon;) approximation ratio in Frobenius norm. The algorithm is quite simple and intuitive and is obtained by combining a generalization of the well known sparse approximation problem from information theory with an existence result on the possibility of sparse approximation. Tightening the analysis along either of these two dimensions would yield improved results.
Prevention in a Chip of EMI Noise Caused by X'tal Oscillator
Authors: Atsushi Kurokawa, Hiroshi Fujita, Tetsuya Ibe
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Developing LSIs with EMI suppression, particularly for use in automobiles, is important for improving warranties and customer acquisition. First, we describe that the measures against EMI noise caused by a X'tal oscillator are important. Next, we present a practical method for analyzing the noise with models of the inside and outside of a chip. In addition, we propose a within-chip measure against EMI noise that takes chip cost into account. The noise is suppressed by using an appropriate resistance and capacitance on the power line. Simulation results demonstrated the method's effectiveness in suppressing noise.
Yet Another Map Algebra
Authors: João Pedro Cerveira Cordeiro, Gilberto Câmara, Ubirajara Moura De Freitas, Felipe Almeida
Venue: Geoinformatica (2009)

This paper describes features of a language approach for map algebra based on the use of algebraic expressions that satisfy a concise formalism. To be consistent with formal approaches such as geoalgebra and image algebra, the proposed algebraic expressions are suitable not only for the usual modeling of layers but also to describe variable neighborhoods and zones. As a compromise between language and implementation issues we present an implementation strategy based on the theory of automata. The result is an efficient way of implementing map algebra that simplifies its use on environmental and dynamic models without going too far from its well-known paradigm.
Mining frequent trajectory patterns in spatial-temporal databases
Authors: Anthony J. T. Lee, Yi-An Chen, Weng-Chong Ip
Venue: Information Sciences: an International Journal (2009)

In this paper, we propose an efficient graph-based mining (GBM) algorithm for mining the frequent trajectory patterns in a spatial-temporal database. The proposed method comprises two phases. First, we scan the database once to generate a mapping graph and trajectory information lists (TI-lists). Then, we traverse the mapping graph in a depth-first search manner to mine all frequent trajectory patterns in the database. By using the mapping graph and TI-lists, the GBM algorithm can localize support counting and pattern extension in a small number of TI-lists. Moreover, it utilizes the adjacency property to reduce the search space. Therefore, our proposed method can efficiently mine the frequent trajectory patterns in the database. The experimental results show that it outperforms the Apriori-based and PrefixSpan-based methods by more than one order of magnitude.
Post-silicon timing characterization by compressed sensing
Authors: Farinaz Koushanfar, Petros Boufounos, Davood Shamsi
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We address post-silicon characterization of the unique gate delays and their timing distributions on each manufactured IC. Our proposed approach is based upon the new theory of compressed sensing. The first step in performing timing measurements is to find the sensitizable paths by traditional testing methods. Next, we show that the timing variations are sparse in the wavelet domain. The sparsity is exploited for estimation of the gate delays using the compressed sensing theory. This estimation method requires significantly less number of timing measurements compared to the case where the dependence between the gate delays is not directly integrated within the estimation framework. We discuss a number of applications for the new post-silicon timing characterization method. Experimental results on benchmark circuits show that using compressed sensing theory can characterize the post-silicon variations with a mean accurately of 95% in the pertinent sparse basis.
Heaven's mirror: mirror illusion realised outside of the mirror
Authors: Seunghyun Woo, Takafumi Aoki, Hironori Mitake, Naoki Hashimoto, Makoto Sato
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

With this system, users experience a mirror illusion through three modalities of feedback (haptic, visual, and auditory) and perceive a boundary-less transition between the real world and the world inside the mirror.