ppxscal/embedding_network huggingface dataset:
The Hydra Parallel Programming System: Research Articles
Authors: Franklin E. Powers,  Jr., Gita Alaghband
Venue: Concurrency and Computation: Practice Experience (2008)

The Hydra Parallel Programming System, a new parallel language extension to Java, and its supporting software are described. It is a fairly simple yet powerful language designed to address a number of areas that have not received much attention. One of these areas is the recompilation of parallel programs at runtime to allow a parallel program to adapt to the architecture it is executing on. The first version of this software system focuses on smaller Symmetric Multiprocessing and compatible architectures which are becoming more common. This particular class of machines has a great need for more options in the area of parallel programming among the vastly popular Java language programmers. Hydra programs will run as sequential Java on machines that do not have the parallel support or do not have an implemented Hydra runtime system without requirement of any modifications to the program. This paper describes the language, compares it with other languages (specifically with JOMP, an OpenMP implementation for Java), presents a brief discussion on compiling and executing Hydra programs, presents some sample benchmarks and their performance on three platforms, and concludes with a discussion of issues and future directions for Hydra. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A comparison of five probabilistic view-size estimation techniques in OLAP
Authors: Kamel Aouiche, Daniel Lemire
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

A data warehouse cannot materialize all possible views, hence we must estimate quickly, accurately, and reliably the size of views to determine the best candidates for materialization. Many available techniques for view-size estimation make particular statistical assumptions and their error can be large. Comparatively, unassuming probabilistic techniques are slower, but they estimate accurately and reliability very large view sizes using little memory. We compare five unassuming hashing-based view-size estimation techniques including Stochastic Probabilistic Counting and LogLog Probabilistic Counting. Our experiments show that only Generalized Counting, Gibbons-Tirthapura, and Adaptive Counting provide universally tight estimates irrespective of the sizeof the view; of those, only Adaptive Counting remains constantly fast as we increasethe memory budget.
Rate Splitting MIMO-based MAC Protocol
Authors: Abduladhim Ashtaiwi, Hossam S. Hassanein
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Multiple Input Multiple Output (MIMO) offers significant advantages in terms of rate and reliability. We consider sharing the MIMO increased rate in Wireless Mesh Networks (WMNs) links. Such sharing allows nodes in a WMN to concurrently meet more demanding communication requirements such as high data rates, increased transmission range, power savings and low dropping rates. In this paper, we propose the Rate Splitting MIMO-based Mac Protocol (RSMP) which is a distributed Mac protocol where pairs of nodes can locally cooperate with other nodes in their vicinities to reserve the required rate through effective selection on transmit antennas. Nodes can then use any preferable MIMO coding technique that best suit their communication requirements. RSMP is evaluated using OPNET interfaced with Matlab. OPNET is used to model the details of the Mac protocol while Matlab is used to compute the MIMO channel capacity and interference. Simulation results are obtained and compared to those of 802.11n MIMO-based DCF MAC protocol. We show that our proposed RSMP scheme outperforms MIMO DCF MAC in medium access delay and throughput. We also show that nodes can always attain their requested rate and that RSMP can be applied to satisfy multiple QoS requirements.
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
Authors: Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
Venue: Expert Systems with Applications: An International Journal (2008)

The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage. This study presents an effective hybrid approach based on constructive genetic algorithm (CGA) for PFFS scheduling with the criterion to minimize the total weighted completion time (WCT). Minimizing the WCT in a PFFS problem significantly differs from the parallel-identical-machine scheduling problem, an optimal schedule in which the jobs on each machine are in weighted shortest processing time (WSPT) order. The proposed approach incorporates two fitness functions, and a population trained by a local improvement search based on tabu search with a candidate list strategy into CGA. Simulation results are compared with those of the column generation (CG) approach to demonstrate the effectiveness of the proposed hybrid approach. In particular, the CG approach has been applied successfully to solve various parallel machine scheduling problems, and yields high-quality solutions.
Self-Tuning Multivariable PID Decoupling Controller of Ball Mill Pulverizing System
Authors: Jie-sheng Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Ball mill coal pulverizing system of pelletizing plant is a complex nonlinear multivariable process with strongly coupling and time-delay, whose operations often varies violently. The automatic control of such systems is a research focus in the process control area. A new multivariable PID decoupling controller is proposed in this paper, which consists of diagonally matrix method-based decomposition compensatory unit, PID controller and fuzzy self-tuning components unit with scaling facto. Particle swarm optimization algorithm is also adopted to optimize parameters of PID controller. Simulation results show the validity of the model obtained and the control method proposed in this paper, the new method can overcome nonlinear and strong coupling features of the system in a wide range, and it has strong robustness and adaptability.
Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics
Authors: A. E. Doroshenko, L. M. Zakhariya, G. E. Tseitlin
Venue: Cybernetics and Systems Analysis (2007)

