ppxscal/embedding_network huggingface dataset:
Optimization of Input Pulse Considering Both High-Speed Response and Rebound Suppression for Solenoids
Authors: Yohei Okada, Yoshiyuki Noda, Takanori Miyoshi, Kazuhiko Terashima, Masayuki Nishida, Naohiko Suganuma
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this study, we propose that optimization of the input pulse results in a high-speed response and rebound suppression for solenoids. This input is given by two impulse voltage responses. The first impulse response rapidly drives the solenoid plunger, and the second suppresses the rebound that occurs upon reaching the reference position. In the past, these pulse timings have been determined by trial and error. In the present study, the solenoid model was built, and optimal timing of the input pulses was derived by giving an evaluation function considering both the plunger’s rebound and the arrival time.
Study on Head Regional of Hot Forming for Wide-Thick Plate
Authors: Xianzhang Feng, Junwei Cheng, Aimin Liu, Cai Liu, Junhui Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

To analyze the forming rules of the width dimensions reduction change of wide-thick plate head regional, the coupled heat rolling model of was created by the theory of the nonlinear finite element. Under the base of constant wide-thick plate width and different side pressing regulations, the forming rules were obtained for wide-thick plate head width reduction amount and side press amount, rounded analysis of variation of wide-thick plate head width reduction and corresponding experimental research were performed, the calculated results were very inosculated with the measured values, it indicates that the model is reality and credibility. The studied results have provided the theoretical references for controlling wide-thick plate head width reduction during rolling metal.
Effect preservation in transaction processing in rule triggering systems
Authors: Mira Balaban, Steffen Jurk
Venue: Acta Cybernetica (2008)

Rules provide an expressive means for implementing database behavior: They cope with changes and their ramifications. Rules are commonly used for integrity enforcement, i.e., for repairing database actions in a way that integrity constraints are kept. Yet, Rule Triggering Systems fall short in enforcing effect preservation, i.e., guaranteeing that repairing events do not undo each other, and in particular, do not undo the original triggering event. A method for enforcement of effect preservation on updates in general rule triggering systems is suggested. The method derives transactions from rules, and then splits the work between compile time and run time. At compile time, a data structure is constructed, that analyzes the execution sequences of a transaction and computes minimal conditions for effect preservation. The transaction code is augmented with instructions that navigate along the data structure and test the computed minimal conditions. This method produces minimal effect preserving transactions, and under certain conditions, provides meaningful improvement over the quadratic overhead of pure run time procedures. For transactions without loops, the run time overhead is linear in the size of the transaction, and for general transactions, the run time overhead depends linearly on the length of the execution sequence and the number of loop repetitions. The method is currently being implemented within a traditional database system.
Solving dense linear systems on platforms with multiple hardware accelerators
Authors: Gregorio Quintana-Ortí, Francisco D. Igual, Enrique S. Quintana-Ortí, Robert A. van de Geijn
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

In a previous PPoPP paper we showed how the FLAME methodology, combined with the SuperMatrix runtime system, yields a simple yet powerful solution for programming dense linear algebra operations on multicore platforms. In this paper we provide further evidence that this approach solves the programmability problem for this domain by targeting a more complex architecture, composed of a multicore processor and multiple hardware accelerators (GPUs, Cell B.E., etc.), each with its own local memory, resulting in a platform more reminiscent of a heterogeneous distributed-memory system. In particular, we show that the FLAME programming model accommodates this new situation effortlessly so that no significant change needs to be made to the codebase. All complexity is hidden inside the SuperMatrix runtime scheduling mechanism, which incorporates software implementations of standard cache/memory coherence techniques in computer architecture to improve the performance. Our experimental evaluation on a Intel Xeon 8-core host linked to an NVIDIA Tesla S870 platform with four GPUs delivers peak performances around 550 and 450 (single-precision) GFLOPS for the matrix-matrix product and the Cholesky factorization, respectively, which we believe to be the best performance numbers posted on this new architecture for such operations.
Real-time monitoring of video quality in IP networks
Authors: Shu Tao, John Apostolopoulos, Roch Guérin
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper investigates the problem of assessing the quality of video transmitted over IP networks. Our goal is to develop a methodology that is both reasonably accurate and simple enough to support the large-scale deployments that the increasing use of video over IP are likely to demand. For that purpose, we focus on developing an approach that is capable of mapping network statistics, e.g., packet losses, available from simple measurements, to the quality of video sequences reconstructed by receivers. A first step in that direction is a loss-distortion model that accounts for the impact of network losses on video quality, as a function of application-specific parameters such as video codec, loss recovery technique, coded bit rate, packetization, video characteristics, etc. The model, although accurate, is poorly suited to large-scale, on-line monitoring, because of its dependency on parameters that are difficult to estimate in real-time. As a result, we introduce a "relative quality" metric (rPSNR) that bypasses this problem by measuring video quality against a quality benchmark that the network is expected to provide. The approach offers a lightweight video quality monitoring solution that is suitable for large-scale deployments. We assess its feasibility and accuracy through extensive simulations and experiments.
A Validity Index Based on Connectivity
Authors: Sriparna Saha, Sanghamitra Bandyopadhyay
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper we have developed a connectivity based cluster validity index. This validity index is able to detect the number of clusters automatically from data sets having well separated clusters of any shape, size or convexity. The proposed cluster validity index, connect-index, uses the concept of relative neighborhood graph for measuring the amount of "connectedness" of a particular cluster. The proposed connect-index is inspired by the popular Dunn's index for measuring the cluster validity. Single linkage clustering algorithm is used as the underlying partitioning technique. The superiority of the proposed validity measure in comparison with Dunn's index is shown for four artificial and two real-life data sets.
Optimal location of the support of the control for the 1-D wave equation: numerical investigations
Authors: Arnaud Münch
Venue: Computational Optimization and Applications (2009)

