ppxscal/embedding_network huggingface dataset:
Virtual Clusters on the Fly - Fast, Scalable, and Flexible Installation
Authors: Hideo Nishimura, Naoya Maruyama, Satoshi Matsuoka
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

One of the advantages in virtualized computing clusters compared to traditional shared HPC environments is their ability to accommodate user-specific system customization. However, past attempts to providing virtual clusters are not scalable with increasing number of VMs, nor do they allow fine-grained customization of VMs, assuming that preconfigured VM images are always available on the Grid. We propose a new virtual cluster installation technique that achieves efficiency and scalability, and yet simultaneously fine-grained customizability. It allows the user to create VMs on the fly for fine-grained customization of VMs, and pipelined data transfer for scalable installation with increasing number of VMs. To achieve efficiency in the presence of such full customization, it automatically caches frequently-constructed virtual disk images to save software installation time in common cases. Our experimental studies using a prototype implementation show that installation of a 190-node virtual cluster can be done in 40 seconds. From this result along with a scalability study, we estimate that installation of a 1000-node virtual cluster could be done in less than two minutes.
Summer program to enhance engineering concepts through collaboration
Authors: C. Hudspeth
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Since 1995 the MEP/SEES (Maximizing Engineering Potential/Science Educational Enhancement Services) programs in the Colleges of Engineering and Science at California State Polytechnic University, Pomona have conducted an NSF Alliance for Minority Participation (AMP) sponsored nontraditional summer program for second-year students, called QUEST II. This unique, 4-week program has involved faculty from Mathematics, Physics, and Mechanical Engineering with upper-division student facilitators leading integrated classes and labs/activities. The curriculum shows the interrelationships of these areas of study and prepares students for a successful transition into physics and engineering mechanics. The design of the program focuses not only on the intellectual level required for technical studies, but also on the value of collaborative learning, the development of oral and written communications skills, problem solving skills, and the use of calculators and computers to supplement the learning experience. This paper presents the program format, content, and examples of the curriculum, as well as data showing the subsequent academic performance of participants.
Analyzing integrity protection in the SELinux example policy
Authors: Trent Jaeger, Reiner Sailer, Xiaolan Zhang
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

In this paper, we present an approach for analyzing the integrity protection in the SELinux example policy. The SELinux example policy is intended as an example from which administrators customize to create a policy for their site's security goals, but the complexity of the model and size of the policy make this quite complex. Our aim is to provide an access control model to express site security goals and resolve them against the SELinux policy. Ultimately, we aim to define a minimal trusted computing base (TCB) that satisfies Clark-Wilson integrity, by first testing for the more restrictive Biba integrity policy and resolving conflicts using Clark-Wilson semantics. Our policy analysis tool, Gokyo, implements the following approach: (1) it represents the SELinux example policy and our integrity goals; (2) it identifies conflicts between them; (3) it estimates the resolutions to these conflicts; and (4) provides information for deciding upon a resolution. Using Gokyo, we derive a proposal for a minimal TCB for SELinux includes 30 subject types, and we identify the work remaining to ensure that TCB is integrity-protected. Our analysis is performed on the SELinux example policy for Linux 2.4.19.
Artifact-free asynchronous geometry-based audio rendering
Authors: N. Tsingos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Most audio rendering systems include a geometry-based simulation engine which computes and updates sound propagation paths and an auralization engine which renders audible the resulting sound field. In the case of dynamic environments the attributes of the sound paths vary over time, which can cause severe artifacts in the auralized sound signal. To avoid this problem, geometrical calculations have to be conducted synchronously with the signal processing tasks and the necessary high update rates can be difficult to achieve in complex environments. We describe a technique which allows for conducting geometrical calculations completely asynchronously from the signal processing. In particular, we introduce a prediction mechanism of path attributes which ensures that artifact-free signal processing can be achieved even when geometrical information is updated at low rates. This technique can be applied to any geometry-based simulations, regardless of the technique used for finding the sound propagation paths.
Global exponential stability of delayed cellular neural networks with impulses
Authors: Yonghui Xia, Jinde Cao, Sui Sun Cheng
Venue: Neurocomputing (2007)

