ppxscal/embedding_network huggingface dataset:
Coalitions and announcements
Authors: Thomas Ågotnes, Hans van Ditmarsch
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitional ability, focusing on what coalitions of agents can achieve by cooperating strategically. In this paper we make a first attempt to bridge these topics by considering the question: "what can a coalition achieve by public announcements?". We propose, first, an extension of public announcement logic with constructs of the form <G>&phi;, where G is a set of agents, with the intuitive meaning that G can jointly make an announcement such that &phi; will be true afterwards. Second, we consider a setting where all agents can make (truthful) announcements at the same time, and propose a logic with a construct <[G]>&phi;, meaning that G can jointly make an announcement such that no matter what the other agents announce, &phi; will be true. The latter logic is closely related to Marc Pauly's Coalition Logic.
A defected ground structure based adaptive modulator covering an UHF RFID band of 908-914MHz
Authors: Jin-Woo Jung, Hyoung Hwan Roh, Jun Seok Park, Yeong Rak Seong, Ha Ryoung Oh, Jun Hyung Kim, Min-Su Kang
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In this paper, simpler and cost-effective way of modulator design using defected ground structure is presented. This is motivated from three benefits that can be obtain from defected ground structure; an extensive resonance, size reduction, excellent stopband characteristic. An extensive resonance via a microstrip ground plane configuration, which includes a varactor diode bridging microstrip transmission line with variable capacitance provision that can be controlled, gives on/off switching and its attenuation level (OOK is a 100%, and which less than 100% can be ASK) that plays the key role of the ASK and OOK modulation process. A varactor diode is under control of a Micro Control Unit that can be controlled by user interface software; therefore, user can monitor communication states while each operational sequence of a varactor diode can be controlled. Sharper phase and more precise data modulation can be achieved after several tuning works and practical trials. A modulation index (about 90 to 93%) with stable tag responses over the target bands (860-to-960MHz, centered 912MHz) was verified through the practical measurements on the RFID reader communication using ASK. And when a modulation index was nearly 99% (approximately 98.8%), this is considered to be an OOK. Overall radio communications are with EPC class-1 Gen2 Type-B and Type-C passive tags, respectively.
Sparse Non-blocking Collectives in Quantum Mechanical Calculations
Authors: Torsten Hoefler, Florian Lorenzen, Andrew Lumsdaine
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

For generality, MPI collective operations support arbitrary dense communication patterns. However, in many applications where collective operations would be beneficial, only sparse communication patterns are required. This paper presents one such application: Octopus, a production-quality quantum mechanical simulation. We introduce new sparse collective operations defined on graph communicators and compare their performance to MPI_Alltoallv. Besides the scalability improvements to the collective operations due to sparsity, communication overhead in the application was reduced by overlapping communication and computation. We also discuss the significant improvement to programmability offered by sparse collectives.
High-Q BZT ceramics for microwave applications
Authors: A. Ioachim, M. I. Toacsan, L. Nedelcu, L. Mihut
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

Ba(Zn1/3Ta2/3)O3 (BZT) ceramics were prepared by solid-state reaction and sintered in air at temperatures in the range 1550-1650 °C, for 2 hours. In order to improve the microwave and millimeter wave properties, annealing treatment at 1400 °C for 10 hours was applied. The long-range order with a 2:1 ratio of Ta and Zn ions on the octahedral positions of the perovskite structure and the vibrational modes were investigated by using XRD and Raman spectroscopy as function of sintering temperature. Presence of small amount of secondary phase, Ba8ZnTa6O24, affects Q factor even in the dense, highly ordered samples. The dielectric parameters were measured in the microwave range by Hakki-Coleman method and were correlated with structural and optical properties. Sintering temperature higher than 1600 °C are required for BZT ceramics in order to obtain low microwave loss (Q x f ∼ 100 THz).
Identifying Similar Subsequences in Data Streams
Authors: Machiko Toyoda, Yasushi Sakurai, Toshikazu Ichikawa
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Similarity search has been studied in a domain of time series data mining, and it is an important technique in stream mining. Since sampling rates of streams are frequently different, and their time period varies in practical situations, the method which deals with time warping such as Dynamic Time Warping (DTW) is suitable for measuring similarity. However, finding pairs of similar subsequences between co-evolving sequences is difficult due to increase of the complexity because DTW is a method for detecting sequences that are similar to a given query sequence.In this paper, we focus on the problem of finding pairs of similar subsequences and periodicity over data streams. We propose a method to detect similar subsequences in streaming fashion. Our approach for measuring similarity relies on a proposed scoring function that incrementally updates a score, which is suitable for data stream processing. We also present an efficient algorithm based on the scoring function. Our experiments on real and synthetic data demonstrate that our method detects the pairs of qualifying subsequence correctly and that it is dramatically faster than the existing method.
Understanding the Power of Abstraction in Patterns
Authors: Linda Rising
Venue: IEEE Software (2007)

