ppxscal/embedding_network huggingface dataset:
Jigsaw Texture Synthesis
Authors: Minh Tran, Amitava Datta
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

Texture synthesis aims to seamlessly extend a sample texture. This can be achieved by reproducing the texture's recognisable patterns along with minimising the occurrences of undesirable image characteristics such as disjoint image features. Presently, patch-based methods have consistently produced the most impressive results. These methods involve aligning and stitching texture patches together. However, image inconsistencies exist when image features are misaligned; they are either fused together or abruptly cut off. Our method minimises the occurrences of these anomalies by using image edges to align patches and redefine their boundaries to preserve texture features. This implementation requires little to no user-defined variables or iterations and can be practically scalable given some pre-computation.
Performance Implications of Cache Affinity on Multicore Processors
Authors: Vahid Kazempour, Alexandra Fedorova, Pouya Alagheband
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Cache affinity between a process and a processor is observed when the processor cache has accumulated some amount of the process state, i.e., data or instructions. Cache affinity is exploited by OS schedulers: they tend to reschedule processes to run on a recently used processor. On conventional (unicore) multiprocessor systems, exploitation of cache affinity improves performance. It is not yet known, however, whether similar performance improvements would be observed on multicore processors. Understanding these effects is crucial for design of efficient multicore scheduling algorithms. Our study analyzes performance effects of cache affinity exploitation on multicore processors. We find that performance improvements on multicoreuniprocessors are not significant. At the same time, performance improvements on multicore multiprocessors are rather pronounced.
An ArgoUML metamodel extension for the workflow systems
Authors: Narayan Debnath, Daniel Riesco, German Montejano
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The Unified Model Language (UML) has nine diagrams. One of them is the activity diagram. This allows the modeling of business processes. A business process is a set of logically related tasks executed to achieve a business result. Workflow systems are those systems based on software that allow automating total or partially a business process. Workflow is defined as a set of methods and technologies that offer facilities for the modeling and administration of diverse processes that happen inside a company. The Workflow Management Coalition (WfMC) has established a standard that allows the interoperability among applications workflow. The proposed standard includes a model of the workflow processes, Workflow Metamodel, and a language of specification of processes in XML (XPDL). ArgoUML is a CASE tool for the analysis and design of objects oriented software systems. ArgoUML uses NSUML metamodel implementing the UML metamodel defined by the Objet Management Group (OMG). The ArgoUML tool is open source and it allows building all the types of defined diagrams in UML. In this work, we propose an extension of the NSUML, the core of ArgoUML metamodel. In this way, the ArgoUML incorporates the possibility to model and to simulate workflow processes.
Chemical Knowledge for the Semantic Web
Authors: Mykola Konyk, Alexander Leon, Michel Dumontier
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

With over 80 file formats to represent various chemical attributes, the conversion between one format and another is invariably lossy due to informal specifications. In contrast, the use of a formal knowledge representation language such as the Web Ontology Language (OWL) enables precise molecular descriptions that can be reasoned about in a logically valid manner. In this paper, we describe a chemical knowledge representation using OWL. We demonstrate its utility in querying a new drug repository created from PubChem, DrugBank and DBpedia. By leveraging Semantic Web technologies, it becomes possible to integrate chemical information at differing levels of detail and granularity, opening new avenues for life science knowledge discovery.
The extremal values of the Wiener index of a tree with given degree sequence
Authors: Hua Wang
Venue: Discrete Applied Mathematics (2008)

The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound's molecular graph with experimentally gathered data regarding the compound's characteristics. In [M. Fischermann, A. Hoffmann, D. Rautenbach, L.A. Szekely, L. Volkmann, Wiener index versus maximum degree in trees, Discrete Appl. Math. 122 (1-3) (2002) 127-137], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maximum and minimum Wiener index, given the number of vertices and the degree sequence.
Classification of Business Travelers Using SVMs Combined with Kernel Principal Component Analysis
Authors: Xin Xu, Rob Law, Tao Wu
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Data mining techniques for understanding the behavioral and demographic patterns of tourists have received increasing research interests due to the significant economic contributions of the fast growing tourism industry. However, the complexity, noise and nonlinearity in tourism data bring many challenges for existing data mining techniques such as rough sets and neural networks. This paper makes an attempt to develop a data mining approach to tourist expenditure classification based on support vector machines (SVMs) with kernel principal component analysis. Compared with previous methods, the proposed approach not only makes use of the generalization ability of SVMs, which is usually superior to neural networks and rough sets, but also applies a KPCA-based feature extraction method so that the classification accuracy of business travelers can be improved. Utilizing the primary data collected from an Omnibus survey carried out in Hong Kong in late 2005, experimental results showed that the classification accuracy of the SVM model with KPCA is better than other approaches including the previous rough set method and a GA-based selective neural network ensemble method.
Speeding up STL Set/Map Usage in C++ Applications
Authors: Dibyendu Das, Madhavi Valluri, Michael Wong, Chris Cambly
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

