ppxscal/embedding_network huggingface dataset:
A Hybrid Reputation Model Based on the Use of Organizations
Authors: Viviane Torres Silva, Ramón Hermoso, Roberto Centeno
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

In this paper we present a hybrid reputation model focused on organizational structures that attempts to solve problems associated with both centralized and decentralized reputation models. Agents in our approach are able not only to evaluate the behavior of others and store reputations values but also to send such information to a centralized mechanism and ask for reputations to this one and to other agents. The main objective of our approach is to allow agents to reason about the reputation values that they receive. Therefore, together with the reputation values, agents store and send information about norms violated and fulfilled and about the facts that contributed to such behavior. Furthermore, this model provides two different types of reputations, as service provider that is related to the behavior of an agent while providing a service to other agents and as reputation source that is related to the behavior of an agent while providing reputation of others.
Timing-driven N-way decomposition
Authors: David Baneres, Jordi Cortadella, Mike Kishinevsky
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techniques to reduce the depth of the netlist due to the affordable computational cost. We present a novel n-way decomposition technique that improves bi-decomposition. The problem of decomposition is formulated as a Boolean relation which captures a larger set of possible solutions compared to bi-decomposition. The solution obtained from the Boolean relation improves the delay with near-zero cost in area. As it is shown on the experimental results, a considerable improvement is achieved on large netlists and even larger depending on which technology mapper is used.
Lie Groups and Lie Algebras: Chapters 7-9 (Elements of Mathematics)
Authors: Nicolas Bourbaki
Venue:  (2008)

This is the softcover reprint of the English translation of Bourbaki's text Groupes et Algbres de Lie, Chapters 7 to 9. It completes the previously published translations of Chapters 1 to 3 (3-540-64242-0) and 4 to 6 (978-3-540-69171-6) by covering the structure and representation theory of semi-simple Lie algebras and compact Lie groups. Chapter 7 deals with Cartan subalgebras of Lie algebras, regular elements and conjugacy theorems. Chapter 8 begins with the structure of split semi-simple Lie algebras and their root systems. It goes on to describe the finite-dimensional modules for such algebras, including the character formula of Hermann Weyl. It concludes with the theory of Chevalley orders. Chapter 9 is devoted to the theory of compact Lie groups, beginning with a discussion of their maximal tori, root systems and Weyl groups. It goes on to describe the representation theory of compact Lie groups, including the application of integration to establish Weyl's formula in this context. The chapter concludes with a discussion of the actions of compact Lie groups on manifolds. The nine chapters together form the most comprehensive text available on the theory of Lie groups and Lie algebras.
The control data loosely coupled network lower level protocols
Authors: William C. Hohn
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The Control Data Loosely Coupled Network (LCN) provides a form of two-party cooperative communications, similar to that described by Enslow (1). Put another way, LCN acts as an agent for Multi-Mainframing and distributed processing by providing a means for interconnection of, and information exchange amongst, a collection of mainframes or mainframes and peripherals (all referred to as "hosts" in the remainder of this paper).
Here's the Beef: Answer Set Programming !
Authors: Torsten Schaub
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

