ppxscal/embedding_network huggingface dataset:
PhyNeSS: A Physics-driven Neural Networks-based Surgery Simulation system with force feedback
Authors: Dhanannjay Deo, Suvranu De
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In this work we present PhyNeSS - a novel Physics-driven Neural Networks-based Surgical Simulation system which, for the first time, combines the complexity and accuracy of physics-based non-linear soft tissue models and commercial finite element codes with the high speed of execution of machine learned neural networks. While soft tissue is inherently nonlinear, physics-based simulation of nonlinear tissue behavior with haptic feedback is very challenging as the solution of the coupled nonlinear partial differential equations is iterative and therefore extremely computationally intensive. The major contribution of this paper is that through an unprecedented combination of hard and soft computing methods, it is able to reduce the solution of nonlinear problems to almost the same complexity as solving linear problems. This promises to resolve one of the longest-standing technical challenges of real time surgical simulation. The first phase of the method is a pre-computation phase, in which each node of the organ model, with known linear or nonlinear material properties, is provided with carefully chosen prescribed displacements and the response, computed using commercial finite element software tools, is recorded off-line and stored in a large database. The data in then vastly condensed into a set of coefficients describing neurons of a Radial Basis Function (RBF) networks or easier storage and rapid reproduction. During real-time computations, as the surgical tool interacts with the organ models, these neural networks are used to reconstruct the deformation fields as well as the reaction forces at the surgical tool tip. We present simulation results for realistic surgical scenarios with real time force feedback.
Accurate Palmprint Recognition Using Spatial Bags of Local Layered Descriptors
Authors: Yufei Han, Tieniu Tan, Zhenan Sun
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

State-of-the-art palmprint recognition algorithms achieve high accuracy based on component based texture analysis. However, they are still sensitive to local variations of appearances introduced by deformation of skin surfaces or local contrast variations. To tackle this problem, this paper presents a novel palmprint representation named Spatial Bags of Local Layered Descriptors (SBLLD). This technique works by partitioning the whole palmprint image into sub-regions and describing distributions of layered palmprint descriptors inside each sub-region. Through the procedure of partitioning and disordering, local statistical palmprint descriptions and spatial information of palmprint patterns are integrated to achieve accurate image description. Furthermore, to remove irrelevant and attributes from the proposed feature representation, we apply a simple but efficient ranking based feature selection procedure to construct compact and descriptive statistical palmprint representation, which improves classification ability of the proposed method in a further step. Our idea is verified through verification test on large-scale PolyU Palmprint Database Version 2.0. Extensive experimental results testify efficiency of our proposed palmprint representation.
Automatic Video Editing for Multimodal Meetings
Authors: Radek Kubicek, Pavel Zak, Pavel Zemcik, Adam Herout
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

Meeting recording is being performed through microphones and video cameras in order to keep a permanent record of the events that are happening during the meetings. The technology to perform such recording is already mature and recording is being performed already for some time. However, efficient retrieval of the information from meeting data remains a hot topic of contemporary research. Several approaches to information retrieval exist, such as indexing the data, event semantics analysis of the data, etc. This contribution focuses on automatic video editing of the data in order to prepare audiovisual material, based on several audio and video sources, that is suitable for human users to see. The video editing takes the original audio and video data as its input as well as the results of analysis of audio and video streams and user instructions. The output of the method is a simple audiovisual stream.
Agent-Based Framework for Distributed Real-Time Simulation of Dynamical Systems
Authors: Grzegorz Polaków, Mieczyslaw Metzger
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

A framework is presented, supporting calculation tasks specific to the control theory, allowing for a consolidation of theory-based calculations with real-world control systems by means of hardware sensors and actuators. A networking protocol was designed specifically for this task, employing producer-distributor-consumer data distribution scheme over Ethernet network to enable synchronised execution of spatially distributed mathematical models implemented as intelligent blackboard-based agent system, in order to properly cooperate with sampled real-world continuous dynamical systems. Comprehensive data on internal structure of distributed system is available by monitoring web service, so it is possible to integrate framework's output in other software.
An adaptive flocking algorithm for performing approximate clustering
Authors: Gianluigi Folino, Agostino Forestiero, Giandomenico Spezzano
Venue: Information Sciences: an International Journal (2009)

