ppxscal/embedding_network huggingface dataset:
Handling a Cooperative Design Context with an Interactive Graph Visualization
Authors: Gilles Halin
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

A collective activity generates a large quantity of various information which constitutes the "context". The comprehension of this context by each actor is essential for the success of the activity. The handling of this context with dedicated interface requires the definition of its data representation, but also its visualization representation in a human machine interface. We present here an interactive visualization graph based on a network representation of this context using a model approach. This visualization allows each actor to have simultaneously a global and local perception of the cooperative context and to handle it (navigate and modify) with adapted and intuitive functions. This approach has been implemented and experimented in the framework of an architectural design activity.
Organization Evaluation of Product Development Process Using Agent Based Simulation
Authors: Xiaodong Zhang, Zhiqiang Zhang, Le Luo, Shuangyue Duan
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In order to evaluate human and organization factors, an agent-based simulation approach is proposed, which simulates design process as a continuous interaction process of design agents and environment. Aiming at the characteristics of collaborative design work, the designer's agent model is constructed and collaboration process of the agent is described using Petri Nets. Simulation program is developed and experiments are conducted based on the agent model. The input parameters and evaluation criteria of the simulation are studied in detail. The elementary simulation result shows the accordance with the practical organization principles. The agent-based simulation provides a quantitative and dynamic method to evaluate and improve human and organization factors in collaborative product development process.
Image segmentation by a contrario simulation
Authors: Nicolas Burrus, Thierry M. Bernard, Jean-Michel Jolion
Venue: Pattern Recognition (2009)

Segmenting an image into homogeneous regions generally involves a decision criterion to establish whether two adjacent regions are similar. Decisions should be adaptive to get robust and accurate segmentation algorithms, avoid hazardous a priori and have a clear interpretation. We propose a decision process based on a contrario reasoning: two regions are meaningfully different if the probability of observing such a difference in pure noise is very low. Since the existing analytical methods are intractable in our case, we extend them to allow a mixed use of analytical computations and Monte-Carlo simulations. The resulting decision criterion is tested experimentally through a simple merging algorithm, which can be used as a post-filtering and validation step for existing segmentation methods.
Learning in games using the imprecise Dirichlet model
Authors: Erik Quaeghebeur, Gert de Cooman
Venue: International Journal of Approximate Reasoning (2009)

We propose a new learning model for finite strategic-form two-player games based on fictitious play and Walley's imprecise Dirichlet model [P. Walley, Inferences from multinomial data: learning about a bag of marbles, J. Roy. Statist. Soc. B 58 (1996) 3-57]. This model allows the initial beliefs of the players about their opponent's strategy choice to be near-vacuous or imprecise instead of being precisely defined. A similar generalization can be made as the one proposed by Fudenberg and Kreps [D. Fudenberg, D.M. Kreps, Learning mixed equilibria, Games Econ. Behav. 5 (1993) 320-367] for fictitious play, where assumptions about immediate behavior are replaced with assumptions about asymptotic behavior. We also obtain similar convergence results for this generalization: if there is convergence, it will be to an equilibrium.
Investigating Factors Influencing QoS of Internet Phone
Authors: Difu Su, Jaideep Srivastava, Jey-Hsin Yao
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

An increasing number of applications are using the Internet for voice transmission, and hence there is a growing demand for the Internet phone. However, the Internet was not originally designed for such isochronous traffic, and it is not clear that it is fully capable of providing the desired Quality of Service (QoS) for this application. In this paper we describe a number of QoS parameters to measure the perceptual quality audio, including measures of delay, rate, and loss. We investigate the factors influencing the QoS of Internet voice, such as packet period and packet size, threshold delay, buffer delay, time slots and Internet sites. We present results from our experiments on how these factors influence the QoS of Internet voice. Based on the results of our experiments, we propose a QoS driven dynamic scheduling algorithm for the real-time transmission of Internet voice packets.
On the optimality of field-line routing in massively dense wireless multi-hop networks
Authors: Esa Hyytiä, Jorma Virtamo
Venue: Performance Evaluation (2009)

We consider the load balancing problem in large wireless multi-hop networks by applying the continuum approximation. The task is to find routes, geometric curves, such that the maximal traffic load in the network is minimized. In finite fixed networks, multi-path routes generally yield a lower congestion and thus allow higher throughput. In contrast, we show that in dense wireless multi-hop networks, the optimal load balancing can be achieved by a destination based single-path routing referred to as field-line routing. This is because any routing can be transformed to the corresponding field-line routing with the same or better performance, by using as paths, the field lines of the so-called destination flow associated with the original routing. The concepts are illustrated with two examples. In the case of a unit disk with unit traffic, the maximal load of 0.389 of a multi-path routing system is reduced to 0.343 by using the field-line routing. Similar improvements are also demonstrated for the unit square.
Obstacle-avoiding rectilinear Steiner tree construction
Authors: Liang Li, Evangeline F. Y. Young
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

