ppxscal/embedding_network huggingface dataset:
Scheduling in Fully Buffered Multistage Switching Fabric Based on Round-Robin
Authors: Yue Zhang, Fang Dong, Yuxiang Hu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Current Memory-Space-Memory Clos switching fabric exhibits poor performance under unbalanced traffic. To eliminate the internal congestion within the switching fabric, by taking buffers into the internal links, this paper proposes an alternative Fully Buffered three-stage Clos switching fabric—FBC, which not only provides perfect throughput performance, but also exhibits better delay performance in heavy load by storing cells at the internal buffers. To employ an efficient and simple scheduling process, we provide a scheduling algorithm for FBC which is named Distributed Round-Robin Scheduling algorithm(DRRS). This algorithm takes advantages of high-efficiency of round-robin and is distributed in implementation, which makes the DRRS prone to implement in hardware. At last,the simulation results prove that DRRS is more effective.
Research on Detecting Technology of Rotating Blade Vibration Performance Parameters
Authors: Fajie Duan, Tao Ouyang, Menglin Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Blade tip-timing (BTT) is a promising method for the detection, measurement and analysis of blade vibrations in rotating bladed assemblies. However the BTT data is badly sampled and specialized analysis methods are needed to extract the vibration performance parameters. In this paper, Theoretical derivation is done to the speed-vector-end-track (SVET) method which used in synchronous vibration measuring. Blade vibration detecting experiment has been accomplished successfully on rotating equipment. Vibration performance parameters such as natural frequencies of the rotating blades have been measured with SVET method. The data is analyzed detailedly. And good result is obtained by compared with theory.
Efficient Algorithms for String-Based Negative Selection
Authors: Michael Elberfeld, Johannes Textor
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of S. Then, use these detectors to partition a monitor set M into self and non-self elements. Implementations of this scheme are often impractical because they need exponential time in the size of S to construct D. Here, we consider r-chunk and r-contiguous detectors, two common implementations that suffer from this problem, and show that compressed representations of D are constructible in polynomial time for any given S and r. Since these representations can themselves be used to classify the elements in M, the worst-case running time of r-chunk and r-contiguous detector based negative selection is reduced from exponential to polynomial.
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
Authors: Neng-Fa Zhou
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are used to propagate value exclusions. The bit-vector representation of finite domains facilitates constant-time removal of unsupported values. For n-ary constraints, we propose pair-wise arc consistency (AC), which ensures that each value has a support in the domain of every related variable. Pair-wise AC does not require introducing new problem variables as done in binarization methods and allows for compact representation of constraints. Nevertheless, pair-wise AC is weaker than general arc consistency (GAC) in terms of pruning power and requires a final check when a constraint becomes ground. To remedy this weakness, we propose adopting early checks when constraints are sufficiently instantiated. Our experimentation shows that pair-wise AC with early checking is as effective as GAC for positive constraints.
Combining Topic Information and Structure Information in a Dynamic Language Model
Authors: Pascal Wiggers, Leon Rothkrantz
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

We present a language model implemented with dynamic Bayesian networks that combines topic information and structure information to capture long distance dependencies between the words in a text while maintaining the robustness of standard n-gram models. We show that the model is an extension of sentence level mixture models, thereby providing a Bayesian explanation for these models. We describe a procedure for unsupervised training of the model. Experiments show that it reduces perplexity by 13% compared to an interpolated trigram.
Study on Pressure Loss for a Muffler Based on CFD and Experiment
Authors: Jianhua Fang, Yiqi Zhou, Peigang Jiao, Zaishan Ling
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In this work we present the research on pressure loss for a muffler with CFD method. Through using CFD technique, at a certain engine velocity, the flow field of a muffler is simulated and computed, and the total pressure distribution of gas flow internal the muffler is analyzed. It is opened out that with the inlet velocity increasing, the total pressure loss becomes higher and higher according to parabola law similarly. Finally, the availability of CFD simulation results is proved by practical test. For the pressure loss of the muffler, the simulation result is 3824.8pa, while the practical test result is 4572.26pa, so taking all the influencing factors into account, the error rate is only 19.54%. At the same time, the practical test also demonstrates that the muffler designed has reached up to the mustard of the whole machine, and has been put into use in this type of excavator.
Axiomatization of Credulous Reasoning in Default Logics using Sequent Calculus
Authors: Mihaiela Lupea
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The family of default logics formalize the default reasoning using nonmonotonic inference rules called defaults. In this paper we propose a uniform abstract characterization of credulous default inference associated to all versions (classical, justified, constrained, rational) of propositional default logic using the credulous default sequent calculi. These axiomatic systems combine sequent and anti-sequent calculus rules for propositional logic with reduction rules specific to the application of the defaults.
Proceedings of the Workshop on Parsing German
Venue: ACL Workshops (2008)

