ppxscal/embedding_network huggingface dataset:
Validation of contracts using enabledness preserving finite state abstractions
Authors: Guido de Caso, Victor Braberman, Diego Garbervetsky, Sebastian Uchitel
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Pre/post condition-based specifications are common-place in a variety of software engineering activities that range from requirements through to design and implementation. The fragmented nature of these specifications can hinder validation as it is difficult to understand if the specifications for the various operations fit together well. In this paper we propose a novel technique for automatically constructing abstractions in the form of behaviour models from pre/post condition-based specifications. The level of abstraction at which such models are constructed preserves enabledness of sets of operations, resulting in a finite model that is intuitive to validate and which facilitates tracing back to the specification for debugging. The paper also reports on the application of the approach to an industrial strength protocol specification in which concerns were identified.
Multivariate analysis of structural economic indicators for Croatia and EU 27
Authors: Natasa Kurnoga Zivadinovic, Ksenija Dumicic, Anita Ceh Casni
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

The last (5th) wave of EU enlargement ended on 1st January 2007 with the accession of Romania and Bulgaria. Many countries of the South-Eastern Europe aspire to join the EU. Croatia appears to be the next prospective member, so the aim of this paper was to classify Croatia and EU 27 Member States according to the structural economic indicators. In that sense, the cluster analysis was applied. The mentioned countries were gathered into homogenous groups in terms of the following structural economic indicators: GDP per capita, total employment rate and comparative price levels. The hierarchical cluster analysis and nonhierarchical cluster analysis were applied and gave similar results.
Comparison of microcalcifications detection in digital mammograms using undecimated filter banks
Authors: Osslan Osiris Vergara Villegas, Humberto De Jesús Ochoa Domínguez, Efrén David Gutiérrez Casas, Vianey Guadalupe Cruz Sánchez
Venue: Proceedings of the 2nd conference on European computing conference (2008)

This paper presents the comparisons of five different undecimated filter banks used for microcalcifications detection. The microcalcifications appear as a small number of high intensity pixels compared with their neighbors. As microcalcifications are high frequency signals, detection can be carried out by decomposing the image in several frequency subbands and discarding the subband that carries the lowest frequencies (smoth signals). The reconstruction of the image contains only details of high frequencies. The results obtained show that there is no a substantial difference in the number of detected microcalcification among the several filter banks.
The fourth dimension of information system audit and security
Authors: Akshai Aggarwal, Sujata Kanhere, Vishnu Kanhere, Shankar Kanhere
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Information system audit and control methodologies have come a long way from a small beginning fifty years ago. In a competitive flat world, large non-governmental enterprises affect the society in so many ways that the failure of a large enterprise is not only an issue of interest to its shareholders or its employees but also to the society, at large. The global financial meltdown has shown that ordinary tax-payers have to step in to save such large enterprises by infusing public funds. Today there is no objective metric to measure whether an enterprise has behaved responsibly and whether public funds should be used to save it. In this paper, the authors have proposed that the annual system audit/security function for an enterprise should be expanded to include a focused report on how socially responsible the enterprise has been during the year. The authors have developed a metric, based on Millennium Development Goals for measuring the social responsibility component in the working of an enterprise. The authors propose that this metric be used as the fourth dimension for IS Audit and Security to annually evaluate every enterprise.
Power and performance characteristics of USB flash drives
Authors: Kyle O'Brien, David C. Salyers, Aaron D. Striegel, Christian Poellabauer
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Even though their capacities are still orders of magnitude lower than those of hard disks, flash storage systems are rapidly gaining importance in energy-constrained systems. This paper focuses on USB flash drives, which can provide portable storage to mobile systems or storage to systems that otherwise do not have persistent storage opportunities (e.g., low-power sensor devices). The paper presents studies relating to power consumption, energy overheads and benefits, and performance impacts of USB flash drives. The key insights obtained from these experiments are that (i) read/write costs are not significantly greater than idle costs and (ii) the size of the flash itself has only limited bearing on energy consumption.
Can Ontology Inform Ontologies?
Authors: Boris Wyssusek
Venue: Proceedings of the 7th International Conference on Formal Concept Analysis (2009)

