ppxscal/embedding_network huggingface dataset:
Change detection and management for the semantic web
Authors: Li Qin
Venue:  (2005)

Today, the World Wide Web has become one of the major sources of information and services. It is decentralized, constantly changing in its structure and contents, and gigantic with unchecked growth. However, the full potential of the current web remains untapped because the information on the web is rendered solely for human consumption. In recent years, the notion of the Semantic Web has been introduced to define a machine-interpretable web targeted for automation, integration and reuse of data across different applications. Data instances on the Semantic Web are enriched with metadata, defined as concepts and properties from ontologies, which are formal, explicit specifications of shared conceptualizations of a given domain of discourse. Detecting changes to data objects has become essential for data warehousing, knowledge archival applications, and search engines. The Semantic Web raises a number of research challenges in the area of change detection and management of data instances and ontologies. By presenting the underlying data semantics, ontologies empower automated inference over ontologies, data instances as well as their changes. This dissertation makes the following research contributions. First, this dissertation proposes an ontology-guided methodology for detecting changes to data instances. It relies on the fact that changes to certain data instances imply changes to other semantically related data instances. Second, inferring changes of data instances from others may pose a threat to the confidentiality since ontologies enable the inference of sensitive information from unclassified information. Therefore, one must take into account the inference relationships and carefully assign the access permissions. By considering various inference patterns, this dissertation proposes an access control model that enables elimination of undesired inference. Third, this dissertation develops methodologies to detecting semantic changes to ontologies. It proposes the notion of isosems to identify the partitions that carry uniform semantics, which is then employed to analyze how semantic changes to one concept imply semantic changes to other semantically related concepts. Fourth, changes to an ontology may invalidate its data instances and dependent ontologies. This dissertation proposes approaches to evaluate the validity of data instances and dependent ontologies.
Combined learning and pruning for recurrent radial basis function networks based on recursive least square algorithms
Authors: Sing Leung, Chung Tsoi
Venue: Neural Computing and Applications (2006)

This paper discusses a way to combine training and pruning for the construction of a recurrent radial basis function network (RRBFN) based on recursive least square (RLS) learning. In our approach, a RRBFN is first trained using the proposed RLS algorithms. Afterwards, the error covariance matrix which is directly obtained from the RLS computations is used to remove some unimportant radial basis function (RBF) nodes. We propose two algorithms: (1) a &#x201c;global&#x201d; version which is suitable for low dimensional input space situation, and (2) a &#x201c;local&#x201d; version which can be applied in situations when the input dimension is large. In both cases, it is shown that the error covariance matrix, obtained from the RLS algorithms, can be used as a means for pruning the trained RRBFN. Simulation examples are presented to illustrate the proposed approaches.
Toward alternative metrics of journal impact: a comparison of download and citation data
Authors: Johan Bollen, Herbert Van de Sompel, Joan A. Smith, Rick Luce
Venue: Information Processing and Management: an International Journal (2005)

We generated networks of journal relationships from citation and download data, and determined journal impact rankings from these networks using a set of social network centrality metrics. The resulting journal impact rankings were compared to the ISI IF. Results indicate that, although social network metrics and ISI IF rankings deviate moderately for citation-based journal networks, they differ considerably for journal networks derived from download data. We believe the results represent a unique aspect of general journal impact that is not captured by the ISI IF. These results furthermore raise questions regarding the validity of the ISI IF as the sole assessment of journal impact, and suggest the possibility of devising impact metrics based on usage information in general.
Suboptimal Solution of a Cheap Control Problem for Linear Systems with Multiple State Delays
Authors: Valery Y. Glizer
Venue: Journal of Dynamical and Control Systems (2005)

A finite-horizon linear-quadratic optimal control problem with multiple pointwise and distributed state delays in the dynamics is considered. The control cost in the performance index is small with respect to the state cost. An asymptotic solution of the singularly perturbed set of Riccati-type functional-differential equations, associated with the original control problem by the optimality conditions, is constructed and justified. Based on this solution, two types of suboptimal feedback control for the original problem are derived. These suboptimal controls are justified for two classes of the initial condition for the state variable.
Near-optimal sensor placements in Gaussian processes
Authors: Carlos Guestrin, Andreas Krause, Ajit Paul Singh
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at the points of highest entropy (variance) in the GP model. We propose a mutual information criteria, and show that it produces better placements. Furthermore, we prove that finding the configuration that maximizes mutual information is NP-complete. To address this issue, we describe a polynomial-time approximation that is within (1 -- 1/e) of the optimum by exploiting the submodularity of our criterion. This algorithm is extended to handle local structure in the GP, yielding significant speedups. We demonstrate the advantages of our approach on two real-world data sets.
Scheduling Collective Communications on Wormhole Fat Cubes
Authors: Vaclav Dvorak
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