Welcome to the ACL Workshop on Parsing German, the first of what we hope will be a long and fruitful series of workshops on this topic. German possesses an interesting set of configurational properties on the syntactic level which make it far less flexible with respect to word order than other free word order languages. Analyses of these properties, which have formed a part of the traditional syntax of German since the early 19th century, only re-entered the mainstream of generative linguistics research within the last twenty years or so. In computational linguistics, however, their realization has varied quite widely: "topological fields" in HPSG-style analyses, multiple parse trees, special constraints on liberation in constraint-based dependency-style analyses, various hybrid "deep/shallow" approaches, and agnostic parameter estimation over graphs. This variation can also acutely be felt in the annotation of German treebanks. Many corpora have historically elected to annotate only a few of the different senses of the term "constituent" inherent to German syntax, resulting in standards that make German appear either more like English or more like Czech. The aim of this workshop was to provide a forum for theoretical discussion as well as a shared task, based on the TIGER and TueBa-D/Z German treebanks, for these various approaches to make their case on empirical grounds. This combination we believe to be essential to balancing the considerations of what structure merits learning versus the ease with which it can be learned. Both treebanks are annotated collections of German newspaper text on similar topics. They are annotated with POS, morphology, phrase structure, and grammatical functions. TueBa-D/Z additionally uses topological fields to describe fundamental word order restrictions in German clauses. The treebanks differ significantly in their annotation schemes, however: while TIGER relies on crossing branches to describe long distance relationships, TueBa-D/Z uses pure tree structures with designated labels for long distance relationships. Additionally, the annotation is TIGER is flat on the phrasal level while TueBa-D/Z annotates phrasal structure more hierarchically. A report on the results of this year's shared task can be found in the final paper of these proceedings.
Service Discovery and Substitution According to Inheritance of Behavior with Invariant Analysis
Authors: Jidong Ge, Hao Hu, Jian Lu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The development of service-oriented applications grows rapidly these years and gains more and more at-tention both from industry and from academe. Service-oriented applications are assembled from building blocks called service components whose profiles are defined by service specifications. When the dynamic changes happen in the service-oriented architectures, the service discovery and substitution should follow the inheritance of behavior so that the systems can be conformance. Inheritance of behavior can be formalized based on both in simple process-algebraic setting and in Petri-net frame-work. In this paper, we presented some necessary/sufficient conditions for the inheritance relations based on the invariant analysis.
XRCE-T: XIP temporal module for TempEval campaign
Authors: Caroline Hagège, Xavier Tannier
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

We present the system we used for the TempEval competition. This system relies on a deep syntactic analyzer that has been extended for the treatment of temporal expressions, thus making temporal processing a complement to a better general purpose text understanding system.
Unsupervised Structure Damage Classification Based on the Data Clustering and Artificial Immune Pattern Recognition
Authors: Bo Chen, Chuanzhi Zang
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

