ppxscal/embedding_network huggingface dataset:
Quality Assessment Of System Architectures And Their Requirements (QUASAR)
Authors: Donald G. Firesmith, Peter S. Capell
Venue: Journal of Integrated Design Process Science (2007)

The quality of a software-intensive system is largely determined by the quality of its architecture and the quality of the architecturally significant requirements that drive its development. Unfortunately, although quality requirements typically have critical architectural ramifications, requirements engineers using such popular techniques as use case modelling tend to emphasize functional requirements over non-functional quality requirements, with the result that the quality requirements are often poorly specified or not specified at all. Similarly, system architects tend to emphasize a system's logical decomposition structure into major functions and subfunctions and the corresponding static physical decomposition structure into a hierarchy of subsystems. The system architects often do not adequately document how (or even if) these subsystems and subsubsystems collaborate to sufficiently support the achievement of their derived and allocated quality requirements. To address these two problem areas, the SEI QUality Assessment of software-intensive System Architectures and their Requirements (QUASAR) method was created to provide acquisition organizations with a proven and efficient means to determine if quality requirements have been properly engineered and if system architectures sufficiently meet these requirements.
Ispd2009 clock network synthesis contest
Authors: C. N. Sze, Phillip Restle, Gi-Joon Nam, Charles Alpert
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Clock network synthesis (CNS) is one of the most important design challenges in high performance synchronized VLSI designs. However, without appropriate problem examples and real-world objectives, research can become less relevant to industrial design flows. To address the need of the research community, we organize a clock network synthesis contest and a set of benchmark suite is released. Since the full-specification physical and electrical requirements of a leading-edge processor clock distribution would be cumbersome and impractical for this contest, we make the problem formulation familiar to the academia; that is to synthesize, buffer, and tune a clock distribution. However, the objective function has been modified to appropriately include the increasing importance of robustness to variation, in addition to the typical performance and power metrics. The paper briefly describes the ISPD clock network synthesis contest and the benchmark suite.
Blind spot
Authors: Eric Riewer
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

At Dona's small grocery store, a fussy store clerk is arranging canned foods, and a grandmother with poor eyesight is looking for an umbrella, while a clumsy robber enters the store. Soon all hell breaks loose, under the watchful eyes of the store's cameras.
Fuzzy Ant Colony Based Routing Protocol for Mobile Ad Hoc Network
Authors: M. M. Goswami, R. V. Dharaskar, V. M. Thakare
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Routing is a challenging task in Mobile AdHoc Network due to nodal mobility, unstable links and limited resources. Swarm intelligence, as demonstrated by biological swarm, such as ant colony has found to be a attractive technique for routing in MANET. However existing swarm intelligence based routing protocols find an optimal path by considering only one or two route selection metrics, such as hop count or time delay making them unsuitable for routing multimedia traffic or real time applications which require optimization of several QOS parameters. Also they don’t consider correlations among multiple route selectionparameters. This paper proposes a novel approach called fuzzy ant colony based routing protocol (FACO) using fuzzy logic and swarm intelligence to select optimal path by considering optimization of multiple objectives while retaining the advantages of swarm based intelligence algorithm. Simulation results show that the proposed protocol is superior over existing swarm intelligence based routing protocols for routing in MANET.
Conceptual modelling: knowledge acquisition and model abstraction
Authors: Kathy Kotiadis, Stewart Robinson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Conceptual modelling has gained a lot of interest in recent years and simulation modellers are particularly interested in understanding the processes involved in arriving at a conceptual model. This paper contributes to this understanding by discussing the artifacts of conceptual modelling and two specific conceptual modelling processes: knowledge acquisition and model abstraction. Knowledge acquisition is the process of finding out about the problem situation and arriving at a system description. Model abstraction refers to the simplifications made in moving from a system description to a conceptual model. Soft Systems Methodology has tools that can help a modeller with knowledge acquisition and model abstraction. These tools are drawing rich pictures, undertaking analyses 'one', 'two', 'three', and constructing a root definition and the corresponding purposeful activity model. The use of these tools is discussed with respect to a case study in health care.
Design and Implementation of a Network Supporting Environment for Virtual Experimental Platforms
Authors: Qi Cui, Wenchang Shi, Yu Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Traditional experimental platforms, which are built based on physical machines, have many disadvantages on diversity, security and repeatability. The development of virtual experimental platforms proposed a solution to this problem, but the construction of the network supporting environment remains a challenging task. This paper presents the design and implementation of a virtual network supporting environment called RuViseNet, which is originally designed to but not limited to support our virtualized experimental platform called RuVisen. Based on virtual machine technologies, RuViseNet achieves network virtualization in the data-link layer by way of capture, modification and forwarding of Ethernet packets. Meanwhile it designs and implements the operation of start/shutdown/save/load for virtual networks with an effective way of controlling virtual machine lifecycles, which provides support both for fast recovery and users' efficiency. The development of RuViseNet implements a good support of virtualized experimental platform for research and product testing.
Improving Personalization Solutions through Optimal Segmentation of Customer Bases
Authors: Tianyi Jiang, Alexander Tuzhilin
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more personalized products and services to them. Traditionally, customer segmentation is achieved using statistics-based methods that compute a set of statistics from the customer data and group customers into segments by applying distance-based clustering algorithms in the space of these statistics. In this paper, we present a direct grouping based approach to computing customer segments that groups customers in terms of optimally combining transactional data of several customers to build a predictive model of customer behavior for each group. We consider customer segmentation as a combinatorial optimization problem of finding the best partitioning of the customer base into disjoint groups and show that finding an optimal customer partition is NP-hard. We propose several suboptimal direct grouping segmentation methods, empirically compares them against traditional statistics-based hierarchical and affinity propagation based segmentation, and 1-to-1 methods across multiple experimental conditions. We show that the best direct grouping method builds mostly small sized customer segments and significantly dominates the statistics-based and 1-to-1 approaches across most of the experimental conditions, while still being computationally tractable.
Computer-assisted instruction in industry
Authors: Catherine P. Breen
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The newest training technology is Computer-Assisted Instruction---CAI as it will be referred to here. CAI is an abbreviation for Computer-assisted Instruction; that is, instruction prepared by a human teacher for presentation under computer control. Its primary aim is to optimize the learning process. 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
Cooperative fault-detection mechanism with high accuracy and bounded delay for underwater sensor networks
Authors: Pu Wang, Jun Zheng, Cheng Li
Venue: Wireless Communications Mobile Computing (2009)