This unusual experience report about mining and documenting patterns describes lessons learned from writing a set of patterns. Many times, pattern stories report on an author's expertise and creation of a set of patterns and their application in that area of expertise. When Linda Rising and Mary Lynn Manns were working on a collection of patterns for introducing patterns, they built on their experience and looked to others' successes—uncovering new patterns and seeing examples, stories, and known uses of the patterns they had discovered.After their book Fearless Change: Patterns for Introducing New Ideas was published, Rising produced a patterns hand book for agricultural innovations. This experience gave her a broader and deeper understanding of what they had written. This article is part of a special issue on software patterns.
The estimation of the Barndorff-Nielsen and Shephard model from daily data based on measures of trading intensity
Authors: Carl Lindberg
Venue: Applied Stochastic Models in Business and Industry (2008)

We give a method to fit the Barndorff-Nielsen and Shephard model [J. R. Stat. Soc. Ser. B 2001; 63:167&ndash;241] to daily data. Many researchers have established a connection between volatility and different measures of trading intensity, such as traded volume or number of trades. We benefit from this connection, and propose to use some measure of trading intensity as the volatility in the model in [J. R. Stat. Soc. Ser. B 2001; 63:167&ndash;241]. Our approach gives stable parameter estimates, and it is much easier to implement than the quadratic variation method. The efficiency of our method is illustrated by a statistical analysis on the Ericsson stock from the OMX Stockholmsb&ouml;rsen during an exceptionally turbulent period of five years. The results indicate a good model fit. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Controlling Usage in Business Process Workflows through Fine-Grained Security Policies
Authors: Benjamin Aziz, Alvaro Arenas, Fabio Martinelli, Ilaria Matteucci, Paolo Mori
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

We propose a language for expressing fine-grained security policies for controlling orchestrated business processes modelled as a BPEL workflow. Our policies are expressed as a process algebra that permits a BPEL activity, denies it or force-terminates it. The outcome is evaluates with compensation contexts. Finally, we give an example of these policies in a distributed map processing scenario such that the policies constrain service interactions in the workflow according to the security requirements of each entity participating in the workflow.
Taming Concurrency: A Program Verification Perspective
Authors: Shaz Qadeer
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

Concurrency, as a basic primitive for software construction, is more relevant today than ever before, primarily due to the multi-core revolution. General-purpose software applications must find ways to exploit concurrency explicitly in order to take advantage of multiple cores. However, experience has shown that explicitly parallel programs are difficult to get right. To deliver compelling software products in the multi-core era, we must improve our ability to reason about concurrency.
On iterative refinement/improvement of the solution to an ill conditioned linear system
Authors: Victor Y. Pan
Venue:  (2008)

We study additive preconditioning A &rarr; C = A + UVH for preconditioner UVH of a smaller rank r. The SMW formula A-1 = ( C &ndash; UVH)-1 = C-1 + C-1 U(Ir &ndash; VHC -1U)-1V HC-1 reduces the solution of a linear system Ax = b to better conditioned linear systems with the matrices S = Ir &ndash; VHC-1U and C. The computations preserve the structure and the sparseness of the input matrix A. We compute the matrix W = C-1U with a higher precision by applying iterative refinement/improvement to approximate the matrix W closely as a sum W0+W 1+...+Wk, where the matrices W i are filled with low precision values.We prove that if C-1Fk 1-C-1Fk < 1, where Fk = Ck &ndash; C, Xk = W0 + ... + Wk and X = W , then Xk-X &le;Ou . By applying forward error analysis, we prove that Xk-X X &le;Ou , and by applying backward error analysis that limk&rarr;&infin; Uk-CWk &dvbm0;C&dvbm0;&dvbm0;Wk&dvbm0; =4c1k 1-c&prime;1k cond2Cuu&d1; , where c1(k) and c&prime;1k are linear functions in k.
Stochastic Stabilization of Delayed Neural Networks
Authors: Wudai Liao, Jinhuan Chen, Yulin Xu, Xiaoxin Liao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