Clones of algebras of n-relations are examined. These clones include algebras equipotent to Codd's algebra. The results obtained earlier for semigroup (grammatical and algorithmic) clones are extended to clones of algebras of functional n-relations. One-dimensional and multidimensional computing structures and related object domains are outlined.
A rider to "A Question of Semantics"
Authors: Rod Steel
Venue: ACM SIGARCH Computer Architecture News (1978)

Peter Denning, in the April '78 issue of CAN, voiced several very incisive observations concerning the generally slow rate at which commercial computer systems have incorporated the architectural knowledge currently available.
Building high-integrity distributed systems with Ravenscar restrictions
Authors: Santiago Urueña, Juan Zamorano
Venue: ACM SIGAda Ada Letters (2007)

The Ravenscar profile was a qualitative leap in the development of single-processor hard real-time systems with certification requirements. But nowadays more and more safety-critical systems are distributed, so a new Ada profile is needed for multi-node applications. This work discusses the restrictions and additions to the language needed to certify and obtain the required predictability and timeliness in a high-integrity hard real-time Ada distributed application.
Why does it take that long? Establishing Product Lines in the Automotive Domain
Authors: Christian Tischer, Andreas Muller, Markus Ketterer, Lars Geyer
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

The automotive industry supplies the world with a tremendous variability of vehicles, fulfilling a wide range of legal requirements all around the world while addressing their owner's needs and preferences from lowest cost to extreme luxury. As a global supplier in the powertrain domain, Bosch Gasoline Systems (GS) addresses this challenge by establishing a Product Line Approach in the software development for gasoline engine control units, supported by process improvement initiative. Several characteristics of the powertrain domain strongly affected the feasible solutions and the time scale. Specific customer relations, complexity and variability of the physical system and a large organization require patience and continuity to be successful with product lines. The achievements of the GS approach are the ability of market oriented development, measurement of the product line success and a continuous control and improvement of product quality.
The complexity of fixed point models of trust in distributed networks
Authors: Karl Krukow, Andrew Twigg
Venue: Theoretical Computer Science (2007)

In this paper we consider the complexity of some problems arising in a fixed point model of trust in large-scale distributed systems, based on the notion of trust structures introduced by Carbone, Nielsen and Sassone; a set of trust levels with two distinct partial orderings. In the trust model, a global trust state exists as the least fixed point of a collection of local policy functions of nodes in the network. We first show that it is possible to efficiently compute a single component of the global trust state using a simple, robust and totally asynchronous distributed algorithm. We complement this with a lower bound which shows that, if the policies are unrestricted then communication and time linear in the number of distinct trust levels is required in the worst case. We then consider the notion of distributed proof carrying requests previously introduced as a means of safely approximating the global trust state without computing its exact value. We present a new result that enables us to give a continuum of proof carrying protocols, the previously known protocol being one extreme of this. The theorem allows us to generate protocols that can prove all possible trust values (previously, it was only possible to prove trust values representing 'not too much bad behaviour'). However, we show that such a general protocol may not be efficient - it is NP-hard to construct an approximately minimal size proof in our model, and in the worst case the nodes must communicate almost as much data as if they were to compute the global trust state from scratch. The implications of our negative results are that it may be necessary to restrict the policy language in order to efficiently implement a fixed point model of trust in a distributed network.
Lightpath Reconfiguration in Regional IP-over-WDM Networks by a Centralized Control System
Authors: Yutaka Katsuyama, Michio Hashimoto, Keiji Nishikawa, Akira Ueno, MD. Nooruzzaman, Osanori Koyama
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Lightpath reconfiguration performance has been evaluated experimentally for regional IP-over-WDM network applications, making the network scalable and stable when traffic changes occur. The reconfiguration performance was examined in an experimental network with reconfigurable optical add/drop multiplexers (R-OADMs) to connect 4 nodes with bi-directional dual-fibers. The experiment was conducted by controlling the ROADMs. The control signals were sent by a developed system over WWW (World-Wide-Web). The lightpaths were added or deleted by the control system in the experimental network, and IP packets were monitored. The results clarified that lightpaths could be reconfigured by controlling the R-OADMs, and IP packets could be routed dynamically by OSPF (Open Shortest Path First) so as to adapt the lightpath changes. The reconfiguration functions of the system together with the ROADMs provide network administrators with easy management for the network in a skill-less, centralized and remotely-controlled way.
A Guide for Management and Financial Controls of Product Lines
Authors: Yoshihiro Matsumoto
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

