ppxscal/embedding_network huggingface dataset:
Visualization in Health Grid Environments: A Novel Service and Business Approach
Authors: Frank Dickmann, Mathias Kaspar, Benjamin Löhnhardt, Nick Kepper, Fred Viezens, Frank Hertel, Michael Lesnussa, Yassene Mohammed, Andreas Thiel, Thomas Steinke, Johannes Bernarding, Dagmar Krefting, Tobias A. Knoch, Ulrich Sax
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

Advanced visualization technologies are gaining major importance to allow presentation and manipulation of high dimensional data. Since new health technologies are constantly increasing in complexity, adequate information processing is required for diagnostics and treatment. Therefore, the German D-Grid initiative started to build visualization centers in 2008, which have recently been embedded into the existing compute and storage infrastructure. This paper describes an analysis of this infrastructure and the interplay with life science applications for 3D and 4D visualization and manipulation. Furthermore, the performance and business aspects regarding accounting, pricing and billing are investigated. The results show the viability and the opportunities for further optimization of this novel service approach and the possibilities for a sustainable business scenario.
Performance analysis of small non-uniform packet switches
Authors: Paul Beekhuizen, Jacques Resing
Venue: Performance Evaluation (2009)

Packet switches have been studied extensively as part of ATM and LAN networks under the assumption that the number of input ports N tends to infinity. Our study of packet switches is motivated by networks on chips, where N is usually 4 or 5 and asymptotic models lead to inaccurate results. We consider small non-uniform switches and accurately approximate stability conditions and throughput. In addition to this, we approximate the mean waiting time in the switch by that in a ./Geo/1 queue.
A Refined Resolution Calculus for CTL
Authors: Lan Zhang, Ullrich Hustadt, Clare Dixon
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

In this paper, we present a refined resolution-based calculus for Computation Tree Logic (CTL). The calculus requires a polynomial time computable transformation of an arbitrary CTL formula to an equi-satisfiable clausal normal form formulated in an extension of CTL with indexed existential path quantifiers. The calculus itself consists of a set of resolution rules which can be used as the basis for an EXPTIME decision procedure for the satisfiability problem of CTL. We prove soundness and completeness of the calculus. In addition, we introduce CTL-RP, our implementation of the calculus as well as some experimental results.
Universal constraint rankings result from learning and evolution: invited talk
Authors: Paul Boersma
Venue: Proceedings of the Eighth Meeting of the ACL Special Interest Group on Computational Phonology and Morphology (2006)

Optimality Theory has met with a bad press in the more emergentist (e.g. computational) literature for its reliance on innate constraints and even on innate constraint rankings (positional faithfulness, licensing by cue). In this talk I will show with computer simulations that even if the learner's initial grammar starts with a large number of constraints that have no inherent bias towards unmarked or otherwise good sound systems, the learner will gradually turn the constraint ranking into something resembling a universally unmarked sound system as an automatic result of input frequencies and imperfections of the transmission channel. It turns out that the parents' sound system is "semi-learnable": if the parents' sound system happens to be universally marked, the offspring will learn to mimic the quirks of this system to some extent, but they will tend to turn the language into a universally unmarked sound system within three generations or so. The conclusion will be that a bidirectional Optimality-Theoretic model of the grammar with two phonological and two phonetic representations is compatible with the view that there is no innate phonological substance in language acquisition. 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
Quantum Hilbert matrices and orthogonal polynomials
Authors: Jørgen Ellegaard Andersen, Christian Berg
Venue: Journal of Computational and Applied Mathematics (2009)

Using the notion of quantum integers associated with a complex number q
Search Mathematical Formulas by Mathematical Formulas
Authors: Yoshinori Hijikata, Hideki Hashimoto, Shogo Nishida
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Users cannot search information by mathematical formulas as queries in existing search engines. This is because mathematical formulas are not expressed as a sequence of characters. Some formulas are expressed in a complex structure like fractional numbers and index numbers. We present a search engine for MathML objects using the structure of mathematical formulas. The system makes the inverted indices by using the DOM structure of the MathML object. We proposed three types of index. One type is constructed from some paths of the DOM structure and expressed in XPath. The other type is constructed by encoding the nodes in the same level in DOM structure. The third type is a hybrid method of them. This paper describes the experiment conducted to study the effectiveness of those indices.
Application of 3S Technology to the Updating Survey of Land
Authors: Feng Jing
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