At the occasion of the Third International Conference on Principles of Knowledge Representation and Reasoning [1] in 1992, Ray Reiter delivered an invited talk entitled "Twelve Years of Nonmonotonic Reasoning Research: Where (and What) Is the beef?", reflecting the state and future of the research area of Nonmonotonic Reasoning (NMR;[2]).Ray Reiter describes it in [3] as a "flourishing subculture" making many outside researchers "wonder what on earth this stuff is good for." Although he seemed to be rather optimistic about the future of NMR, he nonetheless saw its major contribution on the theoretical side, providing "important insights about, and solutions to, many outstanding problems, not only in AI but in computer science in general." Among them, he lists "Logic Programming implementations of nonmonotonic reasoning"
Three Dimensional Wavelet Transform Video Compression
Authors: Ian K. Levy, Roland Wilson
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A new approach to vector quantizer (VQ) codebook design for video data compression is described. This is based on the notion that symmetries in the data, which are seldom captured exactly in any training dataset, are both important perceptually and can lead to a more robust and effective codebook. The idea is illustrated using a 3-d wavelet transformed video sequences. After discussing the relevant symmetries, a codebook design method is presented, based on a modification of the Linde-Buzo-Gray algorithm. This is applied to various video sequences. Comparisons drawn with other work in the area demonstrate that the scheme has potential and is worthy of further investigation.
Hierarchical state machine architecture for regular expression pattern matching
Authors: Cheng-Hung Lin, Hsien-Sheng Hsiao
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Regular expression has been widely used in network intrusion detection system to represent attack patterns due to its expressive power and flexibility. However, the traditional memory architecture suffers from the problem of memory explosion for certain types of complex regular expressions. In this paper, we propose a hierarchical state machine architecture which can significantly reduce the memory required to accommodate complex regular expression patterns. The experiments demonstrate a significant reduction in memory for the complex regular expression patterns commonly used in network intrusion detection systems.
Overlapping Non-dedicated Clusters Architecture
Authors: Martin Štava, Pavel Tvrdík
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Non-dedicated computer clusters promise more efficient resource utilization than conventional dedicated clusters. Existing non-dedicated clustering solutions either expect trust among participating users, or they do not take into account a possibility of running multiple independent clusters on a same set of computers.In this paper, we argue how an ability to run multiple independent clusters without requiring trust among participating users can be capitalized to increase user experience and thus attract more users to participate in the cluster. A generic extension of non-dedicated clusters that satisfies these requirements is defined and a feasibility of one particular extension is demonstrated on our implementation.
Rule-based multi-query optimization
Authors: Mingsheng Hong, Mirek Riedewald, Christoph Koch, Johannes Gehrke, Alan Demers
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together than independently, because it is often possible to share state and computation. Motivated by this observation, various Multi-Query Optimization (MQO) techniques have been proposed. However, these approaches suffer from two limitations. First, they focus on very specialized workloads. Second, integrating MQO techniques for CQL-style stream engines and those for event pattern detection engines is even harder, as the processing models of these two types of stream engines are radically different. In this paper, we propose a rule-based MQO framework. This framework incorporates a set of new abstractions, extending their counterparts, physical operators, transformation rules, and streams, in a traditional RDBMS or stream processing system. Within this framework, we can integrate new and existing MQO techniques through the use of transformation rules. This allows us to build an expressive and scalable stream system. Just as relational optimizers are crucial for the success of RDBMSes, a powerful multi-query optimizer is needed for data stream processing. This work lays the foundation for such a multi-query optimizer, creating opportunities for future research. We experimentally demonstrate the efficacy of our approach.
Research on the interaction between RMB interest rate, exchange rate fluctuations and Chinese capital market
Authors: Mingliang Li, Xinhui Zhou
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

