ppxscal/embedding_network huggingface dataset:
Port-based Multihomed Mobile IPv6: Load-balancing in Mobile Ad hoc Networks
Authors: Robert Brannstrom, Christer Ahlund, Arkady Zaslavsky
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

With today's heterogeneous access to the Internet, users will move between wired and wireless environments and between infrastructure mode and ad hoc mode of wireless communication. When a mobile node moves from an infrastructure connection and connects multihop to an Internet gateway, the performance will degrade and it may not be able to send all of its traffic via a single gateway. This highlights the need of load-balancing between Internet gateways, especially since the behavior of users today involves a multitude of parallel activities generating multiple flows. This paper proposes a solution that enables distribution of individual traffic flows via different Internet gateways instead of using one single gateway. The proposal includes extensions to Mobile IP in order to handle flow mobility bindings. The performance of the solution is verified by simulation studies.
Real Context Model for Tone Recognition in Mandarin Conversational Telephone Speech
Authors: Zhaojie Liu, Jian Shao, Pengyuan Zhang, Qingwei Zhao, Yonghong Yan, Ji Feng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper presents an approach to tone recognition in mandarin conversational telephone speech (CTS) based on a real context model. The real context model is proposed as a new concept designed with special consideration on the fact that mandarin CTS is characterized by complicated tone behaviors due to physiological articulation. As pitch is a supra-segmental feature, current tone's pitch value is influenced by its context especially in CTS for its fast speaking rate. A real context model covers not only the current tone but also the relative pitch level of pre-tone. Then we cluster the real context annotated training data into a few subsets to generate a more refined tone model. Gaussian Mixture Model (GMM) is used for the tone modeling. In addition, a kind of similarity measurements to compute the distance between two tones is employed, which should reveal the similarity of their pitch contour shapes and also include their different pitch height. All experiments are based on the mandarin CTS database, Train04. Our methods can improve tone recognition accuracy 4.7%.
Study on Experts_ Judgment Level of Group Decision Making Based on Numerical Value Decision Matrix
Authors: Xiang-qin Liu, Xia Chen, Bao-zhen Wei
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

It is an important research subject to carry on the classification to the level of judgment experts or experts' judgments in the group decision and analysis. With respect to the problem of the level of experts' judgment to the preference information of numerical decision matrix in the group decision making, an analytic method is proposed. Firstly, the relevant characters of numerical decision matrix and group consistency are analyzed. Then, based on defining the educe matrix of numerical decision matrix are given by each expert, a taxis approach to judgment experts' level are given. Meanwhile, based on defining the fuzzy relation matrix between the two experts, classified approaches to judgment experts' level are given. Finally, a numerical example is given to illustrate the efficacy and rationality of arithmetic.
LATEX DSL: A Coverage Control Protocol for heterogeneous Wireless Sensor Networks
Authors: Huanzhao Wang, Bei Dong, Peijun Chen, Qian Chen, Junjun Kong
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In recent years, there has been a growing interest in wireless sensor networks. Since the sensor nodes have limited available power, energy conservation is a critical issue in all researches about sensor networks. Developing a coverage control protocol to prolong networks life is one of the most important solutions. Based on analyzing the existing coverage control approaches and the features of heterogeneous sensor networks, we propose a Distributed coverage control Strategy based on Location information (DSL) for heterogeneous sensor networks. In DSL, each node calculates the coverage degree locally, and the node scheduling strategy is based on weak time synchronization scheme. Under the premise of guaranteeing nodes k-coverage precisely , DSL can make as more as possible nodes inactive. Simulation results demonstrate that our protocol can reduce the number of active nodes effectively while achieve the required coverage degree, balance the energy consumption and maintain long network lifetime.
Routing Packets into Wireless Mesh Networks
Authors: Rainer Baumann, Simon Heimlicher, Vincent Lenders, Martin May
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

provide Internet access to fixed and mobile wireless devices. In mesh networks, traffic between mesh nodes and the Internet is routed over mesh gateways. On the forward path, i.e., from mesh nodes to Internet nodes, for all mesh nodes only route information for one destination, the gateways, needs to be maintained. However, on the backward path from the Internet to mesh nodes, an individual route for every mesh node is required. In this paper we investigate protocols for backward path routing in wireless mesh networks. Using simulation experiments with realistic mobility patterns of pedestrians and cars in cities, we compare three protocols, each of which represents a routing protocol family: (i) AODV with an extension for mesh networks, a reactive routing protocol, (ii) FBR, a proactive routing protocol, and (iii) GSR, a source routing protocol. Our results indicate that FBR has the highest packet delivery ratio but is not scalable to the network size. The extended AODV seems to be neither scalable nor does it achieve a high packet delivery ratio. A good compromise is provided by GSR, which is the most scalable to the network size and still achieves a high packet delivery ratio.
Power Aware Management of Packet Switches
Authors: Lykomidis Mastroleon, Daniel O'Neill, Benjamin Yolken, Nicholas Bambos
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

