ppxscal/embedding_network huggingface dataset:
IEEE 802.11 MAC Protocol over Wireless Mesh Networks: Problems and Perspectives
Authors: Tzu-Jane Tsai, Ju-Wei Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The wireless mesh network has been an emerging technology in recent years. Because the transmission medium used in networking backhaul APs is radio, the wireless mesh network is not only easy and cost effective in deployment, but also has good scalability in coverage area and capacity. The IEEE 802.11 MAC protocol has been adopted as the de-facto medium access control. In this paper, we assess the fitness of the IEEE 802.11 over wireless mesh networks. We focus on the question: Does the backhaul networking of a wireless mesh network have the capability to support multimedia transport? The backhaul must guarantee the throughput and the latency. Furthermore, the QoS guarantee is required for multimedia applications. We contend that it is really necessary to consider what the key is to be changed in the IEEE 802.11 so that it can adapt the IEEE 802.11 MAC protocol to wireless mesh networks. Through the study of existing solutions, we analyze the previous work and sketch the contours of the directions to achieve our goal in this article.
Self-Managing Sensor-Based Middleware for Performance Monitoring and Data Integration in Grids
Authors: Hong-Linh Truong, Thomas Fahringer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper describes a sensor-based middleware for performance monitoring and data integration in the Grid that is capable of self-management. The middleware unifies both system and application monitoring in a single system, storing various types of monitoring and performance data in decentralized storages, and providing a uniform interface to access that data. We have developed event-driven and demand-driven sensors to support rule-based monitoring and data integration. Grid service-based operations and TCP-based data delivery are exploited to balance tradeoffs between interoperability, flexibility and performance. Peer-to-peer features have been integrated into the middleware, enabling self-managing capabilities, supporting group-based and automatic data discovery, data query and subscription of performance and monitoring data.
Postmodern Software Development
Authors: Robert E. Filman
Venue: IEEE Internet Computing (2005)

The history of software development includes elements of art, science, engineering, and fashion(though very little manufacturing). In all domains, old ideas give way or evolve to new ones: in the fine arts, the baroque gave way to rococo, romanticism, modernism, postmodernism, and so forth. What is the postmodern programming equivalent? That is, what comes after object orientation?
Wire length prediction-based technology mapping and fanout optimization
Authors: Qinghua Liu, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In modern VLSI systems early wire optimization is essential in achieving required performance, routability, and power. The cost functions optimized during traditional logic synthesis do not capture interconnect effects, which may lead to sub-optimal designs. In this paper, we propose a method for applying pre-layout wire-length prediction techniques in logic synthesis, targeting wiring cost and ways to minimize congestion. Specifically, we focus on technology mapping and fanout optimization. Experimental results show that our wire-length-prediction-based technology mapping (WP-Map) and fanout optimization (WP-Fanout) result in 8.7% improvement in average congestion, 17.2% improvement in peak congestion, and 3.3% improvement in timing performance.
Colour Constancy Using the Chromagenic Constraint
Authors: G. D. Finlayson, S. D. Hordley, P. Morovic
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper we propose that two images are captured of every scene: a normal image and an image captured where a coloured filter is placed in front of the camera. This additional information is then used in solving for colour constancy. The novelty of our approach is not that we add a colour filter (this is an old idea) but in how we use the additional information. In contradistinction to previous work we propose that the dimensionality of the 6 measurements per image pixel remains at 3 (not 6): we do not add a filter to increase the number of degrees of freedom but rather as a way of estimating the illuminant. We say that a filter is chromagenic if the relationship between filtered and unfiltered RGBs varies with and depends strongly on illumination. The canonical chromagenic algorithm works by testing the applicability of pre-computed relations in situ in an image. We extend the chromagenic approach to incorporate knowledge of the gamut of colours we expect to see under a given light and so in effect we make a hybrid gamut mapping + chromagenic algorithm. Experiments validate our approach with chromagenic gamut mapping shown to deliver significantly better constancy than all other algorithms tested.
Biological workflow with BlastQuest
Authors: William G. Farmerie, Joachim Hammer, Li Liu, Anuj Sahni, Markus Schneider
Venue: Data Knowledge Engineering (2005)

