ppxscal/embedding_network huggingface dataset:
A Scheme for Probabilistically Reliable Multicast Routing in Wireless Mesh Networks
Authors: Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Wireless mesh network (WMN) is a promising technology for deploying wireless infrastructure to provide wireless broadband access. High-speed wireless meshes will enable a whole new range of exciting broadcast/multicast applications, such as IP-TV and video-on-demand (VOD). There are some researches on multicast in WMNs. Ruiz et al. [3] study multicast tree in terms of minimizing the number of broadcast transmissions in WMNs utilizing the wireless multicast/broadcast advantage [4]. Chou et al. [1] studied minimizing broadcast latency using the multi-rate nature of radio. In [6], a Resilient Forwarding Mesh (RFM) approach is proposed for protecting multicast sessions from link or node failures by establishing a pair of node-disjoint paths for each multicast destination. Common assumption in all the above papers is the binary packet reception model. However, in the real wireless scenario, due to the nature of radio propagation and interference, the deterministic model such as binary packet reception is not realistic. In [2], the authors study some multicast metrics in wireless mesh networks, such as ETT, ETX, PP, METX and SPP. However, this paper does not take reliability into consideration.
Beyond secure channels
Authors: Yacine Gasmi, Ahmad-Reza Sadeghi, Patrick Stewin, Martin Unger, N. Asokan
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

A Trusted Channel is a secure communication channel which is cryptographically bound to the state of the hardware and software configurations of the endpoints. In this paper, we describe secure and flexible mechanisms to establish and maintain Trusted Channels which do not have the deficiencies of previous proposals. We also present a concrete implementation proposal based on Transport Layer Security (TLS) protocol, and Trusted Computing technology. We use Subject Key Attestation Evidence extensions to X.509v3 certificates to convey configuration information during key agreement (TLS handshake). The resulting session key is kept within the Trusted Computing Base, and is updated in a predetermined manner to reflect any detected change in the local configuration. This allows an endpoint to detect changes in the configuration of the peer endpoint while the Trusted Channel is in place, and to decide according to a local policy whether to maintain or tear down the Trusted Channel
The Reflexive Solutions for a Pair of Simultaneous Linear Matrix Equations
Authors: Fan-Liang Li, Xi-Yan Hu, Lei Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, the reflexive solutions of a pair of matrix equations (AX = B, XC = D) is discussed. By apply- ing special properties of reflexive matrices, we obtain the necessary and sufficient conditions for the existence of the solutions. We also derive a general form of the solutions. In addition, the unique optimal approximate solution is given by applying the properties of orthogonal projection matri- ces.
MSVM-RFE
Authors: Xin Zhou, David P. Tuck
Venue: Bioinformatics (2007)

Motivation: Given the thousands of genes and the small number of samples, gene selection has emerged as an important research problem in microarray data analysis. Support Vector Machine—Recursive Feature Elimination (SVM-RFE) is one of a group of recently described algorithms which represent the stat-of-the-art for gene selection. Just like SVM itself, SVM-RFE was originally designed to solve binary gene selection problems. Several groups have extended SVM-RFE to solve multiclass problems using one-versus-all techniques. However, the genes selected from one binary gene selection problem may reduce the classification performance in other binary problems. Results: In the present study, we propose a family of four extensions to SVM-RFE (called MSVM-RFE) to solve the multiclass gene selection problem, based on different frameworks of multiclass SVMs. By simultaneously considering all classes during the gene selection stages, our proposed extensions identify genes leading to more accurate classification. Contact: david.tuck@yale.edu Supplementary information: Supplementary materials, including a detailed review of both binary and multiclass SVMs, and complete experimental results, are available at Bioinformatics online.
Parallel Image Processing
Authors: C. D. Stamopoulos
Venue: IEEE Transactions on Computers (1975)