A class of delayed cellular neural networks with impulses (DCNN) is investigated in this paper. Sufficient conditions are obtained for the existence of unique and globally exponential stable equilibriums of the DCNNs with Lipschitzian activation functions without assuming their boundedness, monotonicity or differentiability, but subjected to impulsive state displacement at fixed instants of time. The sufficient conditions are easy to verify and when the impulsive jumps are absent, the results reduce to those of the non-impulsive systems. Our investigations are based on employing Banach's fixed point theorem, matrix and associated spectral theory. Our results generalize and significantly improve the previous known results due to this method. An example is given to show their feasibility and effectiveness.
Optimization Approaches for Semi-Supervised Multiclass Classification
Authors: Yasutoshi Yajima, Tien-Fang Kuo
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The purpose of this paper is to propose a semisupervised learning method for the problem of multiclass classification. We first introduce the Laplacian of a graph and the associated graph kernels which are exploited in many semi-supervised binary classification methods. Then, we will introduce a new multiclass semi-supervised learning method based on a multiclass formulation of SVM. The proposed optimization problems can fully exploit the sparse structure of the Laplacian matrix, which enables us to optimize the problems with a large number of data points by standard optimization algorithms. Some numerical results indicate that our approaches achieve fairly high performance on large scale problems.
Topology Optimization for Backbone Wireless Mesh Networks
Authors: Mani Malekesmaeili, Mohsen Shiva, Mehdi Soltan
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Nowadays, wireless access is experiencing and developing a new technology called, Wireless Mesh Networks (WMNs). Many wireless standards like IEEE 802.11,15, and 16 have included this technology, as it proposes many facilities and enhancements to wireless access schemes. High throughput, and low delay that are the essential requirements of a backbone WMN, as well as any other network infrastructure, demand new algorithms and metrics other than the ones used in conventional ad-hoc networks. In this paper, we introduce a new metric for Topology Control (TC) in WMNs that aims at maximizing the capacity and throughput of these networks. This metric, namely Collision Domain (CD) load is shown to be superior to conventional metrics, like distance or interference, used in ad-hoc networks. Applications of this metric are shown to have increases up to 150% and even more in the maximum download rate compared to the conventional metrics.
Munet: multicasting protocol in unidirectional ad-hoc networks
Authors: John Silvester
Venue:  (2006)

The dissertation proposes a multicast routing protocol for unidirectional ad-hoc networks, called MUNet, based on the concept of spatial locality. Utilization of unidirectional links in ad-hoc networks is not generally considered by the mainstream research community because of the complexity and failure proneness. These weaknesses, which may be presented by a significant portion of unidirectional links can be overcome by the collaboration of neighbor nodes. The use of neighbor nodes significantly increases network resilience through path self-healing and path shortening. Potential link breakage can be detected and prevented by using neighbor nodes, prior to any costly, time-consuming link recovery. The advantageous impact of utilizing unidirectional links is studied using Random Graph and Euclidean Graph models. The Random Graph model, where node connection and link direction are the only concerns, serves as a theoretical benchmark for the study. The Euclidean Graph model, where more physical characteristics of the wireless network are captured, examines the ability of the network to provide network connectivity through unidirectional links. Similar to most routing protocols, MUNet consists of three main functions: path establishment, path maintenance, and link recovery. With the concept of spatial locality, it constructs a multicast meshed tree, enhanced by the inclusion of neighbor nodes. Because of the absence of essential feedback at the MAC layer, broadcast is the only applicable link layer protocol. The use of neighbor nodes without proper selection strategies can adversely affect the overall routing performance. In order to improve the routing efficiency and resource utilization, we proposed an enhanced version of MUNet which heuristically selects which neighbor nodes should participate. Instantaneously determined by local control traffic density, a node probabilistically sets a level of its responsiveness to participate in the routing protocol maintenance. Simulations using GlomoSim show that the packet delivery performance of MUNET is comparable to that of On-Demand Multicast Routing Protocol (ODMRP) but with significantly less routing overhead, in both unidirectional and bi-directional ad-hoc networks. The enhanced protocol shows further improvement in routing effectiveness along with a reduction in protocol overhead.
On the Performance of Safety Message Discrimination in Vehicular Ad Hoc Networks
Authors: Saleh Yousefi, Saeed Bastani, Mahmood Fathy
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

