ppxscal/embedding_network huggingface dataset:
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
Authors: Y. Guo, A. Lim, B. Rodrigues, J. Tang
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experiments are conducted using benchmark CATS test sets and more complex test sets. The algorithm provides optimal solutions for most test sets and is always 1% from the optimal solutions for all CATS test sets. Comparisons with CPLEX 8.0 are also provided, which show that the algorithm provides good solutions.
InTeRail: A Test Architecture for Core-Based SOCs
Authors: Dimitri Kagaris, Spyros Tragoudas
Venue: IEEE Transactions on Computers (2006)

A flexible test architecture for embedded cores and all interconnects in a System-on Chip (SOC) is presented. It targets core testing parallelism and reduced test application time by using, as much as possible, existing core interconnects to form TAM paths. It also provides for dynamic wrapper reconfiguration. Algorithms that minimize the use of extra interconnects for the TAM path formation are presented and evaluated.
Iteration Aware Prefetching for Remote Data Access
Authors: Philip J. Rhodes, Sridhar Ramakrishnan
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Although processing speed, storage capacity and network bandwidth are steadily increasing, network latency remains a bottleneck for scientists accessing large remote data sets. This problem is most acute with n-dimensional data. Grid researchers have only recently begun to develop tools for efficient remote access to n-dimensional data sets. Within the context of the Granite Scientific Database system, we show that latency penalties can be dramatically reduced using explicit knowledge of a user's access pattern represented as an Iterator. The iterator not only performs an n-dimensional iteration for the user, but also communicates the access pattern to Granite so that a prefetching cache can be constructed that is tuned to the user's access pattern. We experimentally evaluate a scenario for incorporating Granite's prefetching mechanism into the Grid, demonstrating extraordinary performance gains. In light of these results, we describe planned additions to existing Grid services to allow selection of datasets according to the user access pattern.
Language Understanding is One of Key Technologies for Designing an Intelligent CW Natural Language Understanding and Action Control Project
Authors: Hozumi Tanaka
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The project Natural Language Understanding and Action Control started in 2001 as 5-year research project of a Grant-in-Aid for Creative Scientific Research supported by the Ministry of Education, Culture, Sports, Science and Technology, and Japan Society for the Promotion of Science. The research objectives are summarized as follows:
Breaking the Connection: RDMA Deconstructed
Authors: Rajeev Sivaram, Rama K. Govindaraju, Peter Hochschild, Robert Blackmore, Piyush Chaudhary
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

The architecture, design and performance of RDMA (remote direct memory access) over the IBM HPS (High Performance Switch and adapter) are described. Unlike conventional implementations such as InfiniBand, our RDMA transport model is layered on top of an unreliable datagram interface, while leaving the task of enforcing reliability to the ULP (upper layer protocol). We demonstrate that our model allows a single MPI task to deliver bidirectional bandwidth of close to 3. GB/s across a single link and 2 . GB/s when striped across 8 links. In addition, we show that this transport protocol has superior attributes in terms of a) being able to handle RDMA packets coming out of order; b) being able to use multiple routes between a source-destination pair and c) reducing the size of adapter caches.
Design of 802.11 Access Point Chipsets for Enterprise Applications, invited
Authors: N. Patrick Kelly, Ben W. Jones, Nestor A. Fesas, John M. Morton
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Many 802.11 chipsets are designed for client applications and force-fit into access point (AP) applications. Unfortunately, this leaves system designers with very few tools to combat complicated deployment and management issues. As wireless LAN usage becomes more prevalent and new techniques are introduced (e.g. MIMO), the number of applications will increase, further exacerbating these issues. This paper will focus on the unique needs of AP applications, with an emphasis on the needs of businesses (enterprises). It will then be shown how these issues can be addressed through the careful design of an AP system-on-a-chip (SoC). Topics discussed will include RF management, cognitive radio, interference, and 802.11n. Various features needed to address these areas will be presented.
Disordered lattice networks: general theory and simulations: Research Articles
Authors: Stefano Giordano
Venue: International Journal of Circuit Theory and Applications (2005)

