ppxscal/embedding_network huggingface dataset:
Identifying Terminal Distinguishable Languages
Authors: H. Fernau
Venue: Annals of Mathematics and Artificial Intelligence (2004)

We discuss new efficient learning algorithms for certain subclasses of regular and even linear languages based on the notion of terminal distinguishability introduced by Radhakrishnan and Nagaraja. The learning model we use is identification in the limit from positive samples as proposed by Gold and further studied by Angluin and many others. All classes we introduce in this paper are modifications of the language families TDRL (terminal distinguishable regular) and TDELL (terminal distinguishable even linear) defined by Radhakrishnan and Nagaraja. A tradeoff between the power of the language class and the time complexity of the identification algorithm is observed when the size of the underlying alphabet is considered as an additional parameter. Extending the classes of efficiently learnable languages is also important from the viewpoint of applications of the algorithms. One of these extensions is obtained basically by making use of the concept of control language which is known from formal language theory and has been employed for learning theoretic purposes in particular by Takada.
A quasi-elliptic transformation for moving boundary problems with large anisotropic deformations
Authors: Yannis Dimakopoulos, John Tsamopoulos
Venue: Journal of Computational Physics (2003)

We have developed a quasi-elliptic set of equations for generating a discretization mesh that optimally conforms to an entire domain that undergoes large deformations in primarily one direction. We have applied this method to the axisymmetric problem of the transient displacement of a viscous liquid by a high-pressure gas. The liquid initially fills completely a tube the diameter of which may be constant or change smoothly, suddenly or periodically along its finite length. Key ingredients for the success of the proposed transformation are limiting the orthogonality requirements on the mesh and employing an improved node distribution function along the deforming boundary. The retained orthogonal term along with the penalty method for the imposition of the boundary conditions overcome the inherent restrictions of a conformal transformation, producing meshes of high quality. This term also eliminates the discontinuous slopes of the coordinate lines that are normal to the free surface. These usually arise due to the harmonic transformation around highly deforming surfaces. The mathematical anisotropy in the mesh generating equations directly corresponds to the physical one, when the initially straight and normal to the axis of symmetry air/fluid interface, at the tube entrance, develops mostly along the axial direction, generating a long, open bubble. Moreover, the generalized node distribution imposes an optimal discretization of the bubble surface itself. Combining this scheme with the mixed finite element method produces a powerful tool, with extended robustness and accuracy. In order to reduce the computational cost, the resulting set of equations is solved with a non-linear, Gauss-Seidel technique and a variable time step. Specific applications of the proposed scheme are presented.
Network influences on scholarly communication in developmental dyslexia: a longitudinal follow-up
Authors: Claudia A. Perry
Venue: Journal of the American Society for Information Science and Technology (2003)

Author cocitation analysis was used to explore ongoing changes in the intellectual structure of the hybrid problem area of developmental dyslexia for the period 1994-1998, and to address ambiguities in results raised by an earlier study of these researchers for the years 1976-1993. Results suggest that: (1) discrepancies between the structure of the sociometric (personal) and author cocitation networks reflect real differences, not temporal factors; (2) differences between cocitation patterns and reports in the literature, and corresponding delays in the visibility of emerging perspectives, are likely due to the "inertia" of aggregate cocitation data and/or by shifts by neuroscience-vision researchers to publication in more prominent journals; (3) a sharp rise in link density for the neuroscience-vision subgroup indicates increased cohesiveness and growing maturation for this emerging perspective; (4) shifts in subgroup membership, link density, patterns of coauthorship, and multiple factor loadings suggest possible convergence between other subgroups in the network and identify individuals who may play boundary-spanning roles within the network; and (5) changing patterns of cocitation throughout the network suggest the increasing influence of studies relating to neurobiological mechanisms underlying dyslexia. The possible contributions of such boundary spanners in addressing the substantial information and communication challenges posed by the increased interdisciplinary character of scholarship in general also are discussed.
Bakhtinian Understanding to Web Graphics
Authors: Pavol Eliás, Andrej Ferko, Markus Grabner
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The paper introduces a new way of understanding theweb graphics phenomenon. We based it on the popularculture approach by M. Bakhtin. We introduce andexemplify the categories of ambiguous messages createdand communicated by web graphics. The discussion oncoding of ambiguous information is given. Revolution inmultimedia requires completing conventions ininformation coding. One day, the paradigm ofunambiguous meaning of coded information will beattacked by the needs of coding of ambiguous meaning.The paper proposes one way how to code the ambiguity.For transparent illustration only the comic informationis used (but not defined). One possible way ofvizualization of structure of coded comic information isshown. The implication for user interface is discussed.Sharing of ambiguous visual content is undoubtely oneof the prominent Web-based graphics applications.
The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules
Authors: Bob Carpenter
Venue: Computational Linguistics (1991)