This paper puts forward 3S technology to the updating survey of land, and tries to demonstrate the feasibility and practicality of the method.
The impact of parse quality on syntactically-informed statistical machine translation
Authors: Chris Quirk, Simon Corston-Oliver
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We investigate the impact of parse quality on a syntactically-informed statistical machine translation system applied to technical text. We vary parse quality by varying the amount of data used to train the parser. As the amount of data increases, parse quality improves, leading to improvements in machine translation output and results that significantly outperform a state-of-the-art phrasal baseline.
Coefficient strengthening: a tool for reformulating mixed-integer programs
Authors: Kent Andersen, Yves Pochet
Venue: Mathematical Programming: Series A and B (2009)

Providing a good formulation is an important part of solving a mixed-integer program.We suggest measuring the quality of a formulation by whether it is possible to strengthen the coefficients of the formulation. Sequentially strengthening coefficients can then be used as a tool for improving formulations.We believe this method could be useful for analyzing and producing tight formulations of problems that arise in practice.We illustrate the use of the approach on a problem in production scheduling. We also prove that coefficient strengthening leads to formulations with a desirable property: if no coefficient can be strengthened, then no constraint can be replaced by an inequality that dominates it. The effect of coefficient strengthening is tested on a number of problems in computational experiments. The strengthened formulations are compared to reformulations obtained by the preprocessor of a commercial software package. For several test problems, the formulations obtained by coefficient strengthening are substantially stronger than the formulations obtained by the preprocessor. In particular, we use coefficient strengthening to solve two difficult problems to optimality that have only recently been solved.
Decoding Attentional Orientation from EEG Spectra
Authors: Ramesh Srinivasan, Samuel Thorpe, Siyi Deng, Tom Lappas, Michael D'Zmura
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

We have carried out preliminary experiments to determine if EEG spectra can be used to decode the attentional orientation of an observer in three-dimensional space. Our task cued the subject to direct attention to speech in one location and ignore simultaneous speech originating from another location. We found that during the period where the subject directs attention to one location in anticipation of the speech signal, EEG spectral features can be used to predict the orientation of attention. We propose to refine this method by training subjects using feedback to improve classification performance.
Loop Calculus for satisfiability
Authors: Lukas Kroc, Michael Chertkov
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Loop Calculus, introduced by Chertkov and Chernyak, is a new technique to incrementally improve approximations computed by Loopy Belief Propagation (LBP), with the ability to eventually make them exact. In this extended abstract, we give a brief overview of this technique, and show its relevance to the AI community. We consider the problem of Boolean Satisfiability (SAT) and use LBP with Loop Calculus corrections to perform probabilistic inference about the problem. In this preliminary work, we focus on identifying the main issues encountered when applying Loop Calculus, and include initial empirical results in the SAT domain.
Stability Monitoring and Analysis of Opencast Uranic Slope Based on GPS
Authors: Zhu Yufeng, Zhou Shijian, Zang Deyan
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Geologic hazard caused by opencast mine slide often have great influence on construction and production of mine engineering, and slope distortion is the most obviously and directly reason bring on geologic hazard. In consideration of complexity of opencast uranic slope rock mass, real-time analysis on instability of slope by GPS sectionalized monitoring will be adopted in the novel, and regard the slope monitoring datum after data processing as an evidence of judging slope distortion trend and slide forecast so as to increase safety efficiency of Opencast slope.
Services and Business Computing Solutions With Xml: Applications for Quality Management and Best Processes
Authors: Patrick C. K. Hung
Venue:  (2009)

Commercial systems built today are increasingly using XML technologies for storing any amount of text or data. Services and Business Computing Solutions with XML: Applications for Quality Management and Best Processes collects the latest research for academicians and practitioners that describes the use and synergy between data structure technologies. This book explores and investigates various issues of XML data and related applications summarized by Web services. 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
Easy Flow: New Generation Business Process Model
Authors: Qi Sui, Dong-Qing Yang, Teng-Jiao Wang
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

