ppxscal/embedding_network huggingface dataset:
Advanced decision logic in simulation of material flow processing networks
Authors: Douglas A. Bodner, Ke Wang, Sheng Xu
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Material flow processing networks are ubiquitous in modern society. Such networks embody uncertainty, advanced decision logic, and increased performance expectations. As such, they have been subject to analysis by a variety of methods, with one of the most prominent being discreteevent simulation. Simulation enables detailed flow modeling, incorporates uncertainty and allows experiment-based performance assessment. Traditional approaches to simulation are not well-suited to modeling advanced decision logic, though. This paper explores the issue of representing advanced decision logic and presents a reference model for material flow processing networks to support such representations. Implementation issues are discussed, as well.
Research on Multiple Queries Processing Technology in Wide Area Sensor Databases
Authors: Guohua Liu, Shuzhi Zhang, Dongming Zhang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Wide area sensor databases are a hotspot research area internationally at present. The query processing technology in wide area sensor databases is analyzed in detail in this paper. Focusing on the query redundancy problem among multiple queries, the multiple queries processing algorithms are proposed. First of all, it divides these queries into a number of sub-queries equally. Secondly, it constructs a query attribute graph using all the sub-queries and deletes the repeated queries using the eliminating repeated sub-queries algorithm. Finally, it unites the results based on the relations between the query and the sub-queries and gains the query results of users. Theoretical analyses and experimental results demonstrate that the method can dramatically reduce the users' query response times, decrease the messages transferred in the sensor network and improve the utilization ratio of the network bandwidth.
k-set polytopes and order-k Delaunay diagrams
Authors: Dominique Schmitt, Jean-Claude Spehner
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

Given a set S of n points (called sites) in a d-dimensional Euclidean space E and an integer k, 1 \lt k \lt n - 1, we consider three known structures that are defined through subsets of k elements of S: The k-set polytope of S, the order-k Voronoi diagram of S, and its dual, the order-k Delaunay diagram of S. We give a new compact characterization of all-dimensional faces of these three structures through the notions of k-couple and of k-set polytope of a k-couple. We also show that the incidence relations between these faces correspond to inclusion relations between k-couples. These characterizations allow us to give simple proofs of well known relations between the three structures, especially that the d-dimensional order-k Delaunay diagram is the projection of the lower hull of a (d + 1)- dimensional k-set polytope and is the orthogonal dual of the order-k Voronoi diagram.
Context aware systems
Authors: Alois Ferscha
Venue: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (2006)

Pervasive and ubiquitous computing has developed a vision where the "computer" is no longer associated with the concept of a single device or a network of devices, but rather the entirety of situative services originating in a digital world, which are perceived through the physical world. It is expected that services with explicit user input and output will be replaced by a computing landscape sensing the physical world via a huge variety of sensors, and controlling it via a plethora of actuators. Applications and services will therefore have to be greatly based on the notions of context and knowledge, and will have to cope with highly dynamic environments and changing resources. "Context" refers to any information describing the situation of an entity, like a person, a thing or a place.This talk will outline challenges posed by the emerging new models of self-managing systems, i.e. systems able to autonomously become aware of their context, to self-describe their situation e.g. for spontaneous interaction, and to adapt in a self-organizing manner based on the available resources and its performance.
Bridging The Messaging Gap Using Non-Integrated Non-Literal Notions
Authors: Karthick Sankarachary
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Current research in ontology-driven publish/subscribe brokers presupposes that the semantics of events tags along with it, rendering it inapplicable to traditional models. Herein, we explore a non-intrusive modus operandi that relies on overlaying agents across a network of potentially heterogeneous brokers. Firstly, we define a minimalist reference model in terms of topic maps of interesting subjects. Secondly, we create domain-specific agents to eavesdrop on events in such broker models as WS-N, JMS, XMPP, DDS and AMQP. Thirdly, we assemble a topic maps of multiagents that associates brokers having related subjects topic maps, or abstractions thereof. Finally, a workflow conceptualizes subjects of inbound-events as per its topic maps, finds compatible subjects in the same or other domains reachable from the agents topic maps, taking care to avoid redundant events, and mediates the content into publishable outbound-events. In addition, content-based routing checks may be performed if subscription metadata is available.
Embedding the Semantic Knowledge in Convolution Kernels
Authors: Kebin Liu, Fang Li, Ying Han, Lei Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Convolution kernels, such as tree kernel and subsequence kernel are useful for natural language processing tasks. However, most of them ignore the semantic knowledge. In order to solve the problem, this paper proposes a new method to embed the semantic knowledge into kernel calculation. The new method has been applied to extract the ORG-affiliation relation from Chinese texts and achieves an average Fmeasure of 82.1%. Comparing with feature-based method and the traditional Word-sequence kernel, it provides significant improvement.
A noise reduction method for chaotic signals
Authors: Lee Chungyong, D. B. Williams
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