In this paper, it is shown that the addition of simple and linguistically motivated forms of lexical rules to grammatical theories based on subcategorization lists, such as categorial grammars (CG) or head-driven phrase structure grammars (HPSG), results in a system that can generate all and only the recursively enumerable languages. The proof of this result is carried out by means of a reduction of generalized rewriting systems. Two restrictions are considered, each of which constrains the generative power of the resulting system to context-free languages.
Truncated Quadrature Rules Over $(0,\infty)$ and Nyström-Type Methods
Authors: G. Mastroianni, G. Monegato
Venue: SIAM Journal on Numerical Analysis (2003)

We propose replacing the classical Gauss--Laguerre quadrature formula by a truncated version of it, obtained by ignoring the last part of its nodes. This has the effect of obtaining optimal orders of convergence. Corresponding quadrature rules with kernels are then considered and optimal error estimates are derived also for them. These rules are finally used to define stable Nyström-type interpolants for a second kind of integral equation on the real semiaxis whose solutions decay exponentially at $\infty$.
A Multiple-Tier Model Manipulation Architecture for Enterprise Decision Making
Authors: Z. Liang, S. Li, H. Liao, H. Kang, Q. Duan, H. Zhou, H. Yang
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The usage of decision models has been given attentionby decision makers for many years. How to realisepublic-use and reuse of model, and gain the adequateinformation not only limited to local departments in thewide enterprise environment is one of the most concernedissues of decision-makers. The idea of multiple-tierframework put forward by distributed system provides ahelpful approach to this issue.This paper proposes a practical approach to modelmanipulation in a distributed decision support systembased on network technology and component technology.It implements the separation among the clients,application and data level, accordingly allows the dataand model source distributed storage and sharing formulti-departments. The method based on COM+component technology makes the model distributed in thehost computer all over the Internet/Intranet. Consequently,widespread models can be supplied to the client byapplication servers.
Pattern Avoidance and Overlap in Strings
Authors: Marianne Månsson
Venue: Combinatorics, Probability and Computing (2002)