In today's VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important problem in the physical design stage of VLSI circuits. This problem has attracted a lot of attentions in research and several approaches have been proposed to solve this problem effectively. In this paper, we will present a heuristic maze routing based approach to solve this OARSMT problem. It is commonly believed that maze routing based approaches can only handle small scale problems and there is a lack of an effective multi-terminal variant to handle multi-pin nets in practice. We will show in this paper that maze routing based approaches can also handle large scale OARSMT problems effectively. Our approach is based on the searching process as in maze routing and can handle multi-pin nets very well in both solution quality, running time and memory space usage. We have compared our results with those of the previous works and can show that we can out-perform the best previous results on this problem [15] by giving an OARSMT with 2.01% less wire length on average and can make a 27.04% improvement in wire length in comparison with a lower bound of the optimal solution on average, while the running times are all very short and comparable to those in [15]. Besides, due to the flexibility of maze routing, we can handle different kinds of obstacles with different convex or concave rectilinear shapes directly without a need to partition each blockage into a set of rectangular sub-blockages, which will increase the size of the problem.
Engineering Computation: An Introduction Using MATLAB and Excel, 1 edition
Authors: Joseph Musto, William Howard, Richard Williams
Venue:  (2008)

The strength of Engineering Computation is its combination of the two most important computational programs in the engineering marketplace today, MATLAB® and Excel®. Engineering students will need to know how to use both programs to solve problems. While it is important to teach the mechanics of using the relevant tools, those tools can change so the focus of this text is on the fundamentals of engineering computing: algorithm development, selection of appropriate tools, documentation of solutions, and verification and interpretation of results.Table of contentsPART 1: COMPUTATIONAL TOOLSChapter 1: Computing ToolsChapter 2: Excel FundamentalsChapter 3: MATLAB FundamentalsChapter 4: MATLAB ProgrammingChapter 5: Plotting DataPART 2: ENGINEERING APPLICATIONSChapter 6: Finding the Roots of EquationsChapter 7: Matrix MathematicsChapter 8: Solving Simultaneous Equations Chapter 9: Numerical IntegrationChapter 10: Optimization
Playing, performing, reporting: a case study of mobile minimovies composed by teenage girls
Authors: Arto Puikkonen, Leena Ventä, Jonna Häkkilä, Jenine Beekhuyzen
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Digital camera functionality integrated into mobile phones is providing a new tool for users to create content, however user created mobile videos have so far remained a rather unexplored area. In this paper we present a study of 263 teenage girls who created and authored minimovies using the N73 mobile phone. In a semi-controlled setting, the participants produced 82 minimovies, analysed in this paper for their structure, style and feature usage. We compare across age groups, and discuss lessons learnt regarding the social nature of mobile content creation.
Facilitating adult mobile technology-based learning through problem solving
Authors: Kumar Laxman
Venue: International Journal of Mobile Learning and Organisation (2009)

The use of problem-based learning (PBL) within curriculum design has gained momentum in the recent few years due to the pervasive penetration of internet mobile technologies. Due to the power of using contextual problems anchored in real-life issues, PBL techniques have been increasingly adopted in many workplace-learning environments to improve the quality of training provided. In this article, the specific case study of an educational research organisation in Singapore that adopted a paradigm shift in its training methods by leveraging upon a flexible PBL design approach to its mobile and web technology supported knowledge portal training programme will be looked at.
GASA-Hop Localization Algorithm for Wireless Sensor Networks
Authors: Shijun Zhao, Meiling Sun, Zhaohui Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Wireless sensor networks are highly useful for many location-sensitive applications. The position of each node is assumed in most wireless sensor networks, which can make the sensed information meaningful. Finding position without GPS is important when GPS is not accessible or not practical to use. Typically, with the positions of only a few sensors predetermined, localization algorithms work for estimation of remaining sensor positions. DV-Hop is the most popular one. Intrinsically, localization is an optimization problem based on various distance/path measures. GA and SA are both widely used approaches toward optimization problems with certain strength and weakness. GASA which combines GA and SA can provide a more powerful optimization method. In this paper, we firstly propose GASA-Hop which uses GASA as a post-optimizer of DV-Hop to further improve the accuracy of its position estimation. Our simulation results reveal that GASA-Hop is effective.
Utilize 100% redundancy to offer higher-level multiple fault restoration in WDM networks without wavelength conversion
Authors: Chuan-Ching Sue, Jing-Ying Yeh
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

