ppxscal/embedding_network huggingface dataset:
The embedded panopticon: visibility issues of remote diagnostics surveillance
Authors: Katrin Jonsson
Venue: Scandinavian Journal of Information Systems (2006)

Remote diagnostics technology is embedded into physical products in order to prevent breakdowns by monitoring the products' condition via sensors. However, this technology also hides indirect possibilities to monitor the users. The aim of this paper is to explore how remote diagnostics technology changes surveillance and its ethical consequences by studying which surveillance dilemmas users and suppliers identify in remote diagnostics technology and the rationale behind their perspectives. The results show how visibility and non-visibility are of decisive importance concerning whether or not users can examine ethical dilemmas in computer use as visibility seems to be what triggers employees' feelings of being monitored or not. Despite their monitoring possibilities, remote diagnostics systems do not seem to evoke such feelings. By embedding technology and thereby also the monitoring into physical things, both the technology and the cues of surveillance become concealed, both literally and virtually for the user. To the user the direct reminders of surveillance are thus embedded together with the technology, creating an embedded panopticon. As the users cannot examine possible ethical dilemmas the responsibility remains with the suppliers and challenges them to pick a strategy for how to handle ethical questions.
Partitioned Matrix Algorithms for VLSI Arithmetic Systems
Authors: Kai Hwang
Venue: IEEE Transactions on Computers (1982)

A new class of partitioned matrix algorithms is developed for possible VLSI implementation of large-scale matrix solvers. Fast matrix solvers are higherly demanded in signal/image processing and in many real-time and scientific applications. Only a few functional types of VLSI arithmetic chips are needed for submatrix computations after partitioning. This partitioned approach is not restricted by problem sizes and thus can be applied to solve arbitrarily large linear systems of equations in an iterative fashion. The following four matrix computations are shown systematically partitionable into submatrix operations, which are feasible for direct VLSI implementation.
Local and global handovers based on in-band signaling in wireless ATM networks
Authors: M. Ajmone Marsan, C. F. Chiasserini, A. Fumagalli, R. Lo Cigno, M. Munafò
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

This paper illustrates a protocol for wireless ATM networks which makes use of in-band signaling, i.e., of ATM resource management cells, to process network handovers and guarantee the in-sequence and loss-free delivery of the ATM cells containing user data. The proposed approach aims at minimizing the necessary modifications of the ATM signaling standard required to superimpose user mobility onto the fixed network infrastructure, and provides for a gradual upgrade of the fixed network to handle mobility. The proposed protocol handles both local handovers, in which the connection access point needs not migrate to a new ATM local exchange, and global handovers, in which the connection access point must migrate to a new local exchange. The maximum buffering capacity necessary at the base station to guarantee in-sequence and loss-free cell delivery is estimated using a simple model that is studied by means of an ATM network simulation tool.
Grasping Society's Treasure Trove of Information
Authors: Ian H. Witten
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

Search engines -- "web dragons" -- are the portals through which we access society's treasure trove of information. This talk takes a critical look at how they work and the role they play in today's society, touching on social issues such as web spam, privacy, and the difference between the dragons' motivation and ours.
Interacting sequential Monte Carlo samplers for trans-dimensional simulation
Authors: Ajay Jasra, Arnaud Doucet, David A. Stephens, Christopher C. Holmes
Venue: Computational Statistics Data Analysis (2008)

The methodology of interacting sequential Monte Carlo (SMC) samplers is introduced. SMC samplers are methods for sampling from a sequence of densities on a common measurable space using a combination of Markov chain Monte Carlo (MCMC) and sequential importance sampling/resampling (SIR) methodology. One of the main problems with SMC samplers when simulating from trans-dimensional, multimodal static targets is that transition kernels do not mix which leads to low particle diversity. In such situations poor Monte Carlo estimates may be derived. To deal with this problem an interacting SMC approach for static inference is introduced. The method proceeds by running SMC samplers in parallel on, initially, different regions of the state space and then moving the corresponding samples onto the entire state space. Once the samplers reach a common space the samplers are combined and allowed to interact. The method is intended to increase the diversity of the population of samples. It is established that interacting SMC admit a Feynman-Kac representation; this provides a framework for the convergence results that are developed. In addition, the methodology is demonstrated on a trans-dimensional inference problem in Bayesian mixture modelling and also, using adaptive methods, a mixture modelling problem in population genetics.
A framework for analyzing probabilistic protocols and its application to the Partial Secrets Exchange
Authors: Konstantinos Chatzikokolakis, Catuscia Palamidessi
Venue: Theoretical Computer Science (2007)

We propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties. In order to express and verify the correctness of the protocols, we develop a probabilistic version of the testing semantics. We then illustrate these concepts on an extended example: the Partial Secret Exchange, a protocol which uses a randomized primitive, the Oblivious Transfer, to achieve fairness of information exchange between two parties.
How do we train today's students to become tomorrow's engineers?
Authors: Scott Davidson
Venue: IEEE Design Test (2007)

Tomorrow's engineers will need to be familiar with a wide range of fields, necessitated by rapid advances in technology that span several areas of expertise. This will be even more true for CAD engineers. Just as CAD tool suites of the future will have to integrate physics, optics, mechanical engineering, statistics, and perhaps biology, the design team of the future must include people who understand all those things. The universities of today should start training engineers to work on the design teams of tomorrow.
Is there another new factor in evolution?
Authors: Inman Harvey
Venue: Evolutionary Computation (1996)

For 100 years it has been recognized that interactions between learning and evolution, such as the Baldwin effect, can be subtle and often counterintuitive. Recently a new effect has been discussed: It is suggested that evolutionary progress toward one specific goal may be assisted by lifetime learning on a different task that may or may not be “uncorrelated.” The phenomenon is reproduced here in a simple scenario, where the tasks are indeed uncorrelated---'Another New Factor' does indeed exist. The effect is then explained as being due to recovery from weight perturbations caused by mutation in a neural network. It is a special case of a recently discovered relearning effect: the spontaneous recovery of perturbed associations by learning uncorrelated tasks.
Wavelength Assignment for Directional Hypercube Communications on a Class of WDM Optical Networks
Authors: Yawen Chen, Hong Shen
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Hypercube communication is one of the most versatile and efficient communication patterns shared by a large number of computational problems. In this paper, we study routing and wavelength assignment for realizing hypercube communications on WDM optical networks including linear arrays and rings with the consideration of communication directions. Specifically, we consider this problem for both bidirectional and unidirectional hypercube communications. For each case, we identify a lower bound on the number of wavelengths required, and present a simple embedding scheme and wavelength assignment algorithm that uses a provably near-optimal number of wavelengths. By realizing hypercube computations in optical networks, the hypercube computation speed can be significantly improved compared with the traditional electronic networks.
Depth-of-field blur effects for first-person navigation in virtual environments
Authors: Sébastien Hillaire, Anatole Lécuyer, Rémi Cozot, Géry Casiez
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

This paper studies the use of visual blur effects, i.e., blurring of parts of the image fed back to the user, for First-Person-Navigations in Virtual Environments (VE). First, we introduce a model of dynamic visual blur for VE which is based on two types of blur effect: (1) a Depth-of-Field blur (DoF blur) which simulates the blurring of objects located in front or back of the focus point of the eyes, and (2) a peripheral blur which simulates the blurring of objects located at the periphery of the field of vision. We introduce two new techniques to improve real-time DoF: (1) a paradigm to compute automatically the focal distance, and (2) a temporal filtering that simulates the accommodation phenomenon. Second, we describe the results of a pilot experiment conducted to study the influence of blur effects on the performance and preference of video gamers during multiplayer sessions. Interestingly, it seems that visual blur effects did not degrade performance of gamers and they were preferred and selected by nearly half of the participants to improve fun and game-play. Taken together, our results suggest that the use of visual blur effects could thus be suitable in videogames and in other virtual environments.
Order and Difficulty of Debugging
Authors: M. Trachtenberg
Venue: IEEE Transactions on Software Engineering (1983)