In this work we augment the red-black tree implementation of STL set< ... >/map< ... > with a doubly linked list that is in sorted order. This is done for the purpose of speeding up C++ applications that use set< >/map< >::iterator considerably. In such cases, the doubly linked list helps in iterating over the set< >/map< > quickly. Usually the ++/--- operations have an amortized cost of O(1) for a red-black tree implementation. The linked list augmentation helps in improving the ++/--- operations to ¿(1). In addition, our experiments for IBM's P5+ and P6 processors show that this mechanism improves performance for two SPEC CPU2006 benchmarks and there is no adverse cache effect when we support two additional pointers per node of a red-black tree.
A 160×120 Edge Detection Vision Chip for Neuromorphic Systems Using Logarithmic Active Pixel Sensor with Low Power Dissipation
Authors: Jae-Sung Kong, Dong-Kyu Sung, Hyo-Young Hyun, Jang-Kyoo Shin
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In this paper, a vision chip for edge detection based on the structure of a biological retina is introduced. The chip processes an image in a bio-inspired vision mechanism; therefore, it is proper for the neuromorphic systems. Logarithmic active pixel sensor (APS) was applied to the vision chip. By applying a MOS-type photodetector to the logarithmic APS, we could achieve sufficient output swing for the vision chip in natural illumination condition. A correlated-double sampling technique was applied to the chip for noise suppression. In addition, a CMOS buffer circuit is commonly used for both raw and smoothed images by using additional switches. This structure helps reduce the total number of MOSFETs for a unit-pixel and noise. A vision chip with a 160×120 pixel array was fabricated using a 0.35 μm double-poly four-metal CMOS technology, and its operation was successfully demonstrated.
Using Subspace-Based Template Attacks to Compare and Combine Power and Electromagnetic Information Leakages
Authors: François-Xavier Standaert, Cedric Archambeau
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

The power consumption and electromagnetic radiation are among the most extensively used side-channels for analyzing physically observable cryptographic devices. This paper tackles three important questions in this respect. First, we compare the effectiveness of these two side-channels. We investigate the common belief that electromagnetic leakages lead to more powerful attacks than their power consumption counterpart. Second we study the best combination of the power and electromagnetic leakages. A quantified analysis based on sound information theoretic and security metrics is provided for these purposes. Third, we evaluate the effectiveness of two data dimensionality reduction techniques for constructing subspace-based template attacks. Selecting automatically the meaningful time samples in side-channel leakage traces is an important problem in the application of template attacks and it usually relies on heuristics. We show how classical statistical tools such as Principal Component Analysis and Fisher Linear Discriminant Analysis can be used for efficiently preprocessing the leakage traces.
Study of performance evaluation methods for non-uniform speech segmentation
Authors: Jakub Gałka, Bartosz Ziółko
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Speech segmentation is a very difficult problem, because of continuous nature of speech. Segmenting speech into various units (phonemes, syllables, and acoustic atoms) is essential in many applications. Choosing the best method of segmentation must be preceded by evaluation of its performance. This paper is a study of various numerical measures for automatic segmentation performance.
Open Petri Nets: Non-deterministic Processes and Compositionality
Authors: Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Barbara König
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interface. The interface towards the external environment of a ranked open net is given by a subset of places designated as open and used for composition. Additionally, a bound on the number of connections which are allowed on an open place can be specified. We show that the non-deterministic process semantics is compositional with respect to the composition operation over ranked open nets, a result which did not hold for basic open nets.
Expert Assessment of Arguments: A Method and Its Experimental Evaluation
Authors: Lukasz Cyra, Janusz Górski
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

