ppxscal/embedding_network huggingface dataset:
Intelligent data staging with overlapped execution of grid applications
Authors: Yuya Machida, Shin'ichiro Takizawa, Hidemoto Nakada, Satoshi Matsuoka
Venue: Future Generation Computer Systems (2008)

Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging and decoupled from scheduling of computing tasks. However, when the application/workflow scales, we observe considerable degradations in performance, compared to processing within a tightly-coupled cluster. For example, when numerous nodes access the same set of files simultaneously, extreme performance degradation occurs even if replicas are used, due to bottlenecks that show in the infrastructure. Instead of resorting to expensive solutions such as parallel file systems, we propose tightly coupling replica and data transfer management with computation scheduling for alleviating such situations. In particular, we propose three techniques: (1) data-staging requests aggregation and O(1) replication across multiple nodes using a multireplication framework, (2) replica-centric scheduling, which reuses previously used data for minimizing staging time and (3) overlapped execution of data staging and compute bound tasks. Early benchmark results implemented in our prototype Condor-like grid scheduling system demonstrate that the techniques are quite effective in eliminating much of the overhead in data transfers and achieving 100% of CPU utilization.
Runtime Support for Advanced Component Concepts
Authors: Tomas Bures, Petr Hnetynka, Frantisek Plasil, Jan Klesnil, Ondrej Kmoch, Tomas Kohan, Pavel Kotrc
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Component-based development has become a recognized technique for building large scale distributed applications. Although the maturity of this technique, there appears to be quite a significant gap between (a) component systems that are rich in advanced features (e.g., component nesting, software connectors, versioning, dynamic architectures), but which have typically only poor or even no runtime support, and (b) component systems with a solid runtime support, but which typically possess only a limited set of the advanced features. In our opinion, this is mainly due to the difficulties that arise when trying to give proper semantics to the features and reify them in development tools and an runtime platform. In this paper, we describe the implementation of the runtime environment for the SOFA 2.0 component model. In particular, we focus on the runtime support of the advanced features mentioned above. The described issues and the solution are not specific only to SOFA 2.0, but they are general and applicable to any other component system aiming at addressing such features.
Quantile Estimation for Performance Measures in Network Simulations with CINSim
Authors: Daniel Ludtke, Dietmar Tutsch, Matthias Kuhm
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

This paper presents the simulator CINSim. It was developed to investigate interconnection network architectures for a wide application range, like networks-on-chip or parallel computers. CINSim allows the simulation of arbitrary network topologies, various traffic distributions in time and space as well as dynamic reconfiguration of the network under investigation. Besides the estimation of mean values for several performance measures, quantiles can be observed.
The Isomorphism and Homomorphism of Fuzzy Sets
Authors: Chengyi Zhang, Qingan Zheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In this paper, the concepts of the isomorphism and homomorphism of fuzzy sets are given. The sufficient and necessary conditions of isomorphism and homomorphism of fuzzy sets, and some properties of the new structural definition are discussed. The essence of fuzzy sets is point out and the operational properties of fuzzy sets based on isomorphism and homomorphism of fuzzy sets are discussed. Fortunately, we studied the isomorphism and homomorphism of fuzzy relations, have given the concept of isomorphic classification of fuzzy similarity relation, proved that if two fuzzy similarity relation are isomorphic, then they must be classified isomorphic. And, we obtain a conclusions: any fuzzy similarity relation is classified isomorphic to its transitive closure, which ensure we may get the classified structure of X from the original fuzzy similar matrix in theory.
A Low Overhead Fault Tolerant Coherence Protocol for CMP Architectures
Authors: Ricardo Fernandez-Pascual, Jose M. Garcia, Manuel E. Acacio, Jose Duato
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

It is widely accepted that transient failures will appear more frequently in chips designed in the near future due to several factors such as the increased integration scale. On the other hand, chip-multiprocessors (CMP) that integrate several processor cores in a single chip are nowadays the best alternative to more efficient use of the increasing number ber of transistors that can be placed in a single die. Hence, it is necessary to design new techniques to deal with these faults to be able to build sufficiently reliable Chip Multiprocessors processors (CMPs). In this work, we present a coherence protocol aimed at dealing with transient failures that affect the interconnection network of a CMP, thus assuming that the network is no longer reliable. In particular; our proposal posal extends a token-based cache coherence protocol so that no data can be lost and no deadlock can occur due to any dropped message. Using GEMS full system simulator, we compare our proposal against a similar protocol without fault tolerance (TOKENCMP). We show that in absence of failures our proposal does not introduce overhead in terms of increased execution time over TOKENCMP. Additionally, our protocol can tolerate message loss rates much higher than those likely to be found in the real world without increasing execution time more than 15%.
Recent Developments in the Theory and Practice of Testable Logic Design*
Authors: R. G. Bennetts
Venue: Computer (1976)

