ppxscal/embedding_network huggingface dataset:
Learning While Optimizing an Unknown Fitness Surface
Authors: Roberto Battiti, Mauro Brunato, Paolo Campigotto
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered in the Reactive Tabu Search (RTS) method, where the appropriate amount of diversification in prohibition-based (Tabu) local search is adapted in a fast online manner to the characteristics of a task and of the local configuration. We model the parameter-tuning policy as a Markov Decision Process where the states summarize relevant information about the recent history of the search, and we determine a near-optimal policy by using the Least Squares Policy Iteration (LSPI) method. Preliminary experiments on Maximum Satisfiability (MAX-SAT) instances show very promising results indicating that the learnt policy is competitive with previously proposed reactive strategies.
Core and Conditional Core Path of Specified Length in Special Classes of Graphs
Authors: S. Balasubramanian, S. Harini, C. Pandu Rangan
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

A core path of a graph is a path P in G that minimizes d(P) = ${\underset{v \in V}{\sum}} d(v,P)w(v)$. In this paper, we study the location of core path of specified length in special classes of graphs. Further, we extend our study to the problem of locating a core path of specified length under the condition that some existing facilities are already located (known as conditional core path of a graph). We study both the problems stated above in vertex weighted bipartite permutation graphs, threshold graphs and proper interval graphs and give polynomial time algorithms for the core path and conditional core path problem in these classes. We also establish the NP-Completeness of the above problems in the same classes of graphs when arbitrary positive weights are assigned to edges.
Area Throughput of an IEEE 802.15.4 Based Wireless Sensor Network
Authors: Chiara Buratti, Flavio Fabbri, Roberto Verdone
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

In this paper we present a mathematical model to evaluate the performance of an IEEE 802.15.4 based multi-sink Wireless Sensor Network (WSN). Both sensors and sinks are assumed to be Poisson distributed in a given finite domain. Sinks send periodic and synchronous queries, and each sensor transmits its sample to a sink, selected among those that are audible. The IEEE 802.15.4 Multiple Access Control (MAC) protocol is used by sensors to access the channel: both Beacon-Enabled and Non Beacon-Enabled modes are considered. Our aim is to describe how the Area Throughput, defined as the amount of samples per unit of time successfully transmitted to the sinks from the given area, depends on the density of sensors and the query interval. We jointly account for MAC issues (i.e. packet collisions) and connectivity aspects (i.e. network topology, power losses and radio channel behaviour). Performance is evaluated by varying the traffic offered to the network (i.e. the number of sensors deployed), the packet size, the number of Guaranteed Time Slots allocated, and the Superframe Order. A comparison between results obtained in the Beacon-Enabled and the Non Beacon-Enabled cases is also provided, showing how the Area Throughput can be optimised.
The impact of fragmentation over streaming video traffic
Authors: Delyan Genkov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Most software applications do not consider the process of IP datagram fragmentation. They rely on the network for fragmenting packets or on the operating system's Path MTU Discovery algorithm for finding the best packet size for transmission without fragmentation. This behaviour is dangerous and in some cases can lead to particular or full miscommunication. The present paper aims to demonstrate the negative impact of IP fragmentation process over one of most common types of traffic in present world -- streaming video.
Arm-cranking exercise assisted by Functional Electrical Stimulation in C6 tetraplegia: A pilot study
Authors: S. Coupaud, H. Gollee, K. J. Hunt, M. H. Fraser, D. B. Allan, A. N. Mclean
Venue: Journal of Visualization (2008)