We consider in this paper the homogeneous 1-D wave equation defined on ¿¿¿. Using the Hilbert Uniqueness Method, one may define, for each subset ¿¿¿, the exact control v ¿ of minimal L 2(¿×(0,T))-norm which drives to rest the system at a time T>0 large enough. We address the question of the optimal position of ¿ which minimizes the functional $J:\omega \rightarrow \|v_{\omega}\|_{L^{2}(\omega \times (0,T))}$ . We express the shape derivative of J as an integral on ¿ ¿×(0,T) independently of any adjoint solution. This expression leads to a descent direction for J and permits to define a gradient algorithm efficiently initialized by the topological derivative associated with J. The numerical approximation of the problem is discussed and numerical experiments are presented in the framework of the level set approach. We also investigate the well-posedness of the problem by considering a relaxed formulation.
On the Relevance of Facial Expressions for Biometric Recognition
Authors: Marcos Faundez-Zanuy, Joan Fabregas
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

Biometric face recognition presents a wide range of variability sources, such as make up, illumination, pose, facial expression, etc. In this paper we use the Japanese Female Facial Expression Database (JAFFE) in order to evaluate the influence of facial expression in biometric recognition rates. In our experiments we used a nearest neighbor classifier with different number of training samples, different error criteria, and several feature extractions. Our experimental results reveal that some facial expressions produce a recognition rate drop, but the optimal length of the feature extracted vectors is the same with the presence of facial expressions than with neutral faces.
Pictures worth a thousand tiles, a geometrical programming language for self-assembly
Authors: Florent Becker
Venue: Theoretical Computer Science (2009)

We present a novel way to design self-assembling systems using a notion of signal (or ray) akin to what is used in analyzing the behaviour of cellular automata. This allows purely geometrical constructions, with a smaller specification and easier analysis. We show how to design a system of signals for a given set of shapes, and how to transform these signals into a set of tiles which self-assemble into the desired shapes. We show how to use this technique on two examples: squares (with optimal assembly time and a small number of tiles) and general polygons with arbitrarily good resolution.
Packet Transmission Model in Active Network Management
Authors: Hao Tan, Hang Qiu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The Active Networks are a novel approach to network architecture in which the switches of the network perform customized computations on the messages flowing through them. In this paper, we first introduce the traditional SNMP-based network management framework, and then describe the thinking of active network. We discuss the design of some useful active packet transmission models. With the help of these packet transmissions, we can implement network management efficiently.
Models and methods for plan diagnosis
Authors: Nico Roos, Cees Witteveen
Venue: Autonomous Agents and Multi-Agent Systems (2009)