This paper surveys and summarizes the major contributions to the theory and practice of testable logic design. The first part, dealing with the theoretical procedures, discusses the design of easily testable combinational, sequential, and iterative networks, illustrating major techniques with common running examples. The second part comments on the more practical aspects such as board layout, test point siting, and other facilities for easing the problems associated with testing.
Energy-Efficient Wireless Packet Scheduling with Quality of Service Control
Authors: Xiliang Zhong, Cheng-Zhong Xu
Venue: IEEE Transactions on Mobile Computing (2007)

In this paper, we study the problem of packet scheduling in a wireless environment with the objective of minimizing the average transmission energy expenditure under individual packet delay constraint. Most past studies assumed that the input arrivals follow a Poisson process or be statistically independent. However, traffic from a real source typically has strong time-correlation.We model packet scheduling and queuing system for a general input process in linear time-invariant systems. We propose an energy-efficient packet scheduling policy that takes the correlation into account. Meanwhile, a slower transmission rate implies that packets stay in the transmitter for a longer time, which may result in unexpected transmitter overload and buffer overflow. We derive upper bounds of the maximum transmission rate under an overload probability, and upper bounds of required buffer size under a packet drop rate. Simulation results show that the proposed scheduler improves up to 15% in energy savings compared with the policies that assume statistically independent input. Evaluation of the bounds in providing QoS control shows that both deadline misses and packet drops can be effectively bounded by a predefined constraint.
Direct minimum/maximum autocorrelation factors within the framework of a two structure linear model of coregionalisation
Authors: Ellen M. Bandarian, Lynette M. Bloom, Ute A. Mueller
Venue: Computers Geosciences (2008)

In this paper, we present an approach to the method of minimum/maximum autocorrelation factors (MAF) that involves the derivation of the factors in the space of the sample data. The usual approach to MAF begins with an a priori normal score transformation of each attribute. However, as the MAF method is based on principal component analysis (PCA) this initial transformation is unnecessary. Since our method derives the MAF directly in the space of the sample data, we refer to it as direct minimum/maximum autocorrelation factors (DMAF). We present a theoretical derivation of DMAF that simplifies the multi-Gaussian approach. The DMAF method is particularly advantageous when the factors are simulated using a direct simulation algorithm, as no further transformation is required. We demonstrate the DMAF method by means of the simulation of attributes from a multivariate soil data set and show that this method successfully transforms the sample attributes into uncorrelated factors for all lag spacings and is useful for multivariate simulation.
A multi-layer recovery scheme in ASON/GMPLS networks
Authors: Hyuncheol Kim, Younghwa Kim, Kwangjoon Kim, Seongjin Ahn
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The explosive growth of Internet traffic has led to a dramatic increase in demand for data transmission capacity, which has spurred tremendous research activities in Optical Transport Networks (OTNs) such as Automatically Switched Optical Networks (ASON) and related control protocols. To provide high resilience against failures, OTNs must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future OTN with a Generalized Multi-Protocol Label Switching (GMPLS) control plane. Our objective in this paper is to presents a multi-layer recovery scheme that guarantees fast and efficient recovery of lightpaths in ASON/GMPLS Networks. It includes concepts as well as systematic procedures of the proposed scheme for multilayer recovery in ASON/GMPLS Networks.
An Application of a Method for Analysis of Cyclic Prog rams
Authors: N. Francez
Venue: IEEE Transactions on Software Engineering (1978)

A parallel program, Dijkstra's "on-the-fly" garbage collector, is proved correct using analysis along the lines suggested by Francez and Pnueli for cyclic programs. The method is briefly reviewed, and the proof is compared to another proof by D. Gries, based on a method by S. Owickd. The differences between the two approaches are discussed.
A new measure of index assignment in dynamic channels
Authors: Jen-der Day, Jeng-Shyang Pan
Venue: Information Sciences: an International Journal (2008)