Traditionally, since it was coined in the early 17th century by German school philosophy, the word "ontology" has been used to name a field of metaphysics as well as distinct metaphysical doctrines. Since the 1990s, the word "ontology" appears increasingly in information sciences, and likewise in fields that have been subjected to `informatisation' such as biology, geography, and medicine. In all these fields, however, the word "ontology" is being used with different meanings, and for the most part with meanings that are distant from its philosophical roots. 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 New Theory of Quantifiers and Term Connectives
Authors: Ken Akiba
Venue: Journal of Logic, Language and Information (2009)

This paper sets forth a new theory of quantifiers and term connectives, called shadow theory, which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and ¿-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary, John or Mary, and not both John and Mary, as well as determiner phrases such as every man, some woman, and the boys, are all of semantic type e and denote individual-like objects, called shadows-- conjunctive, disjunctive, or negative shadows, such as John-and-Mary, John-or-Mary, and not-(John-and-Mary). There is no essential difference between quantification and denotation: quantification is nothing but denotation of shadows. Individuals and shadows constitute a Boolean structure. Formal language LSD (Language for Shadows with Distributivity), which takes compound terms to denote shadows, is investigated. Expansions and enrichments of LSD are also considered toward the end of the paper.
Communication Bandwidth of Parallel Programming Models on Hybrid Architectures
Authors: Rolf Rabenseifner
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

Most HPC systems are clusters of shared memory nodes. Parallel programming must combine the distributed memory parallelization on the node inter-connect with the shared memory parallelization inside of each node. This paper introduces several programming models for hybrid systems. It focuses on programming methods that can achieve optimal inter-node communication bandwidth and on the hybrid MPI+OpenMP approach and its programming rules. The communication behavior is compared with the pure MPI programming paradigm and with RDMA and NUMA based programming models.
MetRe: supporting the metadata revision process
Authors: Emma Tonkin
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

MetRe is a prototype interface and service designed to support the metadata revision process. Improving consistency of metadata records within an environment is a common repository management task, due to potential for user error when submitting, as well as of other sources of error, such as systematic error resulting from the chosen deposit process. Evidence to support the metadata correction process may be gathered by automated metadata extraction tools, evidence from within the repository, or by comparison with best practice across the repository landscape. MetRe (Metadata Revision) is a prototype demonstrator that is able to identify several characteristic classes of error, twinned with an interface able to highlight several types of individual and systematic error, including a notion of local (intra-repository) and general (inter-repository) best practice.
A general strategy for designing seamless multiscale methods
Authors: Weinan E, Weiqing Ren, Eric Vanden-Eijnden
Venue: Journal of Computational Physics (2009)

We present a new general framework for designing multiscale methods. Compared with previous work such as Brandt's systematic up-scaling, the heterogeneous multiscale method (HMM) and the ''equation-free'' approach, this new framework has the distinct feature that it does not require reinitializing the microscale model at each macro time step or each macro iteration step. In the new strategy, the macro- and micro-models evolve simultaneously using different time steps (and therefore different clocks), and they exchange data at every step. The micro-model uses its own appropriate time step. The macro-model runs at a slower pace than required by accuracy and stability considerations for the macroscale dynamics, in order for the micro-model to relax. Examples are discussed and application to modeling complex fluids is presented.
Automatic Classification of Wood Defects Using Support Vector Machines
Authors: Irene Y. Gu, Henrik Andersson, Raúl Vicen
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

This paper addresses the issue of automatic wood defect classification. We propose a tree-structure support vector machine (SVM) to classify four types of wood knots by using images captured from lumber boards. Simple and effective features are proposed and extracted by first partitioning the knot images into 3 distinct areas, followed by applying an order statistic filter to yield an average pseudo color feature in each area. Excellent results have been obtained for the proposed SVM classifier that is trained by 800 wood knot images. Performance evaluation has shown that the proposed SVM classifier has resulted in an average classification rate of 96.5% and false alarm rate of 2.25% over 400 test knot images. Our future work includes more extensive tests on large data set and the extension of knot types.
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
Authors: Gu Xu, Shuang-Hong Yang, Hang Li
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially useful in many applications including web search, online advertisement, and recommender system. There are three challenges for the task: finding suitable data source, coping with the ambiguities of named entity classes, and incorporating necessary human supervision into the mining process. This paper proposes conducting NEM by using click-through data collected at a web search engine, employing a topic model that generates the click-through data, and learning the topic model by weak supervision from humans. Specifically, it characterizes each named entity by its associated queries and URLs in the click-through data. It uses the topic model to resolve ambiguities of named entity classes by representing the classes as topics. It employs a method, referred to as Weakly Supervised Latent Dirichlet Allocation (WS-LDA), to accurately learn the topic model with partially labeled named entities. Experiments on a large scale click-through data containing over 1.5 billion query-URL pairs show that the proposed approach can conduct very accurate NEM and significantly outperforms the baseline.
Synthesizable time measurement and test scheme for SoC architecture
Authors: M. Amir Abas
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

This paper presents a Synthesizable high-resolution time measurement and test scheme for digital System on Chip (SoC) application namely Two-Delay Interpolation Method (TDIM). The scheme is designed to measure internal timing parameters in SoC architecture such as jitter, set-up and hold time, delay faults and etc. Simulation result shows the circuit is capable to measure as low as 5 ps timing interval and the range of measurement is programmable using programmable logic core in SoC. The small size of the design makes it eminently suitable for SoC applications, particularly when the accurate measurement of small time intervals are required; a need which is increasing as operational speeds tend toward 100GHz.
Existence and computation of equilibria of first-price auctions with integral valuations and bids
Authors: Guillaume Escamocher, Peter Bro Miltersen, Rocio Santillan R.
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We consider existence and computation of symmetric Pure Strategy Nash Equilibrium (PSNE) in single-item, sealed-bid, first-price auctions with integral valuations and bids. For the most general case, we show that existence of PSNE is NP-hard. Then, we present algorithmic results for the case of independent valuations and two ways of breaking ties: Vickrey tie-breaking and random tie-breaking.
Adobe Premiere Pro CS3 Bible
Authors: Adele Droblas, Seth Greenberg
Venue:  (2007)

Go from the basics to professional video production as you master the ins-and-outs of the latest version of Adobes desktop digital video application, Adobe Premiere Pro CS3. This updated and expanded edition of Adobe Premiere Pro Bible covers Premiere Pro CS3s powerful new features with pages of step-by-step tutorials, tips, and tricks. Its the comprehensive guide you need to succeed with Premiere Pro CS3. Build a video production clip by clip with the Timeline, mix audio and create transitional effects, and much more.
Self-adaptive and self-configured CPU resource provisioning for virtualized servers using Kalman filters
Authors: Evangelia Kalyvianaki, Themistoklis Charalambous, Steven Hand
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

Data center virtualization allows cost-effective server consolidation which can increase system throughput and reduce power consumption. Resource management of virtualized servers is an important and challenging task, especially when dealing with fluctuating workloads and complex multi-tier server applications. Recent results in control theory-based resource management have shown the potential benefits of adjusting allocations to match changing workloads. This paper presents a new resource management scheme that integrates the Kalman filter into feedback controllers to dynamically allocate CPU resources to virtual machines hosting server applications. The novelty of our approach is the use of the Kalman filter-the optimal filtering technique for state estimation in the sum of squares sense-to track the CPU utilizations and update the allocations accordingly. Our basic controllers continuously detect and self-adapt to unforeseen workload intensity changes. Our more advanced controller self-configures itself to any workload condition without any a priori information. Indicatively, it results in within 4.8% of the performance of workload-aware controllers under high intensity workload changes, and performs equally well under medium intensity traffic. In addition, our controllers are enhanced to deal with multi-tier server applications: by using the pair-wise resource coupling between application components, they provide a 3% on average server performance improvement when facing large unexpected workload increases when compared to controllers with no such resource-coupling mechanism. We evaluate our techniques by controlling a 3-tier Rubis benchmark web site deployed on a prototype Xen-virtualized cluster.
Beamforming in ad hoc networks: MAC design and performance modeling
Authors: Khalil Fakih, Jean-Francois Diouris, Guillaume Andrieux
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

We examine in this paper the benefits of beamforming techniques in ad hoc networks. We first devise a novel MAC paradigm for ad hoc networks when using these techniques in multipath fading environment. In such networks, the use of conventional directional antennas does not necessarily improve the system performance. On the other hand, the exploitation of the potential benefits of smart antenna systems and especially beamforming techniques needs a prior knowledge of the physical channel. Our proposition performs jointly channel estimation and radio resource sharing. We validate the fruitfulness of the proposed MAC and we evaluate the effects of the channel estimation on the network performance. We then present an accurate analytical model for the performance of IEEE 802.11 MAC protocol. We extend the latter model, by introducing the fading probability, to derive the saturation throughput for our proposed MAC when the simplest beamforming strategy is used in real multipath fading ad hoc networks. Finally, numerical results validate our proposition.
A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem: A Geometrical Approach
Authors: Hiroshi Umeo, Takashi Yanagihara
Venue: Fundamenta Informaticae (2009)

An existence or non-existence of five-state firing squad synchronization protocol has been a long-standing, famous open problem for a long time. In this paper, we answer partially to this problem by proposing a small five-state firing squad synchronization algorithm that can synchronize any one-dimensional cellular array of length n = 2$^k$ in 3n &minus; 3 steps for any positive integer k.
Minimum distance of relative Reed&#x2013;Muller codes
Authors: Tohru Nakashima
Venue: Applicable Algebra in Engineering, Communication and Computing (2009)

We describe a construction of error-correcting codes on a fibration over a curve defined over a finite field, which may be considered as a relative version of the classical Reed&#x2013;Muller code. In the case of complete intersections in a projective bundle, we give an explicit lower bound for the minimum distance.
Frequent pattern mining with uncertain data
Authors: Charu C. Aggarwal, Yan Li, Jianyong Wang, Jing Wang
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

This paper studies the problem of frequent pattern mining with uncertain data. We will show how broad classes of algorithms can be extended to the uncertain data setting. In particular, we will study candidate generate-and-test algorithms, hyper-structure algorithms and pattern growth based algorithms. One of our insightful observations is that the experimental behavior of different classes of algorithms is very different in the uncertain case as compared to the deterministic case. In particular, the hyper-structure and the candidate generate-and-test algorithms perform much better than tree-based algorithms. This counter-intuitive behavior is an important observation from the perspective of algorithm design of the uncertain variation of the problem. We will test the approach on a number of real and synthetic data sets, and show the effectiveness of two of our approaches over competitive techniques.
Resource allocation and scheduling strategies using utility and the knapsack problem on computational grids
Authors: Daniel Colin Vanderster
Venue:  (2008)

Computational grids are distributed systems composed of heterogeneous computing resources which are distributed geographically and administratively. These highly scalable systems are designed to meet the large computational demands of many users from scientific and business orientations. This dissertation address problems related to the allocation of the computing resources which compose a grid. First, the design of a pan-Canadian grid is presented. The design exploits the maturing stability of grid deployment toolkits, and introduces novel services for efficiently allocating the grids resources. The challenges faced by this grid deployment motivate further exploration in optimizing grid resource allocations. The primary contribution of this dissertation is one such technique for allocating grid resources. By applying a utility model to the grid allocation options, it is possible to quantify the relative merits of the various possible scheduling decisions. Indeed, a number of utility heuristics are derived to provide quality-of-service policies on the grid; these implement scheduling policies which favour efficiency and also allow users to intervene with urgent tasks. Using this model, the allocation problem is then formulated as a knapsack problem. Formulation in this manner allows for rapid solution times and results in nearly optimal allocations. The combined utility/knapsack approach to grid resource allocation is first presented in the allocation of single resource type, processors. By evaluating the approach with novel utility heuristics using both random and real workloads, it is shown to result in efficient schedules which have characteristics that match the intended policies. Additionally, two design and analysis techniques are performed to optimize the design of the utility/knapsack scheduler; these techniques play a significant role in practical adoption of the approach. Next, the utility/knapsack approach is extended to the allocation of multiple resource types. This extension generalizes the grid allocation solution a wider variety of resources, including processors, disk storage, and network bandwidth. The general technique, when combined with new heuristics for the varied resource types, is shown to result in improved performance against reference strategies. This dissertation concludes with a novel application of the utility/knapsack approach to fault-tolerant task scheduling. Computational grids typically feature many techniques for providing fault tolerance to the grid tasks, including retrying failed tasks or replicating running tasks. By applying the utility/knapsack approach, the relative merits of these varied techniques can be quantified, and the overall number of failures can be decreased subject to resource cost considerations.
Modelling Agent Behaviours in Simulating Transport Corridors Using Prometheus and Jason
Authors: Karol Kaim, Mateusz Lenar
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

This article describes the approach to create the multi-agent system (MAS) for simulating transport corridors. There are few new ideas that were used during the developing the system. JASON language used in implementation of this system is a relatively new approach. A commitment based communication was described before in few papers but there is a little about its implementation. The social aspects of agents are emphasizes in this paper. Although the system is not fully implemented, the combination of Prometheus methodology and JASON language seems to be the good choice for developing the multi-agent systems.