ppxscal/embedding_network huggingface dataset:
Proof of Berge's strong path partition conjecture for k=2
Authors: Eli Berger, Irith Ben-Arroyo Hartman
Venue: European Journal of Combinatorics (2008)

Berge's strong path partition conjecture from 1982 generalizes and extends Dilworth's theorem and the Greene-Kleitman theorem which are well known for partially ordered sets. The conjecture is known to be true for all digraphs only for k=1 (by the Gallai-Milgram theorem) and for k>=@l (where @l is the cardinality of the longest path in the graph). The attempts made, so far, to prove the conjecture for other values of k have yielded proofs for acyclic digraphs, but not for general digraphs. In this paper, we prove the conjecture for k=2 for all digraphs. The proof is constructive and it extends the proof for k=1.
R70-8 Analog Methods for On-Line System Identification Using Noisy Measurements
Authors: P. C. Young
Venue: IEEE Transactions on Computers (1970)

A stochastic approximation, or stochastic gradient procedure, is a method of estimating the minimum of a criterion function despite the random effects of noise. It was originally conceived by the mathematician as a means of estimating the minimum of a regression function. In recent years, however, stochastic approximation has received considerable attention in the engineering field because of its potential application to learning systems, parameter estimation, and automatic control. 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
Quality-based backlight optimization for video playback on handheld devices
Authors: Liang Cheng, Shivajit Mohapatra, Magda El Zarki, Nikil Dutt, Nalini Venkatasubramanian
Venue: Advances in Multimedia (2007)

For a typical handheld device, the backlight accounts for a significant percentage of the total energy consumption (e.g., around 30% for a Compaq iPAQ 3650). Substantial energy savings can be achieved by dynamically adapting backlight intensity levels on such low-power portable devices. In this paper, we analyze the characteristics of video streaming services and propose a cross-layer optimization scheme called quality adapted backlight scaling (QABS) to achieve backlight energy savings for video playback applications on handheld devices. Specifically, we present a fast algorithm to optimize backlight dimming while keeping the degradation in image quality to a minimum so that the overall service quality is close to a specified threshold. Additionally, we propose two effective techniques to prevent frequent backlight switching, which negatively affects user perception of video. Our initial experimental results indicate that the energy used for backlight is significantly reduced, while the desired quality is satisfied. The proposed algorithms can be realized in real time.
Issues in TCP Vegas over Optical Burst Switching Networks
Authors: Olga Leon, Sebastia Sallent
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we study by means of simulation the effect of the variation of the burstification period in OBS networks on the performance of TCP Vegas.
Standardizing Storage Clusters
Authors: Garth Goodson, Sai Susharla, Rahul Iyer
Venue: Queue (2007)

Data-intensive applications such as data mining, movie animation, oil and gas exploration, and weather modeling generate and process huge amounts of data. File-data access throughput is critical for good performance. To scale well, these HPC (high-performance computing) applications distribute their computation among numerous client machines. HPC clusters can range from hundreds to thousands of clients with aggregate I/O demands ranging into the tens of gigabytes per second.
Self-organized Criticality of Individual Companies: An Empirical Study
Authors: Bin Rao, Dong-yun Yi, Cheng-li Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The stock market is a typically complex and self-interacting system that in many aspects it shows the characteristic of self-organized criticality (SOC). In the present work we mainly investigate the SOC properties of individual companies. Price volatility can be served as an analogy of "avalanche" in the classical sand-pile model and different volatility statistics have different power law behaviors. We mainly analyze the distributions of the return and its ramificate statistics, both theoretical and experimental. The empirical study of the Chinese 5-min trading data (from 2005/7/8 to 2006/2/8) shows that some volatility statistics did show significant power law behaviors while some other volatility statistics show asymptotic power law behaviors and do not accord with the classical SOC model, which might be SOC affected by noise, sub-critical or even chaos. Furthermore, we find that cumulative volatility statistics are much more significant than the original statistics and the high-order volatilty statistics present an inherent multifractality.
Distributed Multi-sensor Multi-target Tracking with Random Sets I
Authors: ShuRong Tian, You He, XiaoShu Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

