ppxscal/embedding_network huggingface dataset:
Configuration Management Policy based on DEB Cost Model in OBS Networks
Authors: Hye-Won Song, Sang-Il Lee, Chan-Hyun Youn
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In Optical Burst Switching (OBS) networks, when contention occurs at an intermediate node, two or more bursts that are in contention can be dropt because a forwarding path reservation is not made for a burst. This is the reason why one of the critical design issues in OBS networks is finding ways to minimize burst dropping resulting from resource contention. In this paper, we propose a configuration management policy based on an operation cost model developed according to network status information which relates to guaranteeing Quality of Service (QoS). Also, we develop the criteria for the configuration management by providing the alternate path using bounded range of the sensitivity of this cost model. Finally, throughout the theoretical and experimental analysis, we can obtain that our proposed scheme has good performance in an aspect of blocking rate and outperforms the conventional scheme in complexity as results.
Gait synthesis for hexapod robots with a locked joint failure
Authors: Jung-Min Yang
Venue: Robotica (2005)

This paper presents a strategy for generating fault-tolerant gaits of hexapod walking robots. A multi-legged robot is considered to be fault-tolerant with respect to a given failure if it is capable of continuing its walking after the occurrence of a failure, maintaining its static stability. The failure concerned in this paper is a locked joint failure for which a joint in a leg cannot move and is locked in place. The kinematic condition for the existence of fault-tolerant gaits is derived for straight-line walking of a hexapod robot on even terrain. An algorithm for generating fault-tolerant gaits is described and, especially, periodic gaits are presented for forward walking of a hexapod robot with a locked joint failure. The leg sequence and the stride length formula are analytically driven based on gait study and robot kinematics. A case study on post-failure walking of a hexapod robot with the wave gait is shown to demonstrate the applicability of the proposed method.
Prediction of Gross Domestic Product Development by Takagi-Sugeno Fuzzy Inference Systems
Authors: Vladimir Olej, Jiri Krupka
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The paper presents the possibility of the design and application of Takagi-Sugeno fuzzy inference system in predicting of gross domestic product development by designing a prediction models whose accuracy is superior to the models used in praxis [1,2].
Composition flexible de services d'objets communicants
Authors: Mathieu Vallée, Fano Ramparany, Laurent Vercouter
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Les environnements d'informatique pervasive mettent en oeuvre de nombreux objets communicants. L'ensemble de ces objets forme un syst&egrave;me d'informatique ubiquiste dont une interface intuitive et flexible doit &ecirc;tre l'environnement m&ecirc;me d'un utilisateur. Chacun de ces objets offrant des services sp&eacute;cifiques nombreux et vari&eacute;s, leur contr&ocirc;le et leur suivi par les utilisateurs devient probl&eacute;matique et induit une surcharge cognitive. Dans cet article, nous pr&eacute;sentons une approche qui vise &agrave; composer automatiquement des services fournis par des objets communicants de fa&ccedil;on &agrave; proposer aux utilisateurs des services de haut niveau. La prise en compte d'informations de contexte pour adapter le processus de composition est une des caract&eacute;ristiques essentielles de ce syst&egrave;me, et constitue une &eacute;tape indispensable &agrave; la construction intelligente de services de haut niveau, et donc &agrave; une v&eacute;ritable intelligence ambiante.Pervasive computing environments involve a variety of smart devices and home appliances. Communities of these devices form a ubiquitous information processing system to which the physical environment should provide an intuitive and flexible user interface. Since each of these devices offers specific services, their number and variety make it difficult for users to control and monitor them all and tend to overload humans cognitive load. In this paper, we present an approach aimed at automatically composing device services, so that users can benefit from higher level services. We also ensure that context information such as users' locations and preferences is properly taken into account within the composition process. We believe that building mechanisms for synthesizing context-aware high level services is a mandatory step towards Ambient Intelligence.
Self-Stablizing Pivot Interval Routing in General Networks
Authors: Doina Bein, Ajoy K. Datta, Vincent Villain
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Compact routing protocols are used to reduce the routing table size at the cost of the optimality of the computed (shortest) paths. Interval Routing ( IR ) is a compact routing scheme, where no des are labeled with unique integers from a continuous range, and the outgoing arcs in every node are labeled with a set of intervals forming a partition of the range. Pivot Interval Routing(PIR) [19, 101] applies IR to an arbitrary weighted network such that the stretch factor (the ratio between the length of a path induced by PIR and the actual distance betwe en theno des) is at most five and three on the average. A self-stabilizing system has the ability to automatically recover from transient faults in finite time [5, 6]. We present a self-stabilizing PIR (SPZR). Our algorithm, with no knowledge of the network layout, tolerates node/link addition and/or failur e, and builds correct routing tables in o(d\sqrt {(a1 + \log n^{} )}) time units (d is the network diameter and n is the maximum number of nodes). The stretch factor and the average stretch factor are preserved. Each node builds its own routing table of size o(n^{1/2} \log ^{3/2} n + \Delta \log n) bits (where \Delta is the node degree) with a total number of o(n^{3/2} \log ^{3/2} n + n\Delta \log (n)) bits for the whole network (\Delta is the maximum degree of a node in the network).
Adaptation des applications au contexte en utilisant les services web
Authors: Tarak Chaari, Frédérique Laforest, André Flory
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

