ppxscal/embedding_network huggingface dataset:
Design and Development of Neural Bayesian Approach for Unpredictable Stock Exchange Databases
Authors: Rashid Hafeez Khokhar, Mohd Noor Md Sap
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Predicting stock market has been a well researched topicin the field of financial engineering. However, mostmethods suffer from serious drawback due to handlinguncertain and missing continuous time-series data. Wedivide our study in two modules: data cleaning anddecision making, first module includes preprocessing ofstock market time series data mining which presents theextended form of extraction of both graphical structureand conditional probabilities of a Bayesian BeliefNetworks (BBN) from a possible incomplete stock markettime series databases. In second decision making module,we introduce Linguistic Rules-Tree (LR-Tree) which is thecombination of fuzzy logics and decision tree but LR-Treemay not be the best generalization due to over-fitting.Consequently Neuro-Pruning method has been introducedfor post pruning of LR-Tree. In Neuro-Pruning, instead ofabsolutely removing nodes, we employ a back-propagationneural network to give weights to nodes according to theirsignificance. After data cleaning and decision makingmodules we hope that, our proposed approaches will beable to handle attributes with differing costs, improvingcomputational efficiency, outperforms error-basedpruning, handle uncertain and missing continuous time-seriesdata.
Virtue-Nets: Toward a Model for Expanding Knowledge Networks
Authors: David T. Croasdell, Y. Ken Wang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Technological innovations in communications infrastructure and software applications such aselectronic mail and Internet browsers have increased the volume and complexity of available information. Changes in the demands on time and interest are so prevalent that the "attention economy" has become an observable challenge for today's knowledge society. Advances ininformation technology provide the capability to manage the information overload. This paper explores virtue-nets and their advantage in grouping data based on qualitative attributes to support knowledge work. A survey of communication technologies and theories supports theneed to develop a network infrastructure to enable intelligent business practices. A network architecture is proposed to support network connectivity using qualitative measures. The paper concludes by providing examples where this infrastructure would be useful.
Seamless Nomadic System-Aware Servants
Authors: Walter Cazzola, Dario Maggiorini
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The growing diffusion of wireless technologies is leading to deployment of small-scale and location dependent information services (LDISs). Those new services call for provisioning schemes that are able to operate in a distributed environment and do not require networkinfrastructure. This paper describes an approach to a service-oriented middleware which enables a mobile device to be aware of the surrounding environment and to transparently exploit every LDIS discovered in the coverage area of the hosting wireless network. the paperintroduces seamless nomadic system-aware (SNA) servant. SNA servants run on mobile devices, discover LDISs and are not associated with any specific service. The paper also describes the key features for the SNA servants implementation and for rendering them interoperable and cross-platform on, at least, .NET and JVM frameworks.
A User-level Multicast Performance Comparison of Scalable Coherent Interface and Myrinet Interconnects
Authors: Sarp Oral, Alan D. George
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper compares and evaluates the multicastperformance of two of the most widely deployed System-AreaNetworks (SANs), Dolphin's Scalable Coherent Interface (SCI)and Myricom's Myrinet. Both networks deliver low latency andhigh bandwidth to applications, but do not support multicast inhardware. We compared SCI and Myrinet in terms of their user-levelperformance using various software-based multicastalgorithms under various networking and multicasting scenarios.The strengths and weaknesses of each network are comparativelypresented in terms of numerous metrics, such as multicastcompletion latency, CPU utilization, link concentration andconcurrency.
BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs
Authors: José Soares, Marco Stefanes
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Abipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v ¿ V, the neighbors of v are consecutive in W. In this work we describe a BSP/CGM algorithm for finding a maximum matching in a convex bipartite graph. for p processors, the algorithm runs in time 0((|V|/p) lg(|V|/p) lg p) and it uses 0(lg p) communication rounds.
Conditional Independences among Four Random Variables III: Final Conclusion
Authors: F. Matúš
Venue: Combinatorics, Probability and Computing (1999)

The problem of probabilistic representability of semimatroids over a four-element set is solved. In this problem, one looks for all combinations of conditional independences within four random variables which can occur simultaneously. New properties of the stochastic conditional independences are deduced from conditional information inequalities. Examples of four-tuples of random variables are presented to show the probabilistic representability of three non-Ingleton semimatroids.
Adaptive vector quantization for images and hyperspectral data
Authors: James A. Storer
Venue:  (2003)