An approach for distributed multi-sensor multi-target tracking with random sets is introduced. For each sensor, probability hypotheses density filter is employed to obtain a state estimate set, then, nearest neighbor filter is used to correlate the state estimates. Experiments show this approach to be able to estimate both the number of tracked objects, as well as the states of the objects, robustly from noisy observations.
A Measurement of a large-scale Peer-to-Peer Live Video Streaming System
Authors: Susu Xie, Gabriel Y. Keung, Bo Li
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Peer-to-Peer (P2P) technologies have found much success in applications like file distributions, and its adoption in live video streaming has recently attracted significant attentions. With the emerge of commercial P2P streaming systems that are orders of magnitude larger than the academic systems, understanding its basic principles and limitations are important in the design of future systems. Coolstreaming represented one of the earliest largescale live streaming trials in the Internet. In this paper, we discuss the fundamental components of the system. By leveraging the recent results obtained from live event broadcast, we develop some basis to demonstrate that a random partnership selection has the potentially to scale. Specific- cally, first, we examine the overlay topology. Second, using a combination of real traces and analysis, we present the highly skewed distribution of peer contribution; a small fraction of peers contribute most of the upload capacity. Third, we discuss the main limitations and the implications on the scalability.
Development of a Software for Effective Cutting Simulation using Advanced Octree Algorithm
Authors: Trung Thanh Pham, Yong Hyun Kim, Sung Lim Ko
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The objective of this study is to develop the simulation software for numerical control (NC) machining. This paper presents the visualization and analysis of cutting process in slope machining by using advanced octree method. A software based on advanced octree algorithms has been developed and used as the basis in this study. The suggested algorithm with supersampling techniques in computer graphics used for developing the simulation software can improve efficiently the computation and visualization of cutting process, reduce memory waste, computation time and obtain high level of accuracy. The simulation results of cutting process in slope machining verified that the application of advanced octree model can overcome several limitations of decomposition model in term of achieving high level of accuracy in cutting simulation with fast computation time.
B69-1 Digital Computer System Principles
Authors: R. C. Minnick
Venue: IEEE Transactions on Computers (1969)

