ppxscal/embedding_network huggingface dataset:
Quartic Spline of Interpolation with Minimal Quadratic Oscillation
Authors: Alexandru Mihai Bica
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The quartic spline of interpolation generated by initial conditions is constructed. The initial values corresponding to the first, second and third derivative of spline in the first knot are uniquely determined such that the quadratic oscillation in average of the quartic spline to be minimal (this notion was recently introduced by the author for any spline of interpolation function). 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
Steiner t-Designs for Large t
Authors: Michael Huber
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial t-designs exist for all values of t, no non-trivial Steiner t-design with t > 5 has been constructed until now. Understandingly, the case t = 6 has received considerable attention. There has been recent progress concerning the existence of highly symmetric Steiner 6-designs: It is shown in [M. Huber, J. Algebr. Comb. 26 (2007), pp. 453---476] that no non-trivial flag-transitive Steiner 6-design can exist. In this paper, we announce that essentially also no block-transitive Steiner 6-design can exist.
Equitable total coloring of Cm Cn
Authors: Chunling Tong, Lin Xiaohui, Yang Yuansheng, Li Zhihe
Venue: Discrete Applied Mathematics (2009)

The equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper, we show that the Cartesian product graphs of C"m and C"n have equitable total 5-coloring for all m>=3 and n>=3.
Branch and bound algorithm for multidimensional scaling with city-block metric
Authors: Antanas Žilinskas, Julius Žilinskas
Venue: Journal of Global Optimization (2009)

A two level global optimization algorithm for multidimensional scaling (MDS) with city-block metric is proposed. The piecewise quadratic structure of the objective function is employed. At the upper level a combinatorial global optimization problem is solved by means of branch and bound method, where an objective function is defined as the minimum of a quadratic programming problem. The later is solved at the lower level by a standard quadratic programming algorithm. The proposed algorithm has been applied for auxiliary and practical problems whose global optimization counterpart was of dimensionality up to 24.
Using salience to segment desktop activity into projects
Authors: Daniel Lowd, Nicholas Kushmerick
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Knowledge workers must manage large numbers of simultaneous, ongoing projects that collectively involve huge numbers of resources (documents, emails, web pages, calendar items, etc). An activity database that captures the relationships among projects, resources, and time can drive a variety of tools that save time and increase productivity. To maximize net time savings, we would prefer to build such a database automatically, or with as little user effort as possible. In this paper, we present several sets of features and algorithms for predicting the project associated with each action a user performs on the desktop. Key to our methods is salience, the notion that more recent activity is more informative. By developing novel features that represent salience, we were able to learn models that outperform both a simple benchmark and an expert system tuned specifically for this task on real-world data from five users.
Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1
Venue: British Computer Society Conference on Human-Computer Interaction (2008)

HCI2007, held at Lancaster University, marked the 21st running of the British HCI group's annual conference. As a sign of growing maturity it was held under the new group identity of BCS Interaction SG. Linden Ball and his co-editors [1] reflected on the spread of HCI into diverse fields of interaction and also on how those fields fed back into HCI itself to further enrich our studies of interaction in all its forms. HCI2008 Culture, Creativity, Interaction continues the evolution and reached out further to other disciplines. Interaction has become more than ubiquitous; it has become embedded in our social fabric with millions taking part in, for example, social networking. Thus the ubiquity of interaction is not only physical; it is also social, cultural, ethical and moral: impacting on our daily lives in ever increasing ways. Our reaction to that as researchers must be to leave our labs and engage with those who are creating new forms of interaction. This year HCI 2008 takes place in Liverpool, European Capital of Culture 2008. There are many events happening in the city raising questions about interaction and technology. Fortunately for this year we have partnered again with (re)Actor3 www.digitalliveart.co.uk where HCI Interactive Experiences will be given a wider, public audience. Hence HCI researchers and the public will be given the chance to experience new forms of interaction which may raise questions about our practice and methodology.
An Integrating Method in Target Segmentation for Practical Video
Authors: Qilei He, Wei Zhang, Guanghe Tian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper proposes an integrating method in target segmentation for practical video. It integrates the affine model and MVFAST into motion complement, integrates the frame difference, phase correlation and snake algorithm into target segmentation. This novel method can use more information from the video but not takes much computer time. Ultimately the practical application proves it as an automatic, efficient and fast algorithm.
Generating Data for Signer Adaptation
Authors: Chunli Wang, Xilin Chen, Wen Gao
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