This paper presents an approach based on an adaptive bio-inspired method to make state of the art clustering algorithms scalable and to provide them with an any-time behavior. The method is based on the biology-inspired paradigm of a flock of birds, i.e. a population of simple agents interacting locally with each other and with the environment. The flocking algorithm provides a model of decentralized adaptive organization useful to solve complex optimization, classification and distributed control problems. This approach avoids the sequential search of canonical clustering algorithms and permits a scalable implementation. The method is applied to design two novel clustering algorithms based on the main principles of two popular clustering algorithms: DBSCAN and SNN. This apporach can identify clusters of widely varying shapes and densities and is able to extract an approximate view of the clusters whenever it is required. Both the algorithms have been evaluated on synthetic and real world data sets and the impact of the flocking strategy on performance has been evaluated.
Multiple allocation hub-and-spoke network design under hub congestion
Authors: R. S. de Camargo, G. Miranda Jr., R. P. M. Ferreira, H. P. Luna
Venue: Computers and Operations Research (2009)

The multiple allocation hub-and-spoke network design under hub congestion problem is addressed in this paper. A non-linear mixed integer programming formulation is proposed, modeling the congestion as a convex cost function. A generalized Benders decomposition algorithm has been deployed and has successfully solved standard data set instances up to 81 nodes. The proposed algorithm has also outperformed a commercial leading edge non-linear integer programming package. The main contribution of this work is to establish a compromise between the transportation cost savings induced by the economies of scale exploitation and the costs associated with the congestion effects.
Quality product derivation: a case study for quality control at Siemens
Authors: Clotilde Rohleder
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

From our experience with customers who deploy customized software products, we have learned that deriving products from shared software assets requires more than complying with quality standards like ISO9126. Additionally, developers must consider what we call the quality profile of the final product. A process that matches the quality profile of final product during product derivation helps provide and validate industrial software application solutions. This paper describes this matching concept and its application in a case study of the development of a product lifecycle reporting tool at a large organization. Also we propose a tool that could enhance quality control.
How do scientists develop and use scientific software?
Authors: Jo Erskine Hannay, Carolyn MacLeod, Janice Singer, Hans Petter Langtangen, Dietmar Pfahl, Greg Wilson
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering for Computational Science and Engineering (2009)

New knowledge in science and engineering relies increasingly on results produced by scientific software. Therefore, knowing how scientists develop and use software in their research is critical to assessing the necessity for improving current development practices and to making decisions about the future allocation of resources. To that end, this paper presents the results of a survey conducted online in October-December 2008 which received almost 2000 responses. Our main conclusions are that (1) the knowledge required to develop and use scientific software is primarily acquired from peers and through self-study, rather than from formal education and training; (2) the number of scientists using supercomputers is small compared to the number using desktop or intermediate computers; (3) most scientists rely primarily on software with a large user base; (4) while many scientists believe that software testing is important, a smaller number believe they have sufficient understanding about testing concepts; and (5) that there is a tendency for scientists to rank standard software engineering concepts higher if they work in large software development projects and teams, but that there is no uniform trend of association between rank of importance of software engineering concepts and project/team size.
A generalized polynomial chaos based ensemble Kalman filter with high accuracy
Authors: Jia Li, Dongbin Xiu
Venue: Journal of Computational Physics (2009)

As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.
Decidable Fragments of a Higher Order Calculus with Locations
Authors: Mikkel Bundgaard, Jens Chr. Godskesen, Bjørn Haagensen, Hans Hüttel
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Homer is a higher order process calculus with locations. In this paper we study Homer in the setting of the semantic finite control property, which is a finite reachability criterion that implies decidability of barbed bisimilarity. We show that strong and weak barbed bisimilarity are undecidable for Homer. We then identify and compare two distinct subcalculi of Homer that both satisfy the semantic finite control property. One subcalculus is obtained by using a type system bounding the size of process terms. The other subcalculus is obtained by considering the image of the encoding of the finite control @p-calculus in Homer.
The Iterated Classification Game: A New Model of the Cultural Transmission of Language
Authors: Samarth Swarup, Les Gasser
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2009)

