ppxscal/embedding_network huggingface dataset:
Improving service selection in component-based architectures with optimal stopping
Authors: Oliver Skroch, Klaus Turowski
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

This paper describes how optimal stopping strategies [9,11] are applicable to certain situations of service selection in component-based and serviceoriented software architectures. It shows how optimal stopping can be used at runtime to stop with O(n) complexity a dynamic service selection process and then yield 1/e probability for the best choice. It provides experimental confirmation in a simulation with currency conversion Web services. Areas of further applicability include grid computing, distributed multimedia and mobile computing.
For Programmers, Multicore Chips Mean Multiple Challenges
Authors: David Geer
Venue: Computer (2007)

Because they are unable to continue to effectively improve microprocessor performance by shrinking transistors and packing more of them onto single-core chips, vendors are building multicore chips that handle various parts of an application in parallel, an alternative approach that presents many challenges.
Comments on "Data Mining Static Code Attributes to Learn Defect Predictors"
Authors: Hongyu Zhang, Xiuzhen Zhang
Venue: IEEE Transactions on Software Engineering (2007)

In this correspondence, we point out a discrepancy in a recent paper "Data Mining Static Code Attributes to Learn Defect Predictors" that was published in this journal. Because of the small percentage of defective modules, using pd and pf as accuracy measures may lead to impractical prediction models.
Human Computer Interaction: Legibility and Contrast
Authors: Silvia Zuffi, Carla Brambilla, Giordano Beretta, Paolo Scala
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In human computer interaction readability of textual information is one of the foremost requirements for displays designed to provide visual information. In this context it is of main interest to identify the design attributes that influence readability, and investigate their relationship with measures of ease of reading. In this paper we present results from a readability experiment focused on text contrast that we performed on the Web. Our analysis indicate that light text on dark background is more difficult to read, and that the minimum luminance contrast between foreground and background color, in terms of CIELAB lightness difference, should be about 27 units.
Navigation techniques for small-screen devices: An evaluation on maps and web pages
Authors: Stefano Burigat, Luca Chittaro, Silvia Gabrielli
Venue: International Journal of Human-Computer Studies (2008)

Several techniques have been proposed to support user navigation of large information spaces (e.g., maps or web pages) on small-screen devices such as PDAs and Smartphones. In this paper, we present the results of an evaluation that compared three of these techniques to determine how they might affect performance and satisfaction of users. Two of the techniques are quite common on mobile devices: the first one (DoubleScrollbar) is the standard combination of two scrollbars for separate horizontal and vertical scrolling with zoom buttons to change the scale of the information space, the second one (Grab&Drag) enables users to navigate the information space by directly dragging its currently displayed portion, while zooming is handled through a slider control. The last technique (Zoom-Enhanced Navigator or ZEN) is an extension and adaptation to mobile screens of Overview&Detail approaches, which are based on displaying an overview of the information space together with a detail view of a portion of that space. In these approaches, navigation is usually supported by (i) highlighting in the overview which portion of space is displayed in the detail view, and (ii) allowing users to move the highlight within the overview area to change the corresponding portion of space in the detail area. Our experimental evaluation concerned tasks involving maps as well as web page navigation. The paper analyzes in detail the obtained results in terms of task completion times, number and duration of user interface actions, accuracy of the gained spatial knowledge, and subjective preferences.
Letters: Convex incremental extreme learning machine
Authors: Guang-Bin Huang, Lei Chen
Venue: Neurocomputing (2007)

Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Transactions on Neural Networks 17(4) (2006) 879-892] have recently proposed a new theory to show that single-hidden-layer feedforward networks (SLFNs) with randomly generated additive or radial basis function (RBF) hidden nodes (according to any continuous sampling distribution) can work as universal approximators and the resulting incremental extreme learning machine (I-ELM) outperforms many popular learning algorithms. I-ELM randomly generates the hidden nodes and analytically calculates the output weights of SLFNs, however, I-ELM does not recalculate the output weights of all the existing nodes when a new node is added. This paper shows that while retaining the same simplicity, the convergence rate of I-ELM can be further improved by recalculating the output weights of the existing nodes based on a convex optimization method when a new hidden node is randomly added. Furthermore, we show that given a type of piecewise continuous computational hidden nodes (possibly not neural alike nodes), if SLFNs f"n(x)=@?i=1n@b"iG(x,a"i,b"i) can work as universal approximators with adjustable hidden node parameters, from a function approximation point of view the hidden node parameters of such ''generalized'' SLFNs (including sigmoid networks, RBF networks, trigonometric networks, threshold networks, fuzzy inference systems, fully complex neural networks, high-order networks, ridge polynomial networks, wavelet networks, etc.) can actually be randomly generated according to any continuous sampling distribution. In theory, the parameters of these SLFNs can be analytically determined by ELM instead of being tuned.
Wise-integrator: an automatic integrator of web search interfaces for E-commerce
Authors: Hai He, Weiyi Meng, Clement Yu, Zonghuan Wu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