We consider a model-based diagnosis approach to the diagnosis of plans. Here, a plan performed by some agent(s) is considered as a system to be diagnosed. We introduce a simple formal model of plans and plan execution where it is assumed that the execution of a plan can be monitored by making partial observations of plan states. These observed states are used to compare them with states predicted based on (normal) plan execution. Deviations between observed and predicted states can be explained by qualifying some plan steps in the plan as behaving abnormally. A diagnosis is a subset of plan steps qualified as abnormal that can be used to restore the compatibility between the predicted and the observed partial state. Besides minimum and subset minimal diagnoses, we argue that in plan-based diagnosis maximum informative diagnoses should be considered as preferred diagnoses, too. The latter ones are diagnoses that make the strongest predictions with respect to partial states to be observed in the future. We show that in contrast to minimum diagnoses, finding a (subset minimal) maximum informative diagnosis can be achieved in polynomial time. Finally, we show how these diagnoses can be found efficiently if the plan is distributed over a number of agents.
Simulation of unit loading device inventory in airline operations
Authors: Chatabush Roongrat, Jay Rosenberger, Brian Huff
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Commercial airlines often encounter imbalances in their inventory of unit loading devices (ULDs). A stochastic simulation model was developed to evaluate inventory policies. The structure of the simulation model is described. We evaluate a minimum ULD loading configuration policy and demonstrate how it reduces ULD shortages and helps balance ULD network flow and inventory. As a result, airlines can reduce operating expenses and improve customer service. Finally, we give future directions for studying ULD inventory.
Enhanced sensitivity refractive index sensor using tilted fiber Bragg grating with thinned cladding
Authors: Yinping Miao, Bo Liu, Qida Zhao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Short-period fiber Bragg gratings with gratings planes tilted at an angle 8&deg; corresponding to the fiber axis show core mode and a large number of cladding-mode resonances in transmission. The differences between the cladding-mode resonance and the core-mode resonance are used to detect the variation of the surrounding refractive index; this refractive index sensor is immune to temperature effects by experimental demonstrations. After the cladding of the tilted fiber Bragg grating was etched by the hydrofluoric, TFBGs with different diameters and different-order cladding modes were investigated; the sensitivity of a TFBG to the external index can be significantly improved by reducing the cladding radius. Enhanced sensitivity and accuracy are achieved when the surrounding refractive index changes between 1.333 and 1.4532.
Ad hoc systems backboned by fibres: limitation and solutions
Authors: Sghaier Guizani, Habib Hamam, Xiaojiang (James) Du, Hsiao-Hwa Chen
Venue: International Journal of Sensor Networks (2009)

An ad hoc network is a set of wireless mobile nodes that communally form a network without specific user administration or configuration. There are several scenarios that do not have an available network infrastructure and could benefit from the creation of an ad hoc network as rescue/emergency operations, law enforcement activities, tactical/military missions, commercial projects, educational classrooms.
Energy minimization related to the nonlinear Schrödinger equation
Authors: Nauman Raza, Sultan Sial, Shahid S. Siddiqi, Turab Lookman
Venue: Journal of Computational Physics (2009)

In this the window of the Sobolev gradient technique to the problem of minimizing a Schrodinger functional associated with a nonlinear Schrodinger equation. We show that gradients act in a suitably chosen Sobolev space (Sobolev gradients) can be used in finite-difference and finite-element settings in a computationally efficient way to find minimum energy states of Schrodinger functionals.
Acquiring scattering properties of participating media by dilution
Authors: Srinivasa G. Narasimhan, Mohit Gupta, Craig Donner, Ravi Ramamoorthi, Shree K. Nayar, Henrik Wann Jensen
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

The visual world around us displays a rich set of volumetric effects due to participating media. The appearance of these media is governed by several physical properties such as particle densities, shapes and sizes, which must be input (directly or indirectly) to a rendering algorithm to generate realistic images. While there has been significant progress in developing rendering techniques (for instance, volumetric Monte Carlo methods and analytic approximations), there are very few methods that measure or estimate these properties for media that are of relevance to computer graphics. In this paper, we present a simple device and technique for robustly estimating the properties of a broad class of participating media that can be either (a) diluted in water such as juices, beverages, paints and cleaning supplies, or (b) dissolved in water such as powders and sugar/salt crystals, or (c) suspended in water such as impurities. The key idea is to dilute the concentrations of the media so that single scattering effects dominate and multiple scattering becomes negligible, leading to a simple and robust estimation algorithm. Furthermore, unlike previous approaches that require complicated or separate measurement setups for different types or properties of media, our method and setup can be used to measure media with a complete range of absorption and scattering properties from a single HDR photograph. Once the parameters of the diluted medium are estimated, a volumetric Monte Carlo technique may be used to create renderings of any medium concentration and with multiple scattering. We have measured the scattering parameters of forty commonly found materials, that can be immediately used by the computer graphics community. We can also create realistic images of combinations or mixtures of the original measured materials, thus giving the user a wide flexibility in making realistic images of participating media.
Conditioning of Random Conic Systems Under a&#x00a0;General Family of Input Distributions
Authors: Raphael Hauser, Tobias M&#x00fc;ller
Venue: Foundations of Computational Mathematics (2009)