One of the most promising and critical application of vehicular ad hoc networks (VANETs) is improvement of the road traffic safety. Currently there is a growing belief that putting an 802.11-like radio into road vehicles could help the drivers to travel more safely. Although research in this field is in preliminary stage, some simple implementations are quite promising; to the best of our knowledge there is no comprehensive feasibility study in the literature. So, as a first step, in this paper we investigate the feasibility of beacon safety message dissemination in VANETs through extensive simulation study. Vehicles are supposed to issue these massages periodically to announce other vehicles about their current situation and use received messages for preventing possible unsafe situations. We evaluate the performance of some simple protocols by the means of quality of service (QoS) metrics like delivery rate and delay and take special attention to reliability and fairness requirements of safety applications. Our results show in spite of global interest, safety applications in VANETs encounter severe challenges which should be addressed properly in the future research. We believe that to become a reality, this issue needs much more research, industry and government support.
Built-in self-test design optimization for scan-based circuits
Authors: Sharad C. Seth
Venue:  (2006)

The move to deep-sub-micron processing technology and the increasing complexity of a single chip makes testability a key problem in VLSI design and scan insertion a broadly accepted solution in the industry. However, scan-based designs pose their own challenges to external testing via an automated test equipment (ATE) because of the ATE's limitations of memory depth, test channels and clock frequency. In this context, built-in self-test (BIST) design technique, with on-chip test generation and response analysis, becomes a viable alternative and is the focus of our work. For scan-based BIST designs, the most important parameters that must be optimized are fault coverage, test application time, area overhead, and power dissipation. Typically, an on-chip linear feedback shift register (LFSR) is employed for pseudo-random test pattern generation in BIST design. Although, with the LFSR it becomes possible to test the circuit with a large number of pseudo-random patterns, testing for random-pattern resistant faults can still take unacceptably long time. This dissertation presents a pseudo-random test compaction method to optimize test application time. Experimental results show that our method outperforms others in test length. Excessive amount of power is wasted during scan shifting in scan-based circuits. The proposed double-tree scan (DTS) architecture saves power by activating only Ologf+2 3 scan flip-flops at each clock cycle, compared with O(f) for the traditional scan, where f is the total number of scan flip flops. The proposed DTS architecture with distributed control overcomes the clock-skew and routing problems associated with the centralized control. Usually, many pseudo-random test patterns generated by the LFSR may not contribute to fault coverage. Bypassing the LFSR states that produce these useless patterns can save up to 99% of total switching activity during scan shifting. The silicon area-overhead of this modification increases rapidly with the number of bypasses. We formulate and solve the area-overhead optimization problem as a consecutive test cover (CTC) problem, where the objective is to optimize a cost function combining the number of bypasses and the number of useful test patterns.
Evolving parallel machine programs for a multi-ALU processor
Authors: J. Vincent
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper proposes a novel genetic parallel programming (GPP) paradigm for evolving optimal parallel programs running on a multi-ALU processor by linear genetic programming. GPP uses a two-phase evolution approach. It evolves completely correct solution programs in the first phase. Then it optimizes execution speeds of solution programs in the second phase. Besides, GPP also employs a new genetic operation that swaps sub-instructions of a solution program. Three experiments (Sextic, Fibonacci and Factorial) are given as examples to show that GPP could discover novel parallel programs that fully utilize the processor's parallelism. 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
Modified Realizability Interpretation of Classical Linear Logic
Authors: Paulo Oliva
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

