ppxscal/embedding_network huggingface dataset:
River model calibration, from guidelines to operational support tools
Authors: Jean-Philippe Vidal, Sabine Moisan, Jean-Baptiste Faure, Denis Dartus
Venue: Environmental Modelling Software (2007)

Numerical modelling is now used routinely to make predictions about the behaviour of environmental systems. Model calibration remains a critical step in the modelling process and different approaches have been taken to develop guidelines to support engineers and scientists in this task. This article reviews currently available guidelines for a river hydraulics modeller by dividing them into three types: on the calibration process, on hydraulic parameters, and on the use of hydraulic simulation codes. The article then presents an integration of selected guidelines within a knowledge-based calibration support system. A prototype called CaRMA-1 (Calibration of River Model Assistant) has been developed for supporting the calibration of models based on a specific 1D code. Two case studies illustrate the ability of the prototype to face operational situations in river hydraulics engineering, for which both data quality and quantity are not sufficient for an optimal calibration. Using CaRMA-1 allows the modeller to achieve the calibration task in accordance with good calibration practice implemented in the knowledge base. Relevant reasoning rules can easily be added to the knowledge base to extend the prototype range of applications. This study thus provides a framework for building operational support tools from various types of existing engineering guidelines.
Laboratory based courses in distance learning settings
Authors: M. Khader
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Offering laboratory-based courses in distance learning environments presents a set of difficulties. First, in asynchronous distance learning settings (mainly video-tapes and self-paced learning), students may not have access to a laboratory and may have to rely on simulation tools, leaving a lot to be desired regarding the laboratory hands-on experience. Second, in synchronous distance learning settings (in which two or more sections of a class convene at geographically separated sites with one instructor supervising the multiple sites simultaneously), laboratory equipment would need to be duplicated at all sites. Furthermore-in the synchronous setting-keeping students at the remote sites interested presents another level of difficulty that needs to be resolved. In this paper, we present solutions that should help to alleviate these problems.
Error recovery in JPEG2000 image transmission
Authors: L. Atzori
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

In this paper, the problem of bit-errors recovery in JPEG2000 images transmission is addressed, with particular attention to errors in the high-frequency components. In the HL and LH sub-bands, differently from the LL band, interpolation based recovering results tend to be often ineffective when more than a few adjacent wavelet coefficients are missing. The solution proposed is then to apply a wavelet patch repetition procedure by predicting the similitude between the contour structure in the damaged area and its surroundings. To this aim, the correlation in the spatial structure, that is the contour information, existing between different sub-bands has been analyzed and exploited. Accordingly, the patch used to conceal the corrupted region is that obtained by minimizing a correlation measure with the spatial structure extracted from an adjacent not corrupted subband. Objective and subjective improvements have been obtained.
Transfer method of Force Information using Five-Fingered Haptic Interface Robot
Authors: Takahiro Endo, Haruhisa Kawasaki, Kazushige Kigaku, Tetsuya Mouri
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In the expert skill transfer, it takes a great deal of time and effort to obtain new skills for beginners. In particular, it is difficult to teach the skills by using only words. So, the skill transfer system that uses VR attracts attention. In this paper, we propose a method for transferring force information and consider the skill transfer system for human five fingers by using five-fingered haptic interface robot.
Multiblock latent root regression. Application to epidemiological data
Authors: Stéphanie Bougeard, Mohamed Hanafi, El Mostafa Qannari
Venue: Computational Statistics (2007)

Several papers have already stressed the interest of latent root regression and its similarities to partial least squares regression. A new formulation of this method which makes it even simpler than the original method to set up a prediction model is discussed. Furthermore, it is shown how this method can be extended not only to the case where it is desired to predict several response variables from a set of predictors but also to the multiblock setting where the aim is to predict one or several data sets from several other data sets. The interest of the method is illustrated on the basis of a data set pertaining to epidemiology.
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
Authors: Blas Pelegrín, Juani L. Redondo, Pascual Fernández, Inmaculada García, Pilar M. Ortigosa
Venue: Journal of Global Optimization (2007)