Argument structures are commonly used to develop and present cases for safety, security and other properties. Such argument structures tend to grow excessively. To deal with this problem, appropriate methods of their assessment are required. Two objectives are of particular interest: (1) systematic and explicit assessment of the compelling power of an argument, and (2) communication of the result of such an assessment to relevant recipients. The paper gives details of a new method which deals with both problems. We explain how to issue assessments and how they can be aggregated depending on the types of inference used in arguments. The method is fully implemented in a software tool. Its application is illustrated by examples. The paper also includes the results of experiments carried out to validate and calibrate the method.
Verifying Dominant Strategy Equilibria in Auctions
Authors: Emmanuel M. Tadjouddine, Frank Guerin
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Future agent mediated eCommerce will involve open systems of agents interoperating between different institutions, where different auction protocols may be in use. We argue that in order to achieve this agents will need a method to automatically verify the properties of a previously unseen auction protocol; for example, they may wish to verify that it is fair and robust to deception. We are therefore interested in the problem of automatically verifying the game-theoretic properties of a given auction mechanism, especially the property of strategyproofness. In this paper we show how the Alloy model checker can be used to automatically verify such properties. We illustrate the approach via two examples: a simple two player Vickrey auction and a quantity restricted multi-unit auction using the Vickrey-Clarke-Groves mechanism.
Nonuniform Cache Architectures for Wire-Delay Dominated On-Chip Caches
Authors: Changkyu Kim, Doug Burger, Stephen W. Keckler
Venue: IEEE Micro (2003)

Nonuniform cache access designs solve the on-chip wire delay problem for future large integrated caches. By embedding a network in the cache, NUCA designs let data migrate within the cache, clustering the working set nearest the processor.
Cross-Calibration and Longitudinal Quality Control of Hologic Selenia Full-Field Digital Mammography Systems for Volumetric Breast Density Measurements
Authors: Jeff Wang, Serghei Malkov, Bo Fan, John Shepherd
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

High breast tissue density has been shown to be one of the strongest predictors of breast cancer risk in women; though currently there are no calibrated methods to ensure that clinical measures of density are accurate. This inability to make accurate measurements impedes the use of breast tissue density as a cancer risk indicator. An accurate and precise method to measure the volumetric density of breast tissue in a clinical environment has been developed without modifying existing methods. The single x-ray absorptiometry (SXA) approach is validated against known breast fibroglandular density test phantoms and the accuracy and precision of the measure is monitored longitudinally. With cross-calibration and longitudinal quality control using the same test phantoms we show that SXA density measures are comparable between seven Hologic Selenia Full-Field Digital Mammography systems. In the future, we plan to address whether SXA measures can be generalized across different makes and models.
Bluetooth ACL Packet Selection Via Maximizing the Expected Throughput Efficiency of ARQ Protocol
Authors: Xiang Li, Man-Tian Li, Zhen-Guo Gao, Li-Ning Sun
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Bluetooth provides different kinds of data packet types with different sizes and error correction mechanisms, thus adapter layer can choose the most suitable packet to be transmitted according to the error rate on the link and application requirements. Based on the acknowledgement history of the most recently transmitted packets, an adaptive algorithm is proposed to choose the suitable Bluetooth data packet for transmission through maximizing the expected throughput efficiency of ARQ protocol on Bluetooth ACL data communication link. Simulation results indicate that this method works very well with a short observation history and also show special performance of DM and DH data packet transmission.
Impacts of mobility patterns on mobile IP handoff in wireless LANs
Authors: Ting Zhou, Song Ci, Hamid Sharif
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Mobile IP has been adopted to provide seamless services to mobile nodes. Currently, there are many mobile IP handoff schemes proposed at different layers of the network protocol stack. However, the handoff performance under different mobility patterns in terms of velocity and path has been largely ignored by the current research work. In this paper, we present our study of the mobility pattern's impact on the performance of mobile IP handoff by theoretical analysis as well as NS-2 simulations, where both deterministic and hybrid models for mobility patterns have been adopted. Our results show that the performance of mobile IP handoff schemes is directly impacted by the mobility patterns. Moreover, the cross-layer handoff schemes outperform other mobile IP handoff schemes under different mobility patterns. We conclude that the routing update delay is one of main performance bottlenecks in mobile IP handoff. So we propose a new solution to reduce the routing update delay by considering the behaviors at the lower layers such as the link layer. Furthermore, our study also presents a platform for efficient network design due to the fact that the routing update delay is tightly coupled with the deployment of access points.
The Instruction-Set Extension Problem: A Survey
Authors: Carlo Galuzzi, Koen Bertels
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction-set, which can be tuned towards specific requirements. The identification, definition and implementation of those operations that provide the largest performance improvement and that should be hardwired, extending in this way the Instruction-Set, constitutes a major challenge. The purpose of this paper is to investigate and study the issues regarding the customization of an Instruction-Set in function of the specific requirements of an application. Additionally, the paper provides an overview of all relevant aspects of the problem and compensates the lack of a general view of the problem in the existing literature.
Affective Transitions in Narrative-Centered Learning Environments
Authors: Scott W. Mcquiggan, Jennifer L. Robison, James C. Lester
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Affect has been the subject of increasing attention in cognitive accounts of learning. Many intelligent tutoring systems now seek to adapt pedagogy to student affective and motivational processes in an effort to increase the effectiveness of tutorial interaction and improve learning outcomes. To this end, recent work has begun to investigate the emotions experienced during learning in a variety of environments. In this paper we extend this line of research by investigating the affective transitions that occur throughout narrative-centered learning experiences. Further analysis differentiates the likelihood of affective transitions stemming from pedagogical agent empathetic responses to student affect.
Charles Babbage's Analytical Engine, 1838
Authors: Allan G. Bromley
Venue: IEEE Annals of the History of Computing (1982)