An iterative method for reducing noise in contaminated chaotic signals is proposed. This method estimates the deviation of the observed signal from the nearest noise-free signal satisfying the system dynamics in order to get a noise-reduced (or enhanced) signal. To calculate the deviation we minimize a cost function composed of two parts: one containing information that represents how close the enhanced signal is to the observed signal and another including constraints that fit the dynamics of the system. This method has a simple structure and is flexible in the choice of the parts of the cost function. The proposed method is compared with Farmer's method which is known to have good performance in mild signal-to-noise ratios but has a more complex structure.
ByZFAD: a low switching activity architecture for shift-and-add multipliers
Authors: Mohammad D. Mottaghi, Ali Afzali Kusha, Zainanabedin Navabi
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

In this paper, a low-power architecture (ByZFAD Stands for Bypass Zero, Feed A Directly) for shift-and-add multipliers is proposed. The architecture considerably lowers the switching activity of conventional multipliers. The modifications include the removal of the shift of B register, direct feeding of A to the adder, bypassing the adder whenever possible, using a ring counter instead of the binary counter, and removal of the partial product shift. To show the efficiency of the architecture, we have compared the switching activity of the proposed architecture with that of the conventional architecture for a radix-2 shift-and-add multiplier. The results for a 32-bit multiplier show that, the proposed architecture lowers the total switching activity up to 76% when compared to the traditional architecture.
A design methodology for application-specific networks-on-chip
Authors: Jiang Xu, Wayne Wolf, Joerg Henkel, Srimat Chakradhar
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2006)

With the help of HW/SW codesign, system-on-chip (SoC) can effectively reduce cost, improve reliability, and produce versatile products. The growing complexity of SoC designs makes on-chip communication subsystem design as important as computation subsystem design. While a number of codesign methodologies have been proposed for on-chip computation subsystems, many works are needed for on-chip communication subsystems. This paper proposes application-specific networks-on-chip (ASNoC) and its design methodology. ASNoC is used for two high-performance SoC applications. The methodology (1) can automatically generate optimized ASNoC for different applications, (2) can generate a corresponding distributed shared memory along with an ASNoC, (3) can use both recorded and statistical communication traces for cycle-accurate performance analysis, (4) is based on standardized network component library and floorplan to estimate power and area, (5) adapts an industrial-grade network modeling and simulation environment, OPNET, which makes the methodology ready to use, and (6) can be easily integrated into current HW/SW codesign flow. Using the methodology, ASNoC is generated for a H.264 HDTV decoder SoC and Smart Camera SoC. ASNoC and 2D mesh networks-on-chip are compared in performance, power, and area in detail. The comparison results show that ASNoC provide substantial improvements in power, performance, and cost compared to 2D mesh networks-on-chip. In the H.264 HDTV decoder SoC, ASNoC uses 39&percnt; less power, 59&percnt; less silicon area, 74&percnt; less metal area, 63&percnt; less switch capacity, and 69&percnt; less interconnection capacity to achieve 2X performance compared to 2D mesh networks-on-chip.
Coloured peak algebras and Hopf algebras
Authors: Nantel Bergeron, Christophe Hohlweg
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