Now workflow technique is almost the unique candidate to handle a business process in a software application. But graph based traditional workflow is not enough flexible in software engineer which is well known since it was introduced from manufacture industry in 1980s. Until now how to make workflow more flexible is also an unresolved problem in workflow technique which is a serious bottleneck for its popularization, although many efforts have been done to advance it. Author thinks it is wrong to design a process model based on graph theory, which is just the reason to cause workflow so inflexible. In this paper, author presents new generation process model --- Easy Flow based on task and its semantic, which is easy to understand, design, modify and refactor a business process. Easy Flow model is completely different with workflow model, which is more adept to control a "changing" business process in an enterprise application. Easy Flow will replace workflow to realize real business process management in future applications.
A New Approach in Reversible Watermarking
Authors: Ahmad Mahmoudi Aznaveh, Azadeh Mansouri, Farah Torkamani-Azar
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

A great number of reversible watermarking methods have been put forward in the last few years. After analysis of some recent methods, we offer a new simple transform to increase the capacity applying just one iteration. Another advantage of our method is its simplicity. Moreover, it does not need to embed a compressed location map for recovering the original host. Therefore, the computational cost of our method is reduced in comparison to similar methods. The flexibility of the proposed method, on account of selecting appropriate contribution factor, is another advantage of our algorithm.
A Robotic Introducer Agent Based on Adaptive Embodied Entrainment Control
Authors: Mutsuo Sano, Kenzaburo Miyawaki, Ryohei Sasama, Tomoharu Yamaguchi, Keiji Yamada
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The necessity for the individual and the individual's tying in real space increases while the age of piece progresses. The robot is requested in that and it is requested what role be able to be played. Here, we pursue the research on the robot design to expand and to promote the group conversation. It proposes the technique to advance the conversation of couple 1 of the first meeting smoothly as the first stage. Especially, it is confirmed that nonverbal interactions are more important than language interactions by a lot of researches so that the individual and the individual may tie. We newly define the communications activity based on embodied entrainment, and propose the method to control the behavior of the robot dynamically according to the state of communications. The active control method uses interaction timing learning which depends on nonverbal communication channels. Our mechanism selects an appropriate embodied robotic behavior by changing the communication strategy based on the state transition of an introduction scene, and increases the communication activity measured by sensing data. The action timing is learned and controlled by a decision-tree. As the result, the real agent robot could control communication situations similarly to a human. We became "Yes" by the evaluation value of 82% for the question that communications had risen as a result of doing the questionnaire survey to 20 university students. Moreover, familiarity became a first meeting introduction robot with "Yes" for the question about whether being possible to have it by the evaluation value of 85%. Therefore, the effectiveness of this proposal technique was verified. Finally, the possibility that the circle of communications can be expanded to N person's group is discussed based on this result.
Design of low complexity digital FIR filters
Authors: Levent Aksoy, Diego Jaccottet, Eduardo Costa
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applications, such as finite impulse response (FIR) filters and linear transforms. Although low-complexity high-performance multiplier architectures have been proposed for the constant multiplications, the area and delay optimization of the MCM operation has often been accomplished by synthesizing the constant multiplications using only addition/subtraction and shifting operations in the shift-adds architecture. To obtain further reductions in area, delay, and power consumption in the shift-adds design of the MCM operation, efficient high-level algorithms have also been proposed. In this paper, we introduce a computer-aided design tool for the synthesis of low-complexity digital FIR filters that includes both high and low level synthesis phases. In the high-level synthesis phase, the MCM operation is optimized in terms of high-level area and delay parameters and the digital FIR filter with the optimized MCM operation is implemented at gate-level in the low-level synthesis phase. It is observed from the experimental results that the design of the MCM operation in shifts-add architecture with the use of high-level algorithms achieves significant area improvements on filter implementations with respect to designs whose MCM operations are implemented in array multiplier architecture.
Cultural Interface Design Advisor Tool: Research Methodology and Practical Development Efforts
Authors: Irina Kondratova, Ilia Goldfarb
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Within the cultural user interface design research and development project we address the need in culturally appropriate user interface design that is brought up by globalization. Globalization is affecting most computer-mediated communication and, in particular, user interface design for the Internet applications. To address this need, we are building a cultural "look and feel" advisor tool that is based on the research study utilizing cultural analysis of a large number of websites for a particular locale. This paper addresses the research methodology we employed in manual evaluation of specific cultural markers on a large set of country-specific websites and reports on several important aspects of transferring our research results into the practical implementation of the cultural design advisor tool.
Robust task-based control policies for physics-based characters
Authors: Stelian Coros, Philippe Beaudoin, Michiel van de Panne
Venue: ACM Transactions on Graphics (TOG) (2009)