In many discrete location problems, a given number s of facility locations must be selected from a set of m potential locations, so as to optimize a predetermined fitness function. Most of such problems can be formulated as integer linear optimization problems, but the standard optimizers only are able to find one global optimum. We propose a new genetic-like algorithm, GASUB, which is able to find a predetermined number of global optima, if they exist, for a variety of discrete location problems. In this paper, a performance evaluation of GASUB in terms of its effectiveness (for finding optimal solutions) and efficiency (computational cost) is carried out. GASUB is also compared to MSH, a multi-start substitution method widely used for location problems. Computational experiments with three types of discrete location problems show that GASUB obtains better solutions than MSH. Furthermore, the proposed algorithm finds global optima in all tested problems, which is shown by solving those problems by Xpress-MP, an integer linear programing optimizer (21). Results from testing GASUB with a set of known test problems are also provided.
Clustering of SNP Data with Application to Genomics
Authors: Michael K. Ng, Mark J. Li, Sio I. Ao, Pak C. Sham, Yiu-ming Cheung, Joshua Z. Huang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Single nucleotide polymorphisms (SNPs) are very common throughout the genome and hence are potentially valuable for mapping disease susceptibility loci by detecting association between SNP markers and disease. Many methods may only be applicable when marker haplotypes, rather than genotypes (categorical data), are available for analysis. In this paper, we explore the properties of k-modes (categorical data) clustering algorithms to SNP data for detecting association between SNP markers and disease. Subspace k-modes clustering properties are also considered and tested.
On the problem of detection and discrimination of double talk and change in the echo path
Authors: C. Carlemalm
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The problem of detection and discrimination of double talk and change in the echo path in a telephone channel is considered. The phenomenon echo path change requires fast adaptation of the channel model to be able to equalize the echo dynamics. On the other hand, the adaption rate should be reduced when double talk occurs. Thus, it is critical to quickly detect a change in the echo path while not confusing it with double talk, which gives a similar effect. The proposed likelihood based approach compares a global channel model with a local one over a sliding window, both estimated with the recursive least squares algorithm.
Validation of a Load Shared Integrated Network with Heterogeneous Services
Authors: S. J. Lincke
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

As wireless networks have become more complex with packet services and sophisticated modulation techniques, validation using multidimensional Markov Chain models has become increasingly rare. Although Product Form models fail when queued packet services are introduced, iterative models (such as Gauss-Seidel) can be accurate. However, Gauss- Seidel is memory and processor intensive. This study considers whether probabilistic transitions can replace state variables in reducing the size of the Gauss-Seidel matrix, while modeling wireless load sharing algorithms including packet services, such as could be used in seamless 4G networks. The model is validated against simulation. Performance results are discussed for load shared networks involving heterogeneous queued packet services alone or in combination with speech services.
Reconfigurable computing implementation of binary morphological operators using 4-, 6- and 8-connectivity
Authors: H. M. Talu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This work details and compares the application of configurable and reconfigurable computing techniques to the estimation of binary 3/spl times/3 masks of 4-, 6- and 8-connectivity and logical operations of AND, OR and NOT. Specifically it is shown that the promise of reconfigurable as opposed to configurable computing provides a very efficient implementation of the morphological operator kernel.
Low-delay perfect reconstruction two-channel FIR/IIR filter banks and wavelet bases with SOPOT coefficients
Authors: W. Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A new family of two-channel low-delay filter banks and wavelet bases using the PR structure of Phoong, Kim and Vaidyanathan (1995) with sum of powers-of-two (SOPOT) coefficients are proposed. In particular, the functions alpha(z) and beta(z) in the structure are chosen as nonlinear-phase FIR and IIR filters, and the design of such multiplier-less filter banks is performed using the genetic algorithm. The proposed design method is very simple to use, and is sufficiently general to construct low-delay filter banks with flexible lengths, delays, and regularity. Several design examples are given to demonstrate the usefulness of the proposed method.
Implementation of IPv6 in 4.4 BSD
Authors: Randall J. Atkinson, Daniel L. McDonald, Bao G. Phan, Craig W. Metz, Kenneth C. Chin
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

The widespread availability of the TCP/IP protocols in early versions of BSD UNIX fostered the currently widespread use of those protocols in commercial products. Rapid depletion of the IPv4 address space has caused the Internet Engineering Task Force to design version 6 of the Internet Protocol (IPv6). IPv6 has some similiarities with IPv4, but it also has many differences, most notably in address size. This paper describes our experience creating a freely distributable implementation of IPv6 inside 4.4 BSD, with focus on the areas that have changed between the IPv4 and IPv6 implementations.
Guest Editors' Introduction: Biochips and Integrated Biosensor Platforms
Authors: Krishnendu Chakrabarty, Roland Thewes
Venue: IEEE Design Test (2007)