For G a finite abelian group, we study the properties of general equivalence relations on G n = G n ¿ $${\mathfrak S}$$ n , the wreath product of G with the symmetric group $${\mathfrak S}$$ n , also known as the G-coloured symmetric group. We show that under certain conditions, some equivalence relations give rise to subalgebras of $${\Bbbk}$$ G n as well as graded connected Hopf subalgebras of ¿ n¿ o $${\Bbbk}$$ G n . In particular we construct a G-coloured peak subalgebra of the Mantaci-Reutenauer algebra (or G-coloured descent algebra). We show that the direct sum of the G-coloured peak algebras is a Hopf algebra. We also have similar results for a G-colouring of the Loday-Ronco Hopf algebras of planar binary trees. For many of the equivalence relations under study, we obtain a functor from the category of finite abelian groups to the category of graded connected Hopf algebras. We end our investigation by describing a Hopf endomorphism of the G-coloured descent Hopf algebra whose image is the G-coloured peak Hopf algebra. We outline a theory of combinatorial G-coloured Hopf algebra for which the G-coloured quasi-symmetric Hopf algebra and the graded dual to the G-coloured peak Hopf algebra are central objects.
Kernel Hetero-associative Memory for Robust Face Recognition
Authors: Bai-ling Zhang
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Associative memory models have been studied as efficient paradigm for visual information processing. In this paper we investigate a new hetero-associative memory (HAM) model based on the Kernel Partial Least Square (KPLS) regression recently proposed in the literature. Steming from the Partial Least Square (PLS) regression, a class of techniques for modeling relations between blocks of observed variables by means of latent variables, kernelized PLS methods have proved to be efficient in treating nonlinear data. By establishing the relations between sets of observed variables, KPLS can provide a general purpose HAM model, which construct nonlinear regression models in possibly high-dimensional feature spaces and uses a few latent factors to account for most of the variations in the response. For face recognition problem, we apply the HAM model to efficiently characterize each subject by relating some possible variations of a face image to a given face, using a modular strudcture by assigning an independent model to each subject. Several benchmark face databases have been used to test the performance.
Proceedings of the 2nd international workshop on Computer vision meets databases
Venue: ACM International Conference Proceeding Series; Vol. 160 (2005)

This second edition of the Computer Vision meets Databases (CVDB) workshop is held in Baltimore, MD, USA, on June 17, 2005. The workshop is sponsored by ACM and together with other innovative workshops CVDB is co-located with the Symposium on Principles of Database System (PODS) and the ACM SIGMOD International Conference on Management of Data. For decades, the computer vision community has been working on content-based multimedia retrieval. Researchers from that community aim at defining better content-based descriptors and extracting them from images. The descriptors obtained are often represented as points in multi-dimensional spaces and some metrics are used during similarity retrieval. Their focus is on increasing the recognition power of their schemes and they usually evaluate their strength using data sets that fit in main memory because they try to avoid the secondary storage management burden.Facilitating the management of very large amounts of data and removing this disk burden has long been a strong motivation for the database community. This is particularly crucial for multimedia databases whose sizes grow very fast. As such, researchers in databases have proposed many smart multidimensional indexing schemes with some elegant algorithms to compute Nearest-Neighbor and Top-N queries.Yet, it is surprising to see that only few works in the computer vision community have adopted any of these indexing schemes. A common reason evoked is that the description schemes that database researchers use are way too simplistic. Therefore, it is hard for computer vision researchers to foresee how indexes could behave when used with a modern and powerful description scheme. Additional reasons given include the assumptions on the distribution of data, the ability to only retrieve the single nearest neighbor of query points, and the use of approximate search schemes that give little clue as to the quality of the returned results.The goal of' this workshop is to bridge this gap between the two communities. The idea is to provide database researchers with a snapshot of what computer vision people are dealing with and vice-versa, with the aim of' defining some research directions that can benefit both communities. There is great expertise on both sides, and this workshop is aimed at sharing it by means of tutorials and presentations.
An algebraic array shape inference system for MATLAB&reg;
Authors: Pramod G. Joisha, Prithviraj Banerjee
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2006)

The problem of inferring array shapes ahead of time in languages that exhibit both implicit and dynamic typing is a critical one because the ramifications of its solution are the better organization of array storage through compaction and reuse, and the generation of high-performance code through specialization by shape. This article addresses the problem in a prototypical implicitly and dynamically typed array language called MATLAB. The approach involves modeling the language's shape semantics using an algebraic system, and applying term rewriting techniques to evaluate expressions under this algebra. Unlike prior efforts at array shape determination, this enables the deduction of valuable shape information even when array extents are compile-time unknowns. Furthermore, unlike some previous methods, our approach doesn't impose monotonicity requirements on an operator's shape semantics. The work also describes an inference methodology and reports measurements from a type inference engine called MAGICA. In a benchmark suite of 17 programs, the shape inference subsystem in MAGICA detected the equivalence of over 61&percnt; of the symbolic shapes in six programs, and over 57&percnt; and 37&percnt; of the symbolic shapes in two others. In the remaining nine programs, all array shapes were inferred to be compile-time constants.
Patterns of Brain Activity during Visual Imagery of Letters
Authors: Tommi Raij
Venue: Journal of Cognitive Neuroscience (1999)