State-of-the-art image compression schemes can often be subdivided into two distinct and independent phases: first data modeling and/or transform coding of the original data followed next by entropy coding (e.g. JBIG, JBIG2, JPEG-LS, JPEG, Vector Quantization). In the first part of this thesis, instead, we will focus our attention to the extension of certain one-dimensional compression methods (i.e., Lempel-Ziv methods) to the two-dimensional domain via a blending with purely two-dimensional techniques (i.e., Vector Quantization). We will study their performance, theoretical bounds, practical improvements and how they behave in the presence of channel errors. In the second part we will study the problem of compressing three-dimensional data generated by electro-optic remote sensors. New algorithms are proposed that implement a novel adaptive version of vector quantization to reduce the high-dimension problem; experimental results are presented.
Evaluation of Several Nonparametric Bootstrap Methods to Estimate Confidence Intervals for Software Metrics
Authors: Skylar Lei, Michael R. Smith
Venue: IEEE Transactions on Software Engineering (2003)

Sample statistics and model parameters can be used to infer the properties, or characteristics, of the underlying population in typical data-analytic situations. Confidence intervals can provide an estimate of the range within which the true value of the statistic lies. A narrow confidence interval implies low variability of the statistic, justifying a strong conclusion made from the analysis. Many statistics used in software metrics analysis do not come with theoretical formulas to allow such accuracy assessment. The Efron bootstrap statistical analysis appears to address this weakness. In this paper, we present an empirical analysis of the reliability of several Efron nonparametric bootstrap methods in assessing the accuracy of sample statistics in the context of software metrics. A brief review on the basic concept of various methods available for the estimation of statistical errors is provided, with the stated advantages of the Efron bootstrap discussed. Validations of several different bootstrap algorithms are performed across basic software metrics in both simulated and industrial software engineering contexts. It was found that the 90 percent confidence intervals for mean, median, and Spearman correlation coefficients were accurately predicted. The 90 percent confidence intervals for the variance and Pearson correlation coefficients were typically underestimated (60-70 percent confidence interval), and those for skewness and kurtosis overestimated (98-100 percent confidence interval). It was found that the Bias-corrected and accelerated bootstrap approach gave the most consistent confidence intervals, but its accuracy depended on the metric examined. A method for correcting the under-/overestimation of bootstrap confidence intervals for small data sets is suggested, but the success of the approach was found to be inconsistent across the tested metrics.
Subgraphs of graphs on surfaces with high representativity
Authors: Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota
Venue: Journal of Combinatorial Theory Series B (2003)

Let G be a 3-connected graph with n vertices on a non-spherical closed surface Fk2 of Euler genus k with sufficiently large representativity. In this paper, we first study a new cutting method which produces a spanning planar subgraph of G with a certain good property. This is used to show that such a graph G has a spanning 4-tree with at most max{2k - 5, 0} vertices of degree 4. Using this result, we prove that for any integer t, if n is sufficiently large, then G has a connected subgraph with t vertices whose degree sum is at most 8t - 1. We also give a nearly sharp bound for the projective plane, torus and Klein bottle. Furthermore, using our cutting method, we prove that a 3-connected graph G on Fk2 with high representativity has a 3-walk in which at most max{2k - 4, 0} vertices are visited three times, and an 8-covering with at most max{4k - 8, 0} vertices of degree 7 or 8. Moreover, a 4-connected G has a 4-covering with at most max{4k - 6, 0} vertices of degree 4.
An investigation of parental perceptions of and attitudes toward computer use in two predominantly hispanic communities in the southwestern border region
Authors: Shirley Sung Davis
Venue:  (2003)

The purposes of this research were to identify the parental perceptions of and attitudes toward their children's computer use, what their children need to know about computer technology, and what kind of support the parents need from the schools in the Southwestern Border Region of the United States. This region is home to a population characterized by poverty, residing in largely rural settings. Bicultural diversity is reflected in the schools, with a majority of the students being Hispanic. Participating parents were from two elementary schools and one middle school in the region. Qualitative research analysis techniques were used to triangulate discussions by 26 participants in five parent focus groups with the responses to technology surveys given by parents, teachers, and students. All data were coded, categorized, and analyzed using a qualitative research software program. Survey data on parents', teachers', and students' technology use were triangulated with findings from the focus groups. Themes emerging from these data were (a) digital divide issues, (b) the desires of respondents from all socioeconomic groups for technology training, (c) respondents' fears to use the Internet, and (d) respondents' concerns about children spending too much time on computers. The following conclusions were reached: (1) Poverty prevented parents from getting computers for their children to use at home. Parents of all ethnic backgrounds wanted their children to have more computer technology exposure. They viewed computer skills as an important part of their children's education. (2) Without experience with computers, the parents were not able to understand what they wanted their children to learn about technology. (3) The parents without computers had more fears about Internet usage than did the parents who had access to computers. (4) Parents from all ethnic backgrounds and income levels expressed the desire to have free computer training with their children in their schools. (5) The digital divide problem was not an ethnic issue; rather, it was a socioeconomic status issue: The more money parents had, the more opportunity there was for their children to have computer ownership. Recommendations for field practice and for further research are included.
Knowledge-based personalization
Authors: Tamara Babaian
Venue: Information management: support systems & multimedia technology (2003)

