ppxscal/embedding_network huggingface dataset:
Confidence interval estimation of a common correlation coefficient
Authors: Lili Tian, Gregory E. Wilding
Venue: Computational Statistics Data Analysis (2008)

This paper presents a generalized variable approach for confidence interval estimation of a common correlation coefficient from several independent samples drawn from bivariate normal populations. This approach can provide one-sided bounds and two-sided confidence intervals with satisfying coverage probabilities regardless of the number of samples, sample sizes and magnitude of the common correlation coefficient while the large sample approach can be very liberal for one-sided bounds. The large sample approach generally performs well for two-sided confidence interval estimation.
Complexity Measures For Public-Key Cryptosystems
Authors: J. Grollmann
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

The first part of this paper gives results about promise problems. A "promise problem" is a formulation of a partial decision problem that is useful for describing cracking problems for public-key cryptosystems (PKCS). We prove that every NP-hard promise problem is uniformly NP-hard, and we show that a number of results and a conjecture about promise problems are equivalent to separability assertions that are the natural analogues of well-known results in classical recursion theory. The conjecture, if it is true, implies nonexistence of PKCS having NP-hard cracking problems. The second part of the paper studies more appropriate measures for PKCS. Among the results obtained are the following: One-way functions exist if an only if P /spl ne/ U and one-way functions f such that range f /spl epsiv/ P exist if and only if U /spl cap/ co-U /spl ne/ P. It will allow that there exist PKCS that cannot be cracked in polynomial time (and that satisfy other reasonable assumptions) only if P /spl ne/ U.
Essentials of Programming Languages, 3rd Edition, 3 edition
Authors: Daniel P. Friedman, Mitchell Wand
Venue:  (2008)

This book provides students with a deep, working understanding of the essential concepts of programming languages. Most of these essentials relate to the semantics, or meaning, of program elements, and the text uses interpreters (short programs that directly analyze an abstract representation of the program text) to express the semantics of many essential language elements in a way that is both clear and executable. The approach is both analytical and hands-on. The book provides views of programming languages using widely varying levels of abstraction, maintaining a clear connection between the high-level and low-level views. Exercises are a vital part of the text and are scattered throughout; the text explains the key concepts, and the exercises explore alternative designs and other issues. The complete Scheme code for all the interpreters and analyzers in the book can be found online through The MIT Press Web site. For this new edition, each chapter has been revised and many new exercises have been added. Significant additions have been made to the text, including completely new chapters on modules and continuation-passing style. Essentials of Programming Languages can be used for both graduate and undergraduate courses, and for continuing education courses for programmers.
Comparison between Lagrangian and mesoscopic Eulerian modelling approaches for inertial particles suspended in decaying isotropic turbulence
Authors: A. Kaufmann, M. Moreau, O. Simonin, J. Helie
Venue: Journal of Computational Physics (2008)

The purpose of this paper is to evaluate the accuracy of the mesoscopic approach proposed by Fevrier et al. [P. Fevrier, O. Simonin, K.D. Squires, Partitioning of particle velocities in gas-solid turbulent flows into a continuous field and a spatially uncorrelated random distribution: theoretical formalism and numerical study, J. Fluid Mech. 533 (2005) 1-46] by comparison against the Lagrangian approach for the simulation of an ensemble of non-colliding particles suspended in a decaying homogeneous isotropic turbulence given by DNS. The mesoscopic Eulerian approach involves to solve equations for a few particle PDF moments: number density, mesoscopic velocity, and random uncorrelated kinetic energy (RUE), derived from particle flow ensemble averaging conditioned by the turbulent fluid flow realization. In addition, viscosity and diffusivity closure assumptions are used to compute the unknown higher order moments which represent the mesoscopic velocity and RUE transport by the uncorrelated velocity component. A detailed comparison between the two approaches is carried out for two different values of the Stokes number based on the initial fluid Kolmogorov time scale, St"K=0.17and2.2. In order to perform reliable comparisons for the RUE local instantaneous distribution and for the mesoscopic kinetic energy spectrum, the error due to the computation method of mesoscopic quantities from Lagrangian simulation results is evaluated and minimized. A very good agreement is found between the mesoscopic Eulerian and Lagrangian predictions for the small particle Stokes number case corresponding to the smallest particle inertia. For larger particle inertia, a bulk viscous term is included in the mesoscopic velocity governing equation to avoid spurious spatial oscillation that may arise due to the inability of the numerical scheme to resolve sharp number density gradients. As a consequence, for St"K=2.2, particle number density and RUE spatial distribution predicted by the mesoscopic Eulerian approach are more smooth with respect to the ones measured from the Lagrangian simulations results. Similarly, the Eulerian approach underestimates the mesoscopic kinetic energy for the high wavenumber modes while the agreement remains very good for the low wavenumber modes. For both cases, the mesoscopic Eulerian approach provides a good prediction of the time dependent particle and fluid-particle velocity correlations measured by spatial averaging in the whole computational domain.
A multi-categorization method of text documents using fuzzy correlation analysis
Authors: Ancy P. Lin, Hao-En Chueh
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In this paper, we propose a novel method based on fuzzy correlation analysis to multicategorization of text documents. A fuzzy correlation analysis which can show the strength of linear relationship between two fuzzy attributes, and the direction of the relationship, is used to measure the strengths of relationships between text documents and the predefined categories. According to the properties of fuzzy correlation coefficient, and by using significance test, we can tell the categories with significantly positive relationship to a text document, and determine which categories to be assigned to a text document.
Optical burst switching network: A multi-layered approach
Authors: Farid Farahmand, Vinod M. Vokkarane, Jason P. Jue, Joel J. P. C. Rodrigues, Mário M. Freire
Venue: Journal of High Speed Networks (2007)