By introducing appropriate stochastic factors into the neural networks, there were results showing that the neural networks can be stabilized. In this paper, stochastic stabilization of delayed neural networks is studied. First, a new type Razumikhin-type theorem about stochastic functional differential equations is proposed and the rigid proof is given by using Itô formula, Borel-Contelli lemma etc.. As a corollary of the theorem, a new type Razumikhin-type theorem of delayed stochastic differential equation is obtained. Next, taking the results obtained in the first section as the theoretic basis, the stabilization of the delayed deterministic neural networks is examined. The result obtained in the paper shows that the neural networks can be stabilized so long as the intensity of the random perturbation is large enough. The expression of the random intensity is presented which is convenient to networks' design.
High aspect ratio via metallization for 3D integration using CVD TiN barrier and electrografted Cu seed
Authors: G. Druais, G. Dilliway, P. Fischer, E. Guidotti, O. Lühn, A. Radisic, S. Zahraoui
Venue: Microelectronic Engineering (2008)

3D integration is of high interest to overcome the future challenges that are to be met both by device interconnections and packaging. In between the challenges that are to be met to achieve this process is the via fill when making high aspect ratio vias and barrier and seed deposition layers deposition. In this paper, we showed that we were able to achieve a good continuity with a good conformality for barrier and seed layers in Aspect Ratio 10 vias, using respectively CVD TiN and eG ViaCoat^(TM) Cu seed. The studied vias are 5@mm wide and 50@mm deep. We first demonstrated the continuity of the barrier by performing a HF-dip test on trenches structures and, after having run a DOE to optimize seed layer deposition recipe, we did some early test of via fill to assess the continuity of the barrier/seed stack.
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
Authors: Valery S. Gordon, Alexander A. Tarasevich
Venue: Computers and Operations Research (2009)

In this paper we study the single machine common due date assignment and scheduling problem with the possibility to perform a rate-modifying activity (RMA) for changing the processing times of the jobs following this activity. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs. Placing the RMA to some position in the schedule can decrease the objective function value. Several properties of the problem are considered which in some cases can reduce the complexity of the solution algorithm.
Design and Implement on E-learning Behavior Mine System
Authors: Kebin Huang, Feimin Li, Ming Zhao, Feng Wang, Xiaoshuang Xu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

E-learning is a new learning model. Understand the learner's behavior is the foundation of e-learning. This essay present a Multi-dimensional and Multi-hierarchy model of E-learning behavior, based on this, it designed an E-learning behavior mine system. It used Web Services, data mine and CELTS to implement the system. Through the system, we can master the learner's characteristics and push them with personalized learning materials.
Topic 4: High Performance Architectures and Compilers
Authors: Koen Bosschere, Ayal Zaks, Michael C. Huang, Luis Piñuel
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

This topic deals with architecture design and compilation for high performance systems --- the discovery and support of parallelism at all levels. The areas of interest range from microprocessors to large-scale parallel machines; from general-purpose platforms to specialized hardware (e.g., graphic coprocessors, low-power embedded systems); and from hardware design to compiler technology. On the compilation side, topics of interest include language aspects, program analysis, transformation, automatic extraction of parallelism at all levels, and the interaction between compiler and the rest of the system. On the architecture side, the scope spans system architectures, processor micro-architecture, memory hierarchy, multi-threading, and the impact of emerging trends.
A Logical Approach to Dynamic Role-Based Access Control
Authors: Philippe Balbiani, Yannick Chevalier, Marwa Houri
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

