ppxscal/embedding_network huggingface dataset:
Combination of words and word categories in varigram histories
Authors: R. Blasig
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper presents a new kind of language model: category/word varigrams. This special model type permits a tight integration of word-based and category-based modeling of word sequences. Any succession of words and word categories may be employed to describe a given word history. This provides a much greater flexibility than previous combinations of word-based and category-based language models. Experiments on the WSJO corpus and the 1994 ARPA evaluation data indicate that the category/word varigram yields a perplexity reduction of up to 10 percent as compared to a word varigram of the same size, and improves the word error rate (WER) by 7 percent. Compared to a linear interpolation of a word-based and a category-based n-gram, the WER improvement is about 4 percent.
New adaptive interior point algorithms for linear optimization
Authors: Maziar Salahi
Venue:  (2006)

Interior Point Methods (IPMs) have shown their power in solving large scale optimization problems. In this thesis, using the notion of self-regularity, various classes of algorithms are proposed. First, we present an adaptive technique to compute the target barrier parameter. Using this adaptive technique a single step large-update algorithm is proposed that enjoys better worst case iteration complexity than the classical large-update IPMs. A new variant of infeasible IPMs, using the same adaptive technique, is proposed that enjoys better worst case iteration complexity than the classical infeasible IPMs. By further use of the adaptive technique a new family of predictor-corrector IPMs is proposed that are different both in the predictor and the corrector steps from their classical counter parts. Worst case iteration complexity analysis reveals significant improvement for some special cases over the classical analogues. In the second part of thesis we analyze the theoretical behavior of the most widely used algorithm in IPM based software packages, the so called Mehrotra-type predictor-corrector algorithm. This analysis reveals some drawbacks of the algorithm that motivated us to modify it. We combine it with a safeguard that prevents the drawback we observed and enables us to prove strong theoretical results about the new algorithm. Motivated by this drawback, we analyze it from different perspective. In the new approach, contrary to the existing variants in the literature, first we fix the step size and then aim to compute the smallest value of the barrier parameter that ensures the prescribed step size is feasible. After the barrier parameter is computed, the algorithm computes the next iterate by a line-search as usual. The worst case behavior of the proposed algorithms is discussed. Finally, some limited encouraging computational results are reported.
Visually Mining the Datacube using a Pixel-Oriented Technique
Authors: David Auber, Noel Novelli, Guy Melancon
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper introduces a new technique easing the navigation and interactive exploration of huge multidimensional datasets. Following the pixel-oriented paradigm [8], the key ingredients enabling the interactive navigation of extreme volumes of data rely on a set of functions bijectively mapping data elements to screen pixels. The use of the mapping from data elements to pixels constrain the computational complexity for the rendering process to be linear with respect to the number of rendered pixels on the screen as opposed to the dataset size. Our method furthermore allows the implementation of usual information visualization techniques such as zoom and pan, anamorphosis and texturing. As a proof-of-concept, we show how our technique can be adapted to interactively explore the Datacube, turning our approach into an efficient system for visual datamining. We report experiments conducted on a Datacube containing 50 millions of items. To our knowledge, our technique outperforms all existing ones and push the scalability limit close to the billion of elements. Supporting all basic navigation techniques, and being moreover flexible makes it easily reusable for a large number of applications.
Asymmetric Squaring Formulae
Authors: Jaewook Chung, M. Anwar Hasan
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

We present efficient squaring formulae based on the Toom-Cook multiplication algorithm. The latter always requires at least one non-trivial constant division in the interpolation step. We show such non-trivial divisions are not needed in the case two operands are equal for three, four and five-way squarings. Our analysis shows that our 3-way squaring algorithms have much less overhead than the best known 3-way Toom-Cook algorithm. Our experimental results show that one of our new 3-way squaring methods performs faster than mpz_mul() in GNU multiple precision library (GMP) for squaring integers of approximately 2400-6700 bits on Pentium IV Prescott 3.2GHz. For squaring in Z[x], our 3-way squaring algorithms are much superior to other known squaring algorithms for small input size. In addition, we present 4-way and 5-way squaring formulae which do not require any constant divisions by integers other than a power of 2. Under some reasonable assumptions, our 5-way squaring formula is faster than the recently proposed Montgomery's 5-way Karatsuba-like formulae.
Resource management for global public computing: many policies are better than (n)one
Authors: Evangelos Kotsovinos, Iulia Ion, Tim Harris
Venue: Proceedings of the 3rd conference on USENIX Workshop on Real, Large Distributed Systems - Volume 3 (2006)