Tetraplegic volunteers undertook progressive exercise training, using novel systems for arm-cranking exercise assisted by Functional Electrical Stimulation (FES). The main aim was to determine potential training effects of FES-assisted arm-crank ergometry (FES-ACE) on upper limb strength and cardiopulmonary {fitness} in tetraplegia. Surface FES was applied to the biceps and triceps during exercise on an instrumented ergometer. Two tetraplegic volunteers with C6 Spinal Cord Injury (SCI) went through muscle strengthening, baseline exercise testing and three months of progressive FES-ACE training. Repeat exercise tests were carried out every four weeks during training, and post-training, to monitor upper-limb strength and cardiopulmonary fitness. At each test point, an incremental test was carried out to determine peak work rate, peak oxygen uptake, gas exchange threshold and oxygen uptake-work rate relationship during FES-ACE. Peak oxygen uptake for Subject A increased from 0.7 l/min to 1.1 l/min, and peak power output increased from 7 W to 38 W after FES-ACE training. For Subject B, peak oxygen uptake was unchanged, but peak power output increased from 3 W to 8 W. These case studies illustrate potential benefits of FES-ACE in tetraplegia, but also the differences in exercise responses between individuals.
Asymptotic behavior of solutions of third-order nonlinear dynamic equations on time scales
Authors: Zhi-Hua Yu, Qi-Ru Wang
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we will study asymptotic behavior of solutions to third-order nonlinear dynamic equations on time scales of the form (1a"2(t)((1a"1(t)(x^@D(t))^@a^"^1)^@D)^@a^"^2)^@D+q(t)f(x(t))=0. By using the Riccati technique and integral averaging technique, two different types of criteria are established, one of which extends some existing results and the other is new. Two examples of dynamic equations on different time scales are given to show the applications of the obtained results.
Hierarchical reconstruction for discontinuous Galerkin methods on unstructured grids with a WENO-type linear reconstruction and partial neighboring cells
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] is applied to the piecewise quadratic discontinuous Galerkin method on two-dimensional unstructured triangular grids. A variety of limiter functions have been explored in the construction of piecewise linear polynomials in every hierarchical reconstruction stage. We show that on triangular grids, the use of center biased limiter functions is essential in order to recover the desired order of accuracy. Several new techniques have been developed in the paper: (a) we develop a WENO-type linear reconstruction in each hierarchical level, which solves the accuracy degeneracy problem of previous limiter functions and is essentially independent of the local mesh structure; (b) we find that HR using partial neighboring cells significantly reduces over/under-shoots, and further improves the resolution of the numerical solutions. The method is compact and therefore easy to implement. Numerical computations for scalar and systems of nonlinear hyperbolic equations are performed. We demonstrate that the procedure can generate essentially non-oscillatory solutions while keeping the resolution and desired order of accuracy for smooth solutions.
Improved Core Isolation and Access for Hierarchical Embedded Test
Authors: Benoit Nadeau-Dostie, Saman M. I. Adham, Russell Abbott
Venue: IEEE Design Test (2009)

IEEE Std 1500 enables automation and hence allows for easier and faster integration of embedded cores into an SoC. This article describes an automated test development system based on the concept of embedded test.
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids
Authors: Zolt&#x00e1;n F&#x00fc;l&#x00f6;p, Andreas Maletti, Heiko Vogler
Venue: Theory of Computing Systems (2009)

Kleene&#x2019;s theorem on the equivalence of recognizability and rationality for formal tree series over distributive multioperator monoids is proved. As a consequence of this, Kleene&#x2019;s theorem for weighted tree automata over arbitrary, i.e., not necessarily commutative, semirings is derived.
An efficient cell-centered diffusion scheme for quadrilateral grids
Authors: M. M. Basko, J. Maruhn, An. Tauschwitz
Venue: Journal of Computational Physics (2009)

A new algorithm for solution of diffusion equations in two dimensions on structured quadrilateral grids is proposed. The algorithm is based on a semi-implicit method for the time discretization and has a nine-point local stencil in space. Our scheme is fast, quite accurate and demonstrates good spatial convergence. The presented numerical tests show that it is well suited for hydrocodes with cell-centered principal variables.
Intuitionistic Letcc via Labelled Deduction
Authors: Jason Reed, Frank Pfenning
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The well-known embedding of intuitionistic logic into classical modal logic means that intuitionistic logic can be viewed as a calculus of labelled deduction on multiple-conclusion sequents, where the labels are the Kripke worlds of the modal embedding. The corresponding natural deduction system constitutes a type system for programs using control operators such as letcc that capture the current program continuation, which has a modal restriction on the use of such continuations that enforces constructive validity. This allows us to develop a rich dependent type theory incorporating letcc, which is known to be otherwise highly problematic for computational interpretations of classical logic. Moreover, we give a novel constructive proof for the soundness of this labelled deduction system, whose algorithmic content is a non-deterministic translation of programs that eliminates uses of letcc and is fully compatible with dependent types and therefore with program verification. This proof has been formally verified on the propositional fragment in the Twelf meta-logical framework.
The Study of the Crystalline Structure of the Phases in the Al-Ni Alloys Ultra Rapid Solidification
Authors: Lidia Cristea, Enona Cristea
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

