ppxscal/embedding_network huggingface dataset:
An Ensemble Text Classification Model Combining Strong Rules and N-Gram
Authors: Jinhong Liu, Yuliang Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Currently, most text classification methods apply machine learning methods, while ignored traditional rules-based methods. In this paper, we propose an ensemble text classification model combining classification rules and N-Gram language model. In order to generate strong classification rules, we propose an exhaustive noun-phrase extraction algorithm and a new optimized rule induction algorithm, called SCA (Strong Covering Algorithms).We also introduce an improved Good- Turing (GT) smoothing method for N-Gram model. Experimental results show that our ensemble classifier achieves an approximately 8% improvement as compared to bi-gram with word-based classifier and 15% improvement as compared to traditional rules-based classifier. In conclusion, the accuracy of ensemble classification model is competent to only a single classification models.
Research on Window-Constrained Constant Bandwidth Server to Support Adaptive QoS
Authors: Zhu Xiangbin
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Advances in computing applications in recent years have prompted the demand for more flexible scheduling models for QoS demand. The DWCS(Dynamic Window- Constrained Scheduling) is a flexible scheduling algorithm. This paper applies DWCS into the open realtime system to support QoS demand. We propose a window-constrained CBS with which the real-time system can use the characteristic of DWCS to improve the scheduling performance. Moreover, the new scheduler can provide some QoS guarantee for real-time tasks. To evaluate the performance of the new server, the two server mechanisms have been implemented on the Linux kernel. The experimental results show that the new server is better than the old server. In the end, the future research directions are discussed.
Understanding Unsteady Flow Features in Transonic Compressors
Authors: Steven E. Gorrell, Allan van de Wall, Fu-Lin Tsung
Venue: Computing in Science and Engineering (2007)

Applying computational science and engineering to the design and analysis of high-performance compressors makes it possible to understand unsteady flow effects in gas turbine engines. Simulations have produced numerical data of greatly improved geometric, physical, and numerical fidelity than previously possible, helping next-generation engines achieve unprecedented performance.
Editor in Chief's Message: Truly "hot" chips--Do we still care?
Authors: David H. Albonesi
Venue: IEEE Micro (2007)

Despite the move away from very high-frequency, high-ILP cores to multiple, more modest cores ("multicore"), power is still a huge, unsolved problem for the microprocessor industry. The emphasis is no longer power-aware processor microarchitecture but power-aware systems architecture. The "system" extends from the multicore system-on-chip to the external memory, disks, indeed to the entire enterprise. The data center has arisen as a major target of power-related computer architecture research. The greater question is, in our attempts to make the world's information available to all in the blink of an eye, what is the environmental cost, and how can we as a research community address this problem?
Statistical description of the limiting set for chaotic motions of the vibro-impact system
Authors: S. P. Gorbikov, A. V. Men'Shenina
Venue: Automation and Remote Control (2007)

A numerical investigation of statistical properties of chaotic motions that occur in one vibro-impact system as a result of the bifurcation connected with the arrival of the periodic motion at the boundary of infinite-impact motion domain. The results of numerical computations prove the existence of a peculiar set which is limiting for chaotic motions occurred after the bifurcation. According to the numerical investigations, "the ensemble average coincides with the time average" in the neighborhood of the limiting set, i.e., it is sufficient to track only one path in solving optimization problems in such a system.
A Variability Modeling Method for Adaptable Services in Service-Oriented Computing
Authors: Soo Ho Chang, Soo Dong Kim
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Publish-Discover-Compose paradigm of Service-Oriented Computing (SOC) presents a challenge on service applicability. Services are not just for predefined clients, rather for potentially many unknown clients. Hence, published services should be highly adaptable to various service clients and contexts. For that, service variability must carefully be modeled by considering the unique computing paradigm and requirements of SOC such as dynamic discovery and composition of services. Current SOC approaches to modeling services largely focus on defining business processes and service components without considering service variability in sufficient details. In this paper, we first compare the variability on conventional applications and the variability on SOC. Then, we identify four types of variability on services. For the types of service variability, we present a method to model service variability and design adaptable services. Using our proposed framework, we believe the applicability and reusability of such services can be greatly increased.
A Survey of Current Work in Microprogramming
Authors: L. H. Jones
Venue: Computer (1975)