This paper proposes a cooperative fault-detection mechanism for detecting cluster-head failures in cluster-based UnderWater Sensor Networks (UWSNs). The proposed detection mechanism aims to accurately and fast detect the failure of a cluster head in order to avoid unnecessary energy consumption caused by a mistaken detection. For this purpose, it allows each cluster member to independently detect the fault status of its cluster head and then employs a distributed agreement protocol to reach an agreement on the fault status of the cluster head among multiple cluster members. It runs concurrently with normal network operation by periodically performing a detection process at each cluster member. To reduce energy consumption, it uses a time division multiple access medium access control (TDMA MAC) protocol and makes use of the data periodically sent by a cluster head as the heartbeats for fault detection. A couple of forward and backward time-division-multiplexing (TDM) frames are specially structured for enabling multiple cluster members to reach an agreement within two frames in each detection process. Moreover, a schedule generation algorithm is also proposed for a cluster head to generate the transmission schedule in the forward and backward frames. Through simulation results, we show that the proposed detection mechanism can achieve high detection accuracy under high packet loss rates in the harsh underwater environment, and can detect a cluster-head failure faster than a traditional fault-detection mechanism within a delay bound of two TDM frames. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform
Authors: Moon Ho Lee, Yuri L. Borissov
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We propose a fast decoding algorithm for the p-ary first-order Reed-Muller code guaranteeing correction of up to ⌊n/4 sin(p-1/2p π)⌋ errors and having complexity proportional to n log n, where n = pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case.
Unsupervised type and token identification of idiomatic expressions
Authors: Afsaneh Fazly, Paul Cook, Suzanne Stevenson
Venue: Computational Linguistics (2009)