In sign language recognition (SLR), one of the problems is signer adaptation. Different from spoken language, there are lots of "phonemes" in sign language. It is not convenient to collect enough data to adapt the system to a new signer. A method of signer adaptation with little data for continuous density hidden Markov models (HMMs) is presented. Firstly, hand shapes, positions and orientations that compose all sign words are extracted with clustering algorithm. They are regarded as basic units. Based on a small number of sign words that include these basic units, the adaptation data of all sign words are generated. Statistics are gathered from the generated data and used to calculate a linear regression-based transformation for the mean vectors. To verify the effectiveness of the proposed method, some experiments are carried out on a vocabulary with 350 sign words in Chinese Sign Language (CSL). All basic units of hand shape, position and orientation are found. With these units, we generate the adaptation data of 350 sign words. Experimental results demonstrate that the proposed method has similar performance compared with that using the original samples of 350 sign words as adaptation data.
Reducing Behavioural to Structural Properties of Programs with Procedures
Authors: Dilian Gurov, Marieke Huisman
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a program graph rather than in terms of its unfoldings is a useful strategy for making analyses more tractable. This paper presents a characterisation of behavioural program properties through sets of structural properties by means of a translation. The characterisation is given in the context of a program model based on control flow graphs of sequential programs with possibly recursive procedures, and properties expressed in a fragment of the modal μ-calculus with boxes and greatest fixed-points only. The property translation is based on a tableau construction that conceptually amounts to symbolic execution of the behavioural formula, collecting structural constraints along the way. By keeping track of the subformulae that have been examined, recursion in the structural constraints can be identified and captured by fixed-point formulae. The tableau construction terminates, and the characterisation is exact, i.e., the translation is sound and complete. A prototype implementation has been developed. We discuss several applications of the characterisation, in particular compositional verification for behavioural properties, based on maximal models.
The mechanized face as a system
Authors: Sorin Mihai Radu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The systemic approach of the mechanized face is carried out by appealing to the flexible economic-mathematics models, to the advantages offered by their using. The concept of vague sets (by fuzzyfication) was used, the issues to be solved become more flexible and allow those who have to take a decision to get many variants for the objectively established functions among them can select the best variant, in accordance with the requirements of the moment and intuition.
The gamer's dilemma: An analysis of the arguments for the moral distinction between virtual murder and virtual paedophilia
Authors: Morgan Luck
Venue: Ethics and Information Technology (2009)

Most people agree that murder is wrong. Yet, within computer games virtual murder scarcely raises an eyebrow. In one respect this is hardly surprising, as no one is actually murdered within a computer game. A virtual murder, some might argue, is no more unethical than taking a pawn in a game of chess. However, if no actual children are abused in acts of virtual paedophilia (life-like simulations of the actual practice), does that mean we should disregard these acts with the same abandon we do virtual murder? In this paper I shall outline several arguments which attempt to permit virtual murder, whilst prohibiting virtual paedophilia.
High standoff dual-mode-actuation MEMS switches
Authors: Yoonsu Choi, Kieun Kim, Mark G. Allen
Venue: Microsystem Technologies (2009)