Biochips and integrated biosensor platforms are revolutionizing DNA analysis, clinical diagnostics, and biomolecule detection and manipulation. Miniaturized biochips have emerged in recent years because of the convergence of rapid advances in life sciences, sensors, microfluidics, microfabrication techniques, and information technology. This special addresses design, integration, and test issues related to biochips.
Monadic datalog over finite structures with bounded treewidth
Authors: Georg Gottlob, Reinhard Pichler, Fang Wei
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-para-meter tractability results. Indeed, by Courcelle's Theorem we know: Any property of finite structures, which is expressible by an MSO sentence, can be decided in linear time (data complexity) if the structures have bounded treewidth. In principle, Courcelle's Theorem can be applied directly to construct concrete algorithms by transforming the MSO evaluation problem into a tree language recognition problem. The latter can then be solved via a finite tree automaton (FTA). However, this approach has turned out to be problematical, since even relatively simple MSO formulae may lead to a "state explosion" of the FTA. In this work we propose monadic datalog (i.e., data log where all intentional predicate symbols are unary) as an alternative method to tackle this class of fixed-parameter tractable problems. We show that if some property of finite structures is expressible in MSO then this property can also be expressed by means of a monadic datalog program over the structure plus the treedecomposition. Moreover, we show that the resulting fragment of datalogcan be evaluated in linear time (both w.r.t. the program size and w.r.t. the data size). This new approach is put to work by devising a new algorithm for the PRIMALITY problem (i.e., testing if some attribute in a relational schema is part of a key). We also report on experimental results with a prototype implementation.
An Adaptive Multilevel Method for Time-Harmonic Maxwell Equations with Singularities
Authors: Zhiming Chen, Long Wang, Weiying Zheng
Venue: SIAM Journal on Scientific Computing (2007)

We develop an adaptive edge finite element method based on reliable and efficient residual-based a posteriori error estimates for low-frequency time-harmonic Maxwell equations with singularities. The resulting discrete problem is solved by the multigrid preconditioned MINRES (minimum residual) iteration algorithm. We demonstrate the efficiency and robustness of the proposed method by extensive numerical experiments for cavity problems with singular solutions which include, in particular, scattering over screens.
An Efficient VLSI Architecture for Template Matching
Authors: N. Ranganathan, Satish Venugopal
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

In this paper, we describe a new special purpose VLSI architecture for template matching, based on a technique known as moment preserving pattern matching (MPPM). This technique first converts the given gray scale image and template into binary form using the moment preserving quantization method and then uses a pairing function to compute the similarity measure. The technique yields accurate results comparable to other approaches but involves simpler computations. The proposed architecture is systolic in nature and achieves a high degree of parallelism and pipelining. It is shown that the proposed architecture is much simpler, achieves higher speed, has a lower hardware complexity and utilizes lesser memory than other special purpose architectures for template matching.
Asynchronous CVE Support System by Continuous VR Space Archiver
Authors: Hiroki Ogasawara, Yoshitaka Shibata
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, we introduce a new idea of revision tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. The revision tree with hierarchical 3D structure is visualized in space and operated by users to refer the past space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communica- tion among many users over computer network. Using this method, the users as group members can progress collabo- rative work and confirm the past CVE without prior commu- nication even if some of the group members do not partic- ipate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.
A distribution definition language for the automated distribution of Java objects
Authors: Paul Soule, Tom Carnduff, Stuart Lewis
Venue: Proceedings of the 2nd workshop on Domain specific aspect languages (2007)

Distributed applications are difficult to write. Programmers need to adhere to specific distributed systems programming conventions and frameworks, which makes distributed systems development complex and error prone and ties the resultant application to the distributed system because the applications code is tangled with the crosscutting concern distribution. We introduce a simple high level domain specific aspect language we call a Distribution Definition Language (DDL), which describes the classes and methods of an existing application that are to be made remote, the distributed system to use to make them remote, and the recovery mechanism to use in the event of a remote error. The DDL is used by the RemoteJ compiler / generator to generate the distributed system specific code and apply it to components using bytecode manipulation techniques. We describe the language and its features and show that a distribution definition language can be used to significantly simplify distributed systems development and improve software reuse.
A longest prefix first search tree for IP lookup
Authors: Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