This paper presents an unsupervised structure damage classification algorithm based on the data clustering technique and the artificial immune pattern recognition. The presented method uses time series measurement of a structure's dynamic response to extract damage-sensitive features for the structure damage classification. The Data Clustering (DC) technique is employed to cluster training data to a specified number of clusters and generate the initial memory cell set. The Artificial Immune Pattern Recognition (AIPR) algorithms are integrated with the data clustering algorithms to provide a mechanism for the evolution of memory cells. The combined DC-AIPR method has been tested using a benchmark structure. The test results show the feasibility of using the DC-AIPR method for the unsupervised structure damage classification.
GIS-Based Spatial Distributions and Evolvement Analysis of Urban Affordable Housing: A Case Study
Authors: Zuo Zhang, Jiangfeng Li, Yanzhong Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Foci of this paper are spatial distribution and evolvement of middle or low income families living in urban affordable housing. Base on Geographic Information System (GIS) this paper presents (1) a methodology using Kernel Density Estimation to study the area of middle or low income families living in affordable housing. (2)Under the calculate result of kernel density estimation make spatial distribution analysis, (3) spatial pattern evolvement analysis and (4) comparison of market housing by using isoline map of market housing price. The use of this methodology will be illustrated using the affordable housing of Wuhan in China and affordable housing data collected from 1995 to 2008.
Software Random Number Generation Based on Race Conditions
Authors: Adrian Colesa, Radu Tudoran, Sebastian Banescu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The paper presents a new software strategy for generating true random numbers, by creating several threads and letting them compete unsynchronized for a shared variable, whose value is read-modified-updated by each thread repeatedly. The generated sequence of random numbers consists of the final values of the shared variable.Our strategy is based on the functionality of the operating system's thread scheduler. Different values of the shared variable are obtained because the concurrent threads are preempted at different moments in their execution. We identified some software and hardware factors that make the scheduler generate context switches at unpredictable moments: execution environment, cache misses, the instruction execution pipeline and the imprecision of the hardware clock used to generate timer interrupts.We implemented the strategy on x86 architecture running Linux operating system. The random number sequences obtained pass over 90\% of the NIST tests.
The Design of a Distance Learning and Teaching System Based on Internet
Authors: Du Jiangyi, Niu Yan
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

This paper introduced the design and achievement of a distance learning and teaching system which based on internet. With the development and popularity of the internet, modern distance education emerged as the times require. Because of its opening, interactivity, practicability and instantaneity, the distance education system become one of the most important parts of modern education.
Worst-case optimal conjunctive query answering for an expressive description logic without inverses
Authors: Magdalena Ortiz, Mantas Šimkus, Thomas Eiter
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many authors. In this paper, we present an algorithm for this problem in the DL ALCH which works in exponential time. It improves over previous algorithms which require double exponential time and is worst-case optimal, as already satisfiability testing in ALC is EXPTIME-complete. Furthermore, it shows that inverse roles cause an exponential jump in complexity; as recently shown, the problem is 2EXPTIME- complete for ALCI. The algorithm is based on a technique that compiles knowledge bases into sets of trees of depth 1. It is in coNP under data complexity (i.e., if the taxonomy part and the query are fixed), thus worst-case optimal. An extension from ALCH to DLs with further constructs is possible.
Lightweight Public Key Infrastructure and Service Relation Model for Designing a Trustworthy ONS
Authors: Jing Sun, Huiqun Zhao, Huibing Xiao, Gongzhu Hu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

With the rapidly development and large scale applications of Electronic Product Code (EPC) networks, researchers and customers have turned their attention to the security problems. In this paper, we discuss the design methodology of trustworthy ONS, an Object Naming System of EPC network, and propose an adjusted Public Key Infrastructure (PKI), called LPKI, for trustworthy ONS. It enhances the security of ONS using a new encryption encode/decode strategy of EPC, and improves reliability of the Certificate Authority by a new multiple customer relation model. Our preliminary experiments show that the proposed method does provide the needed security with reasonable performance, and hence is feasible for building trustworthy ONS.
Server virtualization architecture and implementation
Authors: Jeff Daniels
Venue: Crossroads (2009)

Virtual machine technology, or virtualization, is gaining momentum in the information technology community. While virtual machines are not a new concept, recent advances in hardware and software technology have brought virtualization to the forefront of IT management. Stability, cost savings, and manageability are among the reasons for the recent rise of virtualization. Virtual machine solutions can be classified by hardware, software, and operating system/containers. From its inception on the mainframe to distributed servers on x86, the virtual machine has matured and will play an increasing role in systems management.
Simulation Workflow for the Overall Design of Squirrel Cage Induction Machines
Authors: Christian Grabner
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