The SECAS Project (Simple Environment for Context Aware Systems) is interested in the adaptation of applications to the context (preferences and environment of the user, used terminal ...). We aim to develop a platform which makes the data, the services and the user interface of applications adaptable to the various context situations. In this domain, researches have concentrated on how to capture context data and to carry it to the application. Our work focuses on the impact of context on the application. In this paper, we present the architecture of SECAS, a new definition of the context, our adaptation strategy and a case of study in the medical field.
Information visualization design for multidimensional data: integrating the rank-by-feature framework with hierarchical clustering
Authors: Jinwook Seo
Venue:  (2005)

Interactive exploration of multidimensional data sets is challenging because: (1) it is difficult to comprehend patterns in more than three dimensions, and (2) current systems are often a patchwork of graphical and statistical methods leaving many researchers uncertain about how to explore their data in an orderly manner. This dissertation offers a set of principles and a novel rank-by-feature framework that could enable users to better understand multidimensional and multivariate data by systematically studying distributions in one (1D) or two dimensions (2D), and then discovering relationships, clusters, gaps, outliers, and other features. Users of this rank-by-feature framework can view graphical presentations (histograms, boxplots, and scatterplots), and then choose a feature detection criterion to rank ID or 2D axis-parallel projections. By combining information visualization techniques (overview, coordination, and dynamic query) with summaries and statistical methods, users can systematically examine the most important 1D and 2D axis-parallel projections. This research provides a number of valuable contributions: (a) Graphics, Ranking, and Interaction for Discovery (GRID) principles&mdash;a set of principles for exploratory analysis of multidimensional data, which are summarized as: (1) study 1D, study 2D, then find features (2) ranking guides insight, statistics confirm. GRID principles help users organize their discovery process in an orderly manner so as to produce more thorough analyses and extract deeper insights in any multidimensional data application. (b) Rank-by-feature framework&mdash;a user interface framework based on the GRID principles. Interactive information visualization techniques are combined with statistical methods and data mining algorithms to enable users to orderly examine multidimensional data sets using ID and 2D projections. (c) The design and implementation of the Hierarchical Clustering Explorer (HCE), an information visualization tool available at www.cs.umd.edu/hcil/hce. HCE implements the rank-by-feature framework and supports interactive exploration of hierarchical clustering results to reveal one of the important features&mdash;clusters. (d) Validation through case studies and user surveys: Case studies with motivated experts in three research fields and a user survey via emails to a wide range of HCE users demonstrated the efficacy of HCE and the rank-by-feature framework. These studies also revealed potential improvement opportunities in terms of design and implementation.
Effectiveness of the Step-by-step Discriminatory Analysis at Choosing the Informative Attributes
Authors: E. E. Zhuk, E. V. Serikova
Venue: Automation and Remote Control (2005)

Consideration was given to the problem of discriminatory analysis and effectiveness of the step-by-step procedure of choosing the informative attributes. Risk as a measure of effectiveness was calculated analytically together with its special related characteristic enabling one to estimate dynamics (variation) of the inter-class distances at passing to the informative attributes and propose a new effective procedure of the step-by-step discriminatory analysis.
A study of the impact of price elasticity on the adoption decision of minicomputers
Authors: Easwar A. Nyshadham
Venue:  (2005)

