ppxscal/embedding_network huggingface dataset:
On the Development and Usage of the Market Economy Parametrical Regulation Theory on the Basis of One-Class Mathematical Models
Authors: Abdykappar A. Ashimov, Nurlan A. Iskakov, Yuriy V. Borovskiy, Bahyt T. Sultanov, Askar A. Ashimov
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper offers further development and applications of the theory of a parametrical regulation of market economy evolution. This theory consists of the following sections: formation of a library of economic systems' mathematical models; of rigidness (structural stability) of mathematical models; development of parametrical regulation laws etc. The work contains new results of the considered one class models' rigidness research with and without parametrical regulation.
Verification of Mondex Electronic Purses with KIV: From a Security Protocol to Verified Code
Authors: Holger Grandy, Markus Bischof, Kurt Stenzel, Gerhard Schellhorn, Wolfgang Reif
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

We present a verified JavaCard implementation for the Mondex Verification Challenge. This completes a series of verification efforts that we made to verify the Mondex case study starting at abstract transaction specifications, continuing with an introduction of a security protocol and now finally the refinement of this protocol to running source code. We show that current verification techniques and tool support are not only suitable to verify the original case study as stated in the Grand Challenge but also can cope with extensions of it resulting in verified and running code. The Mondex verification presented in this paper is the first one that carries security properties proven on an abstract level to an implementation level using refinement.
Orbitopal Fixing
Authors: Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the order of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up the branch-and-cut tree.We present a general tool, called orbitopal fixing, for enhancing the capabilities of branch-and-cut algorithms in solving such symmetric integer programming models. We devise a linear time algorithm that, applied at each node of the branch-and-cut tree, removes redundant parts of the tree produced by the above mentioned symmetry. The method relies on certain polyhedra, called orbitopes, which have been investigated in [11]. It does, however, not add inequalities to the model, and thus, it does not increase the difficulty of solving the linear programming relaxations. We demonstrate the computational power of orbitopal fixing at the example of a graph partitioning problem motivated from frequency planning in mobile telecommunication networks.
Internet privacy concerns and beliefs about government surveillance - An empirical investigation
Authors: Tamara Dinev, Paul Hart, Michael R. Mullen
Venue: The Journal of Strategic Information Systems (2008)

This U.S.-based research attempts to understand the relationships between users' perceptions about Internet privacy concerns, the need for government surveillance, government intrusion concerns, and the willingness to disclose personal information required to complete online transactions. We test a theoretical model based on a privacy calculus framework and Asymmetric Information Theory using data collected from 422 respondents. Using LISREL, we found that privacy concerns have an important influence on the willingness to disclose personal information required to transact online. The perceived need for government surveillance was negatively related to privacy concerns and positively related to willingness to disclose personal information. On the other hand, concerns about government intrusion were positively related to privacy concerns. The theoretical framework of our study can be applied across other countries.
Making Allocations Collectively: Iterative Group Decision Making under Uncertainty
Authors: Christian Guttmann
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

A major challenge in the field of Multi-Agent Systems (MAS) is to enable autonomous agents to allocate tasks and resources efficiently. This paper studies an extended approach to a problem we refer to as the Collective Iterative Allocation (CIA) problem. This problem involves a group of agents that progressively refine allocations of teams to tasks. This paper considers the case where the performance of a team is variable and non-deterministic. This requires that each agent is able to maintain and update its probabilistic models using observations of each team's performance. A key result is that each agent needs the capacity to store only two or three observations of a team's performance to find near optimal allocations, and a further increase of this capacity will reduce the number of reallocations significantly.
Testing class libraries for RTSJ safety
Authors: Michael Dawson, Paul Thwaite
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

The addition of new thread types and new memory areas by the Real-Time Specification for Java&trade; (RTSJ) [1] introduces new failure modes for existing class libraries. Existing tests for these class libraries will not cover execution with RTs, NHRTs and with the Immortal and Scoped memory areas. Writing new tests to cover these new cases can take significant time and effort. This paper introduces an approach we call AutoRTUnit that allows us to get test coverage for the new thread types and memory areas by reusing existing JUnit[2] based unit tests. In our case we applied it to expand our test coverage for a subset of the non-RTSJ APIs within our RTSJ-compliant Java virtual machine (JVM).
First hyperpolarizability of 6-vertex carboranes 2. DFT study of NH$_2$/NO$_2$ -substituted 1,2-closo-dicarbahexaboranes
Authors: Kyrill Yu Suponitsky, Tatiana V. Timofeeva
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

