ppxscal/embedding_network huggingface dataset:
On the Properties of Adaptive Additive Increase
Authors: Christos V. Samaras, Vassilis Tsaoussidis
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We discuss the impact of fixed window increase rules on network utilization, fair resource allocation and overall transmission effort. We exploit the dynamics of adaptive additive increase as the strategy of choice for regulating transmission in accordance with the current level of contention. We show that, based on the additive increase rate of flows, a contention-oriented responsive strategy can be designed to (i) increase utilization under low-contention, (ii) reduce overhead and transmission effort under heavy loads, and (iii) maintain system capability to reach fairness.
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Authors: J. Jackson
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We present a membership-query algorithm for efficiently learning DNF with respect to the uniform distribution. In fact, the algorithm properly learns the more general class of functions that are computable as a majority of polynomially-many parity functions. We also describe extensions of this algorithm for learning DNF over certain nonuniform distributions and from noisy examples as well as for learning a class of geometric concepts that generalizes DNF. The algorithm utilizes one of Freund's boosting techniques and relies on the fact that boosting does not require a completely distribution-independent weak learner. The boosted weak learner is a nonuniform extension of a Fourier-based algorithm due to Kushilevitz and Mansour (1991).
Power conservation for strongly connected topology control in wireless sensor network
Authors: Deying Li, Hongwei Du, Wenping Chen
Venue: Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008)

Topology control is one of the most elementary topics in wireless sensor networks. Typically, most of the research only considered the bidirectional communication and symmetric weighted communication model, while the real wireless world contains not only bidirectional but also unidirectional communication links and asymmetric weighted communication model. In this paper, we present two heuristics for the minimum power topology control problem on general model, i.e., given a set of sensors in the Euclidean plane and a transmission power threshold for each directed pair of sensors, to find a power assignment for each sensor to achieve a strong connectivity with minimum total transmission power. Extensive results in simulation evaluate the efficiency of the proposed algorithms.
A word shape coding method for camera-based document images
Authors: Linlin Li, Chew Lim Tan
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This paper reports a word shape coding method to facilitate retrieval of camera-based document images without OCR. Due to perspective distortion, many reported word shape coding methods fail on camera-based images. In this paper, the problem is addressed by approximating the perspective transformation with an affine transformation, and employing an affine invariant, namely length ratio, to represent the connected components. Components in a document image are classified into a few clusters, each of which is assigned with a representative symbol. Retrieval are based on "words" comprising of symbols. The experiment results showed that the proposed method achieved an average retrieval precision of 93.43% and recall of 94.22%.
Flexibility for extended simulation realism: Application to the simulation of mechanical behavior of beams
Authors: Keny Ordaz-Hernandez, Xavier Fischer, Fouad Bennis
Venue: Integrated Computer-Aided Engineering (2008)

This document presents a technique developed to switch between different behavioral models in the interactive simulation of a mechanical object. When conducting interactive simulations several behavioral models may be required, due to limitations of the models' validity domain. In other cases, alternative models are developed to improve the accuracy or the precision of the estimated response. Smaller time of response is also another feature that fosters model creation. In this work, an all-available model approach is proposed to perform interactive simulations where using only one model during the simulation may not be desirable, since its validity domain is finite and its advantages may appear only in a specific range of behavior. This paper proposes coupling several available models to cover a reasonable validity domain, and in particular, to improve the overall time of response. A selector, based on the Takagi-Sugeno-Kang method of inference, is constructed to dynamically switch between models, accordingly to the environment's status. This flexible model, created from a collection of sub-models, may also adapt itself to manage the accuracy/precision-time relation. The concept has been implemented in the simulation of the mechanical response of a simple structure, and performed better than the sub-models that it integrates.
Hovering Information - Self-Organising Information that Finds Its Own Storage
Authors: Alfredo A. Villalba Castro, Giovanna Di Marzo Serugendo, Dimitri Konstantas
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geographical point, called the anchor location, and to its vicinity area, called anchor area. A piece of hovering information is responsible for keeping itself alive, available and accessible to other devices within its anchor area. Hovering information uses mechanisms such as active hopping, replication and dissemination among mobile nodes to satisfy the above requirements. It does not rely on any central server. This paper presents the hovering information concept and discusses results of simulations performed for two algorithms aiming to ensure the availability of a piece of hovering information at its anchor area.
The smallest degree sum that yields potentially Pk-graphical sequences
Authors: Li Jiong-Sheng, Song Zi-Xia
Venue: Journal of Graph Theory (1998)