We present a method for precomputing robust task-based control policies for physically simulated characters. This allows for characters that can demonstrate skill and purpose in completing a given task, such as walking to a target location, while physically interacting with the environment in significant ways. As input, the method assumes an abstract action vocabulary consisting of balance-aware, step-based controllers. A novel constrained state exploration phase is first used to define a character dynamics model as well as a finite volume of character states over which the control policy will be defined. An optimized control policy is then computed using reinforcement learning. The final policy spans the cross-product of the character state and task state, and is more robust than the conrollers it is constructed from. We demonstrate real-time results for six locomotion-based tasks and on three highly-varied bipedal characters. We further provide a game-scenario demonstration.
A Unified Sequent Calculus for Focused Proofs
Authors: Chuck Liang, Dale Miller
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We present a compact sequent calculus LKU for classical logic organized around the concept of polarization. Focused sequent calculi for classical logic, intuitionistic logic, and multiplicative-additive linear logic are derived as fragments of LKU by increasing the sensitivity of specialized structural rules to polarity information. We develop a unified, streamlined framework for proving cut-elimination in the various fragments. Furthermore, each sublogic can interact with other fragments through cut. We also consider the possibility of introducing classical-linear hybrid logics.
Tagging Icelandic text using a linguistic and a statistical tagger
Authors: Hrafn Loftsson
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We describe our linguistic rule-based tagger IceTagger, and compare its tagging accuracy to the TnT tagger, a state-of-the-art statistical tagger, when tagging Icelandic, a morphologically complex language. Evaluation shows that the average tagging accuracy is 91.54% and 90.44%, obtained by IceTagger and TnT, respectively. When tag profile gaps in the lexicon, used by the TnT tagger, are filled with tags produced by our morphological analyser IceMorphy, TnT's tagging accuracy increases to 91.18%.
Very high order PNPM schemes on unstructured meshes for the resistive relativistic MHD equations
Authors: Michael Dumbser, Olindo Zanotti
Venue: Journal of Computational Physics (2009)

In this paper we propose the first better than second order accurate method in space and time for the numerical solution of the resistive relativistic magnetohydrodynamics (RRMHD) equations on unstructured meshes in multiple space dimensions. The nonlinear system under consideration is purely hyperbolic and contains a source term, the one for the evolution of the electric field, that becomes stiff for low values of the resistivity. For the spatial discretization we propose to use high order P"NP"M schemes as introduced in Dumbser et al. [M. Dumbser, D. Balsara, E.F. Toro, C.D. Munz, A unified framework for the construction of one-step finite volume and discontinuous Galerkin schemes, Journal of Computational Physics 227 (2008) 8209-8253] for hyperbolic conservation laws and a high order accurate unsplit time-discretization is achieved using the element-local space-time discontinuous Galerkin approach proposed in Dumbser et al. [M. Dumbser, C. Enaux, E.F. Toro, Finite volume schemes of very high order of accuracy for stiff hyperbolic balance laws, Journal of Computational Physics 227 (2008) 3971-4001] for one-dimensional balance laws with stiff source terms. The divergence-free character of the magnetic field is accounted for through the divergence cleaning procedure of Dedner et al. [A. Dedner, F. Kemm, D. Kroner, C.-D. Munz, T. Schnitzer, M. Wesenberg, Hyperbolic divergence cleaning for the MHD equations, Journal of Computational Physics 175 (2002) 645-673]. To validate our high order method we first solve some numerical test cases for which exact analytical reference solutions are known and we also show numerical convergence studies in the stiff limit of the RRMHD equations using P"NP"M schemes from third to fifth order of accuracy in space and time. We also present some applications with shock waves such as a classical shock tube problem with different values for the conductivity as well as a relativistic MHD rotor problem and the relativistic equivalent of the Orszag-Tang vortex problem. We have verified that the proposed method can handle equally well the resistive regime and the stiff limit of ideal relativistic MHD. For these reasons it provides a powerful tool for relativistic astrophysical simulations involving the appearance of magnetic reconnection.
Video Shot Boundary Detection Using Generalized Eigenvalue Decomposition
Authors: Ali Amiri, Mahmood Fathy
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

In this paper, we propose a novel shot boundary detection algorithm using Generalized Eigenvalue Decomposition (GED). We derive a theorem that discuss about some new features of GED which could be used in the video processing algorithms. Our innovative explanation utilizes this theorem in the detecting of boundaries of video shots. Experimental results and comparison with publicly available shot detection systems on TRECVID 2006 datasets are reported.