A recent renewed interest in hypercube interconnection network has been concentrated to the more scalable and mostly cheaper version known as a fat cube. This paper generalizes the known results on time complexity of collective communications on a hypercube for the wormhole fat cube. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and given in detail. The performed study shows that a large variety of fat cubes can provide lower cost, better scalability and manufacturability without compromising communication performance.
Ready Reckoners
Authors: Bruce O. B. Williams, Roger G. Johnson
Venue: IEEE Annals of the History of Computing (2005)

Multiplication is vital to the conduct of commerce but is time-consuming and error-prone. Many aids were developed over two centuries to address these issues. This article surveys the development of the most widely used of these, the ready reckoner. The underlying principles of reckoner design are explained. To explain their range of use, over 1,250 entries from the major national library catalogues and elsewhere have been classified by application, target user, date, price and format. A sample of different styles are illustrated.
TCP fairness measures for scheduling algorithms in wireless networks
Authors: Krister Norlund, Tony Ottosson, Anna Brunstrom
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

This paper presents two new layer 4 fairness measures, the worst case TCP fairness index and the TCP fairness index. The purpose of the two indices is to measure the performance of algorithms scheduling elastic traffic in wireless networks. Numerical evaluation of round-robin, proportional-fair and max-rate scheduling shows that the new measures can accurately classify the fairness properties of the studied scheduling algorithms. This means that the new fairness measures are appropriate for measuring TCP fairness. The worst case TCP fairness index is the primary measure. The TCP fairness index can be used as a complement in certain cases. The new fairness measures are also compared with two layer 2 fairness measures. Numerical evaluation shows that the new layer 4 measures and the layer 2 measures in some aspects show similar results. However, when evaluating transport layer fairness, it is better to use the new layer 4 measures as they actually measure fairness on layer 4 and the results are easier to interpret.
SH-X: an embedded processor core for consumer appliances
Authors: F. Arakawa, M. Ishikawa, Y. Kondo, T. Kamei, M. Ozawa, O. Nishii, T. Hattori
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

A SuperH&trade; embedded processor core SH-X implemented in a 130-nm CMOS process running at 400 MHz achieved 720 MIPS and 2.8 GFLOPS at a power of 250 mW under worst-case conditions. It has a dual-issue seven-stage pipeline architecture, but reaches the 1.8 MIPS/MHz of the previous five-stage processor. The on-chip memory configuration is tuned for digital consumer appliances. A new resume-standby mode enables a standby current of less than 100, &mu;A and a 3-ms recovery time. The processor meets the requirements of a wide range of applications, and is suitable for digital appliances aimed at the consumer market, such as cellular phones, digital still/video cameras, and car navigation systems.
Sensitivity and Coding of Opportunistic ALOHA in Sensor Networks with Mobile Access
Authors: Parvathinathan Venkitasubramaniam, Srihari Adireddy, Lang Tong
Venue: Journal of VLSI Signal Processing Systems (2005)

We consider a distributed medium access protocol, Opportunistic ALOHA, for reachback in sensor networks with mobile access points (AP). We briefly discuss some properties of the protocol, like throughput and transmission control for an orthogonal CDMA physical layer. We then consider the incorporation of necessary side information like location into the transmission control and numerically demonstrate the loss in throughput in the absence of such information. Through simulations, we discuss the robustness and sensitivity of the protocol under various modeling errors and propose strategies to allow for errors in estimation of some parameters without reduction in the throughput. For networks, where the sensors are allowed to collaborate, we consider three coding schemes for reliable transmission: spreading code independent, spreading code dependent transmission and coding across sensors. These schemes are compared in terms of achievable rates and random coding error exponents. The coding across sensors scheme has comparable achievable rates to the spreading code dependent scheme, but requires the additional transmission of sensor ID. However, the scheme does not require the mobile AP to send data through the beacon unlike the other two schemes. The use of these coding schemes to overcome sensitivity is demonstrated through simulations.
Numerical simulation of two-dimensional electron transport in cylindrical nanostructures using Wigner function methods
Authors: Greg Recine, Bernard Rosen, Hong-Liang Cui
Venue: Journal of Computational Physics (2005)

