ppxscal/embedding_network huggingface dataset:
Future Framework for Maglev Train Traffic Control System Utilizing Autonomous Decentralized Architecture
Authors: T. Kawakami
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

A future framework for the traffic control system of an ultra high speed and huge transportation capacity Maglev (magnetically levitated) linear motor line is presented. This Maglev system must have the ability to recover from disrupted traffic scheduling situations and to provide electrical energy savings. The proposed system consists of the CSS (Central Commander Support System), RPCCs (Regional Power Control Centers), TPCSs (Traffic and Power Control Substations) on the wayside, TSS (Train Supervisor Support System) on board, and IFN (Information Field Network) joining all the facilities. The delay recovery control function has three layers. The top is a strategic rescheduling layer. The CSS helps to plan recovering strategy. The middle layer is a headway minimizing layer including the TPCSs which direct the Maglev train toward a 3D target so as to minimize the train headway. The bottom layer is a temporal speed control layer. The energy saving function has a two layered structure. The top is a total load control layer coordinating the powering/braking schedule of each train and the bottom is the same as in the traffic control function. The proposed architecture is expected to present quite controllable circumstances to the central commander, and also to realize the desirable overall power dissipation characteristic. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Multiresolution Representation and Visualization of Volume Data
Authors: Paolo Cignoni, Claudio Montani, Enrico Puppo, Roberto Scopigno
Venue:  (1995)

A system to represent and visualize scalar volume data at multiple resolution is presented. The system is built on a multiresolution model based on tetrahedral meshes with scattered vertices that can be obtained from any initial dataset. The model is built o-line through data simplication techniques, and stored in a compact data structure that supports fast on-line access. The system supports interactive visualization of a representation at an arbitrary level of resolution through isosurface and projective methods. The user can interactively adapt the quality of visualization to requirements of a specic application task, and to the performance of a specic hardware platform. Representations at dierent resolutions can be used together to enhance further interaction and performance through progressive and multiresolution rendering. EMAIL:: montani@iei.pi.cnr.it
Error control for a time-discretization of the full one-dimensional Fremond model for shape memory alloys.
Authors: Ulisse Stefanelli
Venue:  (1999)

This note deals with a one-dimensional initial-boundary value problem related to the Fremond thermomechanical model of structural phase transitions in shape memory materials. A semi-implicit time-discretization with variable step of the problem is discussed and an a priori estimate for the discretization error is recovered. The latter shows an optimal order of convergence, depends solely on data and imposes no constraints between consecutive time steps. TEL:: +39-382-505628 KEYWORDS:: Shape memory alloys, time discretization, error estimates EMAIL:: ulisse@dimat.unipv.it
MCSE Training Guide (70-217)
Authors: Scrimger Bersinic, Damir Bersinic
Venue:  (2002)

:MCSE Training Guide (70-217): Windows 2000 Active Directory Services Infrastructure, Second Edition is the perfect study guide to help readers pass one of the four core exams in Microsoft's 2000 certification program. This certification exam measures the ability to install, configure, and troubleshoot the Windows 2000 Active Directory™ components, DNS for Active Directory, and Active Directory security solutions. In addition, this test measures the skills required to manage, monitor, and optimize the desktop environment by using Group Policy. Readers preparing for this exam find the Training Guide series to be the most successful self-study tool in the market. This book is their one-stop shop because of its teaching methodology, the accompanying testing software, and superior Web site support.The CD features PrepLogic™ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam and full, detailed explanations of correct and incorrect answers.
Characterizations of Consistent Marked Graphs
Authors: Roberts Fred, Xue Shaoji
Venue:  (1999)