The purpose of this article is to provide a brief survey of current work in microprogramming and to assess future developments in microprogramming in terms of probable advances in semiconductor technology. The article is primarily directed toward readers who understand that "microprogram control" refers to implementation of the control function of a digital computer by means of control sequences that are stored in a memory rather than generated by a hardware control sequencer. The reader should also realize that the "machine" instructions of microprogrammed computers provide a means for organizing microinstructions into logically convenient modules.
CMOS LSI Special Feature: CMOS LSI - Computer Component Process of the 80's
Authors: D. L. Wollesen
Venue: Computer (1980)

Heat dissipation, or the "thermal barrier," is a problem that circuit designers have faced for years. The answer in the 1980's may be CMOS. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Inference of One-Way Queuing Delay Distribution Using Packet-Pair Probes without Clock Synchronization
Authors: Gu Wei-Xuan, Yu Shun-Zheng
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Queuing delay plays an important role in network security and Internet applications, since it carries information about traffic characteristics and congestion properties on the route. This paper presents a novel approach to measure and estimate end-to-end one-way queuing delay in the network. In contrast to existing methods that are trying to remove clock offsets and skews, the novel approach does not require any synchronization between the two measurement ends. Pairs of probe packets are sent from the source to the destination and intra-gaps between the probes are separately measured at each end. By performing an iterative Fourier-to-time reconstruction algorithm on the measured intra-gaps, distribution of the end-to-end one-way queuing delay is estimated. The iteration procedure is proved to be efficient and robust, and simulations are conducted in this paper to validate the novel approach.
Dynamical Network Forensics Based on Immune Agent
Authors: Diangang Wang, Tao Li, Sunjun Liu, Jianhua Zhang, Caiming Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Current network forensics systems are static and not real-time. In order to overcome the shortages, a dynamical network forensics model based on artificial immune theory and multi-agent theory, referred to as DNF, is introduced here. Comparing with traditional computer forensics methods, the new method provides the capacity that gathering real-time evidence dynamically as soon as network intrusions take place and saving the evidence in a safe way to prepare for the collection and analysis of the original evidence. In this paper, architecture of the model and the definitions of its components inspired by the immunity theory are given out. The experiment shows that it is able to insure the authenticity, integrality and validity of the digital evidence, and it is a new method for dynamic computer forensics.
Solving Multi-criteria Minimum Spanning Tree Problem with Discrete Particle Swarm Optimization
Authors: Wenzhong Guo, Guolong Chen, Xiang Feng, Lun Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The minimum spanning tree (MST) of a graph is an important concept in network design, the basic MST problem can be solved efficiently, but the multi-criteria MST (mc-MST) is NP-hard problem. In this paper, a discrete particle swarm optimization (PSO) approach is developed to deal with this problem. The principles of mutation and crossover operator in the genetic algorithm (GA) are incorporated into the proposed PSO algorithm to achieve a better diversity and break away from local optima. In the end, an enumeration method of Chen's is used to evaluate the algorithm's performance and the results show that this algorithm is efficient and feasible.
Systematic Development of Quality Aware Decentralised Service-Oriented Systems
Authors: Lipo Chan, Shanika Karunasekera
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Quality-of-Service (QoS) enhanced service-oriented systems are becoming more important due to the need to support various demands of different application do- mains. Such rising importance and inadequate exist- ing solutions necessitate a finer feature-level develop- ment support that can promote systematic verification of more robust QoS features. Consequently, this paper proposes a systematic methodology to develop versatile or adaptive QoS features in service-oriented systems built for decentralised environments such as peer-to- peer and mobile networks. Keywords: Decentralised service-oriented system, adaptive quality, verification, methodology.
A methodology for transistor-efficient supergate design
Authors: Dimitri Kagaris, Themistoklis Haniotakis
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The number of transistors required for the implementation of a logic function is a fundamental consideration in digital VLSI design. While the determination of a series-parallel implementation can be straightforward once a simplified Boolean expression of the function is available, this may not be an optimum solution. In this paper, a methodology is developed for minimizing the number of transistors that starts from a sum-of-products expression and utilizes non-series-parallel structures. Experimental results demonstrate the efficiency of the approach.
A Cluster File System for High Data Availability Using Locality-Aware Partial Replication
Authors: Jinseok Kim, Sangman Sim, Sungyong Park
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Most traditional cluster file systems replicate whole files to support the data availability. However, considering that the access patterns of file systems have high localities, repli- cating whole files is not an efficient strategy to improve the data availability. This paper presents the design and the implementation of HA-PVFS, a PVFS supporting high data availability, in which the replication is performed partially based on the locality information. Our performance results show that HA-PVFS is dynamic with little overhead over various access patterns.
Technology and Digital Art: A cooperative robotic platform for adaptive and immersive artistic installations
Authors: Raquel Paricio García, Juan Manuel Moreno Aróstegui
Venue: Computers and Graphics (2007)