Parallel image processing shows certain general similarities to retinal processing and shares with optical computing the characteristics of parallelism. Simulation on digital serial computers (DSC's), although possible in the simpler cases, very soon becomes almost uncontrollable, requiring large memories and very long programming and execution times. Advances in present circuit technology now permit one to construct large arrays of interconnected parallel ogic elements resulting in real-time parallel machines where the action of a statement is simultaneous on all the points of the array. A typical processor of this kind is briefly described and an introduction to its code is given. Examples of symmetrical and directional functions and parallel algorithms are also presented. Possible applications of such processors in image processing, pattern recognition, and artificial intelligence are briefly discussed.
Utility Functions for Time-Sharing System Performance Evaluation
Authors: J. M. Grochow
Venue: Computer (1972)

As more and more economic activity shifts to service industries, meaningful evaluation of their "product" is Abecoming a topic of major concern. The service organization is constantly being evaluated by its customers and it is important for management to understand bases for this evaluation. In the case of the general purpose time-sharing system, there may in fact be several different groups of users with different desires and goals. The procedures illustrated below attempt to provide management and designers of future computer systems with a structured way
Crosstalk- and SEU-Aware Networks on Chips
Authors: Arthur Pereira Frantz, Maico Cassel, Fernanda Lima Kastensmidt, Érika Cota, Luigi Carro
Venue: IEEE Design Test (2007)

This article proposes the use of mixed hardware-software solutions to simultaneously address crosstalk faults and single-event upsets in on-chip networks. After analyzing the susceptibility of routers to these faults, the authors propose a software-based solution to deal with SEUs. But they show that the effect of crosstalk faults can be corrected only through hardware-based solutions. The authors then discuss four approaches that combine the use of hardware and software mitigation techniques to simultaneously deal with SEU and crosstalk effects in NoC routers. Experimental results show that the mixed hardware-software strategy is a cost-effective solution, even in high soft-error-rate environments.
Front Inside Cover [blank]
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The Large Hadron Collider (LHC) at CERN, the European Organization for Nuclear Research, needs to produce unprecedented volumes of data when it starts operation in 2007. To provide for its computational needs, the LHC computing grid (LCG) should be deployed as a worldwide computational grid service, providing the middleware upon which the physics analysis for the LHC can be carried out. In 2003, versions of this middleware were deployed which were based on the middleware produced by the European Data Grid project (EDG). In 2004 the LCG-2 release, which consisted of the EDG middleware with some minor modifications, was deployed for use by the LHC experiments. A series of data challenges by these experiments were the first real experiment production use of LCG. During the course of the data challenges, many issues and problems were exposed which had not shown up in more limited tests. The deployment, service and development teams worked closely with the experiments to understand these issues and while some of the problems were solved during the data challenges, others exposed fundamental problems with the middleware as deployed in LCG-2. One of these fundamental problems was the performance under real load of the catalog component provided by EDG, the replica location service. To solve these problems a new component was designed, the LCG file catalog (LFC). The LFC moves away from the replica location service model used in previous LCG releases, towards a hierarchical file system model which is more like a UNIX file system. It also adds missing functionality which was requested by the experiments. This paper presents the architecture and implementation of the LFC and evaluates it in a series of performance tests, with up to forty million entries and one hundred requesting threads from multiple clients. The results show good scalability up to the limits of these tests, and compare favourably with other grid catalog implementations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Are people biased in their use of search engines?
Authors: Mark T. Keane, Maeve O'Brien, Barry Smyth
Venue: Communications of the ACM (2008)

Assessing user search behavior when deciding which links to follow in rank-ordered results lists.
Occlusion analysis: Learning and utilising depth maps in object tracking
Authors: D. Greenhill, J. Renno, J. Orwell, G. A. Jones
Venue: Image and Vision Computing (2008)

Complex scenes such as underground stations and malls are composed of static occlusion structures such as walls, entrances, columns, turnstiles and barriers. Unless this occlusion landscape is made explicit such structures can defeat the process of tracking individuals through the scene. This paper describes a method of generating the probability density functions for the depth of the scene at each pixel from a training set of detected blobs, i.e., observations of detected moving people. As the results are necessarily noisy, a regularization process is employed to recover the most self-consistent scene depth structure. An occlusion reasoning framework is proposed to enable object tracking methodologies to make effective use of the recovered depth.
Automata theory, computer-aided design, and some problems of informatics
Authors: Yu. V. Kapitonova, A. A. Letichevsky
Venue: Cybernetics and Systems Analysis (2007)

The main stages of formation and development of automata theory and its applications to computer-aided design of computing systems are considered. Some open problems of modern theoretical cybernetics are discussed.
Evaluating a haptic-based virtual environment for venepuncture training
Authors: Shamus P. Smith, Susan Todd
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Simulated medical environments allow clinical staff to practice medical procedures for longer than traditional training methods without endangering patients. Haptic devices are a key technology in such systems but it is unclear how their usability can be evaluated. A user study has been performed with a commercial haptic-based medical virtual environment using data logging, user questionnaires and a modified think-aloud verbal protocol to support usability analysis. However, the evaluator does not share the haptic feedback with the participant and it was found that this can be problematic in shaping questions during an evaluation session and interpreting the collected data.
Parameter sensitivity in the probabilistic model for ad-hoc retrieval
Authors: Ben He, Iadh Ounis
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

The term frequency normalisation parameter sensitivity is an important issue in the probabilistic model for Information Retrieval. A high parameter sensitivity indicates that a slight change of the parameter value may considerably affect the retrieval performance. Therefore, a weighting model with a high parameter sensitivity is not robust enough to provide a consistent retrieval performance across different collections and queries. In this paper, we suggest that the parameter sensitivity is due to the fact that the query term weights are not adequate enough to allow informative query terms to differ from non-informative ones. We show that query term reweighing, which is part of the relevance feedback process, can be successfully used to reduce the parameter sensitivity. Experiments on five Text REtrieval Conference (TREC) collections show that the parameter sensitivity does remarkably decrease when query terms are reweighed.
Mutual Dependency of Distribution, Benefits and Causes: An Empirical Study
Authors: Dorina-C. Gumm
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Benefits of distributed software development are discussed controversially. What is perceived as benefit in one case, may be only partially realizable, a disadvantage or even a myth in another one. This paper is a report on the results of an empirical study about distributed requirements engineering practice. The identified benefits are discussed according to related interpedendencies which show the Janus-faced nature of benefits and challenges in distributed project settings.
Semantic web-based interoperability of distributed learner profile
Authors: Mourad Ouziri
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Personalized adaptive learning system aims to make efficient learning activity by considering the learner at the center of the system. Unfortunately, this system does not have complete learner profile because learners use multiple learning systems to perform learning. So, learner profile is fragmented over multiple heterogeneous learning systems. By using semantic web technology, naming Topic Maps, we show how we perform integration of heterogeneous fragments of learner profile in order to get coherent and complete one. So, adaptive learning system allows learner to perform more successful learning.
An Application of Dual-fuzzy Neural-networks to Design of Adaptive Fuzzy Controllers
Authors: Kai-jun Xu, Li Zou, Jia-jun Lai, Yang Xu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper presents a design method of adaptive fuzzy controllers using dual-fuzzy neural networks (DFNNs). For the convenience of adaptive control, the structure of the two-fuzzy neural-network controller is divided into two parts. Each part is a fuzzy neural-network (FNN). The adaptive controller uses two FNNs. One FNN is used to identify a fuzzy model of controlled object. The fuzzy control rule is designed with the linguistic rules of the fuzzy model and is incorporated into the other FNN. Simulations using a controlled object with an non-monotonic input-output characteristics are done to verify the proposed design method.
Behavioral modeling, simulation and synthesis of multi-standard wireless receivers in MATLAB/SIMULINK
Authors: A. Morgado, V. J. Rivas, R. del Río, R. Castro-López, F. V. Fernández, J. M. de la Rosa
Venue: Integration, the VLSI Journal (2008)

This paper presents a SIMULINK block set for the behavioral modeling and high-level simulation of RF receiver front-ends. The toolbox includes a library with the main RF circuit models that are needed to implement wireless receivers, namely: low noise amplifiers, mixers, oscillators, filters and programmable gain amplifiers. There is also a library including other blocks like the antenna, duplexer filter and switches, required to implement reconfigurable architectures. Behavioral models of building blocks include the main ideal functionality as well as the following non-idealities: thermal noise, characterized by the noise figure and the signal-to-noise ratio, and non-linearity, represented by the input-referred second-order and third-order intercept points, IIP"2 and IIP"3, respectively. In addition to these general parameters, some block-specific errors have also been included, like oscillator phase noise and mixer offset. These models have been incorporated into the SIMULINK environment making an extensive use of C-coded S-functions and reducing the number of library block elements. This approach reduces the simulation time while keeping high accuracy, which makes the proposed toolbox very appropriate to be combined with an optimizer for the automated high-level synthesis of radio receivers. As an application of the capabilities of the presented toolbox, a multi-standard direct-conversion receiver intended for 4G telecom systems is modeled and simulated considering the building block requirements for the different standards.
Video Biometrics
Authors: Rama Chellappa, Gaurav Aggarwal
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

A strong requirement to come up with secure and user- friendly ways to authenticate and identify people, to safe- guard their rights and interests, has probably been the main guiding force behind biometrics research. Though a vast amount of research has been done to recognize humans based on still images, the problem is still far from solved for unconstrained scenarios. This has led to an increased interest in using video for the task of biometric recognition. Not only does video provide more information, but also is more suitable for recognizing humans in general surveil- lance scenarios. Other than the multitude of still frames, video makes it possible to characterize biometrics based on inherent dynamics like gait which is not possible with still images. In this paper, we describe several recent algorithms to illustrate the usefulness of videos to identify humans. A brief discussion on remaining challenges is also included.
Adaptive quality of service management for enterprise services
Authors: Daniel Gmach, Stefan Krompass, Andreas Scholz, Martin Wimmer, Alfons Kemper
Venue: ACM Transactions on the Web (TWEB) (2008)

In the past, enterprise resource planning systems were designed as monolithic software systems running on centralized mainframes. Today, these systems are (re-)designed as a repository of enterprise services that are distributed throughout the available computing infrastructure. These service oriented architectures (SOAs) require advanced automatic and adaptive management concepts in order to achieve a high quality of service level in terms of, for example, availability, responsiveness, and throughput. The adaptive management has to allocate service instances to computing resources, adapt the resource allocation to unforeseen load fluctuations, and intelligently schedule individual requests to guarantee negotiated service level agreements (SLAs). Our AutoGlobe platform provides such a comprehensive adaptive service management comprising &mdash;static service-to-server allocation based on automatically detected service utilization patterns, &mdash;adaptive service management based on a fuzzy controller that remedies exceptional situations by automatically initiating, for example, service migration, service replication (scale-out), and &mdash;adaptive scheduling of individual service requests that prioritizes requests depending on the current degree of service level conformance. All three complementary control components are described in detail, and their effectiveness is analyzed by means of realistic business application scenarios.
Relationship of Poisson Transform to Laguerre Expansions
Authors: L. P. Bolgiano, M. J. Piovoso
Venue: IEEE Transactions on Computers (1969)

Sequences with properties which make them attractive discrete-time signals for simulating analog signals are generated by the Poisson transform. It is shown that a finite number of Poisson transform sequence elements gives a signal representation equivalent to a best mean square representation with either Laguerre polynomials or functions.
Online Learning of Multiple Tasks with a Shared Loss
Authors: Ofer Dekel, Philip M. Long, Yoram Singer
Venue: The Journal of Machine Learning Research (2007)

We study the problem of learning multiple tasks in parallel within the online learning framework. On each online round, the algorithm receives an instance for each of the parallel tasks and responds by predicting the label of each instance. We consider the case where the predictions made on each round all contribute toward a common goal. The relationship between the various tasks is defined by a global loss function, which evaluates the overall quality of the multiple predictions made on each round. Specifically, each individual prediction is associated with its own loss value, and then these multiple loss values are combined into a single number using the global loss function. We focus on the case where the global loss function belongs to the family of absolute norms, and present several online learning algorithms for the induced problem. We prove worst-case relative loss bounds for all of our algorithms, and demonstrate the effectiveness of our approach on a large-scale multiclass-multilabel text categorization problem.
Threshold Logic Asymptotes
Authors: R. O. Winder
Venue: IEEE Transactions on Computers (1970)

Let Rnmbe the number of linearly separable n-argument functions specified on some m points of the n-cube. Let R¯nmand R_nmbe, respectively, the minimum and maximum values attained over all choices of the m points. It is known that R¯nmn/n!. 1) Two published ""simplifications"" of the argument which establish this upper bound are shown to be fallacious. 2) It is proved that R_nm=4m(lg m-1)/2. 3) It is proved that if m is less than exponential in n, then as n?8, R¯nm(m/n)n + lower order terms. 4) Let Lnmbe the maximum number of threshold gates needed to realize an arbitrary n-argument switching function specified on m points. It is shown that Lnm?2(m/lg m)1/2.
Seeing is believing: designing visualizations for managing risk and compliance
Authors: R. K. E. Bellamy, T. Erickson, B. Fuller, W. A. Kellogg, R. Rosenbaum, J. C. Thomas, T. Vetting Wolf
Venue: IBM Systems Journal (2007)

This paper explores the design of visualizations that support mandated organizational compliance processes. We draw on the research literature to show how visualizations can operate as effective user interfaces for complex, distributed processes. We argue that visualizations can reduce the complexity of such processes, making them easier to manage, and can facilitate the communication and collaboration that are critical to supporting compliance. We describe the design and pilot deployment of a visualization that supports the IBM Sarbanes-Oxley Act compliance process, discussing design alternatives, the final design, its deployment, and lessons learned.