A marked graph is a graph with a + or - sign on each vertex and is called consistent if each cycle has an even number of - signs. This concept is motivated by problems of communication networks and social networks. We present some new characterizations/recognition algorithms for consistent marked graphs.
Mutual Anonymity Protocols for Hybrid Peer-to-Peer Systems
Authors: Li Xiao, Zhichen Xu, Xiaodong Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In a hybrid peer-to-peer (P2P) system, some operationsare intentionally centralized, such as indexing of peers' files.We present several protocols to achieve mutual communicationanonymity between an information requester and aprovider in a hybrid P2P information-sharing environmentwith trusted index servers such that neither the requester,nor the provider can identify each other, and no other peerscan identify the two communicating parties with certainty.Some existing protocols provide solutions to achieve mutualanonymity in pure P2P systems without any trusted centralcontrols. Compared with two representative protocols, ourproposed mutual anonymity protocols improve efficiency byutilizing trusted third parties and aiming at both reliabilityand low-cost. We show that with some limited central support,our protocols can accomplish the goals of anonymity,efficiency, and reliability. We have evaluated our techniquesin a browser-sharing environment. We show that the averageincrease in response time caused by our protocols is trivial,and these protocols show advantages over existing protocolsin a hybrid P2P system.
The impact of DHT routing geometry on resilience and proximity
Authors: K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, I. Stoica
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, tree-like structures, and butterfly networks. In this paper we focus on how these basic geometric approaches affect the resilience and proximity properties of DHTs. One factor that distinguishes these geometries is the degree of flexibility they provide in the selection of neighbors and routes. Flexibility is an important factor in achieving good static resilience and effective proximity neighbor and route selection. Our basic finding is that, despite our initial preference for more complex geometries, the ring geometry allows the greatest flexibility, and hence achieves the best resilience and proximity performance.
An effective axiomatization for real time ACP
Authors: Wan J. Fokkink, A. S Klusener
Venue:  (1995)