This study addresses the problem of achieving higher-level multi-fault restoration in wavelength division multiplexing (WDM) networks with no wavelength conversion capability. A heuristic scheme, designated as the Directional Cycle Decomposition Algorithm (DCDA), is developed to maximize the number of tolerable faults utilizing only 100% redundancy in WDM networks without wavelength conversion. The redundancy is calculated as the required spare capacity over the given working capacity. The process of identifying the maximum number of tolerable faults is modeled as a constrained ring cover set problem. DCDA decomposes this problem into three steps and has an overall computational complexity of O(|E||V|(C+1)+|E|(C2+1)), where |V|, |E| and C represent the number of vertices, the number of edges in the graph and the number of cycles in the cycle cover, respectively. The evaluation results reveal that the average number of tolerable simultaneous faults increases considerably under DCDA and the maximum number of tolerable simultaneous faults approaches the optimal solution provided by the brute-force method. DCDA facilitates an improved best-effort multi-fault restorability for a variety of planar and non-planar network topologies. An analytical method is proposed to facilitate a rapid estimation of the multi-fault restorability in a network using DCDA without the need for experimental evaluations. In addition, an approximation method is developed to obtain an estimate of the multi-fault restorability directly from DCDA without the requirement for a detailed knowledge of the network topology and restoration routes. The results show that the average errors in the approximated restorability values obtained using this method range from 0.12% (New Jersey) to 1.58% (Cost 239).
Multiuser transmitter OFDM using IP mobile in VPNs
Authors: M. C. Niculescu, Elena Niculescu, I. Resceanu
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

In this paper we try to present advantages of multiuser OFDM and a hardware implementation, this include adaptive frequency hopping, adaptive modulation, and multiple transmitter cells. An overview of several new which techniques improve the safety of system and the enlargement efficiency.
Assessing the quality, success, and utility of M&S research
Authors: Jeffrey S. Smith, John A. Drew Hamilton,  Jr., Richard E. Nance, Barry L. Nelson, George F. Riley, Lee W. Schruben
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents the "position papers" contributed by the participants of a panel at the 2008 Winter Simulation Conference. As the paper pre-dates the actual panel, the purpose of the paper is to provide some background information about the views of the individual panelists prior to the actual panel. Each panelist was asked to submit a position paper addressing the general question of "What makes good Modeling and Simulation research?" This paper presents a summary of these position papers along with an introduction and conclusion aimed at identifying the common themes to setup the conference panel.
On pseudo 2-factors
Authors: Siham Bekkai, Mekkia Kouider
Venue: Discrete Applied Mathematics (2009)

We show that a graph with minimum degree @d, independence number @a>=@d and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most @a-@d+1 edges or vertices.
Shaking Up the Cybersecurity Landscape
Authors: Brandi Ortega
Venue: IEEE Security and Privacy (2009)

A brief look at news in security, privacy, and policy.
Constraint-Level Advice for Shaving
Authors: Radoslaw Szymanek, Christophe Lecoutre
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

This work concentrates on improving the robustness of constraint solvers by increasing the propagation strength of constraint models in a declarative and automatic manner. Our objective is to efficiently identify and remove shavable values during search. A value is shavable if as soon as it is assigned to its associated variable an inconsistency can be detected, making it possible to refute it. We extend previous work on shaving by using different techniques to decide if a given value is an interesting candidate for the shaving process. More precisely, we exploit the semantics of (global) constraints to suggest values, and reuse both the successes and failures of shaving later in search to tune shaving further. We illustrate our approach with two important global constraints, namely alldifferent and sum, and present the results of an experimentation obtained for three problem classes. The experimental results are quite encouraging: we are able to significantly reduce the number of search nodes (even by more than two orders of magnitude), and improve the average execution time by one order of magnitude.
Hierarchical aggregation for efficient shape extraction
Authors: Chunxia Xiao, Hongbo Fu, Chiew-Lan Tai
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