Melt–spinning and melt-extraction methods of rapid solidification have been applied on Al-Ni alloys in the lower and higher composition. For guiding appreciations of the peripheral speed of the cooling disk it is used the dependence between the thickness of the solidified fibbers and the peripheral speed of the extraction disk. The cooling speed calculated on the basis of the thermo transfer coefficient in accordance with the thickness of the fibers has lead to values of the cooling speed of one million C/sec (fibbers of 100 micro meters). Alloys with 1, 86 % Ni content in pouring status and ultra rapid solidified have been analyzed from the point of crystalline structure. The paper is a short analysis of the use of the X-ray diffraction techniques for observing the effects of ultra rapid solidification in Al-Ni alloys. This technique permits to observe highlighting the imperfections in the crystal pattern
Moving Object Segmentation Using Optical Flow and Depth Information
Authors: Jens Klappstein, Tobi Vaudrey, Clemens Rabe, Andreas Wedel, Reinhard Klette
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper discusses the detection of moving objects (being a crucial part of driver assistance systems) using monocular or stereoscopic computer vision. In both cases, object detection is based on motion analysis of individually tracked image points (optical flow), providing a motion metric which corresponds to the likelihood that the tracked point is moving. Based on this metric, points are segmented into objects by employing a globally optimal graph-cut algorithm. Both approaches are comparatively evaluated using real-world vehicle image sequences.
An interface designed for networked monitoring and control in wireless sensor networks
Authors: Xianghui Cao, Jiming Chen, Youxian Sun
Venue: Computer Standards Interfaces (2009)

In this paper, a new interface is developed in detail that provides terminal users with ways for direct and convenient interactions with the wireless sensor networks (WSNs). It also embraces an Internet based subsystem for remote monitoring and controlling of the WSNs. Different from existing platforms and interfaces, our design is general, extensible and not constrained for specific applications. More importantly, it paves the way for improving the data processing efficiency and avoiding data execution congestion. It proposes the idea utilizing the advantages of existing professional mathematical software tools, such as Matlab, Mathematica and Maple, to process the WSN data.
Search shortcuts using click-through data
Authors: Ranieri Baraglia, Fidel Cacheda, Victor Carneiro, Vreixo Formoso, Raffaele Perego, Fabrizio Silvestri
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

Major Web Search Engines take as a common practice to provide Suggestions to users in order to enhance their search experience. Such suggestions have normally the form of queries that are, to some extent, "similar" to the queries already submitted by the same or related users. The final aim of query suggestions is typically to help users to satisfy their information needs more quickly. In this paper we face this problem from a somewhat different perspective, and we propose a new query suggestion model based on Search Shortcuts, that consist in finding and proposing to the user "Successful" queries that allowed, in the past, several users to satisfy their information needs. This model differs from traditional query suggestion approaches, and allows the evaluation to be performed effectively by exploiting actual user sessions from the Microsoft 2006 RFP dataset. We evaluate several algorithms applied to this problem, both traditional Collaborative Filtering techniques and ad-hoc solutions, and report on preliminary results achieved.
Operational experiences with the TI advanced scientific computer
Authors: W. J. Watson, H. M. Carr
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Since 1966 a large computer development program has been conducted by Texas Instruments. The goal for this effort was to provide needed capacity for supporting seismic processing, plus offering a general purpose capability for large scientific problems.
An alternate interface to computers for the physically handicapped: the auto-monitoring communication board
Authors: Gregg C. Vanderheiden, Andrew M. Volk, C. Daniel Geisler
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

For many individuals severe physical handicaps have completely cut off most avenues of personal development and employment. Their physical involvement bars them from any constructive or creative activities requiring physical or manipulative abilities. Moreover, their inability to speak, write or efficiently operate even simple communication devices severely impairs their ability to develop and exercise their mental capacities. This latter problem is basically an output problem in which a normally functioning intellect is trapped within a body having no effective means of communicating or interacting with the environment. Fortunately with today's technology, especially micro electronics and the computer, new avenues are being opened for these individuals which promise them not only a chance for a more effective education and a more meaningful mode of self expression, but also a means of self support through employment.
On orthogonal generalized equitable rectangles
Authors: H. Cao, J. Dinitz, D. Kreher, D. R. Stinson, R. Wei
Venue: Designs, Codes and Cryptography (2009)