Baeten and Bergstra added real time to ACP, and introduced the notion of integration, which expresses the possibility of an action happening within a time interval. In order to axiomatize this feature, they needed an `uncountable'' axiom. This paper deals with prefix integration, and integration is parametrized by conditions, which are inequalities between linear expressions of variables. We present an axiomatization for process terms, and propose a strategy to decide bisimulation equivalence between process terms, by means of this axiomatization.
{\bf (Revision of CS-1993-27.)} Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments
Authors: Kathleen Romanik, Scott J Vitter
Venue:  (1994)

We examine the complexity of testing different program constructs. We do this by defining a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis dimension, and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine that a program is approximately correct, so by studying it for a class of programs we gain insight into the difficulty of testing the program construct represented by the class. We investigate the VCP-dimension of straight line code, if-then-else statements, and for loops. We also compare the VCP-dimension of nested and sequential if-then-else statements as well as that of two types of for loops with embedded if-then-else statements. Finally, we perform an empirical study to estimate the expected complexity of straight line code.
Circular chromatic number of Kneser graphs
Authors: Hossein Hajiabolhassan, Xuding Zhu
Venue: Journal of Combinatorial Theory Series B (2003)

This paper proves that for any positive integer n, if m is large enough, then the reduced Kneser graph KG2(m,n) has its circular chromatic number equal its chromatic number. This answers a question of Lih and Liu (J. Graph Theory 41 (2002) 62). For Kneser graphs, we prove that if m≥2n2(n - 1), then KG(m,n) has its circular chromatic number equal its chromatic number. This provides strong support for a conjecture of Johnson, Holroyd, and Stahl (J. Graph Theory 26 (1997) 137).
Quaternary Universal-Literal CAM for Cellular Logic Image Processing
Authors: Takahiro Hanyu, Manabu Arakaki, Michitaka Kameyama
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

A new quaternary content-addressable memory (CAM) is proposed for cellular logic image processing. A universal literal in CAM cell is used to compare a quaternary input value with various template patterns simultaneously. The universal-literal cell circuit with quaternary data storage capability can be implemented by just four floating-gate MOS transistors, since the cell function is performed by simple threshold operations together with logic-value conversion. As a result, the effective cell area in the proposed CAM array is reduced to 32 percent in comparison with that in a corresponding binary CAM-based implementation.
Applying the Decorator Pattern for Profiling Object-Oriented Software
Authors: Edward B. Duffy, J. Paul Gibson, Brian A. Malloy
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

A profiler can provide valuable information to a developer to facilitate program optimization, debugging or testing. In this paper, we describe the use of the Decorator pattern for non-intrusive profiling of object-oriented applications. We provide a formal specification of the Decorator pattern, and show that the pattern can be used as a program transformation without altering the external, observable behavior of the system. We refer to such a transformation as a correctness preserving transformation, or CPT. As a CPT, the Decorator pattern can be used to non-intrusively profile object-oriented applications and we illustrate this application with an invariant validator for enforcement of Design by Contract, and for profiling memory. We provide a case study to compare the cost trade-offs of validating invariants at different points in a program.
Meta Updater: An Interactive Tool for Minimal View Updates in Knowledge Bases
Authors: Goce Trajcevski, Jorge Lobo, Naveen Grover
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper presents the design of an interactive tool for minimal updates of views in knowledge bases, while maintaining the consistency, expressed by a set of integrity constraints. Minimality is based on a partial order which captures the distance between the old state, before the update request, and the new state, in which the request is satisfied. On the user interface part, once the schema and the database are selected from the initial menu, the system automatically generates the selection menus and communication boxes to guide the user through the update.
Towards Derivation of Real-Time Process-Control Programs
Authors: Keith Marzullo, Fred B. Schneider
Venue:  (1990)

The use of weakest-precondition predicate transformers in the derivation of sequential, process-control software is discussed. Only one extension to Dijkstra''s calculus for deriving ordinary sequential programs was found to be necessary: function-valued auxiliary variables. These auxiliary variables are needed for reasoning about states of a physical process that exist during program transitions.
An Immune Optimization Inspired by Biological Immune Cell-Cooperation for Division-and-Labor Problem
Authors: Naruaki Toma, Satoshi Endo, Koji Yamada, Ha yao Miyagi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

The purposes of this paper are to propose and evaluate an immune optimizationalgorithm inspired by biological immune cell-cooperation, and this algorithm solvesthe division-of-labor problems in multi-agent system (MAS).The proposed algorithmsolves the problem through interactions between agents, and between agents andenvironment.The interactions is performed by division-and-integrations processinginspired by immune cell-cooperation and like co-evolutionary approach.The division-and-integration processing optimizes the work domain, and the like co-evolutionary approach performs equal divisions.To investigate the validity, thisalgorithm is applied to "N-th agent's Travelling SalesmenProblem" as a typicalproblem of MAS.The good property on solving for MAS will be clarified by somesimulations.
Self-organization through bottom-up coalition formation
Authors: Mark Sims, Claudia V. Goldman, Victor Lesser
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We present a distributed approach to self-organization in a distributed sensor network. The agents in the system use a series of negotiations incrementally to form appropriate coalitions of sensor and processing resources.Since the system is cooperative, we have developed a range of protocols that allow the agents to share meta-level information before they allocate resources. On one extreme the protocols are based on local utility computations, where each agent negotiates based on its local perspective. From there, a continuum of additional protocols exists in which agents base decisions on marginal social utility, the combination of an agent's marginal utility and that of others. We present a formal framework that allows us to quantify how social an agent can be in terms of the set of agents that are considered and how the choice of a certain level affects the decisions made by the agents and the global utility of the organization.Our results show that by implementing social agents, we obtain an organization with a high global utility both when agents negotiate over complex contracts and when they negotiate over simple ones. The main difference between the two cases is mainly the rate of convergence. Our algorithm is incremental, and therefore the organization that evolves can adapt and stabilize as agents enter and leave the system.
Polynomial completeness criteria in finite Boolean algebras
Authors: B. A. Romov
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

For a given finite Boolean algebra with r(r/spl ges/2) atoms we consider the set BF(r) of all polynomials produced by superpositions of the main operations and r atomic constants. Using the isomorphism between BF(r) and P, the arity-calibrated product of r two-valued logic algebras P/sub 2/, and also the description of all maximal subalgebras of P/sub 2//sup r/, we establish a general completeness criterion in BF(r), a Sheffer criterion for a single Boolean function to be a generating element in BF(r), and Slupecki type criterion in BF(r) as well.
Implicit Multigrid Method for Modeling 3-D Laminar Diffusion Flames with NOx Prediction
Authors: C. Liao, Z. Liu, C. Liu
Venue:  (1994)

An implicit multigrid time stepping technique is applied to the laminar diffusion methane-air combustion with detailed description of NOx formation in a 3-D channel. The chemical reaction model is assumed to have 48 species and 229 finite-rate, reversible reaction steps. The computation requires about 90 time steps to reduce the residual by 3 orders of magnitude on a 34 x 18 x 18 grid.
DAG drawing from an information visualization perspective
Authors: Guy Melancon, Ivan Herman
Venue:  (1999)

When dealing with a graph, any visualization strategy must rely on a layout procedure at least to initiate the process. Because the visualization process evolves within an interactive environment the choice of this layout procedure is critical and will often be based on efficiency. This paper compares two popular layout strategies, one based on the extraction of a spanning tree, the other based on edge crossing minimization of directed acyclic graphs. The comparison is made based on a large number of experimental evidence gathered through random graph generation. The main conclusion of these experiments is that, contrary to the popular belief, usage of edge crossing minimization algorithms may be extremely useful and advantageous, even under the heavy requirements of information visualization.
Transactions for Java
Authors: Alex Garthwaite, Scott Nettles
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Jest is a Java VM extended to support transactions and general-purpose persistence. Jest allows Java programmers to manipulate any object using transactions and provides resilience to machine failure for these objects. Jest extends Java's current emphasis on safety and reliability to the safe and consistent management of permanent state.Our additions include syntax for transactions and runtime support for durability and atomicity. General-purpose persistence---the ability to make arbitrary kinds of objects persistent---is a key aspect of the design. We provide orthogonal persistence in which any object can be made persistent without regard to type. We do this using persistence-by-reach_ability, in which an object becomes persistent if it is reachable from a special persistent root.An important aim of our implementation is to explore the techniques and tradeoffs that arise when implementing persistence in a runtime system based on mark-and-compact collection. Having previously studied designs based on copying collection, this work allows us to explore additional parts of the persistence design space. Details of the implementation are provided in the paper.We have tested Jest on a debit-credit benchmark derived from TPC-B. Our system achieves a rate of 83 TPS, very close to the limits allowed by our disk and underlying logging system. Tests of the Java compiler compiling itself both with and without our extensions, suggest that, for applications that do not use transactions, our extensions result in a slowdown of about 7% compared to the original Java implementation. We suggest several possible ways of improving this result.
Online strategies for dynamic power management in systems with multiple power-saving states
Authors: Sandy Irani, Sandeep Shukla, Rajesh Gupta
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

Online dynamic power management (DPM) strategies refer to strategies that attempt to make power-mode-related decisions based on information available at runtime. In making such decisions, these strategies do not depend upon information of future behavior of the system, or any a priori knowledge of the input characteristics. In this paper, we present online strategies, and evaluate them based on a measure called the competitive ratio that enables a quantitative analysis of the performance of online strategies. All earlier approaches (online or predictive) have been limited to systems with two power-saving states (e.g., idle and shutdown). The only earlier approaches that handled multiple power-saving states were based on stochastic optimization. This paper provides a theoretical basis for the analysis of DPM strategies for systems with multiple power-down states, without resorting to such complex approaches. We show how a relatively simple "online learning" scheme can be used to improve the competitive ratio over deterministic strategies using the notion of "probability-based" online DPM strategies. Experimental results show that the algorithm presented here attains the best competitive ratio in comparison with other known predictive DPM algorithms. The other algorithms that come close to matching its performance in power suffer at least an additional 40&percnt; wake-up latency on average. Meanwhile, the algorithms that have comparable latency to our methods use at least 25&percnt; more power on average.
Studying the Impact of Gate Tunneling on Dynamic Behaviors of Partially-Depleted SOI CMOS Using BSIMPD
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this work, we investigate and analyze the impact of gate tunneling on dynamic behaviors of partially depleted SOI CMOS with the aid of the physically accurate BSIMPD model. We examine in particular the impact of gate tunneling on the history dependence of inverter delays. The examination reveals key requirements for capturing the history effect in SPICE modeling. This study suggests that gate tunneling has a strong impact on the delay range and should be considered in SOI circuit simulation. It is crucial for circuit designers to understand and contain the hysteretic delay variations caused by gate current. An accurate SPICE model that includes the oxide tunneling mechanism should be used to quantify the effect without undermining the performance benefit of a partially depleted SOI technology. BSIMPD is one model that attempts to bridge the gap between advanced SOI technologies and circuit design. With its built-in floating-body, self-heating and body-contact modules, BSIMPD captures SOI-specific effects and therefore is able to raise the design quality of PD SOI chips. BSIMPD has been implemented in Berkeley SPICE3f4 and other commercial SPICE simulators. It may also be the basis for computing the look-up tables used for higher-level timing simulation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player