The interest rate and exchange rate fluctuations have very significant impacts on the domestic economy and capital market development. Adopted from the traditional theory such as the interest rate parity, capital flow theory and the classical theory of IS-LM model, the paper does an in-depth theoretical and empirical research and analysis on the interaction and complex relationship among the three aspects of RMB interest rates, RMB appreciation and securities prices when they change. Research shows that there are strong correlations between Chinese foreign exchange market, money market and stock market; with the RMB appreciation and interest rate increase, the capital accumulation effect and stock assets revaluation effect will promote the overall price level of Chinese Capital market rising. At the same time, in view of the less flexibility in current RMB interest rate and exchange rate, and the reverse impacts between currency appreciation and interest rates, we expect that the effect from RMB appreciation on the capital market will be weakened compared to the past situation of yen appreciation. However, due to the effect that the RMB appreciation is expected to form some international hot money flows, which maybe form a Chinese economic bubble, this trends can not be neglected, it should be did to maintain a high vigilance and to cautiously deal with the relationship between the RMB appreciation and interest rates rise particularly.
CTrigger: exposing atomicity violation bugs from their hiding places
Authors: Soyeon Park, Shan Lu, Yuanyuan Zhou
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violation bugs are common and important. Existing techniques to detect atomicity violation bugs suffer from one limitation: requiring bugs to manifest during monitored runs, which is an open problem in concurrent program testing. This paper makes two contributions. First, it studies the interleaving characteristics of the common practice in concurrent program testing (i.e., running a program over and over) to understand why atomicity violation bugs are hard to expose. Second, it proposes CTrigger to effectively and efficiently expose atomicity violation bugs in large programs. CTrigger focuses on a special type of interleavings (i.e., unserializable interleavings) that are inherently correlated to atomicity violation bugs, and uses trace analysis to systematically identify (likely) feasible unserializable interleavings with low occurrence-probability. CTrigger then uses minimum execution perturbation to exercise low-probability interleavings and expose difficult-to-catch atomicity violation. We evaluate CTrigger with real-world atomicity violation bugs from four sever/desktop applications (Apache, MySQL, Mozilla, and PBZIP2) and three SPLASH2 applications on 8-core machines. CTrigger efficiently exposes the tested bugs within 1--235 seconds, two to four orders of magnitude faster than stress testing. Without CTrigger, some of these bugs do not manifest even after 7 full days of stress testing. In addition, without deterministic replay support, once a bug is exposed, CTrigger can help programmers reliably reproduce it for diagnosis. Our tested bugs are reproduced by CTrigger mostly within 5 seconds, 300 to over 60000 times faster than stress testing.
A High Fidelity Contrast Improving Model Based on Human Vision Mechanisms
Authors: Toshikazu Kato, Yuichi Kobayashi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, we propose a computational model of adjusting color contrast and luminance contrast non-linearly, dynamically and adaptively based on the image content. It uses lateral inhibition mechanism and adaptation (light/dark, color)mechanisms. Our model can improve the appearance of an image naturally, both locally and globally at the same time. Our transformation shows a reverse-S-shape response, with the curvature being determined based on the content characteristics of each individual image. We demonstrate the performance by image enhancement experiments. It shows a good performance in not only luminance, but also chromaticity. Our model and transformation can be applied to many fields, especially storing or repairing images of art or cultural heritage, because it can improve images preserving original subjective impression.
K-means Optimization Algorithm for Solving Clustering Problem
Authors: Jinxin Dong, Minyong Qi
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The basic K-means is sensitive to the initial centre and easy to get stuck at local optimal value. To solve such problems, a new clustering algorithm is proposed based on simulated annealing. The algorithm views the clustering as optimization problem, the bisecting K-means splits the dataset into k clusters at first, and then run simulated annealing algorithm using the sum of distances between each pattern and its centre based on bisecting K-means as the aim function. To avoid the shortcomings of simulated annealing such as long computation time and low efficiency, a new data structure named sequence list is given. The experiment result shows the feasibility and validity of the proposed algorithm.
Performance testing based on test-driven development for mobile applications
Authors: Heejin Kim, Byoungju Choi, Seokjin Yoon
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Due to the tight schedule of product development for mobile applications and lack of performance testing methods, the product-oriented performance testing that is mostly done in the end of the development shows problems such as identifying a cause of detected faults, tracking down and modifying the faults when faults occur. The importance of testing is emphasized in TDD and the automated test framework is supported for efficient software development with unit tests. In this paper, we propose the methods of performance testing based on test-driven development with regard to non-functional factors as well as functionality of software during the software development process by advancing performance testing to the development stage and introduce a testing tool that assists performance testing on software development phase. It provides automation of test case generation and test execution at unit test level. It will eventually improve the development productivity as well as the reliability and quality of mobile applications by reducing the time and cost to execute tests in the process of the entire mobile applications development and helping to detect faults.
Influence of the AlN molar fraction on the structural and optical properties of praseodymium-doped AlxGa1-xN (0≤x≤1) alloys
Authors: M. Peres, S. Magalhães, N. Franco, M. J. Soares, A. J. Neves, E. Alves, K. Lorenz, T. Monteiro
Venue: Microelectronics Journal (2009)