We consider the conic feasibility problem associated with the linear homogeneous system Ax&#x2264;0, x&#x2260;0. The complexity of iterative algorithms for solving this problem depends on a condition number C(A). When studying the typical behavior of algorithms under stochastic input, one is therefore naturally led to investigate the fatness of the tails of the distribution of C(A). Introducing the very general class of uniformly absolutely continuous probability models for the random matrix&#x00a0;A, we show that the distribution tails of C(A) decrease at algebraic rates, both for the Goffin&#x2013;Cheung&#x2013;Cucker number C G and the Renegar number C R . The exponent that drives the decay arises naturally in the theory of uniform absolute continuity, which we also develop in this paper. In the case of C G , we also discuss lower bounds on the tail probabilities and show that there exist absolutely continuous input models for which the tail decay is subalgebraic.
The Neural Networks Approach to Identification of Local Damages in Elastic Structures
Authors: Arkady N. Soloviev, Polina S. Kourbatova, Nikolai I. Saprounov, Sergey N. Shevtsov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

With aid of neural network technology a reconstruction of crack and holes in elastic bodies was performed. On basis of multilayered perceptron (MLP) the artificial neural networks (ANN) were developed and programmatically realized. These ANN were used for identification of damaged state and for defects geometry reconstruction. At resolving of inverse problems of defects reconstruction an eigenfrequencies spectra or displacement field on free surface of body at stationary oscillation was used as additional information. The finite element soft package ACELAN acting in batch mode for learning sets generation was utilized. The examples of feedforward network training by backpropagation algorithm and also examples of damages like surface flaws and holes were considered. The numerical experiment results were shown a good reliability of developed method and performance of its program implementation.
Facilitating the Analysis of a UK National Blood Service Supply Chain Using Distributed Simulation
Authors: Navonil Mustafee, Simon J.E. Taylor, Korina Katsaliaki, Sally Brailsford
Venue: Simulation (2009)

In an attempt to investigate blood unit ordering policies, researchers have created a discrete-event model of the UK National Blood Service (NBS) supply chain in the Southampton area of the UK. The model has been created using Simul8, a commercial off-the-shelf (COTS) discrete-event simulation package (CSP). However, as more hospitals were added to the model, it was discovered that the length of time needed to perform a single simulation severely increased. It has been claimed that distributed simulation, a technique that uses the resources of many computers to execute a simulation model, can reduce simulation runtime. Further, an emerging standardized approach exists that supports distributed simulation with CSPs. These CSP Interoperability (CSPI) standards are compatible with the IEEE 1516 standard, the High Level Architecture (HLA), the de facto interoperability standard for distributed simulation. To investigate if distributed simulation can reduce the execution time of NBS supply chain simulation, this paper presents experiences of creating a distributed version of the CSP Simul8 according to the CSPI/HLA standards. It shows that the distributed version of the simulation does indeed run faster when the model reaches a certain size. Further, we argue that understanding the relationship of model features is key to performance. This is illustrated by experimentation with two different protocols implementations (using Time Advance Request (TAR) and Next Event Request (NER)). Our contribution is therefore the demonstration that distributed simulation is a useful technique in the timely execution of supply chains of this type and that careful analysis of model features can further increase performance.
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Authors: Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper systematically studies the model-checking problem for LTL formulae over restricted sets of propositional and temporal operators. For almost all combinations of temporal and propositional operators, we determine whether the model-checking problem is tractable (in P) or intractable (NP-hard). We then focus on the tractable cases, showing that they all are NL-complete or even logspace solvable. This leads to a surprising gap in complexity between tractable and intractable cases. It is worth noting that our analysis covers an infinite set of problems, since there are infinitely many sets of propositional operators.
Deterministic bottom-up tree transducers and ground term rewrite systems
Authors: Sándor Vágvölgyi
Venue: Theoretical Computer Science (2009)

We show that it is decidable for any deterministic bottom-up tree transducer A and ground term rewrite system R, which one of the following conditions holds: (i) @t(A)@?@?"R^*, (ii) @?"R^*@?@t(A), (iii) @t(A)=@?"R^*, (iv) @t(A) and @?"R^* are incomparable. Here @t(A) is the tree transformation induced by A, and @?"R^* is the congruence generated by R.