The rate at which a new technology is adopted by a population, called the diffusion rate, has been studied extensively in many fields, particularly the Information Systems field. Price elasticity, the rate at which quantity demanded changes, as a function of price, could be a useful measure in explaining diffusion patterns. In this empirical study, the well-known Bass diffusion model is fitted to a new dataset. Changes in the price elasticity over time were modeled after explaining away the effect of product characteristics in a hedonic regression. The main findings are: (a) price elasticity changes over time, (b) the changes in price elasticity are related to the life cycle stage of the product life cycle. These findings could offer a valuable empirical guide for managers to evaluate price and the effects of diffusion faced by the adopter population. The implications are that not all adopters react the same with respect to time and price effects. Another important implication suggests that an improved focus on the determinants of price elasticity could also play an important part in the Information Systems decision-making process.
Effective Channel Utilization in MANETs for Pervasive Computing Using a Novel RTS-CTS Mechanism
Authors: V. Vijayakrishna, Harsha Ramamurthy, Devdutt Marathe
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Pervasive Computing is a paradigm in which services and computational resources are dispersed throughout the environment, thereby aiding mobile users in their tasks as they move about. Pervasive environments are highly dynamic. Mobile Ad-hoc Network forms the basis in pervasive computing. The challenges involved in an ad-hoc network are far more intricate when compared to other conventional communication networks. Bandwidth and power are the two main criteria generally considered. In most cases, many other aspects are overlooked. Utilization of the network is the most important requisite for any communication to occur. Effective co-ordination is a must between nodes in order to avoid collisions and packet loss. In this paper we suggest two methods for an effective and optimized utilization of the network. Efficient usage of the network will contribute towards increasing the throughput. Our scheme improves network throughput significantly, especially when the network is highly congested.
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6
Authors: Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz
Venue: SIAM Journal on Discrete Mathematics (2005)

SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sites employs no more than $\frac{1}{6}$ of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number N of sites satisfies $N \equiv 1 \pmod{3}$, the determination is complete, and when $N \equiv 2 \pmod{3}$, the only value left undetermined is N = 17. When $N \equiv 0 \pmod{3}$, a finite number of values of N remain, the largest being N = 2580. The techniques developed rely heavily on tools from combinatorial design theory.
The electrical properties of metal-ferroelectric (PbZr0.53Ti0.47O3)-insulator-silicon (MFIS) capacitors with different insulator materials
Authors: Pi-chun Juan, Yu-ping Hu, Fu-chien Chiu, Joseph Ya-min Lee
Venue: Microelectronic Engineering (2005)

MFIS capacitors with Pb(Zr0.53,Ti0.47)O3 (PZT) ferroelectric layer and HfO2, La2O3 and Dy2O3 insulator layers were fabricated and characterized. The size of the capacitance-voltage (C-V) memory windows was investigated. The maximum memory windows of MFIS capacitors with La2O3 and Dy2O3 insulators are close to the theoretical value ΔW ≈ 2dfEc ≈ 1.8 V. The temperature dependence of the current conduction mechanisms through the MFIS capacitors was also investigated. In the temperature range of 375-450K, the electrical conduction of MFIS capacitors with HfO2 and Dy2O3 insulators is space-charge-limited current (SCLC), whereas for Al/PZT/La2O3/Si capacitor Poole-Frenkel emission was the dominant mechanism at higher fields (≥0.8 MV/cm) in the temperature range from 325K to 400K.
Logical approaches to the complexity of search problems: proof complexity, quantified propositional calculus, and bounded arithmetic
Authors: Tsuyoshi Morioka
Venue:  (2005)

For every binary predicate R, there is a search problem QR for finding, given x, any y such that R(x, y) holds. QR is said to be total if every instance x has a solution y, that is, (&forall;x)(&exist;y)R( x, y) holds. Total search problems are commonplace in computer science, and studying their complexity is therefore an important endeavour. In this dissertation, we present links between the complexity of solving QR and the difficulty of proving the totality of QR in the three logical formalisms: propositional calculus, quantified propositional calculus (QPC), and theories of bounded arithmetic. These links allow logical approaches to the complexity of search problems. We show several links between the complexity of a type-2 total search problem QR, where R is represented by a first-order existential sentence &Phi;, and the lengths of proofs of the propositional translations of &Phi; in bounded-depth Frege systems and the Nullstellensatz proof system. In particular, we prove the first direct links between reducibilities among type-2 search problems and lengths of propositional proofs. Based on this and the results on propositional proof complexity, we obtain a number of relative separations among the so-called NP-search classes such as Polynomial Local Search (PLS). Some of the relative separations we obtain are new. Let H be a QPC proof system and j &ge; 1. We define the Sqj -witnessing problem for H to be: given an H-proof of a prenex Sqj -formula A, and a truth assignment to the free variables of A, find a witness for the outermost existential quantifiers of A. These witnessing problems provide a tangible link between the proof lengths in QPC and the complexity of search problems, and we consider them for various parameters. We also introduce and study the new QPC proof systems G*0 and G0, and prove that the Sq1 -witnessing problem for each is complete for NC 1-search problems. Our proof involves proving the TC 0-versions of Gentzen's midsequent theorem and Herbrand's theorem. We introduce a second-order theory VNC1 of bounded arithmetic, and show that the SB1 -definable functions of VNC1 are precisely the NC1-functions. We describe simple translations of every VNC1-proof into a family of polynomial-size G*0 -proofs. From this and similar translation theorems for other bounded arithmetic theories, we obtain the hardness of the Sqj -witnessing problem for H for various H and j &ge; 1.
A Problem Solving Environment for interactive modelling of multiway data
Authors: Ivo H. M. van Stokkum, Henri E. Bal
Venue: Concurrency and Computation: Practice Experience (2006)