In this paper, we extend the idea of Dynamic Power Management (DPM) to network packet switches, devices whose increasing speeds and densities are leading to costly and physically cumbersome power dissipation problems. In particular, we take a system-level approach, examining how operations in an input-queued (IQ) switch can be scheduled to balance power consumption on the one hand with average delay on the other. To accomplish this, we formulate a quadratic cost model which accounts for the power / delay tradeoff and then pose the scheduling problem in terms of a dynamic program. Using techniques from the field of linear quadratic regulation (LQR), we then solve for the optimal control in a relaxed system model and use this to create a novel scheduling algorithm: power aware maximum weight matching (PAMWM). Initial simulation results suggest that, under low load conditions, our algorithm results in significant power savings compared to MWM, with little performance degradation.
Minimum Frequencies for the Virtual Maximum MAC Capacity in a Multichannel Ad-Hoc Network
Authors: Myung Ah Park, Andras Farago
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Since the very first work of asymptotic capacity problem in a wireless ad-hoc network, rich variations such as adding mobility, the usage of directional antenna, and introducing infrastructure have been studied. The intention behind adding these technologies is to reduce inter-node interference and the relay burden of nodes because these are the main causes of vanishing throughput in wireless adhoc networks. Another way to increase network capacity is to use the utilization of multichannels. However, the most recent result on the capacity of a multichannel adhoc network showed that the usage of multichannels and multiple NICs can not break through the same capacity limit as with single channel. More specifically, assuming finite NICs at a node, the per-node throughput of at most \Theta(\sqrtlogn/n) can be maintained by utilizing up to \Theta(logn) channels beyond which capacity loss occurs. In order to give a new perspective on this phenomenon, we define the Minimum Frequencies for the Virtual Maximum MAC Capacity (MFVMC) problem in this paper. The objective of the problem is to find the minimum frequencies to guarantee collision-free transmissions at a given time slot for any maximum matching of a given graph. Focusing our interest to the set of unit disk graphs with the maximum node degree of d, we prove that \Theta(d) is the tight bound for the MFVMC problem. We discuss the implication of this result on the asymptotic network capacity in a multichannel ad-hoc network.
Scout: a data-parallel programming language for graphics processors
Authors: Patrick McCormick, Jeff Inman, James Ahrens, Jamaludin Mohd-Yusof, Greg Roth, Sharen Cummins
Venue: Parallel Computing (2007)

Commodity graphics hardware has seen incredible growth in terms of performance, programmability, and arithmetic precision. Even though these trends have been primarily driven by the entertainment industry, the price-to-performance ratio of graphics processors (GPUs) has attracted the attention of many within the high-performance computing community. While the performance of the GPU is well suited for computational science, the programming interface, and several hardware limitations, have prevented their wide adoption. In this paper we present Scout, a data-parallel programming language for graphics processors that hides the nuances of both the underlying hardware and supporting graphics software layers. In addition to general-purpose programming constructs, the language provides extensions for scientific visualization operations that support the exploration of existing or computed data sets.
Performance Evaluation of Multiple TCP connections in iSCSI
Authors: Bhargava K. Kancherla, Ganesh M. Narayan, K. Gopinath
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Storage Area Networks (SANs) based on Fibre Channel have been used extensively in the last decade while iSCSI is fast becoming a serious contender due to its reduced costs and unified infrastructure. This work examines the performance of iSCSI with multiple TCP connections. Multiple TCP connections are often used to realize higher bandwidth but there may be no fairness in how bandwidth is distributed. We propose a mechanism to share congestion information across multiple flows in "Fair-TCP" for improved performance. Our results show that Fair-TCP significantly improves the performance for I/O intensive workloads.
Runge-Kutta-Fehlberg-Reverse Adaptive Solution to Rout Reservoir Flood
Authors: Xu Guang Li, Ben De Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