Besides domain-specific biological problems, biologists are confronted with many computational problems. The large amount of varying, heterogeneous, and semi-structured biological data, the increasing complexity of biological applications, methods, and tools afflicted with uncertainty and missing knowledge, as well as the lacking interoperability of available tools necessitate integrative measures to enable biology workflow. In this paper we address these problems in the context of the processing and evaluation of BLAST query results. We present a new tool, called BlastQuest, which relies on database technology and provides sophisticated interactive and Web-enabled query, analysis, and visualization facilities for genomics data. The interface with the Gene Ontology and the KEGG pathway databases decisively foster the biological workflow. Finally, based on our experience with BlastQuest, we briefly sketch a new concept, called Genomies Algebra, for solving genomic data management problems from a broader perspective.
Optical-Drop Wavelength Assignment Problem for Wavelength Reuse in WDM Ring Metropolitan Area Networks
Authors: Nobuo Funabiki, Megumi Isogai, Toru Nakanishi, Teruo Higashino
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

This paper presents a formulation of the optical-drop wavelength assignment problem (ODWAP) and its heuristic algorithm for WDM ring networks. The wavelength-division multiplexing (WDM) technology has been popular in communication societies for providing very large communication bands by multiple lightpaths with different wavelengths on a single optical fiber. Particularly, a double-ring optical network architecture based on the packet-over-WDM technology such as the HORNET architecture, has been studied as a next generation platform for metropolitan area networks (MANs). Each node in this architecture is equipped with a wavelength-fixed optical-drop and a tunable transmitter so that a lightpath can be established between any pair of nodes without wavelength conversions. In this paper, we formulate ODWAP for efficient wavelength reuse under heterogeneous traffic in this network. Then, we propose a simple heuristic algorithm for ODWAP. Through extensive simulations, we demonstrate the effectiveness of our approach in reducing waiting times for packet transmissions when a small number of wavelengths are available to retain the network cost for MANs.
Fast solvers of integral equations of the second kind: wavelet methods
Authors: Gennadi Vainikko, Andi Kivinukk, Jüri Lippus
Venue: Journal of Complexity (2005)

For the Fredholm integral equation u = Tu + f on the real line, fast solvers are designed on the basis of a discretized wavelet Galerkin method with the Sloan improvement of the Galerkin solution. The Galerkin system is solved by GMRES or by the Gauss elimination method. Our concept of the fast solver includes the requirements that the parameters of the approximate solution un can be determined in O(n*) flops and the accuracy ||u - un||0,b ≤ cn*-m||f(m)||0,a is achieved where n* = n*(n) is the number of sample points at which the values of f and K, the kernel of the integral operator, are involved; moreover, we require that, having determined the parameters of un, the value of un at any particular point x ∈ (-∞, ∞) is available with the same accuracy O(n*-m) at the cost of O(1) flops. Here || ċ ||0,a and || ċ ||0,b are certain weighted uniform norms. Using GMRES, the 2m-smoothness of K is sufficient; in case of Gauss method, K must be smoother.
Dissemination of Spanish social sciences and humanities journals
Authors: Julia Osca-Lluch, Julia Haba
Venue: Journal of Information Science (2005)

The presence of scholarly journals in international data bases promotes the dissemination of research results and also facilitates requests for specific articles or journals by end users. As scientists seek optimal visibility for their work and wish their results to be published in journals with high circulation, it is important to know which are the leading journals within each scientific area. This paper contains a bibliometric study of scientific journals in the areas of Social Sciences and Humanities that are currently published in Spain, together with information concerning their production and circulation in the different national and international bibliographical data bases, publisher, scientific discipline, impact factor, frequency of publication, language and type of delivery used.
PRC PAKTUS: MUC-3 test results and analysis
Authors: Cheryl Kariya
Venue: Proceedings of the 3rd conference on Message understanding (1991)

For natural language understanding researchers at PRC, preparing for MUC-3 was a useful endeavor in many respects. The value of having a well-defined task, a large corpus, and an automated scoring program can hardly be overestimated. This exercise has pointed out the strengths of our system, confirmed our feelings about which aspects most need work, and taught us how to approach a task of this magnitude efficiently. In this paper, we will discuss our test results, the ways in which we prepared for the task, and lessons learned.
On Arc-Regular Permutation Groups Using Latin Squares
Authors: Sònia P. Mansilla
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