This paper defines a new multi-layered architecture for supporting optical burst switching (OBS) in an optical core network. The architecture takes into account both the control plane as well as the data plane. The paper describes the functionality and the primary protocols that are required at each layer and it explains how the layers interact with each other in the proposed architecture. This paper also identifies some of the challenges and issues surrounding the development of OBS networks, such as data burst scheduling, contention resolution mechanism, supporting QoS, and handling TCP/IP, and provides a brief survey of proposed OBS protocols.
Development of a micrometeorological model for the estimation of methane flux from paddy fields: Validation with standard direct measurements
Authors: Ranjan Mukherjee, Ujjaini Sarkar
Venue: Environmental Modelling Software (2008)

This work has focussed on the development of an indirect method for estimating methane fluxes from paddy fields and wetlands. A micrometeorological model, based on an analytical solution of the Eulerian advection-diffusion equation for vertical diffusion, has been used; model parameters include the location of the methane analyser and standard surface layer scaling factors. Flux chambers, which are commonly used for measuring methane fluxes from agricultural sources, are usually mechanically operated with a rated induced-draft fan and as such cannot replicate the real world atmospheric conditions. The results are not very reliable due to leakages along the piping and at fittings, especially when these chambers are used over a relatively rough surface like an agricultural field or a wetland. The results of the model have been compared with those from the direct method. The seasonal average methane flux calculated by the indirect method, for the cultivar type ''Sundari'', is 7.13E+05g/ha, while cultivar type ''Shatabdi'' gives a little lower value of 5.22E+05g/ha. In case of the direct chamber method also, the seasonal average methane flux for the cultivar type ''Sundari'' (6.20E+05g/ha) is more than cultivar type ''Shatabdi'' (4.84E+05g/ha). When the two methods of assessment were compared, season September-December 2004 gave r^2=0.91, RMSE=0.16 and MNB=0.13 while we got r^2=0.94, RMSE=1.22 and MNB=0.06 for the season September-December 2005. In very few experiments we could cover a huge aerial plot instead of a huge number of experiments necessary for the direct chamber method.
Crop Planning in the Presence of Production Quotas (Invited Paper)
Authors: Marius Radulescu, Gheorghita Zbaganu, Constanta Zoie Radulescu
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The aim of this paper is to present a multiple objective programming model for crop planning under uncertainty in the presence of production quotas. The model is a 0-1 programming model that uses loss functions. Starting from it, one formulates several single objective models: the average loss minimization model; the expected return maximization model; the financial risk minimization model; the loss-return-risk tradeoff model. The models take into account climate risks, market risks and several classes of land quality. They are based on loss function theory and portfolio theory. Simulations in the above mentioned models are made starting from historical data or from scenarios generated by various probability distribution functions. We analyze losses associated to the optimal production plans that try to comply to the target production quotas versus various parameters of the average loss minimization model.
Simple summaries for hashing with choices
Authors: Adam Kirsch, Michael Mitzenmacher
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In a multiple-choice hashing scheme, each item is stored in one of ≥ 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in the maximum load of the buckets. However, a lookup may now require examining each of the d locations. For applications where this cost is undesirable, Song et al. propose keeping a summary that allows one to determine which of the d locations is appropriate for each item, where the summary may allow false positives for items not in hash table. We propose alternative, simple constructions of such summaries that use less space for both the summary and the underlying hash table. Moreover, our constructions are easily analyzable and tunable.
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
Authors: Rostislav Caha, V. Koubek
Venue: Journal of Graph Theory (2006)