A simple graph G is said to have property Pk if it contains a complete subgraph of order k + 1, and a sequence &pi; is potentially Pk-graphical if it has a realization having property Pk. Let &sigma; (k, n) denote the smallest degree sum such that every n-term graphical sequence &pi; without zero terms and with degree sum &sigma; (&pi;) &ge; &sigma; (k, n) is potentially Pk-graphical. Erd&oacute;s, Jacobson, and Lehel [Graph Theory, 1991, 439449] conjectured that &sigma; (k, n) = (k - 1)(2n - k) + 2. In this article, we prove that the conjecture is true for k = 4 and n e 10. &copy; 1998 John Wiley Sons, Inc. J. Graph Theory 29: 6372, 1998
Thermal-Aware IR Drop Analysis in Large Power Grid
Authors: Yu Zhong, Martin D. F. Wong
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Due to the positive feedback loop between power grid Joule heating and the linear temperature dependence of resistivity, non-uniform temperature profiles on the power grid in high-performance IC influence the IR drop in the power grid. Lack of accurate evaluation of thermal effect on the IR drop in the power grid may lead to over-design; or worse, underestimates the IR drop due to increased local temperature. This paper presents a method to compute the temperature-dependent IR drop on the power grid extremely fast. We propose a novel thermal model and a mathematical formulation to compute the temperature profiles on the power grid efficiently. Compared to the traditional thermal lumped model, which gives a much larger thermal network than the original power grid (20 times more nodes), our model takes advantage of power grid properties, and reduces the size of the thermal equivalent network dramatically (only 13% of the size ofthe power grid). Iterative methods are used to efficiently update the IR drops based on the new temperature profile. Experimental results show that without considering temperature impact, the worst IR drop analysis can have error upto 10%.
Energy-Efficient Buffer Architecture for Flash Memory
Authors: W. T. Huang, C. T. Chen, C. H. Chen, C. C. Cheng
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Lower energy consumption is an important consideration in the design of mobile devices. Flash memory is essential in such applications, and one solution for reducing energy consumption is to include a buffer layer in the flash memory storage system. The traditional read/write buffer architecture is not suitable for flash memory, so we developed an optimal-read only-write buffer architecture tailored to the properties of flash memory described in this study. We propose an adaptive Grey decision policy for efficiently decrease the number of write operations to reduce energy consumption by 15% and 35% compared to the least recently used and flash-aware buffer policies, based on our optimal-read only-write buffer architecture.
SRAM methodology for yield and power efficiency: per-element selectable supplies and memory reconfiguration schemes
Authors: Rouwaida Kanj, Rajiv Joshi, Zhuo Li, JB Kuang, Hung Ngo, Ying Zhou, Weiping Shi, Sani Nassif
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We present a novel power-aware yield enhancement design methodology and reconfiguration scheme for deep submicron SRAM designs. We show that with the continued trend of raising array supply to counter process variations, it is more effective to use a per-element selectable virtual power-supply scenario as opposed to single array supply with traditional redundancy schemes. The element can be a bank, a sub-array, or an independent row/column, and the element's virtual supply value is determined based on fail bitmaps. The technique can also be used in conjunction with traditional redundancy schemes to further improve the efficiency. The supply and redundancy assignments can be obtained by relying on memory reconfiguration algorithms. For this, we propose a greedy yet accurate algorithm that runs in O(nlogn) as opposed to average case O(n2) traditional algorithms. The methodology leads to significant power savings ranging from 20% to 50% for 65nm technology. We expect the savings to increase in future technologies as leakage powers dominate. To the best of our knowledge, this is the first time such a methodology is applied to SRAM designs.
IEEE 802.11s wireless mesh networks: Framework and challenges
Authors: Xudong Wang, Azman O. Lim
Venue: Ad Hoc Networks (2008)

Wireless mesh networking based on 802.11 wireless local area network (WLAN) has been actively explored for a few years. To improve the performance of WLAN mesh networks, a few new communication protocols have been developed in recent years. However, these solutions are usually proprietary and prevent WLAN mesh networks from interworking with each other. Thus, a standard becomes indispensable for WLAN mesh networks. To meet this need, an IEEE 802.11 task group, i.e., 802.11s, is specifying a standard for WLAN mesh networks. Although several standard drafts have been released by 802.11s, many issues still remain to be resolved. In order to understand what performance can be expected from the existing framework of 802.11s standard and what functionalities shall be added to 802.11s standard to improve performance, a detailed study on the existing 802.11s standard is given in this paper. The existing framework of 802.11s standard is first presented, followed by pointing out the challenging research issues that still exist in the current 802.11 standard. The purpose of this paper is to motivate other researchers to develop new scalable protocols for 802.11 wireless mesh networks.
Representation and realization of the generalized solutions of the unlimited-locus controllable systems
Authors: V. I. Gurman, Yu. L. Sachkov
Venue: Automation and Remote Control (2008)