Idiomatic expressions are plentiful in everyday language, yet they remain mysterious, as it is not clear exactly how people learn and understand them. They are of special interest to linguists, psycholinguists, and lexicographers, mainly because of their syntactic and semantic idiosyncrasies as well as their unclear lexical status. Despite a great deal of research on the properties of idioms in the linguistics literature, there is not much agreement on which properties are characteristic of these expressions. Because of their peculiarities, idiomatic expressions have mostly been overlooked by researchers in computational linguistics. In this article, we look into the usefulness of some of the identified linguistic properties of idioms for their automatic recognition. Specifically, we develop statistical measures that each model a specific property of idiomatic expressions by looking at their actual usage patterns in text. We use these statistical measures in a type-based classification task where we automatically separate idiomatic expressions (expressions with a possible idiomatic interpretation) from similar-on-the-surface literal phrases (for which no idiomatic interpretation is possible). In addition, we use some of the measures in a token identification task where we distinguish idiomatic and literal usages of potentially idiomatic expressions in context.
An adaptive method for Volterra-Fredholm integral equations on the half line
Authors: A. Cardone, E. Messina, A. Vecchio
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper we develop a direct quadrature method for solving Volterra-Fredholm integral equations on an unbounded spatial domain. These problems, when related to some important physical and biological phenomena, are characterized by kernels that present variable peaks along space. The method we propose is adaptive in the sense that the number of spatial nodes of the quadrature formula varies with the position of the peaks. The convergence of the method is studied and its performances are illustrated by means of a few significative examples. The parallel algorithm which implements the method and its performances are described.
Routing connections with differentiated reliability requirements in WDM mesh networks
Authors: Hongbin Luo, Lemin Li, Hongfang Yu
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Reliability has been well recognized as an important design objective in the design of modern high-speed networks. While traditional approaches offer either 100% protection in the presence of single link failure or no protection at all, connections in real networks may have multiple reliability requirements. The concept of differentiated reliability (DiR) has been introduced in the literature to provide multiple reliability requirements in protection schemes that provision spare resources. In this paper, we consider the problem of routing connections with differentiated reliability in wavelength-division multiplexing (WDM) mesh networks when backup sharing is not allowed. Our objective is to route connections with minimum network cost (e.g., network resources) while meeting their required reliability. We assume connections arrive dynamically one-at-a-time and a decision as to accept or reject a connection has to be made without a priori knowledge of future arrivals. Since sharing cannot be used for achieving efficiency, the goal is to achieve efficiency by improved path selection. In this paper, we first present an integer linear programming (ILP) formulation for the problem. By solving the ILP formulation, we can obtain an optimal solution with respect to the current network state for each dynamic arrival. To solve the ILP formulation, however, is time consuming for large networks. We thus propose two approximation algorithms for the problem. The first one, called Shortest-Path-Pair-based Auxiliary graph (SPPA), can obtain an Ɛ-approximation solution whose cost is at most 1 + Ɛ times the optimum in O((n2(n + 1) + 2mn)(log log(2n) + 1/Ɛ))time, where n and m are the number of nodes and links in a network, respectively. To reduce the computational complexity of the first algorithm, the second algorithm, called Auxiliary graph-based Two-Step Approach (ATSA), is proposed and can obtain a near optimal solution with cost at most 2 + Ɛ times that of the optimal solution in O(mn(log log n+1/Ɛ)) time. Results from extensive simulations conducted on two typical carrier mesh networks show the efficiency of the two algorithms.
An Optimized Communication for Emergency Health Situations
Authors: Sandra Reichert, Raymond Gass, Amir Hajjam, Abderrafiaa Koukam, Emmanuel Andres
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Emergency situations require specific needs in particular in terms of communications, data transmission and sharing. Of particular concern are the transmissions of the patient’s medical history to the emergency physician, the transmission of medical streaming data collected by devices (ECG, stethoscope …) to the emergency services. This will make it possible to get real time second opinion from experts, but also to retrieve medical history of the patient, and to initiate a medical file with objective data as collected for that emergency. The relevance is to benefit from a second opinion in real time; the physician can remotely consult the patient’s medical history, or add new information. Protocols exist to transfer medical information. Thus, according to the state of the art, nowadays, we assist to the emergence of communication protocols adapted to medical domain: the Bluetooth device medical profile. Likewise, Dicom is a commonly format use to transfer medical data (images) on the network. Nevertheless, new needs appear that are not considered in the existing protocols. For instance, the case of the stethoscope or auscultation sounds has not been considered. So, we propose to use the existing protocols (Bluetooth medical device profile, Dicom) and to integrate these data that are not considered today. It should allow to homogenize the communications medium and better share auscultation sounds. The final aim will be the creation of the “School of Auscultation” whose goal is to reposition auscultation as a fundamental non invasive exam, thanks to the new technologies.
Daubechies wavelet beam and plate finite elements
Authors: Lilliam Alvarez Díaz, María T. Martín, Victoria Vampa
Venue: Finite Elements in Analysis and Design (2009)