In this work we develop a theory for describing random networks of resistors of the most general topology. This approach generalizes and unifies several statistical theories available in literature. We consider an n-dimensional anisotropic random lattice where each node of the network is connected to a reference node through a given random resistor. This topology includes many structures of great interest both for theoretical and practical applications. For example, the one-dimensional systems correspond to random ladder networks, two-dimensional structures model films deposited on substrates and three-dimensional lattices describe random heterogeneous materials. Moreover, the theory is able to take into account the anisotropic percolation problem for two- and three-dimensional structures. The analytical results allow us to obtain the average behaviour of such networks, i.e. the electrical characterization of the corresponding physical systems. This effective medium theory is developed starting from the properties of the lattice Green's function of the network and from an ad hoc mean field procedure. An accurate analytical study of the related lattice Green's functions has been conducted obtaining many closed form results expressed in terms of elliptic integrals. All the theoretical results have been verified by means of numerical Monte-Carlo simulations obtaining a remarkably good agreement between numerical and theoretical values. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Energy efficient designs for collaborative signal and information processing in wireless sensor networks
Authors: Hairong Qi
Venue:  (2005)

Collaborative signal and information processing (CSIP) plays an important role in the deployment of wireless sensor networks. In order to support the execution of CSIP algorithms, distributed computing paradigm and clustering protocols, are needed, which are the major concentrations of this dissertation. In order to facilitate collaboration among sensor nodes, we present a mobile-agent computing paradigm, where the processing code is moved to the sensor nodes through mobile agents. We further conduct extensive performance evaluation versus the traditional client/server-based computing. Experimental results show that the mobile agent paradigm performs much better when the number of nodes is large while the client/server paradigm is advantageous when the number of nodes is small. Based on this result, we propose a hybrid computing paradigm that adopts different computing models within different clusters of sensor nodes. Either the client/server or the mobile agent paradigm can be employed within clusters or between clusters according to the different cluster configurations. This new computing paradigm can take full advantages of both client/server and mobile agent computing paradigms. Simulations show that the hybrid computing paradigm performs better than either the client/server or the mobile agent computing. The mobile agent itinerary has a significant impact on the overall performance of the sensor network. We thus formulate both the static mobile agent planning and the dynamic mobile agent planning as optimization problems. Based on the models, we then present three itinerary planning algorithms. We have showed, through simulation, that the predictive dynamic itinerary performs the best in a wide range of conditions, thus making it particularly suitable for CSIP in wireless sensor networks. In order to facilitate the deployment of hybrid computing paradigm, we proposed a decentralized reactive clustering (DRC) protocol to cluster the sensor network in an energy efficient way. The clustering process is only invoked by events occur in the sensor network. Nodes that do not detect the events are put into the sleep state to save energy. In addition, power control technique is used to minimize the transmission power needed. The advantages of DRC protocol are demonstrated through simulations.
Multi-Image 2D-PAGE Feature Detection
Authors: Nick Seow, Arcot Sowmya, Changming Sun
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Although there have been many reports on computerised methods of spot detection for 2D-PAGE gel images, these methods examine one gel image at a time. Different spot detection methods are negatively affected by the multitude of different blemishes that may occur in gel images in different ways. We present a method for utilising pairs of gel images which allows improvements in initial spot detection in both images. Testing of our algorithms on 188 pairings of gel images demonstrates automatic improvements on single-image spot-detection with robustness to initial errors and a 97.5% accuracy.
Geometric algebra of points, lines, planes and spheres for computer vision and robotics
Authors: Eduardo Bayro-Corrochano, Luis Eduardo Falcón
Venue: Robotica (2005)

This paper introduces conformal geometric algebra (CGA) for applications in computer vision and robotics. The authors show that CGA deals with our intuition and insight of the geometry and it helps us to reduce considerably the computational burden of the problems. The CGA can be applied not only to describe the geometry of the space, but to handle the algebra of incidence, as well as conformal transformations, to deal with kinematics or projective geometry problems. The authors show with real and simulated applications that this system can be of great advantage in robotics and computer vision.
TEEVE: The Next Generation Architecture for Tele-immersive Environment
Authors: Zhenyu Yang, Klara Nahrstedt, Yi Cui, Bin Yu, Jin Liang, Sang-hack Jung, Ruzena Bajscy
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Tele-immersive 3D multi-camera room environments are starting to emerge and with them new challenging research questions. One important question is how to organize the large amount of visual data, being captured, processed, transmitted and displayed, and their corresponding resources, over current COTS computing and networking infrastructures so that "everybody" would be able to install and use tele-immersive environments for conferencing and other activities. In this paper we propose a novel crosslayer control and streaming framework over general purpose delivery infrastructure, called TEEVE (Tele-immersive Environments for EVErybody). TEEVE aims for effective and adaptive coordination, synchronization, and soft QoSenabled delivery of tele-immersive visual streams to remote room(s). The TEEVE experiments between two teleimmersive rooms residing in different institutions more than 2000 miles apart show that we can sustain communication of up to 12 3D video streams with 4~5 3D frames per second for each stream, yielding 4~5 tele-immersive video rate.
Irregular-structure tree models for image interpretation
Authors: Sinisa Todorovic
Venue:  (2005)