Cortical signals associated with visual imagery of letters were recorded from 10 healthy adults with a whole-scalp 122-channel neuromagnetometer. The auditory stimulus sequence consisted of 20 different phonemes corresponding to single letters of the Roman alphabet and of tone pips (17%), delivered once every 1.5 sec in a random order. The subjects were instructed to visually imagine the letter corresponding to the auditory stimulus and to examine its visuospatial properties: The associated brain activity was compared with activity evoked by the same stimuli when the subjects just detected the intervening tones. All subjects produced broad imageryrelated responses over multiple cortical regions. After initial activation of the auditory cortices, the earliest imagery-related responses originated in the left prerolandic area 320 msec after the voice onset. They were followed within 70 msec by signals originating in the posterior parietal lobe close to midline (precuneus) and, 100 msec later,in the posterior superior temporal areas, predominantly in the left hemisphere. The activations were sustained and partially overlapping in time. Imagery-related activity in the left lateral occipital cortex was observed in two subjects, and weak late activity in the calcarine cortex in one subject. Real audiovisually presented letters activated multiple brain regions, and task-induced visuospatial processing of these stimuli further increased activity in some of these regions and activated additional areas: Some of these areas were activated during imagery as well. The results suggest that certain brain areas involved in high-level visual perception are activated during visual imagery and that the extent of imageryrelated activity is dictated by the requirements of the stimuli and the task.
The iAPX 286 protection architecture
Authors: Jack Klebanoff
Venue: ACM SIGSMALL Newsletter (1983)

The iAPX 286 is a 16 bit microprocessor introduced by Intel in 1982. Its main features are as follows.1) High performance, 2 to 3 times the performance of the Intel 8086 at equivalent clock speeds.2) A protection architecture that is capable of supporting secure and reliable systems.3) A high performance memory management and protection mechanism (high performance is retained when memory management and protection is turned on).4) Compatibility with the Intel 8086/8088.This article will give an overview of the protection architecture of the Intel iAPX 286.With current software technology, it is not feasible to implement large, or even medium sized, software systems that are completely correct. Generally the number of bugs increases at least linearly with the software size. If a system is to show some robustness its most crucial sections must be protected from less crucial sections. If enforcement of a security policy is the key measure of robustness, then the part of the operating system that enforces security must be small and protected from the rest of the system. Yet one does not want to throw the bulk of the operating system to the wolves; it should be protected from application software.One quickly comes to the conclusion that a traditional two level, user/supervisor, protection architecture is not adequate for supporting secure, high performance, systems. Instead, a Multics-like ring architecture [1] was chosen for the iAPX 286.
Modeling and identification of structure defects in dielectric diodes
Authors: V. M. Bogomol'nyi
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

On electrode surface near of the micropeak tip the high electrical field strength, mechanical stresses concentration and local temperature increase arose. "Lighting-conduction" effect arose therefore. Theory of the first reversible stage of electrical degradation MDM structure formulated on base of analogy in mathematical description of electron transport and hydrodynamic flow. 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
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Authors: Pradeep Varakantham, Ranjit Nair, Milind Tambe, Makoto Yokoo
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms have been proposed to obtain locally or globally optimal policies. Unfortunately, most of these algorithms have either been explicitly designed or experimentally evaluated assuming knowledge of a starting belief point, an assumption that often does not hold in complex, uncertain domains. Instead, in such domains, it is important for agents to explicitly plan over continuous belief spaces. This paper provides a novel algorithm to explicitly compute finite horizon policies over continuous belief spaces, without restricting the space of policies. By marrying an efficient single-agent POMDP solver with a heuristic distributed POMDP policy-generation algorithm, locally optimal joint policies are obtained, each of which dominates within a different part of the belief region. We provide heuristics that significantly improve the efficiency of the resulting algorithm and provide detailed experimental results. To the best of our knowledge, these are the first run-time results for analytically generating policies over continuous belief spaces in distributed POMDPs.
A Grid-Based Architecture for the Composition and the Execution of Remote Interactive Measurements
Authors: Andrea Bagnasco, Arianna Poggi, Anna Marina Scapolla
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper investigates the application of Grid technologies to the execution of remote interactive laboratory measurements. The authors introduce the state-of-art in the field of Grid technologies application to instrument control, and propose an operative model to set up remote interactive measurements. The model implies the abstraction of actual instruments as Grid resources, and the publishing of their main features and functionalities by means of Grid Services. The issues of the interaction with and the integration among the instruments are investigated. The goal is to support composition and execution of remote interactive measurements by instruments connected to different Grid nodes.