The federation of authority in global public computing systems poses major resource management challenges, as different stakeholders may have different views on how server resources are to be apportioned. Ultimately, the complexity of declaring and managing potentially overlapping federated policies often leads to the absence of high-level resource management systems from global public computing platforms. In this paper we propose a practical system that allows the different stakeholders to independently express federated policies, provides mechanisms for resolving potential constraint overlaps automatically, and reaches decentralised resource allocation decisions. We demonstrate experimentally that the system scales gracefully, introduces only a very low performance overhead, and is suitable for operating in realistically large and complex settings.
Program and Algorithm Visualization in Engineering and Physics
Authors: Michael Bruce-Lockhart, Theodore S. Norvell, Yiannis Cotronis
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We report here on our experiences using a program animation tool, the Teaching Machine, for program and algorithm visualization for engineering and physics students at two universities: Memorial University, where it has been used since 1999 for teaching engineering students, and the University of Athens, where it was adopted in 2005 to teach physics students.
A higher order statistics-based subspace method for the 2-D harmonic retrieval problem
Authors: Yi Chu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we present a new high resolution algorithm for the two-dimensional (2-D) harmonic retrieval problem, which, in particular, is noise insensitive in view of the fact that in many practical applications the contaminated noise may not be white noise. For this purpose, the approach is set in the context of higher-order statistics (HOS), which has demonstrated to be an effective approach under colored noise environment. The algorithm begins with the consideration of the fourth-order moments of the available 2-D data. Two auxiliary matrices, constituted by a novel stacking of the diagonal slice of the computed fourth-order moments, are then introduced and through which the two frequency components can be precisely determined, respectively, via matrix factorizations along with subspace rotational invariance (SRI) technique. Some simulation results are also provided to verify the proposed algorithm.
PHP
Authors: Jim Winstead
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