Since its formalization RBAC has become the yardstick for the evaluation of access control formalisms. In order to meet organizational needs, it has been extended along several directions: delegation, separation of duty, history-based access control, etc. We propose in this paper an access control language in which RBAC and all the above-listed extensions can be encoded. In contrast with Cassandra, we have not promoted role management mechanism to first-class citizenship, and have based our model on the assumption that access control systems could be separated into a dynamic part that evolves according to actions performed by users and a static part. We solve in this paper decision problems related to access control for policies expressed in this language.
An Incremental Topology Control Algorithm for Wireless Mesh Networks
Authors: Mani Malekesmaeili, Mehdi Soltan, Mohsen Shiva
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Wireless Mesh Networks (WMNs) with a promising future in wireless backhauling applications have attracted the attention of many network research centers and academic researches. High throughput and low delay as essential requirements of a wireless back-bone network demand new topology control algorithms as well as new optimization metrics. In this paper, a topology control algorithm compliant with the structure of WMNs is proposed, as well as a new metric combining the characteristics of different network layers. The proposed metric is compared with the conventional ones such as distance and interference where even an increase of over 100% in the capacity of the network is presented by applying this metric.
Socio-economic Data Analysis with Scan Statistics and Self-organizing Maps
Authors: Devis Tuia, Christian Kaiser, Antonio Cunha, Mikhail Kanevski
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Distribution of socio-economic features in urban space is an important source of information for land and transportation planning. The metropolization phenomenon has changed the distribution of types of professions in space and has given birth to different spatial patterns that the urban planner must know in order to plan a sustainable city. Such distributions can be discovered by statistical and learning algorithms through different methods. In this paper, an unsupervised classification method and a cluster detection method are discussed and applied to analyze the socio-economic structure of the cantons of Vaud and Geneva in Western Switzerland. The unsupervised classification method, based on Ward's classification and self-organized maps, is used to classify the municipalities of the region and allows to reduce a highly-dimensional input information to interpret the socio-economic landscape of the region. The cluster detection method, the spatial scan statistics, is used in a more specific manner in order to detect hot spots of certain types of activities. The method is applied to the distribution of business managers and working class at the intra-urban scale. Results show the effect of peri-urbanization of the region and can be analyzed in both transportation and social terms.
Rosso Tiziano: A System for User-Centered Exploration and Discovery in Large Image Information Bases
Authors: Giovanni Maria Sacco
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Retrieval in image information bases has been traditionally addressed by two different and unreconciled approaches: the first one uses normal query methods on metadata or on a textual description of each item. The second one works on low-level multimedia features (such as color, texture, etc.) and tries to find items that are similar to a specific selected item. Neither of these approaches supports the most common end-user task: the exploration of an information base in order to find the "right" items. This paper describes a prototype system based on dynamic taxonomies, a model for the intelligent exploration of heterogeneous information bases, and shows how the system implements a new access paradigm supporting guided exploration, discovery, and the seamless integration of access through metadata with methods based on low-level multimedia features. Example interactions are discussed, as well as the major implications of this approach.
A performance study of general-purpose applications on graphics processors using CUDA
Authors: Shuai Che, Michael Boyer, Jiayuan Meng, David Tarjan, Jeremy W. Sheaffer, Kevin Skadron
Venue: Journal of Parallel and Distributed Computing (2008)

Graphics processors (GPUs) provide a vast number of simple, data-parallel, deeply multithreaded cores and high memory bandwidths. GPU architectures are becoming increasingly programmable, offering the potential for dramatic speedups for a variety of general-purpose applications compared to contemporary general-purpose processors (CPUs). This paper uses NVIDIA's C-like CUDA language and an engineering sample of their recently introduced GTX 260 GPU to explore the effectiveness of GPUs for a variety of application types, and describes some specific coding idioms that improve their performance on the GPU. GPU performance is compared to both single-core and multicore CPU performance, with multicore CPU implementations written using OpenMP. The paper also discusses advantages and inefficiencies of the CUDA programming model and some desirable features that might allow for greater ease of use and also more readily support a larger body of applications.
Adaptive Observation Strategies for Forecast Error Minimization
Authors: Nicholas Roy, Han-Lim Choi, Daniel Gombos, James Hansen, Jonathan How, Sooho Park
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Using a scenario of multiple mobile observing platforms (UAVs) measuring weather variables in distributed regions of the Pacific, we are developing algorithms that will lead to improved forecasting of high-impact weather events. We combine technologies from the nonlinear weather prediction and planning/control communities to create a close link between model predictions and observed measurements, choosing future measurements that minimize the expected forecast error under time-varying conditions.We have approached the problem on three fronts. We have developed an information-theoretic algorithm for selecting environment measurements in a computationally effective way. This algorithm determines the best discrete locations and times to take additional measurement for reducing the forecast uncertainty in the region of interest while considering the mobility of the sensor platforms. Our second algorithm learns to use past experience in predicting good routes to travel between measurements. Experiments show that these approaches work well on idealized models of weather patterns.
Schemes for Digital Gift Certificates with Low Computation Complexity
Authors: Ya-Fen Chang, Chin-Chen Chang
Venue: Informatica (2005)

Recently, e-commerce becomes widespread; hence electronic department stores come into being. As a result, Chan and Chang proposed a scheme for digital gift certificates in 2002. Because it is hard to estimate the number of the clients of the electronic department stores, reducing the computation complexity of the electronic department stores becomes an important issue. Due to the need, we propose two schemes for digital gift certificates. Our proposed schemes are very practical since the computation load is light. So the schemes can be applied to the terminals with low computation power.