The iterated classification game (ICG) combines the classification game with the iterated learning model (ILM) to create a more realistic model of the cultural transmission of language through generations. It includes both learning from parents and learning from peers. Further, it eliminates some of the chief criticisms of the ILM: that it does not study grounded languages, that it does not include peer learning, and that it builds in a bias for compositional languages. We show that, over the span of a few generations, a stable linguistic system emerges that can be acquired very quickly by each generation, is compositional, and helps the agents to solve the classification problem with which they are faced. The ICG also leads to a different interpretation of the language acquisition process. It suggests that the role of parents is to initialize the linguistic system of the child in such a way that subsequent interaction with peers results in rapid convergence to the correct language.
Characterization of α-Fe2O3nanoparticles produced by high energy ball milling
Authors: O. M. Lemine, A. Alyamani, M. Sajieddine, M. Bououdina
Venue: Proceedings of the 1st WSEAS international conference on Nanotechnology (2009)

Microstructure and magnetic measurements of milled hematite were studied using the Rietveld analysis based on XRD data and Mössbauer spectrometry. An expansion of the lattice parameters was observed. With increasing the milling time, both Scherrer method and Rietveld analysis show a decrease of the grain. Moreover, some dependence of the lattice parameters on the grain size was observed. Mössbauer spectrometry measurements reveal that there are two kinds of particles co-exist in the sample; nanostructured and micrometric hematite. The magnetic hyperfine field is affected by the grain size.
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
Authors: Johannes H. Hattingh, Ernst J. Joubert
Venue: Discrete Applied Mathematics (2009)

Let G=(V,E) be a graph. A set S@?V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted @c"r(G), is the smallest cardinality of a restrained dominating set of G. We will show that if G is a connected graph of order n and minimum degree @d and not isomorphic to one of nine exceptional graphs, then @c"r(G)@?n-@d+12.
Network Availability of Internet Services: Threats and Defenses, 1st edition
Authors: Angelos Stavrou
Venue:  (2009)

One of the most compelling problems of the Internet is the lack of a comprehensive and unifying approach to dealing with service security and resilience. Although many such individual reliability mechanisms exist, no general set of policies or standards exists regarding how these mechanisms can be combined to achieve an overall robust state of security for the network. Network Availability for Internet Services: Threats and Defenses introduces solutions for defending against distributed denial of service (DDoS) attacks. This book proposes and evaluates practical mechanisms that will frustrate these attacks, and protect a wide range of services while maintaining or even improving their performance characteristics. The focus is on network-level faults and attacks. This book provides a practical end-to-end framework that significantly improves service availability and connectivity, without incurring a prohibitive deployment or performance cost. It also introduces and analyzes mechanisms that boost the security, resilience, and performance of network systems in a manner that is transparent to both the existing infrastructure and the end-users. Designed for advanced-level students in computer science as a secondary text or reference book,this book is also suitable for practitioners and researchers in industry, as well as the government and military.
Implicit Camera Calibration Based on a Nonlinear Modeling Function of an Artificial Neural Network
Authors: Dong-Min Woo, Dong-Chul Park
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Most calibration methods are based on the camera model which consists of physical parameters of the camera including position, orientation, focal length, and optical center. In this paper, we propose a new approach which is based on the neural network model instead of the physical camera model. The neural network employed in this paper is primarily used as a nonlinear modeling function between 2D image points and points of a certain space in 3D real world. The neural network model implicitly contains all the physical parameters, some of which are very difficult to be estimated in the conventional calibration methods. In order to show the performance of the proposed method, images from two different cameras with three different camera angles were used for calibrating the cameras. The performance of the proposed neural network approach is compared with the well-known Tsai's two stage method in terms of calibration errors. The results show that the proposed approach gives much more stable and acceptable calibration error over Tsai's two stage method regardless of camera camera angle.
Pay-Per-Action Model for On-line Advertising
Authors: Mohammad Mahdian, Kerem Tomak
Venue: International Journal of Electronic Commerce (2008)

The on-line advertising industry is based on two dominant business models: pay-per-impression and pay-per-click. The growth of sponsored search has fostered a move to the pay-per-click model because it is less risky for small advertisers. An alternative model, discussed but not widely used in the advertising industry, is pay-per-conversion, or more generally, pay-per-action. This paper discusses the challenges of designing mechanisms for the pay-per-action model and approaches to tackle some of them.
Advanced Word Processsing, 17th edition
Authors: Susie H. VanHuss, Connie M. Forde, Donna L. Woo, Linda Hefferin
Venue:  (2008)