This paper presents a modified realizability interpretation of classical linear logic. The interpretation is based on work of de Paiva (1989), Blass (1995), and Shirahata (2006) on categorical models of classical linear logic using G¨odel's Dialectica interpretation. Whereas the Dialectica categories provide models of linear logic, our interpretation is presented as an endo-interpretation of proofs, which does not leave the realm of classical linear logic. The advantage is that we obtain stronger versions of the disjunction and existence properties, and new conservation results for certain choice principles. Of particular interest is the simple branching quantifier used in order to obtain a completeness result for the modified realizability interpretation.
Next-Generation Software Engineering Introduction to Minitrack
Authors: Alan R. Hevner, Richard C. Linger, Gwendolyn H. Walton
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Societal dependence on largescale, networkcentric systems continues to grow. But cost and complexity are increasing, and errors and vulnerabilities persist despite best efforts. Evidence suggests that software engineering is reaching the limits of development technologies evolved in the first fifty years of computing. A need exists to create a next-generation software engineering (NGSE) for the next fifty years that will reduce cost and complexity for fast and correct development of the ultralargescale systems of the future. NGSE is envisioned as a computational engineering discipline, largely enabled by theorybased, semanticsdirected automation that permits intellectual control at a scope and scale unattainable with present methods.
Non-linear methods for group-blind multiuser detection: synchronous case
Authors: A. Host-Madsen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper considers the problem of multiuser detection for CDMA systems where the codes of a group of users are known while others are unknown, called group-blind multiuser detectors. An example is the uplink in cellular communication system with interference from both in-cell users, with known codes, and out-of-cell users, with unknown codes. In previous papers linear detectors for this situation were developed. In the current paper, we combine these methods with low-complexity non-linear post processing, using the method of slowest descent, a general method for non-linear optimization. The performance of this new group-blind detector is compared to that of the non-blind MMSE detector as well as the linear group blind detector, and the non-linear detector is seen to have a considerably better performance, in particular in heavily loaded systems.
A source subspace tracking array of microphones for double talk situations
Authors: S. Affes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We propose in this paper an array of microphones which achieves good performance in double talk situations. By a subspace tracking procedure, we jointly identify the acoustic paths from the speech and echo sources. With an adaptive beamformer constrained over these paths, we properly recover the original speech, cancel the echo and reduce the background noise. Simulations made with real data confirm the efficiency of this array.
Convergence of Adaptive Discontinuous Galerkin Approximations of Second-Order Elliptic Problems
Authors: Ohannes A. Karakashian, Frederic Pascal
Venue: SIAM Journal on Numerical Analysis (2007)

A residual-type a posteriori error estimator is introduced and analyzed for a discontinuous Galerkin formulation of a model second-order elliptic problem with Dirichlet-Neumann-type boundary conditions. An adaptive algorithm using this estimator together with specific marking and refinement strategies is constructed and shown to achieve any specified error level in the energy norm in a finite number of cycles. The convergence rate is in effect linear with a guaranteed error reduction at every cycle. Results of numerical experiments are presented.
Reliable search strategy for block motion estimation by measuring the error surface
Authors: Yui-Lam Chan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The conventional search algorithms for block matching motion estimation reduce the set of possible displacements for locating the motion vector. Nearly all of these algorithms rely on the assumption: the distortion function increases monotonically as the search location moves away from the global minimum. Obviously, this assumption essentially requires that the error surface be unimodal over the search window. Unfortunately, this is usually not true in real-world video signals. We formulate a criterion to check the confidence of unimodal error surface over the search window. The proposed confidence measure of error surface, CMES, would be a good measure for identifying whether the searching should continue or not. It is found that this proposed measure is able to strengthen the conventional fast search algorithms for block matching motion estimation. Experimental results show that, as compared to the conventional approach, the new algorithm through the CMES is more robust, produces smaller motion compensation errors, and requires simple computational complexity.
Multigrid-based fuzzy systems for time series prediction: CATS competition
Authors: L. J. Herrera, H. Pomares, I. Rojas, A. Guillén, J. González, M. Awad, A. Herrera
Venue: Neurocomputing (2007)

This paper presents a novel learning methodology for multigrid-based fuzzy system (MGFS), and its application to the CATS time series prediction benchmark. The MGFS model keeps the advantages of the traditional grid-based fuzzy systems (GBFS), and overcomes the problem inherent to all GBFSs when dealing with high dimensional input data. Thus the MGFS model keeps interpretability, low computational cost and high generalization. A novel architecture selection algorithm for MGFSs that allows performing input variable selection is proposed. It identifies the sub-optimal architecture, according to a provided data set of input/output data. The architecture selection algorithm is completed with a structure identification procedure, used to obtain the optimal input space partitioning of the different sub-grids of the model. The complete algorithm is used to obtain the MGFS models for the CATS series prediction problem, solved using a direct prediction-based approach.
Maximizing user utility in video streaming applications
Authors: C. E. Luna
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We study the design tradeoffs involved in video streaming in networks with QoS guarantees. We approach this problem by using a utility function to quantify the benefit a user derives from the received video sequence. This benefit is expressed as a function of the total distortion. In addition, we also consider the cost, in network resources, of a video streaming system. The goal of the network user is then to obtain the most benefit for the smallest cost. We formulate this utility maximization problem as a joint constrained optimization problem. The difference between the utility and the network cost is maximized subject to the constraint that the decoder buffer does not underflow. We present a deterministic dynamic programming approach to find the optimal tradeoff for both the constant bit rate (CBR) and renegotiated constant bit rate (RCBR) service classes. Experimental results demonstrate the benefits and the performance of the proposed approach.