We present a novel method for software personalization. Personalization is understood broadly as a set of mechanisms by which an application is tailored to a particular end user and his or her task. The presented method outlined here is motivated by and remedies a few widely recognized problems in the way customization is carried out. The proposed method has been used in a collaborative system called Writer's Aid. Itrelies on a declarative specification of preconditions and effects of system's actions and applies artificial intelligence, automated reasoning, and planning framework and techniques to dynamically recognize the lack or availability of the personal information at the precise time when it affects a system action and initiates an interaction with the user aimed at eliciting this information in case it has not yet been specified.
Comparing Bayes model averaging and stacking when model approximation error cannot be ignored
Authors: Bertrand Clarke
Venue: The Journal of Machine Learning Research (2003)

We compare Bayes Model Averaging, BMA, to a non-Bayes form of model averaging called stacking. In stacking, the weights are no longer posterior probabilities of models; they are obtained by a technique based on cross-validation. When the correct data generating model (DGM) is on the list of models under consideration BMA is never worse than stacking and often is demonstrably better, provided that the noise level is of order commensurate with the coefficients and explanatory variables. Here, however, we focus on the case that the correct DGM is not on the model list and may not be well approximated by the elements on the model list. We give a sequence of computed examples by choosing model lists and DGM's to contrast the risk performance of stacking and BMA. In the first examples, the model lists are chosen to reflect geometric principles that should give good performance. In these cases, stacking typically outperforms BMA, sometimes by a wide margin. In the second set of examples we examine how stacking and BMA perform when the model list includes all subsets of a set of potential predictors. When we standardize the size of terms and coefficients in this setting, we find that BMA outperforms stacking when the deviant terms in the DGM 'point' in directions accommodated by the model list but that when the deviant term points outside the model list stacking seems to do better. Overall, our results suggest the stacking has better robustness properties than BMA in the most important settings.
Learning dependency translation models as collections of finite-state head transducers
Authors: Hiyan Alshawi, Shona Douglas, Srinivas Bangalore
Venue: Computational Linguistics (2000)

The paper defines weighted head transducers, finite-state machines that perform middle-out string transduction. These transducers are strictly more expressive than the special case of standard left-to-right finite-state transducers. Dependency transduction models are then defined as collections of weighted head transducers that are applied hierarchically. A dynamic programming search algorithm is described for finding the optimal transduction of an input string with respect to a dependency transduction model. A method for automatically training a dependency transduction model from a set of input-output example strings is presented. The method first searches for hierarchical alignments of the training examples guided by correlation statistics, and then constructs the transitions of head transducers that are consistent with these alignments. Experimental results are given for applying the training method to translation from English to Spanish and Japanese.
Card Shuffling and the Polynomial Numerical Hull of Degree \emk
Authors: Anne Greenbaum
Venue: SIAM Journal on Scientific Computing (2003)

The polynomial numerical hull of degree k is a set in the complex plane associated with a matrix A that is designed to give more information than the spectrum can provide about the behavior of A under the action of polynomials. We give an example of the application of the polynomial numerical hull of degree k to explain the cutoff phenomenon that is often observed in Markov processes. In particular, we consider the much-publicized result that it takes seven riffle shuffles to randomize a deck of cards [D. Bayer and P. Diaconis, Ann. Appl. Probab., 2 (1992), pp. 294--313]. While this result cannot be explained by eigenvalues, it is shown to be very well predicted by the 1-norm polynomial numerical hulls of various degrees associated with a matrix derived from the probability transition matrix.
An application of a context-aware file system
Authors: Christopher K. Hess, Roy H. Campbell
Venue: Personal and Ubiquitous Computing (2003)