We have constructed a lattice Wigner-Weyl code to expand the Buot-Jensen algorithm to calculation of electron transport in two-dimensional cylindrically symmetric structures. Almost all of the numerical simulations to date have dealt with the restricted problem of one-dimensional transport. In real devices, electrons are not confined to a single transport dimension and the coulombic potential is fully present and felt in three dimensions. We show the derivation of the 2D equation in cylindrical coordinates as well as approximations employed in the calculation of the four-dimensional convolution integral of the Wigner function and the potential. We work under the assumption that longitudinal transport is more dominant than radial transport and employ parallel processing techniques. The total transport is calculated in two steps: (1) transport the particles in the longitudinal direction in each shell separately, then (2) each shell exchanges particles with its nearest neighbor. Most of this work is concerned with the former step: A 1D space and 2D momentum transport problem. Time evolution simulations based on these method are presented for three different cases. Each case lead to numerical results consistent with expectations. Discussions of future improvements are discussed.
Typed Abstraction of Complex Network Compositions
Authors: Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, Ibrahim Matta
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of robust network services largely inaccessible to the average programmer. We propose the development of a novel type system and practical type spaces which reflect simplified representations of the results and conclusions which can be derived from complex compositional theories in more accessible ways, essentially allowing the system architect or programmer to be exposed only to the inputs and output of compositional analysis without having to be familiar with the ins and outs of its internals. Toward this end we present the TRAFFIC (Typed Representation and Analysis of Flows For Interoperability Checks) framework, a simple flow-composition and typing language with corresponding type system. We then discuss and demonstrate the expressive power of a type space for TRAFFIC derived from the network calculus, allowing us to reason about and infer such properties as data arrival, transit, and loss rates in large composite network applications.
The Other Side of the Timing Equation: a Result of Clock Faults
Authors: C. Metra, M. Omana, D. Rossi, J. M. Cazeaux, TM Mak
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

We analyze the impact of clock faults on product quality and operation in the field. We show that clock faults could: i) give rise to min delay violations; ii) compromise the effectiveness of delay fault testing in screening out possible delay faults; iii) be missed by current functional testing (in addition to possibly be missed by structural testing, as proven in [15]). Therefore, new testing/DFT approaches are needed to avoid the dramatic impact of clock faults on product quality and operation in the field. Various possible approaches are discussed.
A Probabilistic Approach to Multi-document Summarization for Generating a Tiled Summary
Authors: M. Saravanan, S. Raman, B. Ravindran
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Due to data overload and time-critical nature of information need, automatic summarization of documents plays a significant role in information retrieval and text data mining. This paper discusses the design of a multi-document summarizer that uses Katz¿s K-mixture model for term distribution. The model helps in ranking the sentences by a modified term weight assignment. The system has been evaluated against the frequently occurring sentences in the summaries generated by a set of human subjects. Our system outperforms other autosummarizers at different extraction levels of summarization with respect to the ideal summary, and is close to the ideal summary at 40% extraction level.
The Alignment Template Approach to Statistical Machine Translation
Authors: Franz Josef Och, Hermann Ney
Venue: Computational Linguistics (2004)

A phrase-based statistical machine translation approach &mdash; the alignment template approach &mdash; is described. This translation approach allows for general many-to-many relations between words. Thereby, the context of words is taken into account in the translation model, and local changes in word order from source to target language can be learned explicitly. The model is described using a log-linear modeling approach, which is a generalization of the often used source&ndash;channel approach. Thereby, the model is easier to extend than classical statistical machine translation systems. We describe in detail the process for learning phrasal translations, the feature functions used, and the search algorithm. The evaluation of this approach is performed on three different tasks. For the German&ndash;English speech VERBMOBIL task, we analyze the effect of various system components. On the French&ndash;English Canadian HANSARDS task, the alignment template system obtains significantly better results than a single-word-based translation model. In the Chinese&ndash;English 2002 National Institute of Standards and Technology (NIST) machine translation evaluation it yields statistically significantly better NIST scores than all competing research and commercial translation systems.
Landmark Guided Forwarding
Authors: Menghow Lim, Julian Chesterfield, Jon Crowcroft
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The common approach among existing wireless Ad Hoc routing solutions is to establish a global optimal path between a source and a destination. We argue that establishing a globally optimal path is both unreliable and unsustainable as the network diameter, traffic volume and number of nodes all increase in the presence of moderate node mobility. To address this we propose Landmark Guided Forwarding (LGF), a protocol that provides a hybrid solution of topological and geographical routing algorithms. We demonstrate that LGF is adaptive to unstable connectivity and scalable to large networks. Our results indicate therefore that Landmark Guided Forwarding converges much faster, scales better and adapts well within a dynamic wireless Ad Hoc environment in comparison to existing solutions.
Trust-enhanced mediation for distributed information systems
Authors: Premkumar Devanbu
Venue:  (2005)