A Runge-Kutta-Fehlberg-Reverse (RKFR) adaptive numerical algorithm for a first-order nonlinear ordinary differential equation is presented and employed to rout floods through reservoir spillways. The classical Runge-Kutta-Fehlberg RKF method ignored the local stability, and in the new method the step length will be further adjusted via a local stability parameter, which measurably reflects the fact as the local truncation error is little enough, the local stability might approximately be characterized by the relative error between the initial dependent variable associated with every step and the feedback which may be calculated using a reverse Runge-Kutta RK method. The idea is verified with two distinct types of numerical examples, and the results have been shown to advance greatly the accuracy of numerical solution with comparable computed speed relative to the RKF. Subsequently, the RKFR is coupled with the reservoir flood routing process, and integrated into the flood control decision support system of Huanren-Huilong reservoir group in Hunjiang River basin of Northeast China, and the testing result demonstrates it is more scientific and reliable compared with the RKF and RK.
Optimized query execution in large search engines with global page ordering
Authors: Xiaohui Long, Torsten Suel
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Large web search engines have to answer thousands of queries per second with interactive response times. A major factor in the cost of executing a query is given by the lengths of the inverted lists for the query terms, which increase with the size of the document collection and are often in the range of many megabytes. To address this issue, IR and database researchers have proposed pruning techniques that compute or approximate term-based ranking functions without scanning over the full inverted lists. Over the last few years, search engines have incorporated new types of ranking techniques that exploit aspects such as the hyperlink structure of the web or the popularity of a page to obtain improved results. We focus on the question of how such techniques can be efficiently integrated into query processing. In particular, we study pruning techniques for query execution in large engines in the case where we have a global ranking of pages, as provided by Pagerank or any other method, in addition to the standard term-based approach. We describe pruning schemes for this case and evaluate their efficiency on an experimental cluster-based search engine with million web pages. Our results show that there is significant potential benefit in such techniques.
A New Parallel Test Approach for Large Memories
Authors: Thirumalai Sridhar
Venue: IEEE Design Test (1986)

Memory test times?and thus test costs?are increasing rapidly as the size of the memories grows each year. Testability techniquestherefore must be developed to reduce the test time without compromising the test quality. This article presents an approachthat meets this goal using parallel signature analyzers (PSAs). PSAs can access more data cells in parallel than I/O pinscan, and the approach's parallelism reduces the test time. The proposed method is analyzed with respect to test time, testquality, and silicon area penalty.
Parallel techniques for information extraction from hyperspectral imagery using heterogeneous networks of workstations
Authors: Antonio J. Plaza
Venue: Journal of Parallel and Distributed Computing (2008)

Recent advances in space and computer technologies are revolutionizing the way remotely sensed data is collected, managed and interpreted. In particular, NASA is continuously gathering very high-dimensional imagery data from the surface of the Earth with hyperspectral sensors such as the Jet Propulsion Laboratory's airborne visible-infrared imaging spectrometer (AVIRIS) or the Hyperion imager aboard Earth Observing-1 (EO-1) satellite platform. The development of efficient techniques for extracting scientific understanding from the massive amount of collected data is critical for space-based Earth science and planetary exploration. In particular, many hyperspectral imaging applications demand real time or near real-time performance. Examples include homeland security/defense, environmental modeling and assessment, wild-land fire tracking, biological threat detection, and monitoring of oil spills and other types of chemical contamination. Only a few parallel processing strategies for hyperspectral imagery are currently available, and most of them assume homogeneity in the underlying computing platform. In turn, heterogeneous networks of workstations (NOWs) have rapidly become a very promising computing solution which is expected to play a major role in the design of high-performance systems for many on-going and planned remote sensing missions. In order to address the need for cost-effective parallel solutions in this fast growing and emerging research area, this paper develops several highly innovative parallel algorithms for unsupervised information extraction and mining from hyperspectral image data sets, which have been specifically designed to be run in heterogeneous NOWs. The considered approaches fall into three highly representative categories: clustering, classification and spectral mixture analysis. Analytical and experimental results are presented in the context of realistic applications (based on hyperspectral data sets from the AVIRIS data repository) using several homogeneous and heterogeneous parallel computing facilities available at NASA's Goddard Space Flight Center and the University of Maryland.
Query expansion using probabilistic local feedback with application to multimedia retrieval
Authors: Rong Yan, Alexander Hauprmann
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval models. However, the performance of local feedback is heavily dependent on the assumption that most top-ranked documents are relevant to the query topic. Although this assumption might be sensible for ad-hoc text retrieval, it is usually violated in many other retrieval tasks such as multimedia retrieval. In this paper, we develop a robust local analysis approach called probabilistic local feedback (PLF) based on a discriminative probabilistic retrieval framework. The proposed model is effective for improving retrieval accuracy without assuming the most top-ranked documents are relevant. It also provides a sound probabilistic interpretation and a convergence guarantee on the iterative result updating process. Although derived from variational techniques, this approach only involves an iterative process of simple operations on ranking features and thus can be computed efficiently in practice. Our multimedia retrieval experiments on TRECVID'03-'05 collections have demonstrated the advantage of the proposed PLF approaches which can achieve noticeable gains in terms of mean average precision over various baseline methods and PRF-augmented results.
Special Feature: Computing in China, 1979-an Update
Authors: I. L. Auerbach
Venue: Computer (1979)