Advance yourself to the expert level of word processing with College Keyboarding 17E: Advanced Word Processing, Lessons 61-120. This text helps you focus on document mastery and advanced word-processing functions with Microsoft Word 2007. You'll quickly master Word's functions for business correspondence, tables, reports, and administrative and employment documents, plus, you'll learn graphics and design enhancement functions, ensuring that you have the skills you need to produce professional and appealing documents and business communications.
Applications of taylor formula
Authors: Dana Simian, Corina Simian
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The aim of this paper is to present a general method which allows us to obtain different identities for a class of function satisfying given conditions. Our method is based on Taylor formula. Many examples are given for the general results obtained. Limit relations for the intermediate points that appears in these identities are established.
Playout buffer and rate optimization for streaming over IEEE 802.11 wireless networks
Authors: Mingzhe Li, Mark Claypool, Robert Kinicki
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2009)

Most streaming rate selection and buffer optimization algorithms are developed for wired networks and can perform poorly over wireless networks. Wireless MAC layer behavior, such as rate adaptation, retransmissions, and medium sharing, can significantly degrade the effectiveness of current streaming algorithms. This article presents the Buffer and Rate Optimization for Streaming (BROS) algorithm to improve streaming performance. BROS uses a bandwidth estimation tool designed specifically for wireless networks and models the relationship between buffer size, streaming data rate, and available bandwidth distribution. BROS optimizes the streaming data rate and initial buffer size, resulting in a high data rate but with few frame losses and buffer underflow events, while still keeping a small initial buffer delay. BROS is implemented in the Emulated Streaming (EmuS) client-server system and evaluated on an IEEE 802.11 wireless testbed with various wireless conditions. The evaluation shows that BROS can effectively optimize the streaming rate and initial buffer size based on wireless network bandwidth conditions, thus achieving better performance than static rate or buffer selection and jitter removal buffers.
Hierarchical reconstruction for spectral volume method on unstructured grids
Authors: Zhiliang Xu, Yingjie Liu, Chi-Wang Shu
Venue: Journal of Computational Physics (2009)

The hierarchical reconstruction (HR) [Y.-J. Liu, C.-W. Shu, E. Tadmor, M.-P. Zhang, Central discontinuous Galerkin methods on overlapping cells with a non-oscillatory hierarchical reconstruction, SIAM J. Numer. Anal. 45 (2007) 2442-2467; Z.-L. Xu, Y.-J. Liu, C.-W. Shu, Hierarchical reconstruction for discontinuous Galerkin methods on unstructured grids with a WENO type linear reconstruction and partial neighboring cells, J. Comput. Phys. 228 (2009) 2194-2212] is applied to a piecewise quadratic spectral volume method on two-dimensional unstructured grids as a limiting procedure to prevent spurious oscillations in numerical solutions. The key features of this HR are that the reconstruction on each control volume only uses adjacent control volumes, which forms a compact stencil set, and there is no truncation of higher degree terms of the polynomial. We explore a WENO-type linear reconstruction on each hierarchical level for the reconstruction of high degree polynomials. Numerical computations for scalar and system of nonlinear hyperbolic equations are performed. We demonstrate that the hierarchical reconstruction can generate essentially non-oscillatory solutions while keeping the resolution and desired order of accuracy for smooth solutions.
Natural Phenomena 2007
Authors: David Ebert, Stephane Merillou
Venue:  (2007)

###############################################################################################################################################################################################################################################################
Performance of Adaptive Mesh Refinement Scheme for Hydrodynamics on Simulations of Expanding Supernova Envelope
Authors: Ayato Noro, Tomoya Ogawa, Takuma Ohta, Kazuyuki Yamashita, Shigeki Miyaji, Mitue Den
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

We present results of performance measurement of our astrophysical fluid dynamics code with Adaptive Mesh Refinement (AMR) scheme. As an example of its application for astrophysical phenomena, we show the results of 3D simulation of Rayleigh-Taylor instability in expanding supernova envelope and the possibility of reconciliation of the present model with observations. The efficiency of memory and CPU-time savings is discussed and measured with this simulation. Its result shows that our code has the ability to simulate phenomena with wide dynamic ranges even in limited computing resources.