In dynamic noisy communication channels, a channel bit error rate (BER) varies with time. When channel distortion measure D"c is a function of bit error rate, an optimal index assignment to minimize D"c is not as uniformly optimal as BER varies. The paper presents a new distortion measure called expected channel distortion (ECD). It is independent of the bit error rate by two proposed beta-type distributions in a multiple-error pattern. Additionally, any index assignment algorithm with ECD measure is mismatch-free. In other words, index assignment algorithms can be against channel mismatch even though BER varies with time in dynamic channels. The voice digitization in North American Telephone Systems (CCITT) is adopted to demonstrate the usefulness of the proposed measure.
The PRET A Rapporter framework: Evaluating digital libraries from the perspective of information work
Authors: Ann Blandford, Anne Adams, Simon Attfield, George Buchanan, Jeremy Gow, Stephann Makri, Jon Rimmer, Claire Warwick
Venue: Information Processing and Management: an International Journal (2008)

The strongest tradition of IR systems evaluation has focused on system effectiveness; more recently, there has been a growing interest in evaluation of Interactive IR systems, balancing system and user-oriented evaluation criteria. In this paper we shift the focus to considering how IR systems, and particularly digital libraries, can be evaluated to assess (and improve) their fit with users' broader work activities. Taking this focus, we answer a different set of evaluation questions that reveal more about the design of interfaces, user-system interactions and how systems may be deployed in the information working context. The planning and conduct of such evaluation studies share some features with the established methods for conducting IR evaluation studies, but come with a shift in emphasis; for example, a greater range of ethical considerations may be pertinent. We present the PRET A Rapporter framework for structuring user-centred evaluation studies and illustrate its application to three evaluation studies of digital library systems.
Learning to Group Text Lines and Regions in Freeform Handwritten Notes
Authors: M. Ye, P. Viola, S. Raghupathy, H. Sutanto, C. Li
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper proposes a machine learning approach to grouping problems in ink parsing. Starting from an initial segmentation, hypotheses are generated by perturbing lo- cal configurations and processed in a high-confidence-first fashion, where the confidence of each hypothesis is pro- duced by a data-driven AdaBoost decision-tree classifier with a set of intuitive features. This framework has success- fully applied to grouping text lines and regions in complex freeform digital ink notes from real TabletPC users. It holds great potential in solving many other grouping problems in the ink parsing and document image analysis domains.
Regular Partitions of Hypergraphs: Regularity Lemmas
Authors: Vojtech Rodl, Mathias Schacht
Venue: Combinatorics, Probability and Computing (2007)

Szemerédi's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more ‘user-friendly’ regularity lemma for hypergraphs.
Optimal design of nonuniform linear arrays in cellular systems by out-of-cell interference minimization
Authors: S. Savazzi, O. Simeone, U. Spagnolini
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

Optimal design of a linear antenna array with nonuniform interelement spacings is investigated for the uplink of a cellular system. The optimization criterion considered is based on the minimization of the average interference power at the output of a conventional beamformer (matched filter) and it is compared to the maximization of the ergodic capacity (throughput). Out-of-cell interference is modelled as spatially correlated Gaussian noise. The more analytically tractable problem of minimizing the interference power is considered first, and a closed-form expression for this criterion is derived as a function of the antenna spacings. This analysis allows to get insight into the structure of the optimal array for different propagation conditions and cellular layouts. The optimal array deployments obtained according to this criterion are then shown, via numerical optimization, to maximize the ergodic capacity for the scenarios considered here. More importantly, it is verified that substantial performance gain with respect to conventionally designed linear antenna arrays (i.e., uniform λ/2 interelement spacing) can be harnessed by a nonuniform optimized linear array.
A Framework for Reliability Computation of the IP Network
Authors: Tao Yu, Shanzhi Chen, Ming Ai, Xin Li, Yuhong Li, Zhen Qin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

As communication networks play an important role in today's life, network reliability becomes more critical than ever. Traditionally, network reliability is measured by connectivity or traffic volume. However, most of performance degradation problems are correlated with routing dynamic and congestion. It is necessary to include the both routing dynamics and congestion into network reliability computation. This paper proposes a new framework to compute the reliability. In this framework, the effects of multiple facts such as routing dynamics, traffic pattern and congestion probability are investigated. The reliability based on the proposed framework provides a new way for network operator to evaluate the performance of the IP network.
Language-modeling kernel based approach for information retrieval
Authors: Ying Xie, Vijay V. Raghavan
Venue: Journal of the American Society for Information Science and Technology (2007)