Consideration was given to various cases of controllability of the limit system describing behavior of a system with unlimited set of rates under (practically sufficiently high) pulse control actions. In compliance with these cases, the structure of the generalized solutions of the initial system was determined as regular solutions of a smaller-order system called the derivative system. Using the facts of the geometrical control theory, proposed was a multistage procedure for construction of the sequences of permissible solutions of the initial system approximating solutions of the derivative system. The presentation was illustrated by an example.
Optical information processing and the fusion of information spectrum
Authors: A. Alfalou, A. Boumezzough
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The information fusion is the regrouping of the various techniques used to associate the information varied on the same problem [1][2][3]. In image processing, the information fusion is concerned with as well as possible combine images of different origins for better knowing the object of observation. Fusion became a significant aspect of information processing in several very different fields, in which information to be amalgamated, the objectives, the methods, and thus the terminology, can vary much, even if the analogies are also numerous. The width which the information fusion takes follows that which technologies and the information processing take in general. The method of fusion that we go presented in this article is based on a regrouping of information in the spectral field. This technique was applied in the framework of the multicorrelation [4], compression, the multiplexing encryption [5]. For these operations we chose a technique to amalgamate information in the spectral field.
Wavelet based co-occurrence histogram features for texture classification with an application to script identification in a document image
Authors: P. S. Hiremath, S. Shivashankar
Venue: Pattern Recognition Letters (2008)

In this paper, we propose a novel texture feature extraction method based on the co-occurrence histograms of wavelet decomposed images, which capture the information about relationships between each high frequency subband and that in low frequency subband of the transformed image at the corresponding level. The correlation between the subbands at the same resolution exhibits a strong relationship, indicating that this information is significant for characterizing a texture. The classification performance is tested on a set of 32 Brodatz textures using the different wavelet filter banks for the proposed feature set. The results are compared with those obtained by using the Gabor filters and the method proposed by Montiel et al. [Montiel, E., Aguado, A.S., Nixon, M.S., 2005. Texture classification via conditional histograms. Pattern Recognition Lett. 26, 1740-1751]. The proposed and the Gabor features are then used in the identification of the script of a machine printed document. The scheme has been tested on eight Indian language scripts including English. It is found to be robust to the skew generated in the process of scanning a document. The experiments are also performed on the images with orientations of different angles and with varying coverage of text. The classification performance is analyzed using the k-NN classifier. The experimental results demonstrate the effectiveness of the proposed texture features in achieving the improved classification performance.
Intel&reg; threading building blocks
Authors: Chuck Pheatt
Venue: Journal of Computing Sciences in Colleges (2008)

Intel&reg; Threading Building Blocks [1] is a C++ runtime library that abstracts the low-level threading details necessary for effectively utilizing multi-core processors. It uses C++ templates to eliminate the need to create and manage threads. Applications tend to be more portable since parallelism is achieved through library calls and utilization of a task manager for scheduling. The task manager analyzes the system the software is running on, chooses the optimal number of threads, and performs load balancing that spreads out the work evenly across all processor cores. The library consists of data structures and algorithms that simplify parallel programming in C++ by avoiding requiring a programmer to use native threading packages such as POSIX threads or Windows threads, or even the portable Boost Threads.
Fiber-optic Nanoprobe Measurement of Intracellular pH in Single CA46 Cell Using pH-dependent Dye
Authors: Na Fang, Yishen Qiu, Zhihao Chen, Qinmiao Chen, Qinghong Lu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper describes the use of nanosensor and pH-dependent fluorescent dye to monitor intracellular pH in single CA46 cell. The pH-dependent fluorescent dye 5 (6)-Carboxyeosin diacetate (CFDA) was used to measure intracellular pH from the surface fluorescence of the single CA46 Cell. Argon ion laser was focused on single cell with a fiber optic nanoprobe which is parked outside on the single cell, also the emitted light was collected with this fiber optic nanoprobe. To account for system instabilities, we have explored a ratiometric approach to determine the intracellular pH on the single-cell level after staining with CFDA. Calibration of the intracellular fluorescence spectra is obtained by equilibration of internal and external pH with Nigericin in k+ buffers at different external pH. Besides accurate estimated of intracellular pH (7.21±0.05). This technique permitted monitor transient changes in intracellular pH caused by addition and removal of NH4+ and allow to study pH-regulatory in Single CA46 cell.
An efficient k'-means clustering algorithm
Authors: Krista Rizman alik
Venue: Pattern Recognition Letters (2008)