The structure and molecular first hyperpolarizability (&beta;) of the nitro-amino-substituted 1,2-dicarba-closo-hexaboranes were investigated at B3LYP/6-31+G(d) level of theory. Conformations with different orientations of the substituents with respect to the carborane cage were considered. It is shown that two factors significantly influence the value of &beta;: orientation of the amino- and nitro-group with respect to the cage, and their mutual orientation. The latter factor appears to be more important. The results obtained have revealed that a carborane substituted at boron atoms is characterized by higher value of the molecular first hyperpolarizability.
Distributed Divide-and-Conquer Techniques for Effective DDoS Attack Defenses
Authors: M. Muthuprasanna, G. Manimaran
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Distributed Denial-of-Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease and low costs of launching such attacks, supplemented by the current woeful state of any viable defense mechanism, have made them one of the top threats to the Internet community today. While distributed packet logging and/or packet marking have been explored in the past for DDoS attack traceback/mitigation, we propose to advance the state of the art by using a novel distributed divide-and-conquer approach in designing a new data dissemination architecture that efficiently tracks attack sources. The main focus of our work is to tackle the three disjoint aspects of the problem, namely attack tree construction, attack path frequency detection, and packet to path association, independently and to use succinct recurrence relations to express their individual implementations. We also evaluate the network traffic and storage overhead induced by our proposed deployment on real-life Internet topologies, supporting hundreds of victims each subject to thousands of high-bandwidth flows simultaneously, and conclude that we can truly achieve single packet traceback guarantees with minimal overhead and high efficiency.
QFCS: A Fuzzy LCS in Continuous Multi-step Environments with Continuous Vector Actions
Authors: José Ramírez-Ruiz, Manuel Valenzuela-Rendón, Hugo Terashima-Marín
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper introduces the QFCS, a new approach to fuzzy learning classifier systems. QFCS can solve the multistep reinforcement learning problem in continuous environments and with a set of continuous vector actions. Rules in the QFCS are small fuzzy systems. QFCS uses a Q-learning algorithm to learn the mapping between inputs and outputs. This paper presents results that show that QFCS can evolve rules to represent only those parts of the input and action space where the expected values are important for making decisions. Results for the QFCS are compared with those obtained by Q-learning with a high discretization to show that the new approach converges in a way similar to how Q-learning does for one-dimension problems with an optimal solution, and for two dimensions QFCS learns suboptimal solutions while it is difficult for Q-learning to converge due to that high discretization.
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
Authors: Andreas Maurer, Massimiliano Pontil
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can be specialized to K-means clustering, nonnegative matrix factorization and the sparse coding techniques introduced by Olshausen and Field.
The Picard contraction mapping method for the parameter inversion of reaction-diffusion systems
Authors: Xiaoyan Deng, Bangju Wang, Guangqing Long
Venue: Computers Mathematics with Applications (2008)

An inverse problem is to determine unknown causes based on observation of their effects. Such problems often arise in scientific research and engineering practice. In this paper we present a parameter inversion method for a class of reaction-diffusion systems by the use of the Picard contraction mapping. We firstly establish an approximate differential equation model which corresponds to the given reaction-diffusion system, and discuss the contractivity of the Picard mapping associated with the approximate model. Then we provide an algorithm for recovering parameters of the reaction-diffusion system based on the Collage theorem. Numerical tests show that the proposed method is efficient.
Transient Boundary Element Method and Numerical Evaluation of Retarded Potentials
Authors: Ernst P. Stephan, Matthias Maischak, Elke Ostermann
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

We discuss the modeling of transient wave propagation with the boundary element method (BEM) in three dimensions. The special structure of the fundamental solution of the wave equation leads to a close interaction of space and time variables in a so-called retarded time-argument. We give a detailed derivation of the discretization scheme and analyse a new kind of "geometrical light cone" singularity of the retarded potential function. Moreover, we present numerical experiments that show these singularities.
A Novel Spatial Clustering Algorithm with Sampling
Authors: Cai-Ping Hu, Xiao-Lin Qin, Jun Zhang
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