The calculations of NPV (net present value) and cash flows provide useful means when organizations come to decide whether they should transit from one-off development to software product line (SPL) based development, how much investment should be made for the development of SPL, whether their investments are being successfully returned from the on-going SPL adoption programs, or whether they should modify their on-going programs. The paper first summarizes experiences that were gathered from the Toshiba Software Factory in which a series of product lines for the domain of electric power generation, called EPG-SPL, has been developed and practically applied since 1962. At present, the 4th generation of EPG-SPL is being applied. The purpose of this paper is to present how NPV and cash flow calculations can be used if it is applied to the management and controls of SPL adoption, and to propose a guide for monitoring the shortage of return-oninvestment every year, which is necessary to achieve successful SPL adoptions.
On triangular norms and uninorms definable in Ł Π12
Authors: Enrico Marchioni, Franco Montagna
Venue: International Journal of Approximate Reasoning (2008)

In this paper, we investigate the definability of classes of t-norms and uninorms in the logic L@P12. In particular we provide a complete characterization of definable continuous t-norms, weak nilpotent minimum t-norms, conjunctive uninorms continuous on [0,1), and idempotent conjunctive uninorms, and give both positive and negative results concerning definability of left-continuous t-norms (and uninorms). We show that the class of definable uninorms is closed under construction methods as annihilation, rotation and rotation-annihilation. Moreover, we prove that every logic based on a definable uninorm is in PSPACE, and that any finitely axiomatizable logic based on a class of definable uninorms is decidable. Finally we show that the Uninorm Mingle Logic (UML) and the Basic Uninorm Logic (BUL) are finitely strongly standard complete w.r.t. the related class of definable left-continuous conjunctive uninorms.
Stealthy malware detection through vmm-based "out-of-the-box" semantic view reconstruction
Authors: Xuxian Jiang, Xinyuan Wang, Dongyan Xu
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

An alarming trend in malware attacks is that they are armed with stealthy techniques to detect, evade, and subvert malware detection facilities of the victim. On the defensive side, a fundamental limitation of traditional host-based anti-malware systems is that they run inside the very hosts they are protecting ("in the box"), making them vulnerable to counter-detection and subversion by malware. To address this limitation, recent solutions based on virtual machine (VM) technologies advocate placing the malware detection facilities outside of the protected VM ("out of the box"). However, they gain tamper resistance at the cost of losing the native, semantic view of the host which is enjoyed by the "in the box" approach, thus leading to a technical challenge known as the semantic gap. In this paper, we present the design, implementation, and evaluation of VMwatcher - an "out-of-the-box" approach that overcomes the semantic gap challenge. A new technique called guest view casting is developed to systematically reconstruct internal semantic views (e.g., files, processes, and kernel modules) of a VM from the outside in a non-intrusive manner. Specifically, the new technique casts semantic definitions of guest OS data structures and functions on virtual machine monitor (VMM)-level VM states, so that the semantic view can be reconstructed. With the semantic gap bridged, we identify two unique malware detection capabilities: (1) view comparison-based malware detection and its demonstration in rootkit detection and (2) "out-of-the-box" deployment of host-based anti-malware software with improved detection accuracy and tamper-resistance. We have implemented a proof-of-concept prototype on both Linux and Windows platforms and our experimental results with real-world malware, including elusive kernel-level rootkits, demonstrate its practicality and effectiveness.
Provable data possession at untrusted stores
Authors: Giuseppe Ateniese, Randal Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary Peterson, Dawn Song
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets in widely-distributed storage system. We present two provably-secure PDP schemes that are more efficient than previous solutions, even when compared with schemes that achieve weaker guarantees. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data. Experiments using our implementation verify the practicality of PDP and reveal that the performance of PDP is bounded by disk I/O and not by cryptographic computation.
Mining Software Evolution to Predict Refactoring
Authors: Jacek Ratzinger, Thomas Sigmund, Peter Vorburger, Harald Gall
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Can we predict locations of future refactoring based on the development history? In an empirical study of open source projects we found that attributes of software evolution data can be used to predict the need for refactoring in the following two months of development. Information systems utilized in software projects provide a broad range of data for decision support. Versioning systems log each activity during the development, which we use to extract data mining features such as growth measures, relationships between classes, the number of authors working on a particular piece of code, etc. We use this information as input into classification algorithms to create prediction models for future refactoring activities. Different state-of-the-art classifiers are investigated such as decision trees, logistic model trees, propositional rule learners, and nearest neighbor algorithms. With both high precision and high recall we can assess the refactoring proneness of object-oriented systems. Although we investigate different domains, we discovered critical factors within the development life cycle leading to refactoring, which are common among all studied projects.
Statistical analysis of ground truth in human labeled data
Authors: Jiang Zhou, Fernando Vilarino, Lacey Gerard, Li Xuchun
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Determining the ground truth in human labeled video data is a common challenge in surveillance and medical imaging research work. In this paper we describe four statistical experiments that examine different approaches of determining ground truth in a database of hand washing videos.
The effect of sidewall friction on dense granular flows
Authors: Nicolas Taberlet, Patrick Richard, Renaud Delannay
Venue: Computers Mathematics with Applications (2008)