Successful optimization processes of highly utilized industrial squirrel cage induction machines enforces fast, reliable and accurate design concepts. Therefore, modern numerical finite element calculation procedures, which incorporate moveable rotor parts, non-linear iron saturation effects and realistic geometric properties, have been systematically established and applied to an induction motor in the time-domain for the prediction of several transient and quasi-steady characteristics. The obtained results have been compared with measurements in order to verify the assumptions within the finite element modeling
Attracting ellipsoids and synthesis of oscillatory regimes
Authors: A. S. Gorobtsov, O. E. Grigor'Eva, E. N. Ryzhov
Venue: Automation and Remote Control (2009)

An approach to stabilization of nonlinear oscillations in multidimensional spaces is proposed on the basis of the V.I. Zubov's stability theory for invariant sets. As a special case, the derived controls make it possible to excite self-oscillating regimes in specified state subspaces R 2k ¿ R 2n with simultaneous oscillation damping on Cartesian products R 2n¿2k .
Magic Lantern Guides: Canon EOS 50D Multimedia Workshop
Authors: Lark Books
Venue:  (2009)

Magic Lantern Guides Multimedia WorkshopsThe worlds best photographic package! Magic Lantern Guides and DVDs have always provided the very best, most in-depth coverage of a cameras ins-and-outs. Now, theres even more magic on the market for photographers: the MAGIC LANTERN MULTIMEDIA WORKSHOP. Its a complete class in digital photography with a D-SLR cameraone that enables you to learn the essentials at your own pace, in the comfort in your own home. The attractive package includes:- Specific 80-minute DVD: An authoritative DVD guide made just for your model. Created by photographers for photographers, it covers specific camera features and functions. The format allows you to navigate easily between different topics and review chapters any time.- Taking Great Digital Photos: This full-color, 64-page book gets newcomers to the digital world started right. Packed with picture-taking tips and information on digital file formats, it explains how f/stops and shutter speeds work together to create an exposure, which focal lengths are best for various subjects, and how to get accurate color with white balance.- Great Photos with Your Digital SLR 60-minute DVD: This live-action tutorial demystifies digital shooting, and shows how to compose photos; choose the best picture-quality settings; improve results with the built-in flash; and interpret your histogram. Plus, see when to trust your cameras automatic settingsor change them yourself. - Quick Reference Wallet Card: This laminated take-along is an ideal in-the-field key to camera and menu operations.Theres nothing else like this on the market! 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
Automatic Construction of Complete Abstraction by Abstract Interpretation
Authors: Junyan Qian, Lingzhong Zhao, Guoyong Cai, Tianlong Gu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Abstraction plays a fundamental role in combating state-space explosion in model checking. Firstly, we study how to abstract models of mu-calculus and derive abstractions that are sound, and apply them to abstracting Kripke structures. However, a lack of completeness in the abstract interpretation leads to spurious counterexamples in the abstract model checking. In order to eliminate spurious counterexamples, the paper describes a method for minimally making abstract interpretations complete, and this refined complete abstract domain always exists.
Generating and visualizing a soccer knowledge base
Authors: Paul Buitelaar, Thomas Eigner, Greg Gulrajani, Alexander Schutz, Melanie Siegel, Nicolas Weber, Philipp Cimiano, Günter Ladwig, Matthias Mantel, Honggang Zhu
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

This demo abstract describes the SmartWeb Ontology-based Annotation system (SOBA). A key feature of SOBA is that all information is extracted and stored with respect to the SmartWeb Integrated Ontology (SWIntO). In this way, other components of the systems, which use the same ontology, can access this information in a straightforward way. We will show how information extracted by SOBA is visualized within its original context, thus enhancing the browsing experience of the end user.
Winning Regions of Pushdown Parity Games: A Saturation Method
Authors: Matthew Hague, C. -H. Ong
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the parity condition. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton transformations to compute a fixed-point characterisation of the winning region. We introduce notions of under-approximation (soundness) and over-approximation (completeness) that apply to automaton transitions rather than runs, and obtain a clean proof of correctness. Our algorithm is simple and direct, and it permits an optimisation that avoids an immediate exponential blow up.
Model-based performance prediction for event-driven systems
Authors: Christoph Rathfelder, Samuel Kounev
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.