The earlier findings of Shooman and Bolsky, that the difficulty of detecting or correcting a software bug is independent of its order of detection, is challenged by new data which shows definite tendencies for early bugs to need less time to be detected and more to be corrected than later bugs.
Performance Evaluation of the PRRA MAC Protocol for GEO Satellite Networks
Authors: Polychronis Koutsakis
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The provision of acceptable Quality-of-Service (QoS) for integrated multimedia traffic over a geosynchronous earth orbit (GEO) satellite network demands the existence of a well-designed Medium Access Control (MAC) protocol. This paper proposes a new dynamic satellite bandwidth allocation technique (Predictive Resource Reservation Access, PRRA) which is based on accurate videoconference traffic prediction. Our work is combined with another work on data traffic modeling and prediction and is shown to provide very good throughput and delay results, when compared with other efficient schemes from the literature and with an "ideal" satellite bandwidth allocation scheme.
Lessons Learned Building TeamTrak: An Urban/Outdoor Mobile Testbed
Authors: Jeffrey Hemmes, Douglas Thain, Christian Poellabauer
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Much research in mobile networks relies on the use of simulations for evaluation purposes. While a number of powerful simulation tools have been developed for this purpose, only recently has the need for physical implementations of mobile systems and applications been widely accepted in the literature. In recognition of this need, and to further our research objectives in the area of wireless sensor networks and mobile cooperative systems, we have built the TeamTrak mobile testbed, which gives us real-world experience with research concepts as we develop them. Additionally, results from outdoor field tests are used to further enhance the capabilities of the testbed itself.
Refined activation strategy for the marking game
Authors: Xuding Zhu
Venue: Journal of Combinatorial Theory Series B (2008)

This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and hence the game chromatic number of G, is at most 17.
Neural modeling of relative air humidity
Authors: I. Białobrzewski
Venue: Computers and Electronics in Agriculture (2008)

The objective of the present study was to use artificial neural networks for the estimation and prediction of relative air humidity. Neural modeling was carried out using MATLAB and STATISTICA software. Relative air humidity was predicted with a feedforward multilayer perceptron artificial neural network with time delay. The backpropagation algorithm was used for ANN training in MATLAB. The forecasting horizon was one time interval (3h). The forecast was extended to 48h (16 measurements) by re-introducing a newly estimated value as an input. The mean relative prediction error for the horizon adopted was 2.1%, and the Pearson r correlation coefficient -0.972. Estimation was performed using a Generalized Regression Neural Network (GRNN) model. This model estimated relative air humidity at the highest value of the Pearson r correlation coefficient -1.000. The GRNN developed with MATLAB tools did not show overfitting, although 100% of the empirical data were used to generate its topology.
Water quality modelling for small river basins
Authors: Stefano Marsili-Libelli, Elisabetta Giusti
Venue: Environmental Modelling Software (2008)

Water quality modelling in small rivers is often considered unworthy from a practical and economic viewpoint. This paper shows instead that a simple model structure can be set up to describe the stationary water quality in small river basins in terms of carbon and nitrogen compounds, when the use of complex models is unfeasible. In short rivers point and nonpoint sources play a key role in shaping the model response, being as important as the self-purification dynamics. Further, the varying river characteristics, in terms of morphology, hydraulics and vegetation, require the introduction of variable parameters, thus complicating the originally simple model structure. To determine the identifiability of the resulting model an identifiability assessment was carried out, based on sensitivity analysis and optimal experiment design criteria. The identifiable subset was determined by ranking the parameters in terms of sensitivity and computing the associated Fisher Information Matrices. It was found that the inclusion of the nonpoint sources as piecewise constant parameters affected the identifiability to a considerable extent. However, the combined parameter-sources calibration was made possible by the use of a robust estimation algorithm, which also provided estimation confidence limits. The calibrated model responses are in good agreement with the data and can be used as scenario generators in a general strategy to conserve or improve the water quality.
A Causal Model for Analyzing Distributed Concurrency Control Algorithms
Authors: B. Bhargava
Venue: IEEE Transactions on Software Engineering (1983)

An event order based model for specifying and analyzing concurrency control algorithms for distributed database systems has been presented. An expanded notion of history that includes the database access events as well as synchronization events is used to study the correctness, degree of concurrency, and other aspects of the algorithms such as deadlocks and reliability. The algorithms are mapped into serializable classes that have been defined based on the order of synchronization events such as lock points, commit point, arrival of a transaction, etc,.
A Novel Algorithm for Load Balancing in Distributed Systems
Authors: Hua-Feng Deng, Yun-Sheng Liu, Ying-Yuan Xiao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper proposes a novel algorithm for load balancing in the parallel and distributed systems. Firstly, almost all jobs are organized into the standard job combinations, each of which consists of one to four jobs. Then they are assigned to the machines according to the assignment algorithm for job combinations, which is a special integer partition algorithm. The maximum error between the optimal algorithm and our algorithm is estimated. The experimental results show that our algorithm performs efficiently.
Cycles and stability
Authors: V. Nikiforov, R. H. Schelp
Venue: Journal of Combinatorial Theory Series B (2008)