This paper introduces k'-means algorithm that performs correct clustering without pre-assigning the exact number of clusters. This is achieved by minimizing a suggested cost-function. The cost-function extends the mean-square-error cost-function of k-means. The algorithm consists of two separate steps. The first is a pre-processing procedure that performs initial clustering and assigns at least one seed point to each cluster. During the second step, the seed-points are adjusted to minimize the cost-function. The algorithm automatically penalizes any possible winning chances for all rival seed-points in subsequent iterations. When the cost-function reaches a global minimum, the correct number of clusters is determined and the remaining seed points are located near the centres of actual clusters. The simulated experiments described in this paper confirm good performance of the proposed algorithm.
How older people account for their experiences with interactive technology
Authors: P. Turner, S. Turner, G. Van De Walle
Venue: Behaviour & Information Technology (2007)

We present a qualitative study, undertaken over a period of nine months, of older people facing the challenges of learning to use interactive technology, specifically personal computers (PCs) and the internet. We examine the range of causal explanations (attributions) voiced by the group in accounting for their difficulties with it. A discourse analysis of these data reveals some factors (anxiety, age-related issues, being too busy to learn and the need for a purpose for the new tools) that support the work of other researchers, while other themes (issues around alienation, identity and agency) deepen understanding of this domain. The implications of the results for how we approach understanding the difficulties faced by older people in this context are discussed.
Towards design of a nailfold capillary microscopy image analysis and diagnosis framework using grid technology
Authors: Kuan-Ching Li, Chiou-Nan Chen, Tsu-Yi Hsieh, Chia-Hsien Wen, Joung-Liang Lan, Der-Yuan Chen, Chuan-Yi Tang
Venue: Journal of High Speed Networks (2007)

Nailfold capillary microscopy examination has been used since late 1950s as a non-invasive in-vivo technique for diagnosing and monitoring connective tissue disease in adults. Disorders such as Primary Raynaud's phenomenon, progressive systemic sclerosis, and rheumatoid arthritis were detected in more than 80% of adult patients, by analyzing such high resolution images. Internet computing and grid technologies have changed the way we tackle complex scientific problems. Grid computing environments are characterized by interconnecting a number of heterogeneous resources in geographically distributed domains. They enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. In this paper, we discuss and develop a framework for nailfold capillary microscope image acquisition and analysis, using computational power provided by grid platforms. In this way, not only useful medical information can be extracted from large amount of history anamneses in an efficient way, with the use of a number of adequate techniques and methods in high performance computing, but also to diagnose abnormal nailfold capillary in far shorter time, to diagnose patient's disease in real-time basis. Based on the results of the classification, analysis of history anamneses are done to discover updated health information possibly hidden in patients' medical records.
Blind source separation of FM and Doppler signals using T-distributions
Authors: Lei Shang, Zahir M. Hussain, Richard Harris
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper investigates the performance of the T-distributions as compared to other well known time-frequency distributions in a recently proposed blind source separation algorithm based on time-frequency analysis. In this study we considered linear FM signals (chirps), non-linear FM signals, and doppler signals.
Prediction of the translocon-mediated membrane insertion free energies of protein sequences
Authors: Yungki Park, Volkhard Helms
Venue: Bioinformatics (2008)

Motivation: Helical membrane proteins (HMPs) play crucial roles in a variety of cellular processes. Unlike water-soluble proteins, HMPs need not only to fold but also get inserted into the membrane to be fully functional. This process of membrane insertion is mediated by the translocon complex. Thus, it is of great interest to develop computational methods for predicting the translocon-mediated membrane insertion free energies of protein sequences. Result: We have developed Membrane Insertion (MINS), a novel sequence-based computational method for predicting the membrane insertion free energies of protein sequences. A benchmark test gives a correlation coefficient of 0.74 between predicted and observed free energies for 357 known cases, which corresponds to a mean unsigned error of 0.41 kcal/mol. These results are significantly better than those obtained by traditional hydropathy analysis. Moreover, the ability of MINS to reasonably predict membrane insertion free energies of protein sequences allows for effective identification of transmembrane (TM) segments. Subsequently, MINS was applied to predict the membrane insertion free energies of 316 TM segments found in known structures. An in-depth analysis of the predicted free energies reveals a number of interesting findings about the biogenesis and structural stability of HMPs. Availability: A web server for MINS is available at http://service.bioinformatik.uni-saarland.de/mins Contact: volkhard.helms@bioinformatik.uni-saarland.de Supplementary information: Supplementary data are available at Bioinformatic online.