This paper studies techniques of finding hamiltonian paths and cycles in hypercubes and dense sets of hypercubes. This problem is, in general, easily solvable but here the problem was modified by the requirement that a set of edges has to be used in such path or cycle. The main result of this paper says that for a given n, any sufficiently large hypercube contains a hamiltonian path or cycle with prescribed n edges just when the family of the edges satisfies certain natural necessary conditions. Analogous results are presented for dense sets. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
The long-term evaluation of Fisherman in a partial-attention environment
Authors: Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seokhee Hong
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

Ambient display is a specific subfield of information visualization that only uses partial visual and cognitive attention of its users. Conducting an evaluation while drawing partial user attention is a challenging problem. Many normal information visualization evaluation methods (full attention) may not suit the evaluation of ambient displays. Inspired by concepts in the social and behavioral science, we categorize the evaluation of ambient displays into two methodologies: intrusive and non-intrusive. The major difference between these two approaches is the level of user involvement, as an intrusive evaluation requires a higher user involvement than a non-intrusive evaluation. Based on our long-term (5 months) non-intrusive evaluation of Fisherman presented in [16], this paper provides a detailed discussion of the actual technical and experimental setup of unobtrusively measurement of user gaze over a long period by using a face-tracking camera and IR sensors. In addition, this paper also demonstrates a solution to the ethical problem of using video cameras to collect data in a semi-public place. Finally, a quantitative term of "interest" measurement with three remarks is also addressed.
TrueKeys: identifying and correcting typing errors for people with motor impairments
Authors: Shaun K. Kane, Jacob O. Wobbrock, Mark Harniss, Kurt L. Johnson
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

People with motor impairments often have difficulty typing using desktop keyboards. We developed TrueKeys, a system that combines models of word frequency, keyboard layout, and typing error patterns to automatically identify and correct typing mistakes. In this paper, we describe the TrueKeys algorithm, compare its performance to existing correction algorithms, and report on a study of TrueKeys with 9 motor-impaired and 9 non-impaired participants. Running in non-interactive mode, TrueKeys performed more corrections than popular commercial and open source spell checkers. Used interactively, both motor-impaired and non-impaired users performed typing tasks significantly more accurately with TrueKeys than without. However, typing speed was reduced while TrueKeys was enabled.
File transfer in Grid applications at deployment, execution and retrieval
Authors: Françoise Baude, Denis Caromel, Mario Leyton
Venue: Multiagent and Grid Systems (2007)