There seem to be two kinds of computer scientists: those who hate software and those who hate hardware. This dichotomy in our field has generated many problems, such as unprogrammable computers, ridiculous software fixes for essentially hardware problems, and the development of hardware devices for which no sane programmer has any conceivable need. Similarly, the textbooks in our field display this same problem: each discusses either hardware or software, but rarely does it adequately cover both.
A Novel Reconfigurable Low Power Distributed Arithmetic Architecture for Multimedia Applications
Authors: Zhenyu Liu, Tughrul Arslan, Ahmet T. Erdogan
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The use of reconfigurable cores in system on chip (SoC) designs is increasingly becoming a trend. Such cores are being used for their flexibility, powerful functionality and low power consumption. Distributed Arithmetic (DA) is a powerful algorithm wildly used in many fields of multimedia for its efficiency. This paper presents a novel reconfigurable adder-based architecture for DA to realize the inner product which is the key computation in many digital signal processing applications. 1D DCT is mapped onto the architecture. Compared with some existing ASIC designs, the new architecture achieves good performance in area, speed and power.
The Researching About Water and Ink Motion Model Based On Soil-Water Dynamics in Simulating for the Chinese Painting
Authors: Xiujin Wang, Jizhou Sun
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Water-ink moving in xuan-paper modeling is the key problem in Chinese painting simulation. In this text, based on the effective thickness xuan-paper model, the mechanics of fluids in porous media and soil-water dynamics are introduced to the research of water and ink motion in xuan-paper. The physics process of forming Chinese painting special effect is presented by building water and ink motion model. The simulating result demonstrates that the model grounded on the theory can bring the satisfied results for different solutions of water and ink and different papers.
Copyright
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The Large Hadron Collider (LHC) at CERN, the European Organization for Nuclear Research, needs to produce unprecedented volumes of data when it starts operation in 2007. To provide for its computational needs, the LHC computing grid (LCG) should be deployed as a worldwide computational grid service, providing the middleware upon which the physics analysis for the LHC can be carried out. In 2003, versions of this middleware were deployed which were based on the middleware produced by the European Data Grid project (EDG). In 2004 the LCG-2 release, which consisted of the EDG middleware with some minor modifications, was deployed for use by the LHC experiments. A series of data challenges by these experiments were the first real experiment production use of LCG. During the course of the data challenges, many issues and problems were exposed which had not shown up in more limited tests. The deployment, service and development teams worked closely with the experiments to understand these issues and while some of the problems were solved during the data challenges, others exposed fundamental problems with the middleware as deployed in LCG-2. One of these fundamental problems was the performance under real load of the catalog component provided by EDG, the replica location service. To solve these problems a new component was designed, the LCG file catalog (LFC). The LFC moves away from the replica location service model used in previous LCG releases, towards a hierarchical file system model which is more like a UNIX file system. It also adds missing functionality which was requested by the experiments. This paper presents the architecture and implementation of the LFC and evaluates it in a series of performance tests, with up to forty million entries and one hundred requesting threads from multiple clients. The results show good scalability up to the limits of these tests, and compare favourably with other grid catalog implementations. 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
Efficient policy analysis for administrative role based access control
Authors: Scott D. Stoller, Ping Yang, C R. Ramakrishnan, Mikhail I. Gofman
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effect of an ARBAC policy by simple inspection, because sequences of changes by different administrators may interact in unexpected ways. ARBAC policy analysis algorithms can help by answering questions, such a suser-role reachability, which asks whether a given user can be assigned to given roles by given administrators. This problem is intractable in general. This paper identifies classes of policies of practical interest, develops analysis algorithms for them, and analyzes their parameterized complexity, showing that the algorithms may have high complexity with respect to some parameter k characterizing the hardness of the input (such that k is often small in practice) but have polynomial complexity in terms of the overall input size when the value of k is fixed.
Iterative model-driven development of adaptable service-based applications
Authors: Leen Lambers, Hartmut Ehrig, Leonardo Mariani, Mauro Pezzè
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Flexibility and interoperability make web services well suited for designing highly-customizable reactive service-based applications, that is interactive applications that can be rapidly adapted to new requirements and environmental conditions. This is the case, for example of personal data managers that many users tailor to their needs to meet different usage conditions and requests. In this paper, we propose a model-based approach that provides users with the ability of rapidly developing, adapting and reconfiguring reactive service-based applications to meet new requirements and needs. Users specify their needs by describing sample executions that include interactions with web services through an intuitive interface. Interactions are stored in a visual formalism that integrates live sequence charts with graph transformation systems. Models can be visualized, modified, executed and automatically analyzed to identify inconsistencies
Research on Mobile Agents in E-learning Service System
Authors: Zong'ang Liu, Shenyuan Yang, Li'an Wang, Wusheng Zhao, Jinchao Tian, Qi Luo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The importance of E-Learning has been transferred to build up the personalized learning environment, and offer a kind of personalized knowledge service based on modern pedagogy and psychology theories. An E- learning service system based on Mobile Agents (ESBMA) was proposed and realized in the paper. The structure of system, work process, key realization technologies of ESBMA, the design of mobile agent, and the realization of mobile agent were introduced in the paper. The results manifest that ESBMA could support personalized E- learning better.
Event-based process monitoring
Authors: R. Sarrate, J. Aguilar, F. Nejjari
Venue: Engineering Applications of Artificial Intelligence (2007)

This article presents an efficient Intelligent Supervision System (ISS) architecture for the monitoring of a plant. The ISS detects relevant events which are later used to identify the state of the plant. The ISS layered structure implements the sliding window paradigm to detect significative events from measured signals. This methodology allows for the design of flexible ISS interfaces, that can be easily configured to detect the desired events. The behavioral model of the plant is described by an automaton, which matches event sequences to the state of the plant. Expert knowledge is used in the design of the whole ISS architecture. The ISS has been implemented in Simulink, and applied to a biotechnological process.
A heuristic clustering algorithm for mining communities in signed networks
Authors: Bo Yang, Da-You Liu
Venue: Journal of Computer Science and Technology (2007)

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.
Singular curves in the joint space and cusp points of 3-RPR parallel manipulators
Authors: Mazen Zein, Philippe Wenger, Damien Chablat
Venue: Robotica (2007)