MEMS switches based on a dual-mode actuation scheme that simultaneously allows for large standoff heights and low clamping voltages have been designed and fabricated. These devices are based on the use of a transient external magnetic field to bring the actuating portion of the switch close to a dielectric-coated clamping electrode, followed by application of an electrostatic clamping voltage to keep the switch closed. Since the clamping voltage is applied when the switch is closed, this voltage can be relatively small. This approach is particularly attractive for RF applications such as arrays of switches in reconfigurable aperture antennas. The arrays of switches are simultaneously closed by the magnetic field generated by an external magnetic source, then selected switches are clamped by electrostatic force using low voltages to maintain the ON state. Their utility in such an array has been demonstrated and several different design variations have been explored to improve switch performance. Contact resistance as low as 0.37&#x00a0;&#x03a9; has been achieved, with actuating field strength of 40&#x00a0;Gauss. These switches possess a large open state air gap (25&#x00a0;&#x03bc;m), and are able to pass high currents in excess of 1&#x00a0;A under low frequency or DC operation. The large OFF state impedance allows for their usage in switching applications in RF devices. Their high frequency functionality has been tested to find that their open-state impedance was identical to that of a perfect open up to 9&#x00a0;GHz and their RF reconfigurability has been demonstrated in a monopole/dipole test bed.
Fiber grating laser sensors
Authors: Bai-Ou Guan, Yang Zhang, Hwa-Yaw Tam
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Fiber grating laser sensors have attracted considerable interests because they not only possess advantages of passive fiber grating sensors, such as compact size, inherent self-referencing capability, and multiplexing capability, but also offer higher signal-to-noise ratio. We present some of our latest works in fiber grating laser inscription and their applications for measurement of lateral force, ultrasound and high temperature.
Structuring and Accessing Semantic Multimedia Data
Authors: Steffen Staab
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Steffen Staab is professor for databases and information systems at the University of Koblenz-Landau, leading the research group on Information Systems and Semantic Web (ISWeb). His interests lie in researching core technology for ontologies and semantic web as well as in applied research for exploiting these technologies for knowledge management,multimedia and software technology.He has participated in numerous national, European and intercontinental research projects on these different subjects and his research has led to more than 100 refereed contributions in journals and conferences. Dr. Staab held positions as researcher, project leader and lecturer at the University of Freiburg, the University of Stuttgart/Fraunhofer Institute IAO, and the University of Karlsruhe and he is a co-founder of Ontoprise GmbH. He is on several journal editorial boards and is incoming Editor-in-Chief of Elsevier's Journal of Web Semantics. For more information see: http://isweb.unikoblenz. de/ and http://www.uni-koblenz.de/ staab/
An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
Authors: Jens Bachmann, Martin Riedl, Johann Schuster, Markus Siegle
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

CASPA is a stochastic process algebra tool for performance and dependability modelling, analysis and verification. It is based entirely on the symbolic data structure MTBDD (multi-terminal binary decision diagram) which enables the tool to handle models with very large state space. This paper focuses on an extension of CASPA's modelling language by weighted immediate actions. We discuss the pertaining semantics and present an efficient symbolic algorithm for the elimination of vanishing states. A non-trivial case study illustrates the usage features of CASPA, from graphical model specification to numerical analysis.
Feature fusion for basic behavior unit segmentation from video sequences
Authors: Xinwei Xue, Thomas C. Henderson
Venue: Robotics and Autonomous Systems (2009)

It has become increasingly popular to study animal behaviors with the assistance of video recordings. An automated video processing and behavior analysis system is desired to replace the traditional manual annotation. We propose a framework for automatic video based behavior analysis systems, which consists of four major modules: behavior modeling, feature extraction from video sequences, basic behavior unit (BBU) discovery and complex behavior recognition. BBU discovery is performed based on features extracted from video sequences, hence the fusion of multiple dimensional features is very important. In this paper, we explore the application of feature fusion techniques to BBU discovery with one and multiple cameras. We applied the vector fusion (SBP) method, a multi-variate vector visualization technique, in fusing the features obtained from a single camera. This technique reduces the multiple dimensional data into two dimensional (SBP) space, and the spatial and temporal analysis in SBP space can help discover the underlying data groups. Then we present a simple feature fusion technique for BBU discovery from multiple cameras with the affinity graph method. Finally, we present encouraging results on a physical system and a synthetic mouse-in-a-cage scenario from one, two, and three cameras. The feature fusion methods in this paper are simple yet effective.
FPGA Implementation of the Ternary Pulse Compression Sequences with Good Discrimination Factor Values
Authors: N. Balaji, K. Subba Rao, M. Srinivasa Rao
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Ternary codes have been widely used in radar and communication areas, but the synthesis of ternary codes with good discrimination factor is a nonlinear multivariable optimization problem, which is usually difficult to tackle. To get the solution of above problem many global optimization algorithms like genetic algorithm, simulated annealing, and tunneling algorithm were reported in the literature. However, there is no guarantee to get global optimum point. In this paper, a novel and efficient VLSI architecture is proposed to design Ternary Pulse compression sequences with good discrimination factor. The VLSI architecture is implemented on the Field Programmable Gate Array (FPGA) as it provides the flexibility of reconfigurability and reprogramability. The implemented architecture overcomes the drawbacks of non guaranteed convergence of the earlier optimization algorithms.
On the design of an obstacle avoiding trajectory: Method and simulation
Authors: Claudiu Pozna, Fritz Troester, Radu-Emil Precup, József K. Tar, Stefan Preitl
Venue: Mathematics and Computers in Simulation (2009)