We present novel results on flow properties using molecular dynamics simulation as well as @c-densitometry experiments. We show that fundamentally different types of granular flow can be observed in one unique system. Using both frictional and frictionless confining walls, we show that the differences existing between these regimes originate in the frictional properties of the walls. The salient features of each regime are described in detail. In particular, the packing fraction and streamwise velocity profiles are shown to hinge on the frictional properties of the confining walls. Finally, we propose a dimensionless number, independent of the grain size, which helps to delineate the different regimes.
A new methodology for designing a fuzzy logic controller and PI, PD blending mechanism
Authors: M. Güzelkaya, Eksin, F. Gürleyen
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

In this study, a hybrid and intelligent structure that blends the "PI-type" and "PD-type" output portions of a new fuzzy logic controller is presented. The new fuzzy logic controller consists of two rule-base blocks and a logical switch in between and its rule-base is formed using new meta-rules. The rule-base blocks admit two inputs one of which is newly devised and called "normalized acceleration" and the other one is the classical "error". The newly devised input gives a relative value about the "fastness" or "slowness" of the system response and provides an easy and straightforward way of forming the rule-base. The new hybrid controller structure is formed in such a way that it intelligently blends PI and PD portions of the fuzzy logic controller through a new empirical relation or a rule-base. Both the empirical relation and the rule-base use the same inputs of the new fuzzy logic controller. The robustness and effectiveness of the new fuzzy logic controller with/without the blending mechanism are illustrated through simulations done on a second-order system with varying parameters. Furthermore, the results of the new hybrid fuzzy PID controller is compared with the results obtained using both the conventional fuzzy PID controller and another hybrid method which is an augmented version of fuzzy PI controller with a resetting factor.
Learning for the Control of Dynamical Motion Systems
Authors: Pierre-Francois Marteau, Sylvie Gibet
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper addresses the dynamic control of multi- joint systems based on learning of sensory-motor transformations. To avoid the dependency of the controllers to the analytical knowledge of the multi- joint system, a non parametric learning approach is developed which identifies non linear mappings between sensory signals and motor commands involved in control motor systems. The learning phase is handled through a General Regression Neural Network (GRNN) that implements a non parametric Nadarayan-Watson regression scheme and a set of local PIDs. The resulting dynamic sensory-motor controller (DSMC) is intensively tested within the scope of hand-arm reaching and tracking movements in a dynamical simulation environment. (DSMC) proves to be very effective and robust. Moreover, it reproduces kinematics behaviors close to captured hand-arm movements.
Tools for Automted Statistical Graphics
Authors: P. M. Caporal
Venue: IEEE Computer Graphics and Applications (1981)

The new, user-friendly software packages, analyzed and differentiated here, make statistical graphics more useful and accessible.