In this presentation, we propose a novel integrated information retrieval approach that provides a unified solution for two challenging problems in the field of information retrieval. The first problem is how to build an optimal vector space corresponding to users' different information needs when applying the vector space model. The second one is how to smoothly incorporate the advantages of machine learning techniques into the language modeling approach. To solve these problems, we designed the language-modeling kernel function, which has all the modeling powers provided by language modeling techniques. In addition, for each information need, this kernel function automatically determines an optimal vector space, for which a discriminative learning machine, such as the support vector machine, can be applied to find an optimal decision boundary between relevant and nonrelevant documents. Large-scale experiments on standard test-beds show that our approach makes significant improvements over other state-of-the-art information retrieval methods. &copy; 2007 Wiley Periodicals, Inc.
Study of signaling effects on Dynamic Traffic Grooming in IP/MPLS over WDM network
Authors: Sheng Chen, Gee-Swee Poo
Venue: Computer Communications (2007)

Signaling is essential in a practical network for connection establishments. Previous works on Dynamic Traffic Grooming (DTG) did not consider the signaling and related information update. The performance is poor when we incorporate the signaling requirement in previous DTG algorithms. This shows that the effect of signaling cannot be ignored in a practical network. In this paper, we discuss the effect of signaling on DTG, and propose a new technique called DTG-PRL to handle the DTG problem. In DTG-PRL, we divide the DTG into two steps: (1) pre-reserve some lightpaths based on statistical traffic observations and (2) dynamically groom the traffic based on the established virtual topology. We have developed an ILP formulation and a heuristic algorithm for the purpose. The simulation results show that the DTG-PRL outperforms previous DTG algorithms in IP Bandwidth Blocking Probability, Network Resource Utilization, Connection Setup Time and Control Message Efficiency. This demonstrates the usefulness of DTG-PRL in practical networks.
A Study on the Circular Sensing Model with a Low Power Profile in Wireless Sensor Networks
Authors: Seok-cheol Lee, Sam-bum Shin, Hyun-suk Hwang, Chang-soo Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Existing wireless sensor network devices based on micro-controller devices such as MICA have a serious limitation of power consumption because of dependent on AA or AAA batteries in executing nodes. However the nodes can keep their lifetime during one or more months, replacement of batteries and difficult maintenance of sensors are often needed. Therefore, it is essential for sensors to have a low power profile. In this paper, we present a method to find duration of sensing, detection of events, and circulation of sensing. Also, we implement a prototype of proposed model and simulate it about power consumption through a circular sensing method. Our main idea is to reduce power consumption for driving sensors through a circular sensing algorithm on wireless communication. We attained a result that our model can decrease power consumption up to almost 3 times. The effect is occurred from avoiding redundant transmission and decreasing the power for driving sensors
History-based joins: Semantics, soundness and implementation
Authors: Kees van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve
Venue: Data Knowledge Engineering (2008)

In this paper we study the use of case history for control structures in workflow processes. History-dependent control offers much more modeling power than classical control structures and it solves several semantical problems of industrial modeling frameworks. In particular, we introduce a history-dependent join. We study the modeling power by means of workflow patterns. Since proper completion (i.e. the ability of any configuration reachable from the initial one to reach the final one) is always an important ''sanity check'' of process modeling, we introduce a modeling method that guarantees this property holds. Finally we consider an implementation of the proposed control structures on top of an existing workflow engine.
Functional-coefficient partially linear regression model
Authors: Heung Wong, Riquan Zhang, Wai-cheung Ip, Guoying Li
Venue: Journal of Multivariate Analysis (2008)

In this paper, the functional-coefficient partially linear regression (FCPLR) model is proposed by combining nonparametric and functional-coefficient regression (FCR) model. It includes the FCR model and the nonparametric regression (NPR) model as its special cases. It is also a generalization of the partially linear regression (PLR) model obtained by replacing the parameters in the PLR model with some functions of the covariates. The local linear technique and the integrated method are employed to give initial estimators of all functions in the FCPLR model. These initial estimators are asymptotically normal. The initial estimator of the constant part function shares the same bias as the local linear estimator of this function in the univariate nonparametric model, but the variance of the former is bigger than that of the latter. Similarly, initial estimators of every coefficient function share the same bias as the local linear estimates in the univariate FCR model, but the variance of the former is bigger than that of the latter. To decrease the variance of the initial estimates, a one-step back-fitting technique is used to obtain the improved estimators of all functions. The improved estimator of the constant part function has the same asymptotic normality property as the local linear nonparametric regression for univariate data. The improved estimators of the coefficient functions have the same asymptotic normality properties as the local linear estimates in FCR model. The bandwidths and the smoothing variables are selected by a data-driven method. Both simulated and real data examples related to nonlinear time series modeling are used to illustrate the applications of the FCPLR model.