Spatial clustering is one of the very important spatial data mining techniques. So far, a lot of spatial clustering algorithms have been proposed. DBSCAN is one of the effective spatial clustering algorithms, which can discover clusters of any arbitrary shape and handle the noise effectively. However, it has also several disadvantages. First, it does based on only spatial attributes, does not consider non-spatial attributes in spatial databases. Secondly, when DBSCAN does handle large-scale spatial databases, it requires large volume of memory support and the I/O cost. In this paper, a novel spatial clustering algorithm with sampling (NSCAS) based on DBSCAN is developed, which not only clusters large-scale spatial databases effectively, but also considers spatial attributes and non-spatial attributes. Experimental results of 2-D spatial datasets show thatNSCAS is feasible and efficient.
Research on the Factors of the Urban System Influenced Post-development of the Olympics' Venues
Authors: Changzheng Liu, Qian Ding, Yao Sun
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Post-development of the Olympics' venues is a big challenge which the Games host cities should face with the continuing development of the Olympic Games. Based on the interactive mechanism between the urban system and the Olympics' venue projects as well as the demand theory, with the relevant statistic materials of the recent Games host cities in the Games year, this paper explores the factors of the urban system which influence post-development of the Olympics' venues, meanwhile, applies two methods of ward cluster analysis and k-mean cluster analysis to verify the validity of the factors, per capita GDP, population, ratio of the service industries of the urban system which influence post-development of the Olympics' venues. And the conclusion is given that these 3 factors are the important determinants of the urban system which support post-development of the Olympics' venues, and also the base of making the strategic and tactical plans to improve the venues after the Games.
Perspective Shape from Shading with Non-Lambertian Reflectance
Authors: Oliver Vogel, Michael Breuß, Joachim Weickert
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In this work, we extend the applicability of perspective Shape from Shading to images incorporating non-Lambertian surfaces. To this end, we derive a new model inspired by the perspective model for Lambertian surfaces recently studied by Prados et al. and the Phong reflection model incorporating ambient, diffuse and specular components. Besides the detailed description of the modeling process, we propose an efficient and stable semi-implicit numerical realisation of the resulting Hamilton-Jacobi equation. Numerical experiments on both synthetic and simple real-world images show the benefits of our new model: While computational times stay modest, a large qualitative gain can be achieved.
Aspect-Oriented Development with Stratified Frameworks
Authors: Colin Atkinson, Thomas Kuhne
Venue: IEEE Software (2003)

Aspect-oriented programming, one of the most promising separation-of-concerns technologies, focuses on concerns that cross-cut a chosen decomposition strategy. Despite its promise, however, AOP has so far failed to make the transition to mainstream software development. The authors describe a strategy, based on architecture stratification, that exploits the advantages of aspect-oriented development in model-driven and component-based frameworks.
Finding a Polytope from Its Graph in Polynomial Time
Authors: Eric J. Friedman
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

We show that one can compute a (simple) polytope from its graph in Polynomial time. This computation of a polytope from its graph was shown to be solvable by Blind and Mani and more recently Kalai provided a simple proof that leads to an exponential time algorithm. Our proof relies on a Primal-Dual characterization by Joswig, Kaibel and Korner. We describe an exponential Linear Programming which can be used to construct the solution and show that it can be solved in polynomial time. 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
A Systematic Approach to Automatically Generate Multiple Semantically Equivalent Program Versions
Authors: Sri Hari Narayanan, Mahmut Kandemir
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

Classic methods to overcome software faults include design diversity that involves creating multiple versions of an application. However, design diverse techniques typically require a staggering investment of time and manpower. There is also no guarantee that the multiple versions are correct or equivalent. This paper presents a novel approach that addresses the above problems, by automatically producing multiple, semantically equivalent copies for a given array/loop-based application. The copies, when used within the framework of common design diverse techniques, provide a high degree of software fault tolerance at practically no additional cost. In this paper, we also apply our automated version generation approach to detect the occurrence of soft errors during the execution of an application.
Phonotactic Recognition of Greek and Cypriot Dialects from Telephone Speech
Authors: Iosif Mporas, Todor Ganchev, Nikos Fakotakis
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