In this note, we give a complete solution of the existence of orthogonal generalized equitable rectangles, which was raised as an open problem in by Stinson (Des Codes Cryptogr 45:347---357, 2007).
Edge Block Detection and Motion Vector Information Based Fast VBSME Algorithm
Authors: Qin Liu, Yiqing Huang, Satoshi Goto, Takeshi Ikenaga
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Compared with previous standards, H.264/AVC adopts variable block size motion estimation (VBSME) and multiple reference frames (MRF) to improve the video quality. Full search motion estimation algorithm (FS), which calculates every search candidate in the search window for 7 block type with multiple reference frames, consumes massive computation power. Mathematical analysis reveals that the aliasing problem of subsampling algorithm comes from high frequency signal components. Moreover, high frequency signal components are also the main issues that make MRF algorithm essential. As we know, a picture being rich of texture must contain lots of high frequency signals. So based on these mathematical investigations, two fast VBSME algorithms are proposed in this paper, namely edge block detection based subsampling method and motion vector based MRF early termination algorithm. Experiments show that strong correlation exists among the motion vectors of those blocks belonging to the same macroblock. Through exploiting this feature, a dynamically adjustment of the search ranges of integer motion estimation is proposed in this paper. Combing our proposed algorithms with UMHS almost saves 96–98% Integer Motion Estimation (IME) time compared to the exhaustive search algorithm. The induced coding quality loss is less than 0.8% bitrate increase or 0.04 dB PSNR decline on average.
Categories of Geospatial and Temporal Integrity Constraints
Authors: Stephan Mäs, Wolfgang Reinhardt
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Integrity constraints play a major role when the logical consistency of a data set has to be evaluated during quality assurance. The paper reviews established approaches of integrity constraint classification and proposes a profound categorisation which distinguishes semantic integrity constraints according to the semantic domains of the involved properties. The categorisation provides the preconditions for formalisation and the identification of conflicts and redundancies in sets of integrity constraints. Therewith the management and usability of integrity constraints will be improved which will also result an improvement of spatial data quality.
3-dimensional digital terrestrial television
Authors: Rafael G. Ayestarán, Jesús A. López, Vanesa Lobato, Víctor M. Peláez, Sonia García
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

A new Digital Terrestrial Television service based on transmission and visualization of 3D images is presented. This service has been designed to be suitable for domestic users without relevant increase of the final cost for the spectator, being the production of the programs what is modified to generate adequate 3D TV signals. The systems that make possible the implementation of the service have been prototyped and tested including the recording cameras and the visualization subsystem for the domestic environment. Some future development lines have also been defined, taking into account different parameters such as quality of service and final cost for the spectator.
The Web-based B2B Environment with Web Services
Authors: Chenxia Sun, Xiaoyang He, Chao Wang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The objective of this work is to develop business-to-business processes of electronic markets using Web services in order to facilitate the execution of these processes in different electronic markets. The main contribution of this approach is the promotion of interoperability, just-in-time integration, and reduction of complexity. In specific, the Cooperation, Orchestration and Semantic Mapping of Web Services (termed as COSMOS) tool, which is an integrated development environment that enables the creation, design and modification of executable business processes based on the Business Process Execution Language, is used for the integration of business-to-business processes of a Virtual Agricultural Market into a fully functional Web-based environment.
VLSI Implementation of a Complete Pipeline MMSE Detector for a 4 × 4 MIMO-OFDM Receiver
Authors: Shingo Yoshizawa, Yasushi Yamauchi, Yoshikazu Miyanaga
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents a VLSI architecture of MMSE detection in a 4×4 MIMO-OFDM receiver. Packet-based MIMO-OFDM imposes a considerable throughput requirement on the matrix inversion because of strict timing in frame structure and subcarrier-by-subcarrier basis processing. Pipeline processing oriented algorithms are preferable to tackle this issue. We propose a pipelined MMSE detector using Strassen's algorithms of matrix inversion and multiplication. This circuit achieves real-time operation which does not depend on numbers of subcarriers. The designed circuit has been implemented to a 90-nm CMOS process and shows a potential for providing a 2.6-Gbps transmission speed in a 160-MHz signal bandwidth.
A Service Selection Method of Non-critical Task in Parallel Structure
Authors: Hong-ning Zhu, Bin Zhang, Xian-wen Gao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Aiming at the neglected selection for non-critical task in parallel structure, this paper provides a method of services selection based on grey relational analysis. It regards the execution time of critical task as the upper limit for the execution time of non-critical task, uses the execution time of non-critical task as the reference series, and takes other QoS criteria as compared series. And the grey relational grades represent the relational degree between the QoS criteria and the execution time; the grey relational grades are reduced to the QoS criteria’s weights, then evaluating the weighted sum of criteria in order to choose the optimized candidate Web QoS service of parallel structure. Though the selection sacrifices the execution time of non-critical task, it has no influence on the execution time of parallel structure, and improves other QoS criteria simultaneously. The instance analysis shows that the method is a composite service QoS optimization technique which does not affect the execution time of composite services and obtains the better service quality at the cost of sacrificing the execution time of non-critical task.