In this paper we shall review the major approaches done in the past concerning the development of immersive artistic installations. This will permit one to identify the basic features to be attained by this kind of installations and based on them a new cooperative and autonomous robotic platform will be proposed. The major novelty of the approach presented in this paper relies on its short- and long-term adaptation capabilities. The technical details of its basic building blocks and the results of the preliminary field tests will be provided, showing that it constitutes a very efficient platform for the construction of actual adaptive and immersive artistic installations.
Approximations of Lovász extensions and their induced interaction index
Authors: Jean-Luc Marichal, Pierre Mathonet
Venue: Discrete Applied Mathematics (2008)

The Lovasz extension of a pseudo-Boolean function f:{0,1}^n->R is defined on each simplex of the standard triangulation of [0,1]^n as the unique affine function f@^:[0,1]^n->R that interpolates f at the n+1 vertices of the simplex. Its degree is that of the unique multilinear polynomial that expresses f. In this paper we investigate the least squares approximation problem of an arbitrary Lovasz extension f@^ by Lovasz extensions of (at most) a specified degree. We derive explicit expressions of these approximations. The corresponding approximation problem for pseudo-Boolean functions was investigated by Hammer and Holzman [Approximations of pseudo-Boolean functions; applications to game theory, Z. Oper. Res. 36(1) (1992) 3-21] and then solved explicitly by Grabisch et al. [Equivalent representations of set functions, Math. Oper. Res. 25(2) (2000) 157-178], giving rise to an alternative definition of Banzhaf interaction index. Similarly we introduce a new interaction index from approximations of f@^ and we present some of its properties. It turns out that its corresponding power index identifies with the power index introduced by Grabisch and Labreuche [How to improve acts: an alternative representation of the importance of criteria in MCDM, Internat. J. Uncertain. Fuzziness Knowledge-Based Syst. 9(2) (2001) 145-157].
Zcs: A zeroth level classifier system
Authors: Stewart W. Wilson
Venue: Evolutionary Computation (1994)

A basic classifier system, ZCS, is presented that keeps much of Holland's original framework but simplifies it to increase understandability and performance. ZCS's relation to Q-learning is brought out, and their performances compared in environments of two difficulty levels. Extensions to ZCS are proposed for temporary memory, better action selection, more efficient use of the genetic algorithm, and more general classifier representation.
Comparative Analysis of Neural Network Techniques Vs Statistical Methods in Capacity Planning
Authors: Nalini Vasudevan, Gowri C. Parthasarathy
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Capacity planning is a technique which can be used to predict the computing resource needs of an organization for the future after studying current usage patterns. This is of special import for adaptive enterprises, given the large infrastructure and large number of users. Determining resource needs beforehand can be very beneficial because it is a proactive approach and helps prevent resource crunches and service level violations. Accuracy of the predicted values, however, depends upon the methods used for the forecast and also upon the accuracy of the historical data. Historical data in the capacity planning sense is system performance data. Most of the approaches used for such a prediction make use of statistical methods or are based on queuing theory. This paper compares the traditional statistical based methods with a method based on neural networks. The training set for the neural network consists of historical values of a metric (for example CPU utilization percentage) for which the prediction is to be done. The advantages of this method over other methods have also been discussed. From the predicted information, we illustrate how capacity planning is done.
A Data Fusion Algorithm for Large Heterogeneous Sensor Networks
Authors: Hong Lin, John Rushing, Sara Graves, Evans Criswell
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

A distributed search based data fusion algorithm is presented for target detections in large heterogeneous sensor networks. A score function is introduced as the objection function during the optimal search. The network state is determined when the score is the highest. A close to optimal solution can be obtained before the arrival of the next sensor data thus enabling real time target tracking. The algorithm is evaluated with a series of real-time simulations on networks of variable sensor compositions with a commodity Linux cluster.
Survivable Embedded Mission-Critical Network Base on Fibre Channel
Authors: Yue Wang, WanDong Cai, Qi Duan
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Embedded communication networks are playing an increasingly important role in embedded and mission-critical systems. In this paper, a new architecture of FC-based embedded mission-critical network (FEMN) has been proposed firstly, FEMN adopt novel simplified architecture and compact signaling protocol that are different from FC standard. In the second part, paper focus on the topology survivability of embedded mission-critical network, introduce the vertex segment set to describe the amount of work done to destroy the network and how badly the network's damage is. We observe several existing parameters and introduce kcutset tenacity to measure topology survivability of embedded mission-critical network. At last, we put forward a method to construct graph that could achieve the upper bound of k-cutset tenacity under special case.
Semiblind techniques for carrier frequency offset estimation in OFDM systems
Authors: Tilde Fusco, Ferdinando Marrone, Mario Tanda
Venue: Signal Processing (2008)