The effects of the AlN molar fraction on structural and optical properties of praseodymium implanted Al"xGa"1"-"xN (0=^3H"5 (526nm) and ^3P"0->^3F"2 (652nm) transitions of the Pr^3^+ ion. The red emission peak position shifts to lower energies with increasing Al content in the alloys. The peak full-width at half-maximum increases with the Al content up to x=0.7 due to disorder effects. The implantation damage and Pr-incorporation was investigated by Rutherford backscattering spectrometry doing channelling measurements along the direction. X-ray diffraction reciprocal space maps show an expansion of the c lattice parameter in the implanted region which is reversed after thermal annealing at 1300^oC.
Automatic Generation of Error Messages for the Symbolic Execution of EB3 Process Expressions
Authors: Jérémy Milhau, Benoît Fraikin, Marc Frappier
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

This paper describes an algorithm to automatically generate error messages for events refused by a process expression. It can be used in the context of an information system specified with the EB3 method. In this method, a process expression is used to describe the valid traces of events that the information system must accept. If a user submits an event which is rejected by this process expression, our algorithm produces an error message explaining why the event has been rejected; it also suggests which event should be submitted in order to correct the error.
Performance Evaluation on Uniform Interactive Markov Chains
Authors: Xiying Zhao
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The models we considered in this paper are uniformed nondeterminism interactive Markov chains (IMCs). To give the performance specification of IMCs, we first give an algorithm to compute the optimize path probability to reach a set of goal states within a given time bound on an IMC MD, which describing until operator. Using an action-based logic called aCSL the properties of interesting over the IMCs models are described. The correctness of our describing method is proved. It is an extension of performance evaluation pure continue-time Markov chains.
A Game-Theoretic Analysis of Games with a Purpose
Authors: Shaili Jain, David C. Parkes
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We present a simple game-theoretic model for the ESP game, an interactive game devised to label images on the web, and characterize the equilibrium behavior of the model. We show that a simple change in the incentive structure can lead to different equilibrium structure and suggest the possibility of formal incentive design in achieving desirable system-wide outcomes, complementing existing considerations of robustness against cheating and human factors.
Another approach for the teaching of the foundations of programming using UML and Java
Authors: Rafael Rivera-Lopez, Estela Rivera-Lopez, Abelardo Rodriguez-Leon
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

This paper presents one proposal for teaching the foundations of object oriented programming using the Unified Modeling Language (UML) as one modeling language and Java as one object oriented programming language. Unlike other approaches where only two types of UML diagrams are used with the intention of transferring them to a codification (class diagram and sequence diagram, or class diagram and statechart diagram), this proposal uses tree types of UML diagrams: class diagram, sequence diagram and activity diagram, for modeling basic programming problems. This is with the intention of facilitating to the student the transition between the diagrams used to model one solution and its final codification in one programming language.
D&eacute;monstration: autonomie et plaisir d'usage d'un EIAH
Authors: Magali Jobert, Gabriel Michel
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

Taking into account the affects in Intelligent Tutoring Systems for a children with cognitive handicapped, includes concepts such as autonomy, pleasure to use and reducing the frustration of learners.
Competition with clone: an analysis of the role of illegal copy
Authors: Jhung-Soo Hong, Jae-Cheol Kim
Venue: Netnomics (2008)

The efficiency of a market depends on the amount of information about products available to buyers. However, an information goods market is not an efficient market because information goods are mostly experience goods. We suggest that illegal copying can be an efficient information channel to account for the problem. We also suggest that partially enforced copyright protection may encourage the competition between the original information goods and illegally copied goods that benefits not only customers but also producers.
Simulation analysis of cluster tool operations in wafer fabrication
Authors: Amit Kumar Gupta, Peter Lendermann, Appa Iyer Sivakumar, John Priyadi
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Cluster tools have been one of the proposed alternatives to improve operations performance in semiconductor fabrication. The benefits include high yield throughput, less contamination and less human involvement. Perkinson et al. (1994, 1996) developed analytical models to predict the minimum theoretical time required to complete the cycle in a cluster tool. This paper addresses the verification of these analytical models using simulation. Two simulation models were developed -- one with simple configuration and another one that incorporates parallel chambers. The implementation of parallel chambers for the longest process in the cluster tool is tested as the potential area of performance improvement.
A novel framework for efficient automated singer identification in large music databases
Authors: Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan
Venue: ACM Transactions on Information Systems (TOIS) (2009)

Over the past decade, there has been explosive growth in the availability of multimedia data, particularly image, video, and music. Because of this, content-based music retrieval has attracted attention from the multimedia database and information retrieval communities. Content-based music retrieval requires us to be able to automatically identify particular characteristics of music data. One such characteristic, useful in a range of applications, is the identification of the singer in a musical piece. Unfortunately, existing approaches to this problem suffer from either low accuracy or poor scalability. In this article, we propose a novel scheme, called Hybrid Singer Identifier (HSI), for efficient automated singer recognition. HSI uses multiple low-level features extracted from both vocal and nonvocal music segments to enhance the identification process; it achieves this via a hybrid architecture that builds profiles of individual singer characteristics based on statistical mixture models. An extensive experimental study on a large music database demonstrates the superiority of our method over state-of-the-art approaches in terms of effectiveness, efficiency, scalability, and robustness.