In the present work we report recent progress in development of dialect recognition system for the Standard Modern Greek and Cypriot dialect of Greek language. Specifically, we rely on a compound recognition scheme, where the outputs of multiple phone recognizers, trained on different European languages are combined. This allows achieving higher recognition accuracy, when compared to the one of the mainstream phone recognizer. The evaluation results reported here indicate high recognition accuracy - up to 95%, which makes the proposed solution a feasible addition to existing spoken dialogue systems, such as voice banking applications, call routers, voice portals, smart-home environments, e-Government speech oriented services, etc.
A Steep Thermodynamical Selection Rule for Evolutionary Algorithms
Authors: Weiqin Ying, Yuanxiang Li, Shujuan Peng, Weiwu Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The genetic algorithm (GA) often suffers from the premature convergence because of the loss of population diversity at an early stage of searching. This paper proposes a steep thermodynamical evolutionary algorithm (STEA), which utilizes a steep thermodynamical selection (STS) rule. STEA simulates the competitive mechanism between energy and entropy in annealing to systematically resolve the conflicts between selective pressure and population diversity in GA. This paper also proves that the rule STS has the approximate steepest descent ability of the free energy. Experimental results show that STEA is both far more efficient and much stabler than the thermodynamical genetic algorithm (TDGA).
Temporal Issues and Recognition Errors on the Capitalization of Speech Transcriptions
Authors: Fernando Batista, Nuno Mamede, Isabel Trancoso
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper investigates the capitalization task over Broadcast News speech transcriptions. Most of the capitalization information is provided by two large newspaper corpora, and the spoken language model is produced by retraining the newspaper language models with spoken data. Three different corpora subsets from different time periods are used for evaluation, revealing the importance of available training data in nearby time periods. Results are provided both for manual and automatic transcriptions, showing also the impact of the recognition errors in the capitalization task. Our approach is based on maximum entropy models and uses unlimited vocabulary. The language model produced with this approach can be sorted and then pruned, in order to reduce computational resources, without much impact in the final results.
Framework for Choosing a Set of Syllables and Phonemes for Lithuanian Speech Recognition
Authors: Sigita Laurinčiukaitė, Antanas Lipeika
Venue: Informatica (2007)

This paper describes a framework for making up a set of syllables and phonemes that subsequently is used in the creation of acoustic models for continuous speech recognition of Lithuanian. The target is to discover a set of syllables and phonemes that is of utmost importance in speech recognition. This framework includes operations with lexicon, and transcriptions of records. To facilitate this work, additional programs have been developed that perform word syllabification, lexicon adjustment, etc. Series of experiments were done in order to establish the framework and model syllable- and phoneme-based speech recognition. Dominance of a syllable in lexicon has improved speech recognition results and encouraged us to move away from a strict definition of syllable, i.e., a syllable becomes a simple sub-word unit derived from a syllable. Two sets of syllables and phonemes and two types of lexicons have been developed and tested. The best recognition accuracy achieved 56.67% &plusmn;0.33. The speech recognition system is based on Hidden Markov Models (HMM). The continuous speech corpus LRN0 was used for the speech recognition experiments.
Guest Editor's Introduction: Middleware Works in Progress Papers
Authors: Guruduth Banavar
Venue: IEEE Distributed Systems Online (2003)

This section includes the second batch of six papers that will be presented as Works in Progress papers at the ACM/IFIP/USENIX International Middleware Conference (Middleware 2003)(http://middleware2003.inf.puc-rio.br). These papers, selected by the review committee from a large selection of excellent submissions, are short summaries intended to describe ongoing work and interim results. Please contact the authors for more detailed descriptions of the work described. 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
The Research and Implement of Mean-Quantization-Based Fragile Watermarking in AVS-S Audio Coding
Authors: Bo Hang, RuiMin Hu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The AVS-S standard for security industry requires its audio information must have tamper-proof capability. We researched the fragile watermarking based on mean quantization principle and implement it in AVS-S audio coding. Firstly, a binary image was embedded into audio as the watermarking. The audio with watermarking should have no significant quality decrease. Then attack the audio sequence with a variety of methods. We calculate the watermarking similarity between the retrieved and the original to discover attack actions. The test showed this algorithm can achieve the desired results.