The IP lookup mechanism is a key issue, in the design of IP routers. IP lookup is an important action in a router, which finds the next hop of each incoming packet with a longest-prefix-match address in the routing table. This work places the routing table on a longest prefix first search tree, which is constructed as a heap-like structure by the prefix length. A router using this scheme has fewer memory accesses when executing IP lookup than a router designed according to the Trie [E. Fredkin, Trie Memory, Communication of the ACM 3 (1960) 490-500], Patricia [K. Sklower, A tree-based routing table for Berkeley Unix, in: Proceedings of the USENIX Conference, 1991, pp. 93-99] or Prefix tree [M. Berger, IP lookup with low memory requirement and fast update, in: Proceedings of IEEE High Performance Switching and Routing, 2003, pp. 287-291]. Some nodes of the proposed tree can include two entries of the routing table to decrease the number of tree nodes. For instance, a routing table with 163,695 entries can be held in the proposed tree with 156,191 nodes. Furthermore, an improved scheme is presented to partition a tree into several smaller trees. The simulation reveals that the scheme not only lowers the tree height effectively but also scales well to IPv6 addresses.
Parallel Detection of Targets in Hyperspectral Images Using Heterogeneous Networks of Workstations
Authors: Antonio Plaza, David Valencia, Soraya Blazquez, Javier Plaza
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Heterogeneous networks of workstations have rapidly become a cost-effective computing solution in many application areas. This paper develops several highly innovative parallel algorithms for target detection in hyperspectral imagery, considered to be a crucial goal in remote sensing-based homeland security and defense applications. In order to illustrate parallel performance, we consider four (partially and fully) heterogeneous networks of workstations distributed among different locations at University of Maryland, and also a massively parallel Beowulf cluster at NASA's Goddard Space Flight Center. Experimental results indicate that heterogeneous networks can be used as a viable low-cost alternative to homogeneous parallel systems in many on-going and planned remote sensing missions.
Algorithms of Unicast, Multicast and Broadcast Transmission for Optical Switches
Authors: Iwona Pozniak-Koszalka, Dawid Zydek
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Optical technologies for recent computer networks should provide high performance, ability to easy expansion and ensuring greater data's safety. They are very popular and still very much under research. The paper concerns optical switching problem for broadcast, multicast and unicast traffic. Improvement of architecture represented by input-output matrix and broadcast-multicast matrix, which deals with the considered types of transmission, is presented. For the proposed system, new modified algorithms like LSA, QLSA, Exact and J-family are provided and investigated. In order to evaluate properties of developed algorithms, the experimentation system has been designed and implemented. As main index of performance the total penalty T_P is used. The idea of experimentation system, some results of research and properties of algorithms are discussed.
Traffic data repository at the WIDE project
Authors: Kenjiro Cho, Koushirou Mitsuya, Akira Kato
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

It becomes increasingly important for both network researchers and operators to know the trend of network traffic and to find anomaly in their network traffic. This paper describes an on-going effort within the WIDE project to collect a set of free tools to build a traffic data repository containing detailed information of our backbone traffic. Traffic traces are collected by tcpdump and, after removing privacy information, the traces are made open to the public. We review the issues on user privacy, and then, the tools used to build the WIDE traffic repository. We will report the current status and findings in the early stage of our IPv6 deployment.
Practical algorithm for data security (PADS) in wireless sensor networks
Authors: Julia Albath, Sanjay Madria
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

When data are generated in sensor networks, high-speed data streams travel through the network. Traditional security approaches are often unable to keep up with the rates of the streams or they introduce overhead, which shortens the life of the network. The approach proposed in this paper is one that solves the problems posed above. By embedding a one-time pad, the actual value is distorted enough to make any information gleaned from eavesdropping useless to an attacker. The use of the one-time pad ensures that the data were indeed received from a particular sensor, and it gives adequate protection against injected messages. The simulation shows this approach provides security with negligible overhead while the throughput is similar to the same network without security.