For a given a permutation group G, the problem of determining which regular digraphs admit G as an arc-regular group of automorphism is considered. Groups which admit such a representation can be characterized in terms of generating sets satisfying certain properties, and a procedure to manufacture such groups is presented. The technique is based on constructing appropriate factorizations of (smaller) regular line digraphs by means of Latin squares. Using this approach, all possible representations of transitive groups of degree up to seven as arc-regular groups of digraphs of some degree is presented.
Differentiable parameterization of Catmull-Clark subdivision surfaces
Authors: Ioana Boier-Martin, Denis Zorin
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Subdivision-based representations are recognized as important tools for the generation of high-quality surfaces for Computer Graphics. In this paper we describe two parameterizations of Catmull-Clark subdivision surfaces that allow a variety of algorithms designed for other types of parametric surfaces (i.e., B-splines) to be directly applied to subdivision surfaces. In contrast with the natural parameterization of subdivision surfaces characterized by diverging first order derivatives around extraordinary vertices of valence higher than four, the derivatives associated with our proposed methods are defined everywhere on the surface. This is especially important for Computer-Aided Design (CAD) applications that seek to address the limitations of NURBS-based representations through the more flexible subdivision framework.
A new approach for SCORM compatible database design
Authors: Tsvetan Hristov, Angel Smrikarov, Tsvetozar Georgiev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper discuss how to modify the Database of the e-Learning platform eLSe in order to achieve conformity with SCORM specifications. This conformity will make the learning content reusable and will enable exchange of courses between eLSe and existing learning management systems (LMS) and content management systems (CMS).
Coefficient Elimination Algorithm for Low Energy Distributed Arithmetic DCT Architectures
Authors: Tarek Darwish, Magdy Bayoumi
Venue: Journal of VLSI Signal Processing Systems (2005)

An energy aware DCT (Discrete Cosine Transform) architecture based on the distributed arithmetic concept is proposed. Architectures based on the distributed arithmetic concept are inherently low power as they are multiplication free algorithms. One characteristic of the DCT is that upon transformation signal energies are concentrated in only a few coefficients (less than 25%) with the rest (75%) of the coefficients being insignificant and negligible. One can skip the computation of these terms without seriously affecting the output signal quality. Exploiting this idea, we propose a low energy DCT architecture that can achieve 55% savings in the energy dissipation and 28 db in signal quality. In addition, we propose an adaptive energy aware DCT architecture that trades off energy consumption for signal quality. Using this adaptive architecture, we present a study of the effect of coefficient elimination on energy consumption and signal quality.
MCDA: An Efficient Multi-Channel MAC Protocol for 802.11 Wireless LAN with Directional Antenna
Authors: Chih-Yung Chang, Hao-Chun Sun, Chen-Chi Hsieh
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

IEEE 802.11 provides a contention based MAC protocol for single channel wireless environment. Extending IEEE 802.11 to a multi-channel environment will not only exploit the bandwidth utilization but also reduce the degree of contentions. Involving directional antenna in designing multi-channel MAC protocol additionally increases the spatial reuse, allowing more communications proceeding in parallel. This paper proposes an efficient 802.11 Multi-Channel MAC protocol with Directionable Antenna (MCDA). Since each station is only equipped with a single antenna, communicating pairs that progress their communications on data channels will unable to maintain the channel usage information which is only obtained from the control channel, raising the channel collision problem. The proposed protocol adopts mechanism of channel switch sequence (CSS) to resolve the channel collision problem and reduce the overhead in message exchange for switching channel. According to the state management, MCDA then controls directional antenna transmitting data on a selected channel to exploit the opportunities of spatial reuse and maintain the fairness among communicating pairs. Simulation results show That the proposed MCDA protocol can largely improve the bandwidth utilization and throughput while the fairness could be maintained.
Toward an Agent-Based and Context-Oriented Approach for Web Services Composition
Authors: Zakaria Maamar, Soraya Kouadri Mostefaoui, Hamdi Yahyaoui
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

This paper presents an agent-based and context-oriented approach that supports the composition of Web services. A Web service is an accessible application that other applications and humans can discover and invoke to satisfy multiple needs. To reduce the complexity featuring the composition of Web services, two concepts are put forward, namely, software agent and context. A software agent is an autonomous entity that acts on behalf of users and the context is any relevant information that characterizes a situation. During the composition process, software agents engage in conversations with their peers to agree on the Web services that participate in this process. Conversations between agents take into account the execution context of the Web services. The security of the computing resources on which the Web services are executed constitutes another core component of the agent-based and context-oriented approach presented in this paper.
Improving aviation safety with information visualization: a flight simulation study
Authors: Cecilia R. Aragon, Marti A. Hearst
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Many aircraft accidents each year are caused by encounters with invisible airflow hazards. Recent advances in aviation sensor technology offer the potential for aircraft-based sensors that can gather large amounts of airflow velocity data in real-time. With this influx of data comes the need to study how best to present it to the pilot - a cognitively overloaded user focused on a primary task other than that of information visualization.We focus on one particular aviation application, but the results may be relevant to user interfaces in other operationally stressful environments.
Decoding complexity and iteration number statistics in Low Density Parity Check codes
Authors: Marco Baldi, Gabriella Bosco, Franco Chiaraluce, Roberto Garello
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