A prototype Problem Solving Environment (PSE) is presented for problems in interactive modelling of multiway data. Multiway data result from measurements as a function of two or more independent variables. The PSE comprises a parameter estimation loop and a model adjustment loop. The model can be specified hierarchically using mathematically described building blocks which encapsulate the model assumptions. A typical case study of three-way data illustrates the need for interactive model adjustment. Requirements for interactive problem solving are discussed. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Scalable Switch for Service Guarantees
Authors: Bill Lin, Isaac Keslassy
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

Operators need routers to provide service guarantees such as guaranteed flow rates and fairness among flows, so as to support real-time traffic and traffic engineering. However, current centralized input-queued router architectures cannot scale to fast line rates while providing these service guarantees. On the other hand, while load-balanced switch architectures that rely on two identical stages of fixed configuration switches appear to be an effective way to scale Internet routers to very high capacities, there is currently no practical and scalable solution for providing service guarantees in these architectures. In this paper, we introduce the interleaved matching switch (IMS) architecture, which relies on a novel approach to provide service guarantees using load-balanced switches. The approach is based on emulating a Birkhoff-von Neumann switch with a load-balanced switch architecture and is applicable to any admissible traffic. In cases where fixed frame sizes are applicable, we also present an efficient frame-based decomposition method. More generally, we show that the IMS architecture can be used to emulate any input queued or combined input-output queued switch.
An Interoperable, Standards-Based Grid Resource Broker and Job Submission Service
Authors: Erik Elmroth, Johan Tordsson
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

We present the architecture and implementation of a Grid resource broker and job submission service, designed to be as independent as possible of the Grid middleware used on the resources. The overall architecture comprises seven general components and a few conversion and integration points where all middleware-specific issues are handled. The implementation is based on state-of-the-art Grid and Web services technology as well as existing and emerging standards (WSRF, JSDL, GLUE, WS-Agreement). Features provided by the service include advance reservations and a resource selection process based on a priori estimations of the total time to delivery for the application, including a benchmark-based prediction of the execution time. The general service implementation is based on the Globus Toolkit 4. For test and evaluation, plugins and format converters are provided for use with the NorduGrid ARC middleware.
A Per-Class QoS Service Model in IEEE 802.11e WLANs
Authors: Jeng Farn Lee, Wanjiun Liao, Meng Chang Chen
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

In this paper, we study the provision of perclass QoS for IEEE 802.11e Enhanced Distributed Channel Access (EDCA) WLANs. We propose two mechanisms, called BIWF-SP and IDFQ-SP, based on backoff interval (BI) and inter-frame space (IFS), respectively. In our mechanisms, both strict priority and proportional fair service are supported. We describe the operations of the proposed mechanisms in details, and compare their performance with the original EDCA mechanism via simulations. The results show that both BIWF-SP and IDFQ-SP outperform the original EDCA in terms of the support for both strict priority and weighted fair service. Compared to IDFQSP, BIWF-SP is easier to be implemented in real systems; compared to BIWF-SP, IDFQ-SP has better aggregate throughput and is more stable. More importantly, both mechanisms conform with the IEEE 802.11e EDCA standard, rendering both good candidates to provide per-class QoS service for IEEE 802.11 WLANs.
A New Approach to Synthesize Multiple-Output Functions Using Reversible Programmable Logic Array
Authors: Ahsan Raja Chowdhury, Rumana Nazmul, Hafiz Md. Hasan babu
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, a new realization for logic functions, namely Reversible Programmable Logic Array (RPLA), has been proposed. The proposed realization has the advantage of regularity as compared to the existing non-PLA reversible realizations. A minimization technique is also presented along with the realization of reversible PLA. Experimental results are also shown for benchmark functions for the above realization.
A Structure Based Clustering Algorithm with Applications to VLSI Physical Design
Authors: Jianhua Li, Laleh Behjat, Blair Schiffner
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Clustering plays an important role in VLSI physical design. In this paper, we present a new structure and connectivity based clustering algorithm. The proposed clustering algorithm emphasizes capturing natural circuit clusters, i.e., highly interconnected cell groups. We apply the proposed clustering algorithm to 2-way and k-way partitionings on ISPD98 benchmark suite [1], and 2-way partitioning to part of ISPD2005 benchmark suite [2]. The experimental results show that the proposed clustering algorithm can maintain the partitioning solution qualities while reducing the sizes of large scale circuits.