This paper investigates the singular curves in the joint space of a family of planar parallel manipulators. It focuses on special points, referred to as cusp points, which may appear on these curves. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make possible a nonsingular change of assembly mode. The purpose of this study is twofold. First, it exposes a method to compute joint space singular curves of 3-RPR planar parallel manipulators. Second, it presents an algorithm for detecting and computing all cusp points in the joint space of these same manipulators.
Digital Systems Simulation
Authors: S. A. Szygenda
Venue: Computer (1975)

Early approaches to digital logic simulation were extremely expensive, difficult to use, and plagued with model inaccuracies. Today's simulators have overcome these problems to varying degrees. This situation, combined with the ever-increasing complexity of today's technology, has prompted the acceptance of digital logic simulation as a mandatory tool in most design automation systems.
FIVA
Authors: Evert-Jan Blom, Dinne W. J. Bosman, Sacha A. F. T. van Hijum, Rainer Breitling, Lars Tijsma, Remko Silvis, Jos B. T. M. Roerdink, Oscar P. Kuipers
Venue: Bioinformatics (2007)

Summary: FIVA (Function Information Viewer and Analyzer) aids researchers in the prokaryotic community to quickly identify relevant biological processes following transcriptome analysis. Our software assists in functional profiling of large sets of genes and generates a comprehensive overview of affected biological processes. Availability: http://bioinformatics.biol.rug.nl/standalone/fiva/ Contact: o.p.kuipers@rug.nl Supplementary information: http://bioinformatics.biol.rug.nl/standalone/fiva/suppMaterials.php
Undetectability of Bridging Faults and Validity of Stuck-At Fault Test Sets
Authors: K. L. Kodandapani
Venue: IEEE Transactions on Computers (1980)

The study of bridging faults (or short circuits that occur between conducting paths) has become increasingly important with the advent of LSI technology. To date, only a very few papers have been published on this topic. Specifically, little is known regarding undetectable bridging faults. More importantly, what has yet to be explored are the effects of undetectable bridging faults on the tests designed to detect stuck-at faults.
The Research and Application of Fuzzy Immune PID Control in the Load Control System of Tube Mill
Authors: Guili Yuan, Jizhen Liu, Wen Tan, Xiangjie Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Aiming at the tube mill load controlled object with the characteristics of large delay, large inertia, nonlinear and time-variant, we design a tube mill load control system basing at fuzzy immune PID control. The system combines with the cascade control and fuzzy immune PID control, adopts P control in the inner loop and fuzzy immune PID control in the outer loop, takes fully advantage of the cascade control ,fuzzy control, immune feedback control and PID control, which makes the system not only have better track ability but also stronger robust and anti-disturbance .In order to show the superior of the control strategy , simultaneously the paper carry out cascade PID control Simulation, the result manifests that the control effect has better regulation-quality than cascade PID control, what's more, the control algorithm is very simple and practical.
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems
Authors: Faisal N. Abu-Khzam
Venue: Theory of Computing Systems (2007)

Pseudo-kernelization is introduced in this paper as a new strategy for improving fixed-parameter algorithms. This new technique works for bounded search tree algorithms by identifying favorable branching conditions whose absence could be used to reduce the size of corresponding problem instances. Pseudo-kernelization applies well to hitting set problems. It can be used either to improve the search tree size of a 3-Hitting-Set algorithm from O*(2.179k) to O*(2.05k), or to improve the kernel size from k3 to 27k. In this paper the parameterized 3-Hitting-Set and Face Cover problems are used as typical examples.
Resource allocation based on imprecise information
Authors: André de Korvin, Plamen Simeonov, Ongard Sirisaengtaksin
Venue: Neural, Parallel Scientific Computations (2007)

The main objective of this work is to develop a methodology for risk management in a distributed system. Security is a very important issue when different users have potential access to operations of various databases of a system. There are benefits and risks involved in allowing these accesses overtime. Assuming that the probability of a user being hostile may be crisp or fuzzy is partially known, we implement fuzzy linear programming to maximize the benefits while keeping the loss under a certain fuzzy limit within the time allocation for each user. Furthermore, we develop an approach using fuzzy cognitive map to help estimate the probability of the user being hostile. In the paper, we use a specific model for simplicity in illustrating our methodology but the model can be extended to general problems of allocation of resources in a highly sensitive information distributed system such as online banking.