Ubiquitous computing environments stretch the requirements of traditional infrastructures used to facilitate the development of applications. Activities are often supported by collections of applications, some of which are automatically launched with little or no human intervention. This task-driven environment challenges existing application construction and data management techniques. In this paper, we describe a file system that organises application data based on contextual information, imports user data based on its physical presence, and supports format conversions to accommodate device context. We describe several applications that we have developed within our ubiquitous computing infrastructure and show how they leverage the novel features of our file system to simplify their complexity.
A spectral element semi-Lagrangian (SESL) method for the spherical shallow water equations
Authors: F. X. Giraldo, J. B. Perot, P. F. Fischer
Venue: Journal of Computational Physics (2003)

A spectral element semi-Lagrangian (SESL) method for the shallow water equations on the sphere is presented. The sphere is discretized using a hexahedral grid although any grid imaginable can be used as long as it is comprised of quadrilaterals. The equations are written in Cartesian coordinates to eliminate the pole singularity which plagues the equations in spherical coordinates. In a previous paper [Int. J. Numer. Methods Fluids 35 (2001) 869] we showed how to construct an explicit Eulerian spectral element (SE) model on the sphere; we now extend this work to a semi-Lagrangian formulation. The novelty of the Lagrangian formulation presented is that the high order SE basis functions are used as the interpolation functions for evaluating the values at the Lagrangian departure points. This makes the method not only high order accurate but quite general and thus applicable to unstructured grids and portable to distributed memory computers. The equations are discretized fully implicitly in time in order to avoid having to interpolate derivatives at departure points. By incorporating the Coriolis terms into the Lagrangian derivative, the block LU decomposition of the equations results in a symmetric positive-definite pseudo-Helmholtz operator which we solve using the generalized minimum residual method (GMRES) with a fast projection method [Comput. Methods Appl. Mech. Eng. 163 (1998) 193]. Results for eight test cases are presented to confirm the accuracy and stability of the method. These results show that SESL yields the same accuracy as an Eulerian spectral element semi-implicit (SESI) while allowing for time-steps 10 times as large and being up to 70% more efficient.
Computer-assisted instruction: the application of theorem-proving to adaptive response analysis
Authors: Adele Goldberg
Venue: ACM SIGCUE Outlook (1973)

In a CAI system for teachig elementary mathematical logic, in order to provide tutorial advice similar to the suggestions a human tutor might give, a theorem-prover is employed as a proof-analyzer to generate appropriate dialogue with students who need help with a proof. It is shows that the heuristically programmed theorem-prover, by embodying techniques thought to be used by the students, constructs derivations for expressions in the elementary theory of Abelian groups within the constraints on rule usage imposed on these students. To demonstrate its capabilities, the theoremprover was tested on a list of theorems and problems chosen arbitrarily from a standard curriculum in elementary algebra. The proof-analyzer mocks the adaptive behavior of a human tutor; it can determine relevant hints when a student requires help in completing a soultion paths. The proof-analyzer is incorporated in a new instructional system or mathematical logic, an examle of a "student-oriented" CAI system which emphasizes active participation of the students with the computer by providing methods by which a student can initially specify or extend the axiomatic theory he is studying, while still retaining the error analysis and teaching facilities of an interactive proof-checker. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Handwritten slides on a tabletPC in a discrete mathematics course
Authors: Evan Golub
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

There are a wide variety of ways to present information at the front of a classroom. These include chalk on a blackboard, markers on a whiteboard, pens on transparencies, and computer projection systems. While computer-based presentation systems provide many opportunities both in and out of the classroom, there may also be many limitations. In-class spontaneity and dynamic exposition might be restricted. Class preparation time might increase dramatically when compared to the amount required to prepare handwritten materials. Certain presentation techniques may no longer be available. This paper will introduce a computer-based presentation system modeled on handwritten transparencies. It will then discuss how it addresses the above issues as well as how it can be used in and out of the classroom. These will be explored in the context of its use while teaching an undergraduate discrete mathematics course.
MACHETE: synthesis of sequential machines for easy testability
Authors: Bapiraju Vinnakota, Niraj K. Jha
Venue: Proceedings of the conference on European design automation (1991)

Test generation for sequential machines is known to be computationally expensive. We present a scheme, called MACHETE (MACHines for Easy TEstability), for synthesizing easily testable architectures for sequential machines by adding some state transitions and their associated output vectors to the state transition table. This is done to make the internal states of the machine easily controllable as well as observable. This can enable us to obtain a high fault coverage in reasonable amounts of CPU time.