Charles Babbage commenced work on the design of the Analytical Engine in 1834 following the collapse of the project to build the Difference Engine. His ideas evolved rapidly, and by 1838 most of the important concepts used in his later designs were established. This paper introduces the design of the Analytical Engine as it stood in early 1838, concentrating on the overall functional organization of the mill (or central processing portion) and the methods generally used for the basic arithmetic operations of multiplication, division, and signed addition. The paper describes the working of the mechanisms that Babbage devised for storing, transferring, and adding numbers and how they were organized together by the "microprogrammed" control system; the paper also introduces the facilities provided for user- level programming. The intention of the paper is to show that an automatic computing machine could be built using mechanical devices, and that Babbage's designs provide both an effective set of basic mechanisms and a workable organization of a complete machine. 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
Large-Scale Image Deblurring in Java
Authors: Piotr Wendykier, James G. Nagy
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

This paper describes Parallel Spectral Deconvolution (PSD) Java software for image deblurring. A key component of the software, JTransforms, is the first, open source, multithreaded FFT library written in pure Java. Benchmarks show that JTransforms is competitive with current C implementations, including the well-known FFTW package. Image deblurring examples, including performance comparisons with existing software, are also given.
Note: An addendum on the incremental assignment problem
Authors: A. Volgenant
Venue: Information Sciences: an International Journal (2008)

In Toroslu and Ucoluk [I.H. Toroslu, G. Ucoluk, Incremental assignment problem, Information Sciences 177 (2007) 1523-1529] the incremental assignment problem is defined as follows. A new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum-weighted matching is already known, and the maximum-weighted matching of the extended graph is sought. An O(n^2) algorithm for the problem has been derived, with n the size of a partition in the bipartite graph. We point out that such a result can be found in literature.
Experiments in Selective Overhearing of Hierarchical Organizations
Authors: Gery Gutnik, Gal A. Kaminka
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

Lately, overhearing has gained interest in monitoring multi-agent settings. Previous investigations provided an extensive set of techniques using overhearing. However, most previous investigations rely on a problematic assumption that all inter-agent communications can be overheard. In the real-world settings, it is reasonable to assume that the available overhearing resources will be essentially limited. Thus, overhearing targets should be carefully chosen. We provide a theoretical and empirical study of selective overhearing. In particular, we focus on overhearing hierarchical organizations that are highly popular in the real-world settings. This paper first presents a theoretical approach for modelling overhearing in hierarchical organizations . Then, based on the proposed model, we present experiments in simulating conversations in hierarchical organizations, and empirically examine a set of overhearing strategies particularly suited for such organizations. Based on these extensive experiments, we are able to determine efficient overhearing strategies and isolate the parameters influencing their behavior.