Consider a finite alphabet &Omega; and patterns which consist of characters from &Omega;. For a given pattern w, let cor(w) denote its autocorrelation, which can be seen as a measure of the amount of overlap in w. Letting aw(n) denote the number of strings over &Omega; of length n which do not contain w as a substring, the main result of this paper is: If cor(w) > cor(w&prime;) then aw(n)&minus;aw&prime;(n) > (&#x007C;&Omega;&#x007C;&minus;1)(aw(n&minus;1)&minus;aw&prime;(n&minus;1)) for n &#x2265; N, and the value of N is given. This result confirms a conjecture by Eriksson [2], which was previously proved to be true by Cakir, Chryssaphinou and M&aring;nsson [1] when &#x007C;&Omega;&#x007C; &#x2265; 3.
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
Authors: Giulia Galbiati
Venue: Information Processing Letters (2003)

An undirected biconnected graph G with nonnegative integer lengths on the edges is given. The problem we consider is that of finding a cycle basis B of G such that the length of the longest cycle included in B is the smallest among all cycle bases of G. We first observe that Horton's algorithm [SIAM J. Comput. 16 (2) (1987) 358-366] provides a fast solution of the problem that extends the one given by Chickering et al. [Inform. Process. Lett. 54 (1995) 55-58] for uniform graphs. On the other hand we show that, if the basis is required to be fundamental, then the problem is NP-hard and cannot be approximated within 2 - ε, ∀ε > 0, even with uniform lengths, unless P = NP. This problem remains NP-hard even restricted to the class of complete graphs; in this case it cannot be approximated within 13/11 - ε, ∀ε > 0, unless P = NP; it is instead approximable within 2 in general, and within 3/2 if the triangle inequality holds.
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
Authors: Jean-Yves Vion-Dury
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many areas ranging from schema specifications, designation and transformation languages to XML query languages. Moreover, researchers have proposed elegant and tractable formal semantics [8, 9, 10, 14], fostering various works on mathematical properties and theoretical tools [10, 13, 12, 14].We propose here a novel way to consider XPath, not only for selecting nodes, but also for tree rewriting using rules. In the rule semantics we explore, XPath expressions (noted p,p') are used both on the left and on the right side (i.e. rules have the form p → p'). We believe that this proposal opens new perspectives toward building highly concise XML transformation languages on widely accepted basis.
Pricing of American options using linear complementarity formulation: methods and their evaluation
Authors: M. D. Koulisianis, T. S. Papatheodorou
Venue: Neural, Parallel Scientific Computations (2003)

We systematically evaluate five methods for the solution of the American Option Pricing Problem in its Linear Complementarity Formulation. These include Projected Successive OverRelaxation (PSOR), which is iterative and one of the most popular methods for solving this problem, and four new methods. The new methods are based on the notion of the "moving index", recently introduced by the authors, which made it possible to produce efficient direct techniques for solving this problem. Three of the new methods used in this work are direct. These are the original Moving Index method (MI), the Direct Inverse Multiplication method (DIM) and a stable version of it (SDIM). The evaluation shows that all three direct methods clearly outperform the (iterative) PSOR method. Furthermore, in order to enhance the performance of iterative schemes, we combined the moving index technique with PSOR, thus deriving an improved version of it (IPSOR), which turned out to be about twice as fast as PSOR. However IPSOR is still too slow in comparison with all three direct methods. A principal conclusion is that exploitation of the moving index approach leads to great improvements in computational speed and that (new) direct methods outperform iterative ones for this problem. Finally, amongst the three direct methods, MI seems to be superior, while DIM and SDIM offer efficient alternatives in some cases. Our evaluation is based on realistic data and instances of characteristic model problems, typically encountered in the financial markets.
Squeakers: a report on real kids using real computers to learn real math
Authors: Kim Rose
Venue: Computers in Entertainment (CIE) (2003)

What have Alan Kay and his research team been up to for the past few years? Our Spring issue of ACM Computers in Entertainment will include a report from Alan and his colleagues on their work with children and adults around the globe.In 2001 Kay founded Viewpoints Research Institute, Inc. -- a non-profit organization that serves as the umbrella for further research and development of new learning and media development systems. In 2002 Kay joined the Hewlett-Packard Company as a Sr. Fellow at HP Labs while maintaining the non-profit organization.Alan and his team have been working in their Labs and in classrooms, community-learning centers, and with universities worldwide to continue R&D of Squeak and other collaborative, online learning environments. Look for a report on their work and findings this Spring!For a sneak peek, visit http://www.squeakland.org/sqmedia/movies/html/clips.html 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
Enabling content-driven applications in resource-constrained environments
Authors: Sami Nicole Rollins
Venue:  (2003)

The vision of pervasive computing is quickly becoming a reality. Unfortunately, the range of applications supported by devices such as personal digital assistants (PDAs), digital watches, and iPod-like devices remains somewhat limited. Many current efforts promise to support services such as web browsing, personal file management, and peer content exchange on these devices. However, supporting these kinds of content-driven applications in the next-generation computing environment promises to be a challenge. Most pervasive devices are constrained with respect to resources such as bandwidth, processing power, disk space, energy supply, and even display capabilities. These constraints often render traditional technical solutions insufficient for supporting functionality such as content location, delivery, and display. In order to evolve current applications to meet the changing demands and limitations of next-generation computing environments, these challenges must be addressed. The goal of this dissertation is to develop system-level techniques to overcome resource constraints that restrict the use of pervasive devices for content-driven applications such as web browsing and peer content exchange. In particular, we focus on enabling three subfunctions of content-driven applications: content access, content management, and content exchange. First, we describe a technique to enable content access on devices with limited display capabilities. Second, we describe a technique to enable management of personal content in a power-constrained environment. Finally, we describe a technique that enables new services and improved performance in peer-style content exchange networks. This set of techniques represents a stepping stone in the evolution from the current computing environment to the next-generation, pervasive computing environment.
A method for developing dimensional data marts
Authors: Tim Chenoweth, David Schuff, Robert St. Louis
Venue: Communications of the ACM (2003)

Decision-oriented dimensional data marts are fundamentally different than transaction-oriented relational databases. A distinctive methodology and a different set of tools are required for their effective development.
Neural Network Model for Testing Stuck-at and Delay Faults in Digital Circuit
Authors: Pan Zhongliang
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The automatic test pattern generation techniques usingartificial neural networks are studied. First, an optimalneural network model of digital circuits is investigated.The network model can represent a logic circuit by theminimal number of neurons. It is shown that there existoptimal neural networks for arbitrary logic circuits. Wecan get the network parameters by solving a system oflinear equations. Second, a new energy model for delayfaults testing of digital circuits is presented, which isbased on the optimal neural network models. Third, it isshown that the test generation approach using the optimalneural network model can reduce the search space, andhas better computation efficiency if compared with thecircuit test methods using Hopfield binary neural network.
Data exchange and software integration: Interdisciplinary design challenges
Authors: Dave Wilson
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Hewlett-Packard develops and markets a family of computer-aided engineering products used by high-frequency designers to model the signal path in contemporary communications systems. As design frequencies, clock speeds and packaging densities continue to increase, more designers are finding that system and circuit simulation products need to be complemented by electromagnetic simulation software to develop models for basic circuit functionality or to characterize and compensate undesired parasitic effects. The HP High-Frequency Structure Simulator (HP HFSS) is a frequency-domain, finite element-based simulator, which enables engineers to characterize high-frequency behavior in 2D (transmission lines) and arbitrary 3D structures. Links with mechanical computer aided design (CAD) software have also become more important as the 3D structures to be analyzed by HP HFSS can involve packaging parasitics when the housing in which the electrical circuitry is enclosed becomes an influence on the signal path. Depending upon the complexity of the structure to be analyzed, HP HFSS can require hundreds of Mbytes of RAM and disk during automated adaptive solution convergence processes which determine field and circuit parameter solution results to user-specified accuracies. Although computer resource requirements will always be an important consideration for users of this type of product, another important situation to address for the future involves the exchange of data between the different simulation and modelling tools required to take design from concept through simulation to manufacture. The introduction of physical simulation tools into the traditional circuit simulation arena changes the design process flow and increases the demand for improved integration and interoperability of circuit simulators, numerical EM simulators, and mechanical CAD software. This paper provides an overview of data exchange issues in high-frequency electrical&ndash;physical&ndash;mechanical design processes.
A note on periodic review inventory model with controllable setup cost and lead time
Authors: Bor-Ren Chuang, Liang-Yuh Ouyang, Kai-Wayne Chuang
Venue: Computers and Operations Research (2004)

In this study, we investigate the periodic review inventory models with a mixture of backorders and lost sales by controlling lead time and setup cost simultaneously to reduce the inventory operating cost. It is assumed that the probability distribution of the protection interval, i.e., review period plus lead time, demand is unknown but its first two moments are given, we apply the minimax distribution free procedure to solve this problem. An algorithm to find the optimal solutions is developed. Specifically, from the results of numerical examples, it can be shown that, the significant savings can be achieved through the reductions of lead time and setup cost.
Modeling transportation problems using concepts of swarm intelligence and soft computing
Authors: Panta Lucic
Venue:  (2002)

Many real-world problems could be formulated in a way to fit the necessary form for discrete optimization. Discrete optimization problems could be solved by numerous different techniques that have appeared through years. Some of the techniques will provide optimal solution(s) to the problem and some of them will give &ldquo;good enough&rdquo; solution(s). Fundamental reason for developing techniques capable of producing solutions that are not necessarily optimal is the fact that many of discrete optimization problems are NP-complete. Metaheuristic algorithms are a common name for a set of general purpose techniques developed to provide solution to the problems belonging to discrete optimization. Mostly the techniques are based on natural metaphors. Countless problems in transportation engineering could be formulated as discrete optimization problems. Recently, researchers started studying the behavior of social insects (ants) in an attempt to use the swarm intelligence concept to develop artificial systems with the ability to search a problem's solution space in a way that is similar to the foraging search by a colony of social insects. The development of artificial systems does not entail the complete imitation of natural systems, but explores them in search of ideas for modeling. This research is partially devoted to the development of a new system based on foraging behavior of bee colonies - Bee System. The Bee System was tested through many instances of the Traveling Salesman Problem. Many transportation-engineering problems besides being of combinatorial nature are characterized by uncertainty. In order to treat these problems, the second part of the research is devoted to development of the algorithms combining existing results in the area of swarm intelligence (existing Ant System) and approximate reasoning. The proposed approach&mdash;Fuzzy Ant System is tested on the following two examples: Stochastic Vehicle Routing Problem and Schedule Synchronization in Public Transit.
On certain transformations of poly-basic bilateral hypergeometric series
Authors: Remy Y. Denis, S. N. Singh, S. P. Singh
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we have established certain transformations of basic hypergeometric series with more than one base. Some of these lead to the relationship between product of two q-series. These results, in turn, lead to very interesting transformations of bi-basic and poly-basic q-series. A few of the results which are representative of the many results obtained are presented in this article.