More and more databases are becoming Web accessible through form-based search interfaces, and many of these sources are E-commerce sites. Providing a unified access to multiple E-commerce search engines selling similar products is of great importance in allowing users to search and compare products from multiple sites with ease. One key task for providing such a capability is to integrate the Web interfaces of these E-commerce search engines so that user queries can be submitted against the integrated interface. Currently, integrating such search interfaces is carried out either manually or semi-automatically, which is inefficient and difficult to maintain. In this paper, we present WISE-Integrator - a tool that performs automatic integration of Web Interfaces of Search Engines. WISE-Integrator employs sophisticated techniques to identify matching attributes from different search interfaces for integration. It also resolves domain differences of matching attributes. Our experimental results based on 20 and 50 interfaces in two different domains indicate that WISE-Integrator can achieve high attribute matching accuracy and can produce high-quality integrated search interfaces without human interactions.
PECAP: Priority-Based Delay Alleviation Algorithm for IEEE 802.15.4 Beacon-Enabled Networks
Authors: Joseph Jeon, Jong Wook Lee, Hyung Seok Kim, Wook Hyun Kwon
Venue: Wireless Personal Communications: An International Journal (2007)

A new priority-based algorithm for IEEE 802.15.4 beacon-enabled networks is proposed in order to alleviate an end-to-end delay while maintaining energy efficiency. In this paper, the active period is temporally increased to reduce the sleep delay that makes up a large portion of the end-to-end delay. Nodes having high-priority packets request the coordinator to execute an extended contention access period by sending a priority toning signal. The simulation results show that the proposed algorithm alleviates the end-to-end delay of high priority packets.
Exploring Performance of Hypercube Structure for Multicast in Mobile Ad Hoc Networks
Authors: Ki-Il Kim
Venue: Wireless Personal Communications: An International Journal (2007)

Performance of multicast routing protocol in mobile ad hoc networks is mostly characterized by underlying forwarding structure. Currently, general structures based on tree/mesh based scheme cannot handle with transmission efficiency, robustness to dynamic topology, scalability, and load balancing functionalities at the same time. To handle above key performance factors concurrently, we propose a new virtual backbone architecture for multicast, which is based on hierarchical hypercube structure. Due to the natural properties of hypercube structure, we can achieve efficiency, robustness and load balance in mobile ad hoc networks where links are frequently broken owing to nodes' free immigration. Furthermore, scalability problem is naturally resolved by hierarchical structure. Finally, through simulation results, we have proven good scalability by demonstrating that our structure can provide higher packet delivery ratio with low control overhead and better scalability than tree/mesh based scheme without regard to the number of group members.
Performance of memory reclamation for lockless synchronization
Authors: Thomas E. Hart, Paul E. McKenney, Angela Demke Brown, Jonathan Walpole
Venue: Journal of Parallel and Distributed Computing (2007)

Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace locks with non-blocking synchronization to protect against deadlock, priority inversion, and convoying. In both cases, dynamic data structures that avoid locking require a memory reclamation scheme that reclaims elements once they are no longer in use. The performance of existing memory reclamation schemes has not been thoroughly evaluated. We conduct the first fair and comprehensive comparison of three recent schemes-quiescent-state-based reclamation, epoch-based reclamation, and hazard-pointer-based reclamation-using a flexible microbenchmark. Our results show that there is no globally optimal scheme. When evaluating lockless synchronization, programmers and algorithm designers should thus carefully consider the data structure, the workload, and the execution environment, each of which can dramatically affect the memory reclamation performance. We discuss the consequences of our results for programmers and algorithm designers. Finally, we describe the use of one scheme, quiescent-state-based reclamation, in the context of an OS kernel-an execution environment which is well suited to this scheme.
A new framework for identifying combinatorial regulation of transcription factors: A case study of the yeast cell cycle
Authors: Junbai Wang
Venue: Journal of Biomedical Informatics (2007)