In this article a three staged file transfer approach for the Grid is proposed. File transfer in the Grid can take place at three stages: deployment, user application execution, and retrieval (post-execution). Each stage has it's own environmental requirements, and therefore different techniques must be applied. The contributions presented in this article can be grouped in two. First, the integration of heterogeneous resource acquisition and file transfer protocols. This allows on-the-fly deployment and retrieval of files. Secondly, an asynchronous file transfer mechanism based on active objects, wait-by-necessity, and automatic continuation. The proposed file transfer model has been implemented using the ProActive middleware. ProActive provides, among others, a Grid infrastructure abstraction using deployment descriptors, and a programming model based on active objects with transparent futures. Finally, the proposed file transfer model is benchmarked and validated with a real case study: BLAST.
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
Authors: David Pichardie
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq module functors for constructing complex lattices using efficient data structures. The lattice signature contains a well-foundedness proof obligation which ensures termination of generic fixpoint iteration algorithms. With this library, complex well-foundedness proofs can hence be constructed in a functorial fashion. This paper demonstrates the ability of the recent Coq module system in manipulating algebraic structures and extracting efficient Ocaml implementations from them. The second contribution of this work is a generic result, based on the constructive notion of accessibility predicate, about preservation of accessibility properties when combining relations.
An application of fuzzy logic and neural network to fingerprint recognition
Authors: Ching-Tang Hsieh, Chia-Shing Hu
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Because fingerprint patterns are fuzzy in nature and ridge endings are changed easily by scares, we try to only use ridge bifurcation as fingerprints minutiae and also design a fuzzy feature image encoder by using cone membership function to represent the structure of ridge bifurcation features extracted from fingerprint. Then, we integrate the fuzzy encoder with back-propagation neural network (BPNN) as a recognizer which has variable fault tolerances for fingerprint recognition. Experimental results show that the proposed fingerprint recognition system is robust, reliable and rapid.
An application for semantic markup of biodiversity documents
Authors: Hong Cui
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We would like to demonstrate a machine-learning based semantic markup system that may be used to reformat free-text biodiversity documents in XML format for digital libraries. We named the system MARTT II. It is built on the MARTT engine described in [1], but with new components for example a parallel markup engine using the unsupervised learning algorithm described in [2]. The double Is in the name stand for Intuitive Interaction, which is our goal to make the system truly easy to use. They also mean the system supports two different automated markup engines, allowing the user to choose either one to use and make comparisons between the two.
Decision Thresholds in Functional MR Image Analysis
Authors: Michelle Liou, Hong-Ren Su, Arthur C. Tsai
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In functional magnetic resonance imaging (fMRI) studies, statistical parametric maps (SPMs) plots in an anatomical background those voxels exceeding a p-value threshold. In this study, we explore some limitations of a sole use of p-values including the false discovering rate (FDR) control over experimental-wise error rates. As a comparison, we also include the receiver-operator characteristic (ROC) curve approach for finding the optimal decision threshold. In a real data example, we apply different methods to analyzing the same data set. The results show that both p-value and ROC approaches suggest similar findings when functional images are less contaminated by noise. The FDR control of experimental-wise errors is sensitive to the proportion of voxels being classified as active. We finally discuss the use of different approaches for analyzing fMRI data.
Detecting statistical interactions with additive groves of trees
Authors: Daria Sorokina, Rich Caruana, Mirek Riedewald, Daniel Fink
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-dimensional components. When variables interact, however, their effects are not additive and must be modeled and interpreted simultaneously. We present a new approach for the problem of interaction detection. Our method is based on comparing the performance of unrestricted and restricted prediction models, where restricted models are prevented from modeling an interaction in question. We show that an additive model-based regression ensemble, Additive Groves, can be restricted appropriately for use with this framework, and thus has the right properties for accurately detecting variable interactions.
Digital protection systems response to sequence and phase components in non sinusoidal operation conditions
Authors: F. Martínez-Cárdenas, A. Medina
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Traditional open literature about protection systems documents the use of residual currents or voltages (zero sequence components) and negative sequence components of currents or voltages to detect and protect the different power system elements against unbalanced conditions, as an option to the use of phase quantities. However, literature rarely presents experimental studies showing a comparison between the sensibility of response of sequence component functions against with the sensibility of phase functions. This contribution details the results of experimental studies conducted to evaluate the sensibility of response of zero and negative sequence component protection functions under unbalanced conditions against the response to phase quantities. The studies presented are in addition performed in the presence of harmonic distortion to evaluate their impact on the protection system behaviour.
Measuring OSS quality trough centrality
Authors: Liaquat Hossain, David Zhou
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

In this study, we explore whether the degree of centrality, betweenness and density of the open source software or OSS team communications network have any bearing on the quality of the software developed. We measure the quality of OSS in terms of number of defect fixed per software promotion, the number of defects reported at different severity levels and the average number of days for a defect to be fixed for each project team. The data required to conduct the analysis needs to be of OSS projects, their team structure and also contribution of the projects user community and immediate development team. We extract the communications pattern of OSS projects development teams from online forums or message boards as the developers are usually located in different geographic areas. We use SorceForge.net for collecting relevant coordination related data for this study; which is the central resource for hosting more than 100,000 open source development projects and with over 1 million registered users that participate in the development of high profile OSS projects. The outcome of this study suggests that there is a correlation between social network characteristics and strong and poor performing projects in an OSS environment.
Positive solutions of a discrete-time descriptor system
Authors: Begoña Cantó, Carmen Coll, Elena Sánchez
Venue: International Journal of Systems Science (2008)

Discrete-time linear descriptor systems with restrictions over their trajectory are considered. In this work, some conditions required to achieve nonnegative output-response are studied. State-feedback and dynamic compensators are constructed to achieve the desired property. Finally, some applications to the Leontief economic model are given.