In the last few years, wavelets analysis application has called the attention of researchers in a wide variety of practical problems, particularly for the numerical solutions of partial differential equations using different methods such as finite differences, semi-discrete techniques or finite element method. In some mathematical models in mechanics of continuous media, the solutions may have local singularities and it is necessary to approximate with interpolatory functions having good properties or capacities to efficiently localize those non-regular zones. Due to their excellent properties of orthogonality and minimum compact support, Daubechies wavelets can be useful and convenient, providing guaranty of convergence and accuracy of the approximation in a wide variety of situations. In this work, we show the feasibility of a hybrid scheme using Daubechies wavelet functions and the finite element method to obtain numerical solutions of some problems in structural mechanics. Following this scheme, the formulations of an Euler-Bernoulli beam element and a Mindlin-Reisner plate element are derived. The accuracy of this approach is investigated in some numerical test cases.
Money Shock in Dynamic Stochastic General Equilibrium Models
Authors: Liu Yang, Li Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Based on the China economy data 1996-2005, two issues are addressed in this paper. First, we examine the ability of the DSGE model to describe stylized facts about China economy. The model succeeds to replicate the variability observed in 1996-2005. Second, we compare two methods of motivating money in DSGE Model. Drawing on our econometric analysis, we argue that the cash-in-advance model, closed by a money growth rule, comes closer to the data.
D&eacute;monstration: HephaisTK, une bo&icirc;te &agrave; outils pour le prototypage d'interfaces multimodales
Authors: Bruno Dumas, Denis Lalanne, Rolf Ingold
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This article describes HephaisTK, a toolkit for prototyping multimodal interfaces. The article briefly presents the state of the art and the challenges before describing the architecture of the HephaisTK toolkit, along its description language. Finally, the article explains future works.
Edge searching weighted graphs
Authors: Öznur Yaşar, Danny Dyer, David A. Pike, Margo Kondratieva
Venue: Discrete Applied Mathematics (2009)

In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphs with arbitrary positive integer weights assigned to its edges. We give bounds on the weighted search number in terms of related graph parameters including pathwidth. We characterize the graphs for which two searchers are sufficient to clear all edges. We show that for every weighted graph the minimum number of searchers needed for a not-necessarily-monotonic weighted edge search strategy is enough for a monotonic weighted edge search strategy, where each edge is cleaned only once. This result proves the NP-completeness of the problem.
Adaptive wireless access solutions in transport environment
Authors: Tomas Zelinka, Miroslav Svitek
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

This paper presents new attitude to adaptive control of the multi-path and multi-technology technology wireless access communications solutions. Presented approach represents response on transport processes management requirements to provide complex seamless wireless communication services in the selection of different modes coverage and guaranteed quality. Such solutions are related to communications of the vehicle to infrastructure as well as vehicle to vehicle. Such communications networking must include the inter-vehicle communication interconnect, as well. CALM based system represent relevant data routing/switching with vertical RM OSI compatible communications architecture, however, with horizontal hierarchical management structure. Authentic decision processes within these access wireless communications CALM routing/switching structures are, however, in literature discusses quite rarely. Decision processes measurable i.e. precisely enumerated system requirements are quantified by the performance indicators. As result of application analysis the relevant performance indicators are demarcated into the acceptable tolerance ranges as the starting point for following processes. In this paper we apply decision processes based on Bayes statistics as "traditional" alternative to e.g. concept of Policy-based Management (PBM) traditionally and widely applied within the IP based networks. In proposed alternative measured data are processed by Kalman filters to separate reasonable part of noise and to predict individual parameters behavior in its near future. Than self-trained classification algorithm processes filtered measured data combined with deterministic parameters like the services economy, policy etc. Training data block represent parameters vectors time line extended by correct decisions, i.e. assignment to the appropriate class. Even though these tools are designed specifically for the multi-path communications system, such principles are open for future penetration into whole telematic system adaptive management.