China's ccomplishments remain impressive in spite of political barriers to technical progress. Most limiting of these is the dictum of self-sufficiency, which makes vertical integration and its attendant efficiency impossible.
Society-oriented Designated Confirmer Signatures
Authors: Baodian Wei, Fangguo Zhang, Xiaofeng Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The concept of society-oriented designated confirmer signatures (SDCS) is introduced in this paper. SDCS can be used in the circumstances where the capability of the signer and that of the confirmer are both needed to be shared among groups of individuals. The ways to share the signing capability and the confirming capability are different due to the different stabilities of the signer group and the confirmer group. Based on the techniques of threshold cryptography, a concrete SDCS scheme is proposed and its security is analyzed. Our scheme can also be converted into an ordinary signature scheme or a designated verifier signature scheme.
Chaotic Time Series Prediction Based on Radial Basis Function Network
Authors: Ding Tao, Xiao Hongfei
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

A prediction method for chaotic time series, based on radial basis function (RBF) network, is proposed. First, two important parameters for reconstructing phase space, the time delay and the embedding dimension, are estimated by correlation integral method, and the embedding dimension is the number of input units. Second, RBF centers are optimized by means of the Cross Iterative Fuzzy Clustering Algorithm (CIFCA) and the Regularized Orthogonal Least Squares Algorithm (ROLSA), and the selected RBF centers construct hidden units. The proposed method centralizes advantages of CIFCA and ROLSA, and it can decrease network scale, improve generalization performance, accelerate network training speed and avoid ill-conditioning of learning problems. A case of known chaotic system, Rollser system, verifies validity of the proposed method.
Mining approximate top-k subspace anomalies in multi-dimensional time-series data
Authors: Xiaolei Li, Jiawei Han
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time and form time-series data. Moreover, the time series data correspond to market segments, which are described by a set of attributes, such as age, gender, education, income level, and product-category, that form a multi-dimensional structure. To better understand market dynamics and predict future trends, it is crucial to study the dynamics of time-series in multi-dimensional market segments. This is a topic that has been largely ignored in time series and data cube research. In this study, we examine the issues of anomaly detection in multi-dimensional time-series data. We propose time-series data cube to capture the multi-dimensional space formed by the attribute structure. This facilitates the detection of anomalies based on expected values derived from higher level, "more general" time-series. Anomaly detection in a time-series data cube poses computational challenges, especially for high-dimensional, large data sets. To this end, we also propose an efficient search algorithm to iteratively select subspaces in the original high-dimensional space and detect anomalies within each one. Our experiments with both synthetic and real-world data demonstrate the effectiveness and efficiency of the proposed solution.
Seamless proactive handover across heterogeneous access networks
Authors: Ashutosh Dutta, Subir Das, David Famolari, Yoshihiro Ohba, Kenichi Taniuchi, Victor Fajardo, Rafa Marin Lopez, Toshikazu Kodama, Henning Schulzrinne
Venue: Wireless Personal Communications: An International Journal (2007)

Dual-mode handsets and multimode terminals are generating demand for solutions that enable convergence and seamless handover across heterogeneous access networks. The IEEE 802.21 working group is creating a framework that defines a Media Independent Handover Function (MIHF), facilitates handover across heterogeneous access networks, and helps mobile users experience better performance during mobility events. In this paper, we describe this 802.21 framework and also summarize a Media-independent Pre-Authentication (MPA) mechanism currently under discussion within the IRTF that can further optimize handover performance. We discuss how the 802.21 framework and the MPA technique can be integrated to improve handover performance. Finally, we describe a test-bed implementation and validate experimental performance results of the combined mobility technique.