By integrating heterogeneous functional genomic datasets, we have developed a new framework for detecting combinatorial control of gene expression, which includes estimating transcription factor activities using a singular value decomposition method and reducing high-dimensional input gene space by considering genomic properties of gene clusters. The prediction of cooperative gene regulation is accomplished by either Gaussian Graphical Models or Pairwise Mixed Graphical Models. The proposed framework was tested on yeast cell cycle datasets: (1) 54 known yeast cell cycle genes with 9 cell cycle regulators and (2) 676 putative yeast cell cycle genes with 9 cell cycle regulators. The new framework gave promising results on inferring TF-TF and TF-gene interactions. It also revealed several interesting mechanisms such as negatively correlated protein-protein interactions and low affinity protein-DNA interactions that may be important during the yeast cell cycle. The new framework may easily be extended to study other higher eukaryotes.
Write-aware buffer cache management scheme for nonvolatile RAM
Authors: Kyu Hyung Lee, In Hwan Doh, Jongmoo Choi, Donghee Lee, Sam H. Noh
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Nonvolatile RAM (NVRAM) technology is advancing rapidly with 1-2Mb capacity single-chip prototypes becoming available from major semiconductor companies. We will soon see NVRAM become an everyday component of our commodity computers. This paper explores the use of NVRAM as part of the buffer cache. A nonvolatile buffer cache provides a computer system with a means to maintain complete consistency as well as improved performance. The results of this paper can be summarized as follows. First, we show that the hit ratio that has been a commonly used metric to measure buffer cache performance is no longer adequate for caches with NVRAM. Instead of the hit ratio, we need to count the number of disk accesses to assess user perceived cache performance. Second, we show that because of this change in performance metric, when managing a buffer cache with NVRAM, one can do better than when using the MIN replacement algorithm mainly by distinguishing read and write operations. With this, we show that there is room for improvement in efficiently handling caches with NVRAM. Finally, based on these findings, we propose a simple and practical buffer management technique that improves on using the LRU algorithm.
Enhanced Two-Dimension Scatter Difference Discriminant Analysis for Face Recognition
Authors: Cai-kou Chen, Jing-yu Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A novel model for image feature extraction and recog- nition called enhanced two-dimension scatter difference discriminant analysis (E2DSDD) is presented in the pa- per. 2DSDD can extract less coefficients than the tradi- tional two-dimension scatter difference discriminant anal- ysis (2DSDD) for image representation and lead to faster classification. In addition, a new feature selection scheme is suggested for the selection of the most discriminative features. Experiments on the ORL face databases show E2DSDD outperforms the current 2DSDD, 2DLDA and 2DPCA algorithms in its computation efficiency and recog- nition performance.
A trainable system for face detection in unconstrained environments
Authors: Augusto Destrero, Francesca Odone, Alessandro Verri
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper describes a monitoring system that imple- ments real-time face detection. The structure of the system is based on multiple cues that discard non face areas as soon as possible: we combine motion, skin, and face de- tection. The latter is the core of our system and consists of a hierarchy of small SVM classifiers built on the output of a feature selection procedure. Following face detection, a Kalman tracking on the face region allows us to optimize re- sults over time. We present an experimental analysis of the face detection module and results obtained with the whole system on the specific task of counting people entering the scene.
Hybrid BIST Optimization Using Reseeding and Test Set Compaction
Authors: Gert Jervan, Elmet Orasson, Helena Kruus, Raimund Ubar
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Classical built-in self-test (BIST) approaches are largely based on pseudorandom testing, and using linear feedback shift registers (LFSR) for test set generation and test response compaction. In this paper we are concentrating on one possible extension of the classical BIST, namely hybrid BIST, where pseudorandom test patterns are complemented with precomputed deterministic test patterns to increase the fault coverage and to reduce test time. We will propose a novel method for hybrid BIST optimization, based on reseeding and test set compaction. The objective is to minimize the test time at given test memory constraints, without losing test quality. We will compare the proposed method with hybrid BIST methods developed earlier and analyze its suitability for testing core-based systems.
MAC Protocol Design for Impulse Radio UWB Based WPANs
Authors: Nan Shi, Yimeng Yang, Ignas G. Niemegeers
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Ultra Wide Band (UWB) has recently gained great interest for high data rate short-range WPANs. Designing a MAC protocol for UWB WPANs must take into account the physical layer characteristics. Due to large bandwidth and spreading spectrum, a time hopping impulse radio UWB (IR-UWB) system can accomplish multiple access by using code division multiplexing. Unlike most existing MAC protocols relying on contention access to limit transmissions, the MAC design for impulse radio intends to accommodate simultaneous transmissions. In this paper, we newly propose a MAC scheme for IR-UWB WPANs. This scheme is a hybrid CDMA and TDMA approach based on time hopping spread spectrum and the timing format of IEEE 802.15.3 MAC. The simulation results show that the proposed approach outperforms the existing protocol under our specifications and WPAN scenarios.
STAR: self-tuning aggregation for scalable monitoring
Authors: Navendu Jain, Dmitry Kit, Prince Mahajan, Praveen Yalagandula, Mike Dahlin, Yin Zhang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data streams. Adaptivity and approximation are essential for both robustness to varying workload characteristics and for scalability to large systems. In contrast to previous studies, we treat the problem as a workload-aware optimization problem whose goal is to minimize the total communication load for a multi-level aggregation tree under a fixed error budget. STAR's hierarchical algorithm takes into account the update rate and variance in the input data distribution in a principled manner to compute an optimal error distribution, and it performs cost-benefit throttling to direct error slack to where it yields the largest benefits. Our prototype implementation of STAR in a large-scale monitoring system provides (1) a new distribution mechanism that enables self-tuning error distribution and (2) an optimization to reduce communication overhead in a practical setting by carefully distributing the initial, default error budgets. Through extensive simulations and experiments on a real network monitoring implementation, we show that STAR achieves significant performance benefits compared to existing approaches while still providing high accuracy and incurring low overheads.
On Geographic Collaborative Forwarding in Wireless Ad Hoc and Sensor Networks
Authors: Kai Zeng, Wenjing Lou, Jie Yang, D. Richard III Brown
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, we study the geographic collaborative forwarding (GCF) scheme, a variant of opportunistic routing, which exploits the broadcast nature and spatial diversity of the wireless medium to improve the packet delivery efficiency. Our goal is to fully understand the principles, the gains, and the tradeoffs of the node collaboration and its associated cost, thus provide insightful analysis and guidance to the design of more efficient routing/forwarding protocols. We first identify the upper bound of the expected packet advancement (EPA) that GCF can achieve and prove the concavity of the maximum EPA.With energy efficiency as a major concern, we propose a new metric, EPA per unit energy consumption, which balances the packet advancement, reliability and energy consumption. By leveraging the proved properties, we then propose an efficient algorithm which selects a feasible candidate set that maximizes this local metric. We validate our analysis results by simulations, and justify the effectiveness of the new metric by comparing the performance of GCF with those of the existing geographic and opportunistic routing schemes.
New Delay-Dependent Stabilization Criterion for Time-Delay Chaotic Systems
Authors: Yijing Wang, Zhiqiang Zuo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper deals with the problem of standard feedback control for a class of time-delay chaotic systems. A new delay-dependent condition for stabilization with less con-servatism is derived in terms of linear matrix inequalities. In order to obtain a lower controller gain, an optimization algorithm is proposed which involves some constraints to restrict the size of gain matrix. A numerical example is pro- vided to show that our method gives significant improvement over the existing ones.
A New Inner Congestion Control Mechanism in Terabit Routers
Authors: Huaxi Gu, Kun Wang, Chu Ke, Changshan Wang, Guochang Kang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Direct interconnection network (DIN) has gained more and more attention when designing the switching fabric in the terabit routers. Various congestion control mechanisms are proposed for DIN when it is employed in the parallel computer systems. However, they all have own shortcomings and are not suitable for fabrics in the terabit routers. Based on the requirements of terabit class routers we propose a new congestion control mechanism in this paper. It uses a new detection criterion, i.e. the length of the source buffer, which is more accurate. Besides, the presence of the real time traffic is considered in particular. No throttling is imposed on such traffic to provide QoS. The input traffic will go into different source queue according to their traffic class. The input queue for the real time traffic will no longer be stopped to provide QoS. Finally, simulations are carried out by OPNET software. The results show that our congestion control mechanism eliminates performance degradation for loads beyond saturation, keeping adequate levels of throughput at high loads.
Sparse and passive reduction of massively coupled large multiport interconnects
Authors: Natalie Nakhla, Michel Nakhla, Ram Achar
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The large number of ports in an interconnect structure is a critical limiting factor when applying model-order reduction. This is due to the fact that the size of the reduced model grows rapidly with increasing the number of ports, leading to large and dense circuit matrices. To address this problem, a novel method based on transverse partitioning and waveform relaxation is proposed for passive model-order reduction of massively coupled large multiport interconnects. The new method effectively replaces the tightly coupled multiport reduced model with decoupled 2-port subcircuits. In addition to preserving the advantages of model-order reduction, the computational complexity of the new method grows only linearly with the number of lines.