In this dissertation, we seek to accomplish the following related goals: (1) to find a unifying framework to address localization, detection, and recognition of objects, as three sub-tasks of image-interpretation, and (2) to find a computationally efficient and reliable solution to recognition of multiple, partially occluded, alike objects in a given single image. The second problem is to date an open problem in computer vision, eluding a satisfactory solution. For this purpose, we formulate object recognition as Bayesian estimation, whereby class labels with the maximum posterior distribution are assigned to each pixel. To efficiently estimate the posterior distribution of image classes, we propose to model images with graphical models known as irregular trees. The irregular tree specifies probability distributions over both its structure and image classes. This means that, for each image, it is necessary to infer the optimal model structure, as well as the posterior distribution of image classes. We propose several inference algorithms as a solution to this NP-hard problem (nondeterministic polynomial time), which can be viewed as variants of the Expectation-Maximization (EM) algorithm. After inference, the model represents a forest of subtrees, each of which segments the image. That is, inference of model structure provides a solution to object localization and detection. With respect to our second goal, we hypothesize that for a successful occluded-object recognition it is critical to explicitly analyze visible object parts. Irregular trees are convenient for such analysis, because the treatment of object parts represents merely a particular interpretation of the tree/subtree structure. We analyze the significance of irregular-tree nodes, representing object parts, with respect to recognition of an object as a whole. This information is then exploited toward the ultimate object recognition. Empirical results demonstrate that irregular trees more accurately model images than their fixed-structure counterparts quad-trees. Also, the experiments reported herein show that our explicit treatment of object parts results in an improved recognition performance, as compared to the strategies in which object components are not explicitly accounted for.
Multi-Resolution Indexing for XML Dat
Authors: Antoine Maghamez, Gongzhu Hu
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

As the Extendible Markup Language (XML) becoming a de facto standard for representing and exchanging data over the Internet, it is critical to be able to retrieve XML data efficiently. One way to achieve this is to use indexing, just like we index data stored in relational databases. In this paper, we present a multi-resolution structural index (MRI) method to facilitate fast retrieval of XML data. The indexing method is based on a new coding scheme that assigns unique numbers to the elements on all possible paths of the tree representing the XML document. The coding scheme is based on the DTD (Data Type Definition) of the XML file. Elements are stored in internal data structures in such a way that they can be directly accessed via the unique coding. The ancestordescendant relationships among the tree elements are easily identified to help fast process of user's queries. Our experiments show that the MRI indexing approach is effective, both in time and space.
Generating More MNT Elliptic Curves
Authors: Michael Scott, Paulo S. Barreto
Venue: Designs, Codes and Cryptography (2006)

In their seminal paper, Miyaji et al. [13] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curves are important for the realisation of pairing-based cryptosystems on ordinary (non-supersingular) elliptic curves. We provide an alternative derivation of their results, and extend them to allow for the generation of many more suitable curves.
Impact of mobility on mobile telecommunications networks: Research Articles
Authors: Yi-Bing Lin, Ai-Chun Pang, Herman Chung-Hwa Rao
Venue: Wireless Communications Mobile Computing (2005)

This paper describes the mobility management mechanisms for mobile telecommunications networks. There are two major types of mobility: radio network mobility and core network mobility. Radio network mobility supports radio link switching of a mobile user during conversation, and core network mobility provides roaming and tunnel-related management for packet re-routing due to user movement. Impact of mobility on both the radio and the core networks is addressed in this paper. Also, potential research issues on these topics are discussed. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Computing for LQCD: apeNEXT
Authors: Francesco Belletti, Sebastiano Fabio Schifano, Raffaele Tripiccione, Francois Bodin, Philippe Boucaud, Jacques Micheli, Olivier Pene, Nicola Cabibbo, Sergio de Luca, Alessandro Lonardo, Davide Rossetti, Piero Vicini, Maxim Lukyanov, Laurent Morin, Norbert Paschedag, Hubert Simma, Vincent Morenas, Dirk Pleiter, Federico Rapuano
Venue: Computing in Science and Engineering (2006)