The paper suggests a new mathematical construction for the potential field used in the design of obstacle avoiding trajectories. The main benefits of the proposed construction are the quickness of minimum computation and the compensation for the main drawbacks specific to the ''traditional approaches'' belonging to the potential field method in general. The potential field definition and its minimum computation concept are presented. Next the concept is included in a design method for obstacle avoiding trajectories. The method is expressed in the form of an algorithm for obstacle avoidance. In the following step a state-space controller is designed in order to control the car along that trajectory. Digital simulation results obtained for the complete dynamic model of a car well validate the method.
Implementation of parallel programs interpreter in the development environment ParJava
Authors: V. P. Ivannikov, A. I. Avetisyan, S. S. Gaissaryan, M. S. Akopyan
Venue: Programming and Computing Software (2009)

The implementation of the ParJava development environment is considered that enables one to develop parallel applications in the modern programming language Java within the industrial standard MPI. The internal representation of the SPMD program model is described, which is constructed so as to place as much of the interpretation work of a parallel Java program on JavaVM. Features of the model generation and its preparation to the interpretation are described. The model generator transforms the abstract syntax tree of each method of the program being simulated into a model of the control flow, forms a computation model that will be executed on JavaVM, and forms a module for evaluating the execution times of the basic blocks. The interpretation of the model executed on p nodes of a parallel computing system (cluster) is performed in p logical processes of which each is executed in an individual thread. The interpretation of a logical process assumes that all its methods beginning from the main method are interpreted. The interpretation of each method consists in executing the computation model of this method on JavaVM. The order of interpretation of the method's basic blocks is determined by the system interpreter of the method's model. The system makes it possible to reduce parts of the model and interpret the model by parts. Problems of the simulation and interpretation of communication functions are discussed. The communication functions are described using nine basic exchange operations. To evaluate the time needed to transfer data between processes, an empirical dependence between the amount of the transferred data and the transfer time is used, which is obtained using tests. A short description of the ParJava graphical interface is presented. Applications developed using the proposed implementation of the system are platform independent; and the development, tuning, and maintenance overheads for those applications are considerably reduced. This is a contribution to the development of high-productive parallel applications.
Smooth flexible models of nonhomogeneous poisson processes using one or more process realizations
Authors: Michael E. Kuhl, Shalaka C. Deo, James R. Wilson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We develop and evaluate a semiparametric method to estimate the mean-value function of a nonhomogeneous Poisson process (NHPP) using one or more process realizations observed over a fixed time interval. To approximate the mean-value function, the method exploits a specially formulated polynomial that is constrained in least-squares estimation to be nondecreasing so the corresponding rate function is nonnegative and smooth (continuously differentiable). An experimental performance evaluation for two typical test problems demonstrates the method's ability to yield an accurate fit to an NHPP based on a single process realization. A third test problem shows how the method can estimate an NHPP based on multiple realizations of the process.
Querying by Photographs: Using Virtual Reality for Content-Based Image Retrieval
Authors: J. Assfalg, A. Del~Bimbo, P. Pala
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The success of the `query by example' paradigm for content-based retrieval has lowered the interest of the research community in the development of new interaction paradigms. Nevertheless, in many contexts this can be inadequate, due to the difficulty for many users to paint significant examples and the impossibility -- in many cases -- of reproducing complex scenes.3D interfaces and Virtual Reality based interaction paradigms offer new possibilities to overcome these limitations. In the propotype system presented hereafter, a virtual world can be interactively customized by adding objects to a predefined scene and editing object properties in terms of colours and textures. The system allows the user to navigate the 3D scene. While navigating the virtual world, the user is given the opportunity of taking some photographs used to query by content a database of images.