ppxscal/embedding_network huggingface dataset:
Restricted arc-connectivity of digraphs
Authors: Lutz Volkmann
Venue: Information Processing Letters (2007)

Since interconnection networks are often modeled by graphs or digraphs, the edge-connectivity of a graph or arc-connectivity of a digraph are important measurements for fault tolerance of networks. The restricted edge-connectivity @l^'(G) of a graph G is the minimum cardinality over all edge-cuts S in a graph G such that there are no isolated vertices in G-S. A connected graph G is called @l^'-connected, if @l^'(G) exists. In 1988, Esfahanian and Hakimi [A.H. Esfahanian, S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform. Process. Lett. 27 (1988), 195-199] have shown that each connected graph G of order n>=4, except a star, is @l^'-connected and satisfies @l^'(G)=
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Authors: Virginia Vassilevska, Ryan Williams, Raphael Yuster
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In the all-pairs bottleneck paths (APBP) problem (a.k.a. all-pairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can be routed from s to t. The APBP problem was first studied in operations research, shortly after the introduction of maximum flows and all-pairs shortest paths. We present the first truly sub-cubic algorithm for APBP in general dense graphs. In particular, we give a procedure for computing the (max, min)-product of two arbitrary matrices over R ∪ (∞,-∞) in O(n2+Ω/3) ≤ O(n2.792) time, where n is the number of vertices and Ω is the exponent for matrix multiplication over rings. Using this procedure, an explicit maximum bottleneck path for any pair of nodes can be extracted in time linear in the length of the path.
A QoS-Aware and Energy-Conserving Transcoding Proxy Using On-Demand Data Broadcasting
Authors: Jiun-Long Huang Ming-Syan Chen
Venue: IEEE Transactions on Mobile Computing (2007)

Most research works in transcoding proxies in mobile computing environments are on the basis of the traditional client-server architecture and do not employ the data broadcast technique. In addition, the issues of QoS provision and energy conservation are also not addressed in the prior studies. In view of this, we design in this paper a QoS-aware and energy-conserving transcoding proxy by utilizing the on-demand broadcasting technique. We first propose a QoS-aware and energy-conserving transcoding proxy architecture, abbreviated as QETP, and model it as a queuing network consisting of three queues. By analyzing the queuing network, three lemmas are derived to estimate the load of these queues. We then propose a version decision policy and a service admission control scheme to provide QoS in QETP. The derived lemmas are used to guide the execution of the proposed version decision policy and service admission control scheme to achieve the given QoS requirement. In addition, we also propose a data indexing method to reduce the power consumption of clients. To measure the performance of the proposed architecture, three experiments are conducted. Experimental results show that the average access time reduction of the proposed scheme over the traditional client-server architecture ranges from 45 percent to 75 percent. Experimental results also show that the proposed scheme is more scalable than the traditional client-server architecture and is able to effectively control the system load to attain the given QoS requirements. In addition, the proposed scheme is able to greatly reduce the average tuning time of clients at the cost of a slight increase (around 5 percent in our experiments) in average access time.
The effects of varying population density in a fine-grained parallel genetic algorithm
Authors: Xiaodong Li, M. Kirley
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper introduces a new method for controlling selection pressure in fine-grained parallel GAs. Our model, inspired by percolation theory, employs a "seeding" mechanism, which provides a means of systematically increasing the population size until the carrying capacity of the lattice is reached. Initially, a relatively small number of individuals (solutions) occupy small isolated patches (demes). As time goes by, additional randomly generated individuals are added to the lattice. As the density increases, the small isolated demes gradually merge to form larger connected demes. This "percolation process" helps to balance the interplay between genetic and population forces. The implications of alternative migration schemes between demes are also investigated in terms of the population diversity, selection pressure and consequently algorithm performance. Experimental results using benchmark optimisation problems confirm that the "step-wise" increase in the population density does affect the quality of the solutions found in a given trial.
Optimal Contexts for the Self-Test of Coarse Grain Dynamically Reconfigurable Processors
Authors: Tomoo Inoue, Takashi Fujii, Hideyuki Ichihara
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

This paper proposes a self-test method of dynamically reconfigurable processors (DRPs) without area overhead. This method constructs a test frame of processor elements (PEs) such that it consists of test pattern generators, response analyzers and PEs under test, and switches several test frames dynamically so as to test all the PEs. Since the number of contexts and test application time are subject to the structure of test frames, we design several test frames with different structures and discuss the relationship of the structures to the number of contexts and test application time. Based on this discussion, we can construct the best test frame according to a given test environment.
The River-Rafting System for Knowledge Discovery Related to Persuasion Process Conversation Logs
Authors: Wataru Sunayama, Katsutoshi Yada
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The purpose of this research is to develop a framework to represent the content and process of persuasion communications for overdue payment collection, thus making it possible to examine how the skilled operators have used theme related keywords concerning motivations to pay, the payment methods and the payment confirmation in their negotiation to achieve higher collection success. This paper describes a basis for modeling a persuasion process. There has been no research or methods for dealing with large amounts of conversation logs for discovering useful knowledge about persuasion processes. In this paper, we report our successful efforts in discovering a part of the distinctive features of skilled worker techniques as indicated in their conversations related to overdue payment collection and the application of our methods to communication data related to a Japanese telecommunications company.
Efficient Metamorphosis of Point-Sampled Geometry
Authors: Haishan Tian, Yuanjun He, Hongming Cai, Lirong Feng
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

We present an automated implemented and computationally efficient method for smoothly morphing of point set surface. In the issue, corresponding between the surfaces is difficult for point set surface without any topological information. To overcome this, the method is guided by registration and warp functions, then the intermediate surfaces are constructed depend on only the local geometric information expressed by the point locations in 3D space. To reduce the distortion of the intermediate shapes, the distance metric between points is defined, and the algorithm optimally matches the points in the two models. The automated method provides the animator with a technique that can be used to create a set of models forming a smooth transition between pairs of a given sequence of keyframe models. The advantage of the new approach is that the capability of morphing between objects having a different topological without any intervene of animators.
Distributed probability network
Authors: Y. Ozturk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper introduces a distributed sub-pattern space binary associative memory for error correction and pattern completion. The associative architecture presented in this work is analogous to belief network representations in that, it represents domain knowledge using a set of sub-pattern joint probability distributions. It is superior to belief networks in that, it can be used as an associative memory. The proposed architecture is distributed in nature and offers a fault tolerant solution to binary pattern completion and error correction problems.
Very low bit rate video coding using active triangular mesh
Authors: P. Salembier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper presents a video coding scheme for very low bit rate applications. The coding approach relies on the notion of active meshes and can be viewed as a particular case of region-based coding. The active mesh is used to efficiently represent and code the various regions of the scene as well as the motion information. The algorithm involves the following steps: projection (time tracking of the regions); partition and motion coding; synthesis; modification of the mesh topology (introduction of new regions and elimination of useless regions); and texture coding.
Surface Reconstruction with Least Square Reproducing Kernel and Partition of Unity
Authors: Jun Yang, Changqian Zhu, Hua Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

We present a new scheme for the surface reconstruction of large noisy scattered points coming from laser range scanners. It is based on a combination of the two well-known methods: Least Square Reproducing Kernel (LSRK) and Partition of Unity (PoU). The input point datasets are broken into many subdomains with an error-controlled octree subdivision method, which adapts to variations in the complexity of the model. A local Least Square Reproducing Kernel function is constructed at each octree leaf cell. Finally, we blend these local shape functions together using weighting functions. Due to the separation of local approximation and local blending, the representation is not global and can be created and evaluated rapidly. Numerical experiments demonstrate robust and efficient performance of the proposed methods in processing a great variety of 2D and 3D reconstruction problems.
Mixed system and component level T-CAD for micro fabrication
Authors: U. Hansen
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

In this paper two T-CAD systems are presented, one dealing with the design of micro devices on the system level and allowing checking of process sequences using rules comprising expert knowledge. The other one is a work-flow-based system for the layout of micro components fabricated by wet chemical etching of silicon, thus providing a component level view to the design process. It is shown how both systems are integrated providing the designer with concurrent access to system and component design.
The effect of morphological smoothening by reconstruction on the extraction of peaks and pits from digital elevation models
Authors: Dinesh Sathyamoorthy
Venue: Pattern Recognition Letters (2007)

In this paper, the effect of morphological smoothening by reconstruction on the extraction of peaks and pits from digital elevation models (DEMs) is studied. First, a mathematical morphological based algorithm to extract peaks and pits from DEMs is developed. Morphological smoothening by reconstruction is then implemented on the DEM of Great Basin using kernels of different sizes. The number of peaks and pits extracted from the resultant DEMs is computed using connected component labeling and the results are compared. This work is aimed at studying the capabilities of morphological smoothening by reconstruction in the modeling of objects and processes operating within an environment.
Speech under stress conditions: overview of the effect on speech production and on system performance
Authors: H. J. M. Steeneken
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The NATO research study group on "Speech and Language Technology" recently completed a three year project on the effect of "stress" on speech production and system performance. For this purpose various speech databases were collected. A definition of various states of stress and the corresponding type of stressor is proposed. Results are reported from analysis and assessment studies performed with the databases collected for this project.
Curball--A Prototype Tangible Game for Inter-Generational Play
Authors: Dagmar Kern, Mark Stringer, Geraldine Fitzpatrick, Albrecht Schmidt
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Older people have been the focus of research for ubiquitous computing applications. While many of these are understandably focused on health and aging in place issues, there is also considerable opportunity to support more playful aspects of life as an older person. We report here on a prototype collaborative game that can be played between an older person and a child. The game is based on a bowling game and makes use of tangible devices, sensors and augmented reality components. We report on the iterative development of this inter-generational play prototype and initial user feedback.
A new approximation algorithm for obtaining the probability distribution function for project completion time
Authors: Ming-Jong Yao, Weng-Ming Chu
Venue: Computers Mathematics with Applications (2007)

This paper focuses on the application of the techniques of discretization to obtain an approximated probability density function (pdf) for the completion time of large-size projects, in which we allow any type of pdf for the duration of activities. In this study, we improve the techniques of discretization in the following two ways: first, we propose to replace the max operation with an approximation procedure to save significant computational loading; and second, to reduce the error from assuming independence between paths using a simple heuristic rule. To evaluate the performance of our proposed algorithm, we randomly generated 20 sets of 100-node instances in our numerical experiments. Taking the results from a Monte Carlo simulation using 20,000 samples as a benchmark, we demonstrate that the proposed algorithm significantly outperforms the PERT model and Dodin's [B.M. Dodin, Approximating the distribution function in stochastic networks, Comput. Oper. Res. 12 (3) (1985) 251-264] algorithm in both the running time and the precision aspects.
High-Speed Real-Time Simulation
Authors: Roy E. Crosbie
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Real-time simulation has been used since the early days of computer simulation. Current real-time operating systems can support real-time simulations with frame times as short as hundreds of microseconds. Some applications are now emerging that need shorter frame times, as low as 1 microsecond. New techniques are required for these high-speed real-time (HSRT) simulations. One approach is based on small arrays of digital signal processors. For complex systems it may be necessary to embed HSRT simulations in a larger real-time system using a multi-rate approach.
Invited Talk: Sketch Based Anomaly Detection, Identification and Performance Evaluation
Authors: Patrice Abry, Pierre Borgnat, Guillaume Dewaele
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

An anomaly detection procedure is defined and its statistical performance are carefully quantified. It is based on a non Gaussian modeling of the marginal distributions of random projections (sketches) of traffic aggregated jointly at different levels (multiresolution). To evaluate false negative vs. false positive in a controlled, reproducible and documented framework, we apply the detection procedure to traffic time-series from our self-made anomaly database. It is obtained by performing DDoS-type attacks, using real-world attack tools, over a real operational network. Also, we illustrate that combining sketches enables us to identify the target IP destination address and faulty packets hence opening the track to attack mitigation.
Narrative based Topic Visualization for Chronological Data
Authors: Mina AKAISHI, Yoshikiyo KATO, Ken SATOH, Koichi HORI
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper proposes several methods visualizing topics in documents. (i) Word Colony represents the dependency relationships among term occurrences in a target document. It helps users get an overview of a document. Using Word Colony with pictures gives users a more intuitive impression. (ii) Topic Sequence is a concatenation of Word Colonies for segmented documents. It shows plots as a story's topic transitions. (iii) Topic Matrix represents relations among topics based on latent contexts within a collection of documents. Several visualization techniques enable users to visualize topics in a document in different ways. It gives variations of viewpoint and triggers the creative imagination.
Digital Signal Types Identification Using a Hierarchical SVM-Based Classifier and Efficient Features
Authors: Ataollah Ebrahimzadeh, Seyed Alireza Seyedin
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Automatic digital signal type identification (ADSTI) is an important topic for both military and civilian communication applications. Most of proposed techniques (identifiers) can only recognize a few types of digital signal and usually need high levels of SNR. This paper presents a technique that includes a variety of digital signal types. In this technique a hierarchical support vector machine based structure is proposed for multi-class classification. Combination of higher order moments and higher order cumulants up to eighth are utilized as the effective features. Genetic algorithm is used to parameter selection in order to improve the performance of identifier. Simulation results show that proposed identifier has high performance even at low SNR values.
Comparison of GLR and maximal invariant detectors under structured clutter covariance
Authors: N. Nagai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

There has been considerable recent interest in applying maximal invariant (MI) hypothesis testing as an alternative to the generalized likelihood ratio (GLR) test. This interest has been motivated by several attractive theoretical properties of MI tests including: exact robustness to variation of nuisance parameters, finite-sample min-max optimality (in some cases), and distributional robustness. However, in the deep-hide target detection problem, there are regimes for which either of the MI and the GLR tests can outperform the other. We discuss conditions under which the MI tests can be expected to outperform the GLR tests in the context of a radar imaging and target detection application. We also show that the relative advantage of the MI tests is robust to boundary estimation errors.
The Mobile Business Value Chain in China
Authors: Yaobin Lu, Yuanyuan Dong, Bin Wang
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

China, a fast-growing developing country, has the largest number of mobile phone users all over the world, and its mobile business (m-business) is booming with the rapid development of mobile technologies. We propose a framework of m-business value chain in China, and analyze the participators of the value chain and their roles. Our results indicate that China's m-business value chain is different from those in developed countries. Furthermore, the results provide a foundation for future strategic analysis of the telecommunications industry in China. Drawing on technological factors that may influence the development of m-business, this study also discusses the future of m-business in China.
When is an object not an object?
Authors: Mark Roseman
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

This paper describes an approach to designing and building Tcl extensions that can be flexibly and dynamically changed using either Tcl or C. In particular, extensions having an object-based interface are considered. This extension approach seeks to avoid the "chasm" found in migrating code from Tcl to C as it matures by freely mixing Tcl and C to create an object's subcommands. The approach differs from traditional Tcl object frameworks in that it retains familiar mechanisms used to create new toplevel Tcl commands, and emphasizes extensions holding much of their data at the C level. A secondary goal is to illustrate how extension authors can encourage rich customization, by exposing object internals to change. To illustrate the technique, a simple data structure is extended to support sharing between multiple Tcl processes.
Access control models and security labelling
Authors: Chuchang Liu, Angela Billard, Maris Ozols, Nikifor Jeremic
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

Security labels convey information that is utilised to perform access control decisions, specify protective measures, and aid in the determination of additional handling restrictions required by security policies. In discussing security labelling, one of the most important aspects is to investigate access control models and obtain an appropriate technique for specifying the kind of security policies that are required. One problem with previous approaches to the specification of access control policies is that they are based on an idealisation of the real problem and give a first approximation: may or may not a subject access a given object? The binary, logical function is the essential starting point, but is generally insufficient to guide the hard decisions that are required by a variety of applications in the real world. Focusing on the issues regarding security labelling, this paper first proposes a technique for expressing need-to-know policies that are regarded as the basis for security labelling and should be followed in the labelling process. Then, based on the proposed lattice access control model dealing with both security levels and categories of objects, several security labelling principles are given. Finally, we propose a dynamic model for security labelling that not only provides support for dynamic labelling within a system but also a functional base for the design and implementation of a security labelling system.
Spectral features for Arabic word recognition
Authors: M. S. Khorsheed
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We present a holistic technique for recognising words written in cursive Arabic script that does not rely on character segmentation. Each word is transformed into a normalised polar image, and a two dimensional Fourier transform is applied to the polar image. The resultant spectrum tolerates variations in size, rotation or displacement. Each word is represented by a single template, and the recognition is based on the Euclidean distance from those templates. Words are written in four different Arabic type-faces, where ligatures and overlaps pose challenges to segmentation-based methods.