apeNEXT is the latest in the APE collaboration's series of parallel computers for computationally intensive calculations such as quantum chromo dynamics on the lattice. The authors describe the computer architectural choices that have been shaped by almost two decades of collaboration activity.
A Novel Methodology for Constructing Secure Multipath Overlays
Authors: Marc Sanchez Artigas, Pedro Garcia Lopez, Antonio F. Gomez Skarmeta
Venue: IEEE Internet Computing (2005)

One technique for securely delivering data in structured overlays is to increase the number of disjoint paths among peers. However, most overlays do not offer a substrate to accommodate multiple paths. The binary-equivalence relationship-based Cyclone methodology is decoupled from the overlay architecture, which insulates it from such limitations. It fortifies existing routing algorithms to defend against data-forwarding attacks.
A Benchmark Suite for SOAP-based Communication in Grid Web Services
Authors: Michael R. Head, Madhusudhan Govindaraju, Aleksander Slominski, Pu Liu, Nayef Abu-Ghazaleh, Robert van Engelen, Kenneth Chiu, Michael J. Lewis
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

The convergence of Web services and grid computing has promoted SOAP, a widely used Web services protocol, into a prominent protocol for a wide variety of grid applications. These applications differ widely in the characteristics of their respective SOAP messages, and also in their performance requirements. To make the right decisions, an application developer must thus understand the complex dependencies between the SOAP implementation and the application. We propose a standard benchmark suite for quantifying, comparing, and contrasting the performance of SOAP implementations under a wide range of representative use cases. The benchmarks are defined by a set of WSDL documents. To demonstrate the utility of the benchmarks and to provide a snapshot of the current SOAP implementation landscape, we report the performance of many different SOAP implementations (gSOAP, AxisJava, XSUL and bSOAP) on the benchmarks, and draw conclusions about their current performance characteristics.
Exponential Stabilization of Laminated Beams with Structural Damping and Boundary Feedback Controls
Authors: Jun-Min Wang, Gen-Qi Xu, Siu-Pang Yung
Venue: SIAM Journal on Control and Optimization (2005)

We study the boundary stabilization of laminated beams with structural damping which describes the slip occurring at the interface of two-layered objects. By using an invertible matrix function with an eigenvalue parameter and an asymptotic technique for the first order matrix differential equation, we find out an explicit asymptotic formula for the matrix fundamental solutions and then carry out the asymptotic analyses for the eigenpairs. Furthermore, we prove that there is a sequence of generalized eigenfunctions that forms a Riesz basis in the state Hilbert space, and hence the spectrum determined growth condition holds. Furthermore, exponential stability of the closed-loop system can be deduced from the eigenvalue expressions. In particular, the semigroup generated by the system operator is a $C_0$-group due to the fact that the three asymptotes of the spectrum are parallel to the imaginary axis.
Supporting ordering and consistency in a distributed Event Heap for Ubiquitous Computing
Authors: Oliver Storz, Adrian Friday, Nigel Davies
Venue: Personal and Ubiquitous Computing (2005)

The Stanford Event Heap has been shown to provide appropriate support for constructing interactive workspace applications. Given this success it is natural to consider the Event Heap as a platform to support other classes of Ubiquitous Computing applications. In this paper we argue that the distributed, spontaneous nature of these applications places additional demands on the Event Heap that require extensions to both the engineering and API. Suitable extensions are described and their use to support a typical Ubicomp application is discussed.
A Very Low Power CMOS Potentiostat for Bioimplantable Applications
Authors: Mohammad M. Ahmadi, Graham A. Jullien
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, we describe a new structure for designing low power potentiostats, which are suitable for electrochemical sensors used in biomedical implants. The low power consumption is a result of using just one operational amplifier in the structure. The structure is also inherently very low noise because it amplifies the output current of the sensor in current mode which can then be converted to the desirable variable; i.e., voltage, frequency, pulse width, etc. Finally we present a new topology for the design of a low power operational amplifier dedicated to driving super capacitive chemical sensors.
A User-guided Association Rules Mining Method and Its Application
Authors: Yanhong Li
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Association rules method is important in mining large sets of data, but there are often many meaningless rules discovered, which affects the algorithm's efficiency, moreover, the presentation of rules is not easy for users to understand. User guide often works during association rules mining procedure. This paper presents a user-guided association rules mining method, considering users' differential emphasis on each item through fuzzy regions. This is more realistic and practical than prior association rules methods. Moreover, the discovered rules are expressed in natural language that is more understandable to humans. The paper finally uses the proposed method to analyze data sets of appliance loan, the performance of the proposed approach is demonstrated.