In this paper we consider a semiblind carrier frequency offset (CFO) synchronization scheme based on the insertion of pilot tones and exploiting the statistical redundancy of the OFDM signal due to the cyclic prefix and/or to virtual subcarriers. In particular, under the assumption that the number of subcarriers is sufficiently large, the received signal is modeled as a circular complex Gaussian random vector (C-CGRV) with nonzero mean. Therefore, by exploiting the joint probability density function for C-CGRVs, unconditional maximum likelihood CFO estimators are derived. The performance of the proposed semiblind algorithms is assessed via computer simulation and compared with that of some blind and semiblind CFO estimators previously proposed in the literature.
Range-aggregate query problems involving geometric aggregation operations
Authors: Prosenjit Gupta
Venue: Nordic Journal of Computing (2006)

We consider variations of the standard orthogonal range searching motivated by applications in database querying and VLSI layout processing. In a generic instance of such a problem, called a range-aggregate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the objects of S intersected by q can be answered efficiently. Although range-aggregate queries have been widely investigated in the past for aggregation functions like average, count, min, max, sum etc. we consider aggregation operations involving geometric intersection searching problems in this paper. Efficient solutions are provided for point enclosure queries for d ≥ 1, 1-d interval intersection, 2-d orthogonal segment intersection and interval/rectangle/hyper-rectangle enclosure queries in this framework.
An efficient algorithm for statistical circuit optimization using Lagrangian relaxation
Authors: I-Jye Lin, Yao-Wen Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Due to the technology scaling down, process variation has become a crucial challenge on both interconnect delay and reliability. To handle the process variation, statistical optimization has emerged as a popular technique for yield improvement. As a relatively new technique, second-order conic programming (SOCP) has recently attracted very much attention in the literature for statistical circuit optimization. However, we observe significant limitations of SOCP in its flexibility, accuracy, and scalability for statistical circuit optimization, especially when interconnects are considered. We thus present in this paper an effective and efficient alternative for multi-constrained statistical circuit optimization by both gate and wire sizing using Lagrangian relaxation (LR). Compared with SOCP, experimental results show that our LR-based algorithm can achieve much better solution quality by reducing 21% area and obtain 560X speed-up over SOCP.
Fuzzy Reliability Analysis of an iSCSI-Based Fault Tolerant Storage System Organization
Authors: MingHua Jiang, Jingli Zhou, Ming Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

iSCSI is a newly emerging protocol with the goal of implementing the storage area network (SAN) technology over TCP/IP, which brings economy and convenience whereas it also raises performance and reliability issues. This paper presents a implementation of iSCSI-based fault tolerant storage system, and then analyzed the reliability of this system by combination of fuzzy logic and Markov modeling. This reliability method is a technique for analyzing fault tolerant designs under considerable uncertainty, such as is seen in compilations of component failure rates, the presented model provides the estimation of the lower and upper boundary of iSCSI-based fault tolerant storage system with a single run of the model.
Locality-Aware Ratio Rule Mining
Authors: Masafumi Hamamoto, Hiroyuki Kitagawa
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper examines a Ratio Rule mining problem based on support and confidence factors. Ratio Rules represent linear relationships included in some numeric attributes. They are applicable to understanding data, filling missing attribute values, and related issues. In our previous work, we have formulated Ratio Rules in analogy with associa- tion rule mining, and proposed a mining algorithm. How- ever these Ratio Rules consider "Global" relationships. In this paper, we formulate the Local Ratio Rules, which in- troduces locality concept, and propose a method to extract them. We show appropriateness of our proposed method using synthetic and real data.
Message of the Program Chairs of STEV'07
Authors: Johannes Mayer, Sami Beydeda
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The First International Workshop on Software Test Eval- uation (STEV'07) co-located with QSIC'07 is the first work- shop to address the oracle problem in software testing. Unfortunately, this important problem has often been ne- glected. The workshop is intended as a forum for those working in the field of software test oracles and its aim is to foster collaboration among those researcher in order to advance the state of the art. An program with presentations on a lot of topics in the field of test oracles guarantees an interesting and hopefully also inspiring workshop. 30350372