This paper presents an efficient framework which supports both automatic and interactive shape extraction from surfaces. Unlike most of the existing hierarchical shape extraction methods, which are based on computationally expensive top-down algorithms, our framework employs a fast bottom-up hierarchical method with multiscale aggregation. We introduce a geometric similarity measure, which operates at multiple scales and guarantees that a hierarchy of high-level features are automatically found through local adaptive aggregation. We also show that the aggregation process allows easy incorporation of user-specified constraints, enabling users to interactively extract features of interest. Both our automatic and the interactive shape extraction methods do not require explicit connectivity information, and thus are applicable to unorganized point sets. Additionally, with the hierarchical feature representation, we design a simple and effective method to perform partial shape matching, allowing efficient search of self-similar features across the entire surface. Experiments show that our methods robustly extract visually meaningful features and are significantly faster than related methods.
New Sequences with Low Correlation and Large Family Size
Authors: Fanxin Zeng
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In direct-sequence code-division multiple-access (DS-CDMA) communication systems and direct-sequence ultra wideband (DS-UWB) radios, sequences with low correlation and large family size are important for reducing multiple access interference (MAI) and accepting more active users, respectively. In this paper, a new collection of families of sequences of length pn-1, which includes three constructions, is proposed. The maximum number of cyclically distinct families without GMW sequences in each construction is π(pn-1)/n · π(pm-1)/ m, where p is a prime number, n is an even number, and n = 2m, and these sequences can be binary or polyphase depending upon choice of the parameter p. In Construction I, there are pn distinct sequences within each family and the new sequences have at most d + 2 nontrivial periodic correlation {-pm-1, -1, pm-1,2pm-1,···,dpm-1}. In Construction II, the new sequences have large family size p2n and possibly take the nontrivial correlation values in {-pm-1, -1, pm-1, 2pm-1,···,(3d-4)pm-1}. In Construction III, the new sequences possess the largest family size p(d-1)n and have at most 2d correlation levels {-pm-1, -1, pm-1,2pm-1, ···,(2d-2)pm-1}. Three constructions are near-optimal with respect to the Welch bound because the values of their Welch-Ratios are moderate, WR ≐ d, WR ≐ 3d-4 and WR ≐ 2d-2, respectively. Each family in Constructions I, II and III contains a GMW sequence. In addition, Helleseth sequences and Niho sequences are special cases in Constructions I and III, and their restriction conditions to the integers m and n, pm ≠ 2 (mod 3) and n ≡ 0 (mod 4), respectively, are removed in our sequences. Our sequences in Construction III include the sequences with Niho type decimation 3 · 2m-2, too. Finally, some open questions are pointed out and an example that illustrates the performance of these sequences is given.
Computer-simulations of aspects of the diagnostic process
Authors: Max A. Woodbury, Richard Friedman, David Gustafson, Jonathan Clive, Max A. Woodbury
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This session discusses research related to study of the diagnostic process using computer-assisted methods, and from a perspective that is not necessarily disease-specific or decision oriented. Some of this research concerns itself with the detection of latent diagnostic and prognostic groups, as well as the study of diagnoses evaluated by physicians on computer-simulated patients.
The art of game-mastering pervasive games
Authors: Staffan Jonsson, Annika Waern
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Pervasive Games can benefit greatly from being game-mastered rather than fully automatic. However, game-mastering pervasive games is not a simple task neither from a technical nor a game design perspective. In this article we discuss some of the core issues for pervasive game mastering based on two example games. The first game was a long duration pervasive larp, where the core game activity was role-play. The second game is a pervasive game which relies extensively on technology installations, and where game mastering is used to create a coherent experience mixing technology-mediated gaming with live role-play events. Based on these rather different games we outline the core issues and methods available for pervasive game mastering.
A tunable holistic resiliency approach for high-performance computing systems
Authors: Stephen L. Scott, Christian Engelmann, Geoffroy R. Vallée, Thomas Naughton, Anand Tikotekar, George Ostrouchov, Chokchai Leangsuksun, Nichamon Naksinehaboon, Raja Nassar, Mihaela Paun, Frank Mueller, Chao Wang, Arun B. Nagarajan, Jyothish Varma
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

In order to address anticipated high failure rates, resiliency characteristics have become an urgent priority for next-generation extreme-scale high-performance computing (HPC) systems. This poster describes our past and ongoing efforts in novel fault resilience technologies for HPC. Presented work includes proactive fault resilience techniques, system and application reliability models and analyses, failure prediction, transparent process- and virtual-machine-level migration, and trade-off models for combining preemptive migration with checkpoint/restart. This poster summarizes our work and puts all individual technologies into context with a proposed holistic fault resilience framework.
The design and evaluation of an assistive multimodal interface
Authors: Philip Strain
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

A requirements capture carried out with thirty blind and visually impaired participants has outlined many issues visually impaired people face when accessing the Web using current assistive technology. One key finding was that spatial information is not conveyed to users. An assistive multimodal interface has been developed that conveys spatial information to users via speech, audio and haptics. Additionally, techniques for evaluating assistive technology with visually impaired participants are discussed.