A first order statistical analysis of the number of iterations used for decoding Low Density Parity Check codes is presented and discussed. It is shown that such analysis is: i) necessary for correctly measuring and comparing the complexity of these codes and ii) useful for design purposes. The study is relevant, as Low Density Parity Check codes have been recently proposed for introduction in some important telecommunication standards, like digital video broadcasting and space applications.
ID-Based Ring Authenticated Encryption
Authors: Tianjie Cao, Dongdai Lin, Rui Xue
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Ring authenticated encryption has the following security requirements: semantic-security, recipient-designation, verification-dependence, verification-convertibility, recipient-ambiguity, recipient-verifiability, signer-ambiguity and signer-verifiability. Ring authenticated encryption can be used to enhance user privacy. In this paper, based on Boneh and Franklinyýs ID-based encryption scheme and Zhang and Kimýs ID-based ring signature scheme, we propose an ID-based ring authenticated encryption scheme. We also show that the proposed scheme satisfies the correctness property and all security requirements.
Dissemination asynchrone d'information en mode peer-to-peer dans les r&eacute;seaux ad-hoc
Authors: Hervé Roussain, Frédéric Guidec
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This paper presents a model for peer-to-peer, asynchronous data dissemination in ad hoc networks. This model relies on a "collective memory" all stations contribute to implement, according to their capacity. This approach helps tackle station volatility and network fragmentation. Information exchange can be performed asynchronously by stations that are not nessarily active simultaneously in the network. Moreover in a fragmented network a station roaming between network islands can provide its neighbours with information it has gathered while visiting another part of the network.
Partitioning and placement for buildable QCA circuits
Authors: Sung Kyu Lim, Ramprasad Ravichandran, Mike Niemier
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2005)

Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of an electron charge configuration in chemical molecules. In this article, we present the first partitioning and placement algorithm for automatic QCA layout. We identify several objectives and constraints that will enhance the buildability of QCA circuits. The results are intended to: (1) define what is computationally interesting and could actually be built within a set of predefined constraints, (2) project what designs will be possible as additional constructs become realizable, and (3) provide a vehicle that we can use to compare QCA systems to silicon-based systems.
Predictive filtering: a learning-based approach to data stream filtering
Authors: Vibhore Kumar, Brian F. Cooper, Shamkant B. Navathe
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

Recent years have witnessed an increasing interest in filtering of distributed data streams, such as those produced by networked sensors. The focus is to conserve bandwidth and sensor battery power by limiting the number of updates sent from the source while maintaining an acceptable approximation of the value at the sink. We propose a novel technique called Predictive Filtering. We use matching predictors at the source and the sink simultaneously to predict the next update. The update is streamed only when the difference between the actual and the predicted value at the source increases beyond a threshold. Different predictors can be plugged into our framework, and we present a comparison of the effectiveness of various predictors. Through experiments performed on a bee-motion tracking log we demonstrate the effectiveness of our algorithm in limiting the number of updates while maintaining a good approximation of the streamed data at the sink.
Building reactive web applications
Authors: Federico M. Facca, Stefano Ceri, Jacopo Armani, Vera Demaldé
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The Adaptive Web is a new research area addressing the personalization of the Web experience for each user. In this paper we propose a new high-level model for the specification of Web applications that take into account the manner users interact with the application for supplying appropriate contents or gathering profile data. We therefore consider entire processes (rather than single properties) as smallest information units, allowing for automatic restructuring of application components. For this purpose, a high-level Event-Condition-Action (ECA) paradigm is proposed, which enables capturing arbitrary (and timed) clicking behaviors.
Unifying User-to-User Messaging Systems
Authors: Jan-Mark S. Wams, Maarten van Steen
Venue: IEEE Internet Computing (2004)

Unification of user-to-user messaging systems facilitates message exchange independent of time, place, protocol, and end-user device.This article describes an approach to unification that is based on introducing a middleware layer instead of employing gateways. It entails a single system that provides common services such as email, fax, and short messaging, but that can also enable novel services that current messaging systems can't support.The authors also describe how the model can be efficiently implemented on a global scale.