Decision-makers in critical fields such as medicine and finance make use of a wide range of information available over the Internet. Mediation, a distributed database technique, manages the complexity and diversity of the information schemas on behalf of the user. We raise here the issue of trust: is the information obtained through mediation trustworthy? Each user can have different perspective on the desired trustworthiness the information he or she needs. We consider here the scaling problem that arises from a large number of users accessing information from many different sources. A mediator cannot be expected to manage the potentially quadratic scaling of trustworthiness relationships that users can have with information sources. Furthermore, the possibility of using untrustworthy data increases the risk that the resulting data will be unacceptable: a mediator might evaluate a complex, distributed query plan for a client, only to have the answer rejected because the client does not trust the sources of the information. To help address these issues, we propose a general static trust prediction model, which can infer the trust ratings of query plans, based on trust meta-data about the input data into the query plan. We have defined several useful trust metrics that may be employed as part of the mediation system.
A graph-based approach for extracting terminological properties from information sources with heterogeneous formats
Authors: Luigi Palopoli, Domenico Rosaci, Giorgio Terracina, Domenico Ursino
Venue: Knowledge and Information Systems (2005)

The problem of handling both the integration and the cooperation of a large number of information sources characterised by heterogeneous representation formats is a challenging issue. In this context, a central role can be played by the knowledge about the semantic relationships holding between concepts belonging to different information sources (intersource properties). In this paper, we propose a semiautomatic approach for extracting two kinds of intersource properties, namely synonymies and homonymies, from heterogeneous information sources. In order to carry out the extraction task, we introduce both a conceptual model, for representing involved sources, and a metrics, for measuring the strength of the semantic relationships holding among concepts represented within the same source.
Design Issues of a Novel Toolkit for Parallel Application Performance Monitoring and Analysis in Cluster and Grid Environments
Authors: Kuan-Ching Li, Hsiao-Hsi Wang, Chiou-Nan Chen, Chun-Chieh Liu, Chia-Fu Chang, Chia-Wen Hsu, Sheng-Shiang Hung
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

The low-cost and availability of network of workstations have made them attractive solution for high performance computing. Striking progress of network technology is enabling high-performance global computing, with the utilization of cluster and grid technologies, in which computational and data resources in a local or wide area network are transparently employed to solve large-scale problems. In this paper, we present implementation and design rationale of Visuel* toolkit for performance measurement and analysis of parallel applications in cluster and grid environments. Most of performance visualization tools available today for highperformance platforms show solely system performance data (e.g., CPU load, memory usage, network bandwidth, server average load), and thus, being suitable for visualization of computing platform system activities. The Visuel toolkit is webbased interface designed to show performance activities of all computing nodes of a cluster or grid computing platform involved in the execution of a parallel application, such as CPU load level and memory usage of each computing node. In addition, this toolkit is able to display comparative performance data visualizations generated from a number of executions of an application under investigation, analyzing the performance of different implementations. Evaluations using this toolkit show that it outperforms in easing the process of investigation and implementation of parallel applications, in effective way.
'Affective' computing and emotion recognition systems: the future of biometric surveillance?
Authors: Joseph Bullington
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

This paper concerns a subtopic of a larger research program called affective computing, referred to as affect recognition (the terms 'affect recognition' and 'emotion recognition' will be used interchangeably in this paper). It is proposed that computer systems based on affect recognition could play an important role in the next generation of biometric surveillance systems. In order to introduce affect recognition and its possible applications to the information security community, the present paper will explore the intersection of several groups of technologies, among them: surveillance camera networks, ubiquitous computing, biometrics, face recognition, and affective computing. Three possible scenarios for the deployment of affect recognition will then be briefly discussed. The implementation of these systems will represent the realization of an important goal for the security industry, the automation of real-time prediction of human behavior and intention. Before this goal can be achieved, however, many technical and ethical issues will have to be resolved.