The web is growing at a tremendous pace, and the demands for content beyond simple static pages keep increasing. There is a critical shortage of people capable of producing pages with dynamic content. PHP (http://www.php.net/) is an HTML-embedded scripting language that attempts to lower the technical hurdles and make building dynamic pages faster and easier for developers of all skill levels.
Design and Simulation of Trust Management Techniques for a Coalition Data Sharing Environment
Authors: Srinivasan Iyer, Bhavani Thuraisingham
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

Effective communication among agents in large teams is crucial because the members share a common goal but only have partial views of the environment. Information sharing is difficult in a large team because, a team member may have a piece of valuable information but not know who needs the information, since it is infeasible to know what each other agent is doing. Information sharing is a main part of any system or organization. The information sharing needs to be foolproof. Only the legitimate receiver should be able to get hold of the information. This paper mainly deals with intelligent software agents for information sharing with confidentiality and trust. It clearly defines an Intelligent Software Agent, background of Information sharing in intelligent agents and the trust in the agents. Some part of the information needs confidentiality. The information that is shared requires security policy enforced based on the domain of the information and trust level of individual agent. This paper also provides the results of a multi-agent simulation for sharing information. It also implements trust calculation based on the quality of information provided by the peer agents in the simulation.
Secure Information Sharing in a Virtual Multi-Agency Team Environment
Authors: Nabil Adam, Ahmet Kozanoglu, Aabhas Paliwal, Basit Shafiq
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper proposes a two tier RBAC approach for secure and selective information sharing among virtual multi-agency response team (VMART) and allows expansion of the VMART by admitting new collaborators (government agencies or NGOs) as need arise. A coordinator Web Service for each member agency is proposed. The coordinator Web Service is responsible for authentication, information dissemination, information acquisition, role creation and enforcement of predefined access control policies. Secure, selective and fine-grained information sharing is realized through the encryption of XML documents according to RBAC policies defined for the corresponding XML schema.
A feedback system for graphics video coding and networking
Authors: Dongmei Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents feedback design of a desktop visual communications system. The system consists of video coding using a 3-D graphics model and video transmission over the Internet. To reduce the overall video quality degradation in visual communications caused by coding and networking errors, we jointly researched the compression and transmission of video signals. In building the 3-D graphics model-based coding structure, instead of using feedforward based on pixel intensity, we develop a three-level signal representation and an analysis-by-synthesis feedback framework. In prototyping the video over IP in desktop conferencing, we adapt the video encoders coding rates based on feedback of the network states and receivers. We therefore contribute to the analysis, modeling, and transmission of multimedia signals for desktop visual communications.
A framework for the non-monolithic implementation of protocols in the x-kernel
Authors: Parag K. Jain, Norman C. Hutchinson, Samuel T. Chanson
Venue: Proceedings of the High-Speed Networking Symposium on USENIX 1994 High-Speed Networking Symposium (1994)

This paper describes a framework for splitting the implementation of network protocols in the x-kernel into a user-level library, which implements the majority of the protocol functionality, and a kernel component, which provides a fast track to demultiplex packets into the appropriate recipient address space. The design also provides the user with flexibility to decide which aspects of the protocol implementation should be in user space and which should be in the kernel. We implement an example TCP/UDP-IP-Ethernet protocol stack and report on its performance which is competitive with monolithic implementations. The kernel level demultiplexing of network packets is well structured, modular and scalable. The cost of demultiplexing is shown to be insensitive to the number of user-level instances of protocols. The performance of the approach on a multiprocessor system shows that non-monolithic protocol implementations are potentially more parallelizable than traditional monolithic ones.
Intelligent decision support using case-based reasoning in the early design stage
Authors: John W. Priest
Venue:  (2006)

Shortages of design expertise and experience often result in a low level of assemblability and manufacturability. In addition, expertise is hard to disseminate to novices. To effectively disseminate and reuse this valuable knowledge, design, departments need effective and efficient design support mechanisms such as decision support systems. The objective of the research is to propose a new methodology for assembly design. The Case-Based Reasoning and Design for Manufacture and Assembly (CBR-DFMA) system is a CBR system integrated with web technology using hybrid v DFMA methodology to advise, assess and reuse assembly part designs based on previous expertise and experience in the early design stage. Using web technology, CBR-DFMA disseminates and shares up-to-date design experience anytime and anywhere. Experimental results of the research show that CBR methodology is suitable for imparting expertise, managing experience and providing recommendations in assembly part design.
RABC: A Conceptual Design of Pervasive Infrastructure for Browser Computing based on Ajax technologies
Authors: Fumikazu KONISHI, Manabu Ishii, Shingo Ohki, Ryo UMESTU, Akihiko KONAGAYA
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

We have developed the RIKEN Ajax Browser Computing (RABC) system. This system enables the simple realization of large scale Global Computing systems,like the SETI@home project, that take advantage of unused computing resources. Its greatest advantage is that an agent program, which has been traditionally required, does not need to be installed. Volunteers can participate by simply browsing to a webpage provided by the RABC system. This system allows greater CPU cycle resources to be acquired than traditional methods. We have evaluated a performance difference between JavaScript and legacy computer languages.
An adaptive packet scheduling algorithm for efficient downlink bandwidth allocation in UWB based wireless infrastructure networks
Authors: Yang Liu, Yu-Kwong Kwok, Jianzhou Wang
Venue: Computer Communications (2007)

A short range wireless infrastructure network, in which multiple UWB (ultra-wideband) WPANs are interconnected, is envisioned to be an important platform for various large scale mobile computing applications. It has been suggested that traditional packet scheduling algorithms used in cellular networks can be used for UWB based short-range networks. Unfortunately, these existing algorithms, e.g., HSDPA, cannot properly balance the conflicting goals of maximizing bandwidth efficiency while providing adequate fairness to users. Recently, an efficient scheme called MTA-ISIR is suggested and is found to be effective under several practical scenarios. Nevertheless, we find that there are still some drawbacks in the MTA-ISIR algorithm. In this paper, we propose two new approaches in which the power level threshold used for handling the fairness is dynamically adjusted for different traffic models. Our first approach is based on the ''opportunistic scheduling'' concept which enables the scheduler to optimize the bandwidth efficiency without sacrificing fairness. The second approach makes use of the consecutive packet lengths to prioritize users when assigning time slots. Simulation results indicate that the proposed methods outperform MTA-ISIR under a wide range of parameters.
Approximate Gauss-Newton Methods for Nonlinear Least Squares Problems
Authors: S. Gratton, A. S. Lawless, N. K. Nichols
Venue: SIAM Journal on Optimization (2007)

The Gauss-Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an &ldquo;inner&rdquo; direct or iterative process. In comparison with Newton&rsquo;s method and its variants, the algorithm is attractive because it does not require the evaluation of second-order derivatives in the Hessian of the objective function. In practice the exact Gauss-Newton method is too expensive to apply operationally in meteorological forecasting, and various approximations are made in order to reduce computational costs and to solve the problems in real time. Here we investigate the effects on the convergence of the Gauss-Newton method of two types of approximation used commonly in data assimilation. First, we examine &ldquo;truncated&rdquo; Gauss-Newton methods where the inner linear least squares problem is not solved exactly, and second, we examine &ldquo;perturbed&rdquo; Gauss-Newton methods where the true linearized inner problem is approximated by a simplified, or perturbed, linear least squares problem. We give conditions ensuring that the truncated and perturbed Gauss-Newton methods converge and also derive rates of convergence for the iterations. The results are illustrated by a simple numerical example. A practical application to the problem of data assimilation in a typical meteorological system is presented.
Modeling and Documenting the Evolution of Architectural Design Decisions
Authors: Rafael Capilla, Francisco Nava, Juan C. Duenas
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

All software systems are built as a result of a set of design decisions that are made during the architecting phase. At present, there is still a lack of appropriate notations, methods and tools for recording and exploiting these architectural design decisions. In addition, the need for maintaining and evolving the decisions made in the past turns critical for the success of the evolution of the system. In this research paper we extend a previous work to detail those issues related to the evolution of architectural design decisions.
A domain-specific language for regular sets of strings and trees
Authors: Nils Klarlund, Michael I. Schwartzbach
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

We propose a new high-level programming notation, called FIDO, that we have designed to concisely express regular sets of strings or trees. In particular, it can be viewed as a domain-specific language for the expression of finite-state automata on large alphabets (of sometimes astronomical size). FIDO is based on a combination of mathematical logic and programming language concepts. This combination shares no similarities with usual logic programming languages. FIDO compiles into finite-state string or tree automata, so there is no concept of run-time. It has already been applied to a variety of problems of considerable complexity and practical interest. In the present paper, we motivate the need for a language like FIDO, and discuss our design and its implementation. We show how recursive data types, unification, implicit coercions, and subtyping can be merged with a variation of predicate logic, called the Monadic Second-order Logic (M2L) on trees. FIDO is translated first into pure M2L via suitable encodings, and finally into finite-state automata through the MONA tool.
TclDG: a Tcl extension for dynamic graphs
Authors: John Ellson, Stephen North
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

TclDG is a toolkit extension for the manipulation, rendering, and interaction with abstract graphs and dynamic graph views. This paper introduces TclDG by examples that progressively build up to an implementation of a multiple-view graph editor.
Optimal Control of a Robotic System for Human Power Enhancement
Authors: A. Montagner, A. Frisoli, S. Marcheschi, E. Sanchez, M. Bergamasco
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Human power augmentation devices are robotic systems used for assisting the operator in the execution of manipulative/walking tasks and with the capability of amplifying human force. In this paper we present a new approach for the synthesis of an LQG controller that, with respect to other solutions, does not require direct measurements of interaction forces between the robotic device and the external environment. The experimental performance of the devised controller is shown on a testbed with 1 DOF.
Context Dependent Procedures and Computed Types in √eriFun
Authors: Andreas Schlosser, Christoph Walther, Michael Gonder, Markus Aderhold
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We present two enhancements of the functional language L which is used in the @?eriFun system to write programs and formulate statements about them. Context dependent procedures allow to stipulate the context under which procedures are sensibly executed, thus avoiding runtime tests in program code as well as verification of absence of exceptions by proving stuck-freeness of procedure calls. Computed types lead to more compact code, increase the readability of programs, and make the well-known benefits of type systems available to non-freely generated data types as well. Since satisfaction of context requirements as well as type checking becomes undecidable, proof obligations are synthesized to be proved by the verifier at hand, thus supporting static code analysis. Information about the type hierarchy is utilized for increasing the performance and efficiency of the verifier.