We prove a number of Turan and Ramsey type stability results for cycles, in particular, the following one: Let n>4, 0=(2-10^-^6)n, then for every 2-coloring of E(G) one of the colors contains cycles C"t for all t@?[3,n].
Adaptive digital game-based learning framework
Authors: Phit-Huan Tan, Siew-Woei Ling, Choo-Yee Ting
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

A common teaching and learning methodology involves one that delivers knowledge to learners within a classroom environment. With the enhancement of information technology, Web-based learning has been promoted as an alternative teaching and learning methodology. Digital games, an interactive piece of technology within the multimedia learning environment, could foster the learning process effectively and interestingly especially among young learners. Researchers and game designers have noted this promising technology and proposed some frameworks and models to foster multimedia learning environment. However, most of the models do not address the learning behavior in game design, which is important to facilitate learning process in game-based learning. In view of this, this paper focuses on proposing and discussing components that leverage the pedagogical aspects in designing game-based learning environment.
Existence of Positive Solutions for Boundary Value Problems on a Measure Chain with a Parameter
Authors: Huting Yuan, Fang Mi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

We are concerned with the existence of positive solutinos of general two point boundary value problems for the non-linear equation x^{\Delta \Delta } (t) + \lambda f (t, x(\sigma(t))) = 0 without the assumption of f being nonnegative.
Generalized Inverse Approach to Adaptive Multiclass Pattern Classification
Authors: W. G. Wee
Venue: IEEE Transactions on Computers (1968)

Abstract In this paper a least-square approach to multiclass pattern classification is undertaken. The generalized inverse computation is used to furnish a quick solution to the problem of fixed training samples. The use of recursive on-line computation is also recommended. Experimental results are presented to illustrate the approach. Both deterministic and statistical interpretations have been given to the approach. The pattern classifier proposed by Chaplin and Levadi [1] and the adaptive pattern classifier proposed by Patterson and Womack [2] are special cases of this approach.
MIMO-Based and SISO Multihop Sensor Networks: Energy Efficiency Evaluation
Authors: George N. Bravos, George Efthymoglou, Athanassios G. Kanatas
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Wireless Sensor Networks have become suitable for a wide range of applications during recent years. These networks demand the implementation of energy-aware techniques and low complexity protocols in all layers. Recently, a MIMO based structure has been proposed to offer enhanced energy savings in WSNs, compared with simple SISO transmission. In this paper we consider the most common transmission structure for WSNs, using multiple hops. We examine and compare MIMO based WSN with a multihop transmission in terms of energy efficiency. The results mainly depend on the channel conditions and the distance to the destination node. We reach analytical expressions to calculate threshold values of these parameters, which determine the areas where the MIMO based structure outperforms multihop transmission. Index Terms Energy efficiency evaluation, Multiple- Input-Multiple-Output systems, Wireless Sensor Networks I.
2 Tutorial Series Perspectives on Business Data Processing
Authors: G. A. Champine
Venue: Computer (1980)

Second in a series commissioned by the Computer Society, this tutorial establishes "typical" application and system requirements for the diverse activities comprising business computing.
The BBC and its web 2.0 partners
Authors: Ben Sutherland
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

The British Broadcasting Corporation's websites, in English and in the 33 languages broadcast on the BBC World Service, are among the most powerful online providers of content -- in particular news and current affairs information -- on the internet. But as the level of individual users' internet usage and sophistication grows, BBC.co.uk is looking to advance its methods of getting this content to people beyond the provision of one simple one-size-fits-all website. Tools such as RSS feeds and desktop news alerts began the process, which, driven by a Creative Futures programme and a set of 15 "web principles", has now expanded to include the establishment of presences in, and utilisation of, Second Life, You Tube and My Space. Meanwhile new deals allowing for content to be distributed more widely are being announced virtually on a monthly basis. But what are the implications of such moves? Should a publicly-funded broadcaster be involved to such an extent with private interests? Is this extension of BBC News into these areas likely to attract further complaints from private media broadcasters who argue they are marginalised by the BBC's subsidised clout? And will it leave those with limited or no ability or interest in the new interactive world underserved - or neglected altogether?