ppxscal/embedding_network huggingface dataset:
Upper bounds on the k-domination number and the k-Roman domination number
Authors: Adriana Hansberg, Lutz Volkmann
Venue: Discrete Applied Mathematics (2009)

Let G be a graph and let k be a positive integer. A subset D of the vertex set of G is a k-dominating set if every vertex not in D has at least k neighbors in D. The k-domination number@c"k(G) is the minimum cardinality among the k-dominating sets of G. A Romank-dominating function on G is a function f:V(G)@?{0,1,2} such that every vertex u for which f(u)=0 is adjacent to at least k vertices v"1,v"2,...,v"k with f(v"i)=2 for i=1,2,...,k. The weight of a Roman k-dominating function is the value f(V(G))=@?"v"@?"V"("G")f(v). The minimum weight of a Roman k-dominating function on a graph G is called the Romank-domination number@c"k"R(G). In 2007, Rautenbach and Volkmann [D. Rautenbach, L. Volkmann, New bounds on the k-domination number and the k-tuple domination number, Appl. Math. Lett. 20 (2007) 98-102] gave an upper bound for the k-domination number @c"k(G). Using again the probabilistic method, we achieve better bounds for this parameter and prove new bounds for the k-Roman domination number @c"k"R(G). Moreover, we generalize known inequalities for the case k=1 [V.I. Arnautov, Estimations of the external stability number of a graph by means of the minimal degree of vertices, Prikl. Mat. Programm. 11 (1974) 3-8 (in Russian); C. Payan, Sur le nombre d'absorption d'un graphe simple, Cahiers Centre Etudes Recherche Oper. 17 (1975) 307-317; E.J. Cockayne, P.A. Dreyer Jr., S.M. Hedetniemi, S.T. Hedetniemi, Roman domination in graphs, Discrete Math. 278 (2004) 11-22].
Reliable multicast tree construction algorithm
Authors: Choonsung Rhee, Jungwook Song, Euijun Kim, Sunyoung Han
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Analysis problem of the existing TMTP and RMTP based on tree in order to efficiently provide reliable multicast, and proposed architecture extended to solve problems grasped. The architecture which is proposed can minimize implosion and exposure, and decreases delay time by tree reconstruction as partial tree reconstruction. We used early OMNet++ simulator, and simulation did the environment which various, and was complicated to demonstrate effectiveness of the architecture which proposed, and provided reliability-based the existing tree.
Topology Preserving Constrained Graph Layout
Authors: Tim Dwyer, Kim Marriott, Michael Wybrow
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Constrained graph layout is a recent generalisation of force-directed graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.
The anatomy study of high performance task scheduling algorithm for Grid computing system
Authors: L. Y. Tseng, Y. H. Chin, S. C. Wang
Venue: Computer Standards Interfaces (2009)

Large-scale computation is frequently limited to the performance of computer hardware or associated cost. However, as the development of information and network technologies thrives, idle computers all over the world can be utilized and organized to enhance overall computation performance; that is, Grid environments that facilitate distributed computation. Hence, the dispatching and scheduling of tasks should be considered as an important issue. Previous studies have demonstrated Grid environments that are composed of idled computers around the globe and are categorized as a type of Heterogeneous Computing (HC). However, scheduling heuristics currently applied to HC focus on the search of minimum makespan, instead of the reduction of cost. In addition, relevant studies usually presume that HC is based on high-speed bandwidth and the communication time is ignored. Further, in response to the call for user-pay policy, as a user dispatches a job to a Grid environment for computation, each execution task would be charged. It is difficult to estimate a job will be dispatched to which and how many computers; it is impossible to predetermine scheduling heuristic which is proposed in previous studies will result in the optimal makespan, and mention actual cost and risk. Therefore, this study proposes ATCS-MCT (Apparent Tardiness Cost Setups-Minimum Completion Time) scheduling algorithm that composes of execution time, weight, due date, and communication time factors to testify that the ATCS-MCT scheduling algorithm not only achieves better makespan than Min-min scheduling heuristics do but also reduces costs.
A New Feature Detection Mechanism and Its Application in Secured ECG Transmission with Noise Masking
Authors: Fahim Sufi, Ibrahim Khalil
Venue: Journal of Medical Systems (2009)

With cardiovascular disease as the number one killer of modern era, Electrocardiogram (ECG) is collected, stored and transmitted in greater frequency than ever before. However, in reality, ECG is rarely transmitted and stored in a secured manner. Recent research shows that eavesdropper can reveal the identity and cardiovascular condition from an intercepted ECG. Therefore, ECG data must be anonymized before transmission over the network and also stored as such in medical repositories. To achieve this, first of all, this paper presents a new ECG feature detection mechanism, which was compared against existing cross correlation (CC) based template matching algorithms. Two types of CC methods were used for comparison. Compared to the CC based approaches, which had 40% and 53% misclassification rates, the proposed detection algorithm did not perform any single misclassification. Secondly, a new ECG obfuscation method was designed and implemented on 15 subjects using added noises corresponding to each of the ECG features. This obfuscated ECG can be freely distributed over the internet without the necessity of encryption, since the original features needed to identify personal information of the patient remain concealed. Only authorized personnel possessing a secret key will be able to reconstruct the original ECG from the obfuscated ECG. Distribution of the key is extremely efficient and fast due to small size (only 0.04---0.09% of the original ECG file). Moreover, if the obfuscated ECG reaches to the wrong hand (hacker), it would appear as regular ECG without encryption. Therefore, traditional decryption techniques including powerful brute force attack are useless against this obfuscation.
Architectural styles for opportunistic mobile communication: requirements and design patterns
Authors: Davy Preuveneers, Ansar-Ul-Haque Yasar, Yolande Berbers
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Mobile computing has been in the research epicenter for several decades. We have seen drastic shifts with mobile computing systems and wireless ad hoc networks dynamically adapting to create co-operating nodes that provide the right services at the right time. One aspect of such systems that has been poorly addressed is the complexity of developing applications for mobile users that require group interactions in large scale networks, especially between people unfamiliar with one another but with similar goals. Such systems need to know the type of social interaction, the context of all participants and nodes in the network, and a proper architectural design to implement scalability up to city wide networks. In this paper, we analyze which architectural styles and design patterns are the best suited the implement the various interaction requirements. We address scalability for interactions in large-scale networks from a software architectural perspective and focus on event-driven service oriented architectures to make the design of context-aware systems for large-scale mobile interactions a less complex task.
STARAN parallel processor system software
Authors: Edward W. Davis
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This paper is concerned with the features and concepts of system software for a parallel associative array processor---STARAN. Definitions of parallel processors have appeared often. Essentially they are machines with a large number of processing elements. They have the capability to operate on multiple data streams with a single instruction stream. STARAN is a line of parallel processors with a variable number of processing elements.
Study on Current Control Strategy for Two-Stage Matrix Converter (TSMC) Fed Induction Motor Using Complex Vectors
Authors: Zhiyong Chen, Wenlang Deng
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

In view of the dependence on non-linear parameters of induction motor leading to poor decoupling in conventional vector control, the current control strategy of TSMC fed induction motor using complex vectors is proposed. And mathematic models using complex vectors on TSMC and induction motor are derived and simplified. Then the use of complex vectors root locus figures out complex PI current regulator to solve limitation which serious degradation is apparent as the synchronous frequency increases and to reduce the dependence on motor’s parameters for decoupling control system. Finally, simulation study is carried out for proposed strategy. And results indicate that TSMC have the capacity to supply high quality power and the proposed strategy sharply promotes dynamic and steady state performances of control.
Choosing Leaders for Multi-objective PSO Algorithms Using Differential Evolution
Authors: Upali Wickramasinghe, Xiaodong Li
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The fast convergence of particle swarm algorithms can become a downside in multi-objective optimization problems when there are many local optimal fronts. In such a situation a multi-objective particle swarm algorithm may get stuck to a local Pareto optimal front. In this paper we propose a new approach in selecting leaders for the particles to follow, which in-turn will guide the algorithm towards the Pareto optimal front. The proposed algorithm uses a Differential Evolution operator to create the leaders. These leaders can successfully guide the other particles towards the Pareto optimal front for various types of test problems. This simple yet robust algorithm is effective compared with existing multi-objective particle swarm algorithms.
Introducing API design principles in CS2
Authors: Jaime Niño
Venue: Journal of Computing Sciences in Colleges (2009)

CS2 provides a great opportunity to teach an initial set of best practices and patterns that provide students with a strong foundation for later use in the development of APIs. The best-practices presented guide the student in the specification, implementation and testing of units whose clients will be other programmers.
Finite elements with embedded branching
Authors: C. Linder, F. Armero
Venue: Finite Elements in Analysis and Design (2009)

This paper is concerned with the numerical modeling of crack branching in brittle materials using finite elements with embedded strong discontinuities, that is, discontinuities in the displacement field defining the solution of the underlying boundary-value problem. In particular, new finite elements are developed in this framework accommodating the different branches of the bifurcating discontinuity in the element interior. The key aspect of these developments is the correct representation of the kinematics of these configurations. This is accomplished through the identification of the proper separation modes characterizing these solutions and their incorporation in the discrete strain field of the finite element. The resulting enhanced modes are activated based on a branching criterion depending on the velocity of the crack tip. The performance of the new elements is illustrated with several numerical simulations involving other approaches for the treatment of branching and comparisons with available experimental results.
Yubikey
Authors: Dirk Merkel
Venue: Linux Journal (2009)

Learn how to increase system and on-line security.
Analysis of the Linear GSIC Multiuser Detector Using a Matrix Iterative Approach
Authors: A. Bentrcia, A. Zerguine
Venue: Wireless Personal Communications: An International Journal (2009)

In this work, we use a new approach that relies on the theory of matrix iterative analysis to study the convergence behavior of the linear group-wise successive interference cancellation (GSIC) detector. Particularly, we show that the linear GSIC detector is in fact a realization of a modified block successive over-relaxation (BSOR) iterative method where the relaxation factor is a matrix instead of scalar. Consequently, to study the convergence behavior of the GSIC detector, we propose two new corollaries that extend the famous work of Kahan (Varga, Matrix iterative analysis, 2000) to the case where the relaxation factor is a matrix instead of a scalar. Using the two new corollaries we develop two new conditions of convergence for the linear GSIC detector. Simulation results are in excellent agreement with theory.
Algorithmic Meta Theorems
Authors: Martin Grohe
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined in terms of logic and graph theory. An archetypal algorithmic meta theorem is Courcelle's Theorem [1], which states that all graph properties definable in monadic second-order logic can be decided in linear time on graphs of bounded tree width. More recent examples of such meta theorems state that all first-order definable properties of planar graphs can be decided in linear time [2] and that all first-order definable optimisation problems on classes of graphs with excluded minors can be approximated in polynomial time to any given approximation ratio [3].In my talk, I gave an overview of algorithmic meta theorems and the main techniques used in their proofs. Reference [4] is a comprehensive survey of the material.
Automatic linearization of nonlinear skinning
Authors: Ladislav Kavan, Steven Collins, Carol O'Sullivan
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Linear blending is a very popular skinning technique for virtual characters, even though it does not always generate realistic deformations. Recently, nonlinear blending techniques (such as dual quaternions) have been proposed in order to improve upon the deformation quality of linear skinning. The trade-off consists of the increased vertex deformation time and the necessity to redesign parts of the 3D engine. In this paper, we demonstrate that any nonlinear skinning technique can be approximated to an arbitrary degree of accuracy by linear skinning, using just a few samples of the nonlinear blending function (virtual bones). We propose an algorithm to compute this linear approximation in an automatic fashion, requiring little or no interaction with the user. This enables us to retain linear skinning at the core of our 3D engine without compromising the visual quality or character setup costs.
Network Management Framework Based on Active Network Technique
Authors: Hang Qiu, Lei-Ting Chen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The Active Networks approach has been presented as an alternative technology for solving several problems in conventional networks, mainly in the network management area. In this paper, we present an Active Network-based network management framework which shows the advantages of network programmability. It is designed to actively manage both traditional and active networks, and be incrementally deployed in existing networks. We explain the design and implementation of active node, discuss the Code Distribution Scheme which is based on mobile code, demand loading, and caching techniques. We also explore the general management scheme of this framework.
Incorporating animation technologies into tools for colonial American education
Authors: Christopher P. Redmann
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

This paper will describe the integration of animation and visual effects technologies into the development of tools geared for colonial American education. Projects discussed will include the incorporation of crowd simulation software and full body motion capture to recreate Revolutionary War battles, laser scan acquisition of excavated archaeological artifacts, and recreation of historic structures through the use of modeling and animation software. Through the use of these technologies, the margin of error in representation can be lessened, and the level of realism for the enduser can be accentuated. Also, by utilizing these tool sets, it may be possible to create a more engaging educational presentation for schoolchildren. Current coursework for Colonial American education is consistent with teaching methods developed during the middle of the last century, relying on limited visual information to illustrate points. Through a series of projects, a number of digital assets were created to reinforce crucial points in the lesson. The first of these involved a recreation of a colonial era structure, the James and Ann Whitall House, a Quaker plantation built in 1748. Adjacent to the house was Fort Mercer, where the Battle of Red Bank was fought during the American Revolutionary War. This was also reconstructed digitally, and crowd simulations were developed using Massive Prime and motion capture data from our Vicon MX3 system to recreate possible battle scenarios. Another element of the battle was the waterfront, including the destruction of the H.M.S. Augusta; the ship was recreated to detailed specifications, utilizing dynamic simulations for both the water and the riggings. In addition to the course-work, much of the information was converted to web friendly formats for distribution on the Whitall House website
Bayesian models of eye movement selection with retinotopic maps
Authors: Francis Colas, Fabien Flacher, Thomas Tanner, Pierre Bessi&#x00e8;re, Beno&#x00ee;t Girard
Venue: Biological Cybernetics (2009)

Among the various possible criteria guiding eye movement selection, we investigate the role of position uncertainty in the peripheral visual field. In particular, we suggest that, in everyday life situations of object tracking, eye movement selection probably includes a principle of reduction of uncertainty. To evaluate this hypothesis, we confront the movement predictions of computational models with human results from a psychophysical task. This task is a freely moving eye version of the multiple object tracking task, where the eye movements may be used to compensate for low peripheral resolution. We design several Bayesian models of eye movement selection with increasing complexity, whose layered structures are inspired by the neurobiology of the brain areas implied in this process. Finally, we compare the relative performances of these models with regard to the prediction of the recorded human movements, and show the advantage of taking explicitly into account uncertainty for the prediction of eye movements.
Signpost from the masses: learning effects in an exploratory social tag search browser
Authors: Yvonne Kammerer, Rowan Nairn, Peter Pirolli, Ed H. Chi
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Social tagging arose out of the need to organize found content that is worth revisiting. A significant side effect has been the use of social tagging sites as navigational signposts for interesting content. The collective behavior of users who tagged contents seems to offer a good basis for exploratory search interfaces, even for users who are not using social bookmarking sites. In this paper, we present the design of a tag-based exploratory system and detail an experiment in understanding its effectiveness. The tag-based search system allows users to utilize relevance feedback on tags to indicate their interest in various topics, enabling rapid exploration of the topic space. The experiment shows that the system seems to provide a kind of scaffold for users to learn new topics.
It's the thought that counts: content vs. contact
Authors: Hanif Baharin, Romiza Md. Nor, Ralf Mühlberger
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

We are currently exploring two domains where the introduction of content gathering technologies is having a negative impact on social contact, particularly telecare technologies on independent living and sensor technologies on remote regional workers. To minimise the incidental cost of such interventions we are investigating enhanced design options that include contact, in the form of presence/awareness, as secondary functionality of these technologies. In this paper we classify a sample of presence technologies from the home environments using a model of presence, based on the concept of content and contact. Content is discussed in terms of the communication bandwidth while contact is viewed from the attention requirement of both initiator and receiver. Issues and successes of each category are highlighted, and we conclude with a contact focused interaction pattern that relates to, but is not driven by, content.
EMail Legal Issues 2008
Authors: Susan Singleton
Venue: Thorogood Reports (2008)

This updated report from IT/ecommerce legal expert Susan Singleton focuses on the employment issue of email and Internet use in the officearguably the most important and universally applicable part of English Internet law.
3D Multimedia Data Search System Based on Stochastic ARG Matching Method
Authors: Naoto Nakamura, Shigeru Takano, Yoshihiro Okada
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

This paper treats a 3D multimedia data retrieval system based on a stochastic Attributed Relational Graph (ARG) matching method. ARG can be used to represent the structural feature of data, so using ARG as feature representation of 3D multimedia data, it is possible to accurately retrieve the user required data similar to his/her query in terms of its component structure. In this paper, the authors propose a 3D multimedia data search system consisting of an image/video-scene search system, a 3D model search system and a motion data search system. Each search system works commonly with a stochastic ARG matching engine. Experimental results show that the proposed system can effectively retrieve 3D multimedia data similar to the user's query in terms of component structure of the data. Especially, its 3D model search system and motion search system have better experimental results than that of other search systems.