ppxscal/embedding_network huggingface dataset:
Understanding enterprise integration project risks: A focus group study
Authors: Sandeep Purao, Sharoda Paul, Steven Smith
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The prerequisites of success and reasons for failure for enterprise integration projects are still not well-understood as evidenced by large failure rates, including cost or schedule overruns, abandoned projects, and projects delivered with diminished functionality. These failures point to the inherently human activities of planning and overseeing that are critical to successful large-scale integration. In spite of a rich stream of research on systems development risks, few research efforts have attempted to understand enterprise integration risks. This paper reports preliminary findings, based on an analysis of data gathered via focus groups at an organization poised to embark on an integration project, about how organizational participants perceive these risks. The analysis shows that risk perception is fuzzy, it differs significantly across organizational actors, and points to considerable information asymmetry between risk managers and project participants.
Wavelet decomposition tree selection for palm and face authentication
Authors: Loris Nanni, Alessandra Lumini
Venue: Pattern Recognition Letters (2008)

In this work, we study the usefulness of multi-resolution analysis for the face and palm authentication problems. The images are decomposed into frequency subbands with different levels of decomposition using different wavelets. We adopt as features for the authentication problem, the wavelet coefficients extracted from some ''selected'' subbands of several wavelet families. We propose to use a multi-matcher where each matcher is trained using a single subband, the matchers are combined using the ''Max Rule''. The band selection is performed by running Sequential Forward Floating Selection (SFFS). Moreover, several linear subspace projection techniques have been tested and compared. Experiments carried out on several biometric datasets show that the application of Laplacian EigenMaps (LEM) on a little subset of wavelet subbands (chosen by SFFS) permits to obtain a low Equal Error Rate.
A maximum likelihood approximation method for Dirichlet's parameter estimation
Authors: Nicolas Wicker, Jean Muller, Ravi Kiran Reddy Kalathur, Olivier Poch
Venue: Computational Statistics Data Analysis (2008)

Dirichlet distributions are natural choices to analyse data described by frequencies or proportions since they are the simplest known distributions for such data apart from the uniform distribution. They are often used whenever proportions are involved, for example, in text-mining, image analysis, biology or as a prior of a multinomial distribution in Bayesian statistics. As the Dirichlet distribution belongs to the exponential family, its parameters can be easily inferred by maximum likelihood. Parameter estimation is usually performed with the Newton-Raphson algorithm after an initialisation step using either the moments or Ronning's methods. However this initialisation can result in parameters that lie outside the admissible region. A simple and very efficient alternative based on a maximum likelihood approximation is presented. The advantages of the presented method compared to two other methods are demonstrated on synthetic data sets as well as for a practical biological problem: the clustering of protein sequences based on their amino acid compositions.
The Open Channel
Venue: Computer (1976)

The Open Channel is exactly what the name implies: a forum for the free exchange of technical ideas. Hold your contributions to one page maximum in the final magazine format (about 1000 words-less, if you want to include illustrations). 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
An Improved Partitioning-Based Web Documents Clustering Method Combining GA with ISODATA
Authors: Zhengyu Zhu, Yunyan Tian, Jingqiu Xu, Xin Deng, Xiang Ren
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The existing partitioning-based clustering algorithms, such as k-means, k-medoids and their variations, are simple in theory and fast in convergence speed, but they always just reach local optimum when the iterations terminate and they are not suitable for discovering clusters in the cases when their sizes are very different. This paper proposes an improved Web documents clustering method, using genetic algorithm (GA) which introduces some ideas of ISODATA[6] into the design of its mutation operation. Experiments show that the GA's global search characteristic can avoid local optimum and the ISODATA-based mutation operation makes the improved clustering algorithm have the self-adjusting ability to discover clusters of different sizes.
Feature Analysis and Classification for Filtering Junk Information in Animation
Authors: Ming Zhao, Shilin Wang, Shenghong Li, Xiang Li, Zhi Xue
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Digital animation is a widely used digital media on internet to convey information. However, many animations nowadays are usually advertisements and contain only junk information. In order to detect and filter such information, a feature extraction, analysis and classification method for animation content understanding is proposed. A feature set composed of the traditional image/video features and other specific features for animation is extracted. Then a feature analysis method based on Mutual Information (MI) is performed to select the feature combination with high discriminative power. Finally, SVM with RBF kernel is used as the classifier and an average error of 8.28% is achieved by the optimum feature set.
The adaptive social hierarchy: a self organizing network based on naturally occurring structures
Authors: Andrew Markham, Andrew Wilkinson
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Wireless networks can be used for relaying information acquired by mobile animal borne tags. To date, no research has considered the large amount of diversity presented by the animal kingdom which impacts the design of the network. We consider here how the weight of the animal affects the size of the tag, and hence the energy that it can carry. We use a common structure in Nature, the social dominance hierarchy, and form a similar hierarchy based on energy. Nodes adjust their perceived rankings through continual tournaments using simple, locally applied rules to result in a stable and adaptive structure. We show that the number of levels in the hierarchy controls traffic density and consequently energy usage. To further conserve energy of low ranked nodes, we propose a simple cross-layer protocol. We show through simulation that our power-aware protocol outperforms those with no knowledge of energy.
New Products
Authors: D. A. Michalopoulos
Venue: Computer (1976)

Applied Digital Data Systems Inc. recently announced its System 70 intelligent terminal, a microprocessor-based system pre-programmed for immediate use.
Research on Float-Coded Genetic Algorithm Based on Wavelet Denoising Mutation
Authors: Mingyi Cui, Yanli Shangguan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Coding is a difficult subject of research on genetic algorithm (GA). In many codes, float code (FC) is super to other codes in use. But, noise and its influence on GA performance were ignored by researches in genetic operation. Mutation played an important role of improving GA performance. Hence, float-coded genetic algorithm (FCGA) based on wavelet denoising mutation (FCGAWM) was proposed in this paper. Decomposing of FC noise was shown with wavelet in theory. FC denoising mutation was implemented in it. The experiment was made in it. The results of the research and the experiment indicated that the theory was credible and the method was feasible in it. FCGAWM is of active significance to extend application space of FCGA.
Multivalued mappings and their selectors in the theory of conflict-controlled processes
Authors: A. A. Chikrii, I. S. Rappoport, K. A. Chikrii
Venue: Cybernetics and Systems Analysis (2007)

Conflict-controlled processes with a cylindrical terminal set are considered. The method of resolving functions is used to obtain sufficient conditions of game termination in a guaranteed time in a class of stroboscopic strategies. These conditions are expressed as star-shapedness in certain cones or convex-valuedness of special multivalued mappings. A functional form of first direct Pontryagin method is derived.
Using Atoms to Simplify Distributed Programs Checking
Authors: H. F. Li, Eslam Al Maghayreh, D. Goswami
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

The execution of a distributed program generates a large state space which needs to be checked in testing and debugging. This state space can be reduced by using atoms corresponding to code blocks before performing the checking of the required program properties. This paper presents our results in using atoms which are known at program design time for this purpose. We consider the impact of incomplete or incorrect knowledge of atoms on the validity of checking if a run is indeed atomic with respect to the identified atoms and if it satisfies the required program properties.
A resource optimized Processor Core for FPGA based SoCs
Authors: Gerald Hempel, Christian Hochberger
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Modern FPGAs have become so affordable that they can be used to substitute ASICs in mass produced devices. Typi- cally, the term configurable system on a chip (CSoC) is used for this kind of usage. A key component in such a CSoC is the processor core. Currently, several cores are available for FPGAs. 32 bit processors like MicroBlaze, NIOS 2 or OpenRisc require a lot of resources, whereas very small solutions like PicoBlaze or Lattice Mico8 are not capable of running reasonably complex software. Thus, there is a gap between these two extremes, which we want to fill with our development SpartanMC. This contribution describes its design objectives, architecture, tools, peripherals and compares it to other well known processor cores.
Self-regulating finite automata
Authors: Alexander Meduna, Tomáš Masopust
Venue: Acta Cybernetica (2007)

This paper introduces and discusses self-regulating finite automata. In essence, these automata regulate the use of their rules by a sequence of rules applied during previous moves. A special attention is paid to turns defined as moves during which a self-regulating finite automaton starts a new self-regulating sequence of moves. Based on the number of turns, the present paper establishes two infinite hierarchies of language families resulting from two variants of these automata. In addition, it demonstrates that these hierarchies coincide with the hierarchies resulting from parallel right linear grammars and right linear simple matrix grammars, so the self-regulating finite automata can be viewed as the automaton counterparts to these grammars. Finally, this paper compares both infinite hierarchies. In addition, as an open problem area, it suggests the discussion of self-regulating pushdown automata and points out that they give rise to no infinite hierarchy analogical to the achieved hierarchies resulting from the self-regulating finite automata.
Proofs of Networks of Processes
Authors: J. Misra
Venue: IEEE Transactions on Software Engineering (1981)

We present a proof method for networks of processes in which component processes communicate exclusively through messages. We show how to construct proofs of invariant properties which hold at all times during network computation, and terminal properties which hold upon termination of network computation, if network computation terminates. The proof method is based upon specifying a process by a pair of assertions, analogous to pre-and post-conditions in sequential program proving. The correctness of network specification is proven by applying inference rules to the specifications of component processes. Several examples are proved using this technique.
Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006
Venue: Baltic Sea; Vol. 276 (2006)

You are holding in your hands the proceedings of the 6th Baltic Sea Conference on Computing Education Research - Koli Calling. The conference was held in November 2006. The papers presented at the conference, and collected in these proceedings were of excellent quality and highlight both the depth and the variety of the emerging field of Computing Education Research. Twenty-nine papers/posters, one invited seminar and two invited speeches were presented during the three conference days. Lecia Barker, ATLAS, University of Colorado, Boulder, CO, USA, broadened our perspective on students' experience of power and gender, through her speech Defensive climate in the computer science classroom, originally written by Dr Barker together with Kathy Garvin-Doxas, and Michele Jackson for the 33rd SIGCSE technical symposium on Computer science education, 2002. The Koli Calling conference thanks ACM for a travel grant for Dr Barker. Tony Clear took the discussion further, by introducing critical enquiry to the community in his talk Valuing Computer Science Education Research?, finally Matti Terdre discussed the interaction between computer science and the community in his seminar The Development of Computer Science: A Sociocultural Perspective. Contributions to the main conference can take one of three forms. Research papers present unpublished, original research, presenting novel results, methods, tools, or interpretations that contribute to solid, theoretically anchored research. System papers describe tools for learning or instruction in computing education, motivated by the didactic needs of teaching computing, while Discussion papers provide a forum for presentation of novel ideas and prototypes. Finally, the Posters had their focus on work in process. All papers and posters were double-blind peer reviewed by members of the international program committee.
Controlling Transparency in an Online Learning Environment
Authors: Tyler Robison, Steven Tanimoto
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

The presence of transparency in an online learning environment may potentially enhance the educational value of the system, yet there are many aspects to transparency, and the configuration of these features can prove both difficult and daunting for educators. In this paper we propose a framework for controlling transparency in an online learning environment taking into account the task, learner model and learner preferences. These characteristics will be dynamically mapped onto a transparency configuration, allowing the system to adjust its presentation on-the-fly via a form of end-user programming. We describe the kinds of transparency our framework addresses, how users control transparency, and how the settings of multiple users are resolved into a single transparency configuration.
A Mixed Shared and Multi Paths Protection Scheme with SRLG Constraints
Authors: Zong-Li Tang, Xing-Ming Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The dynamic traffic assignment problem in WDM mesh network and traps avoidance problem under shared risk link group (SRLG) constraints were studied. A protection scheme entitled Mixed Shared Multi-Paths Protection (MSMPP) was proposed. MSMPP can not only effectively avoid traps, but also, differing from previous shared path protection (SPP) scheme, make the primary path, when it doesn't work, share its bandwidth with the backup paths, so that the network bandwidth utilization is enhanced. Simulation results show that the performance of MSMPP is better than SPP.
An Improved Attribute Reduction Algorithm Based on Rough Set
Authors: Haijun Wang, Shaoliang Wei, Yimin Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

An improved heuristic attribute reduction algorithm based on the attribute frequency is presented. After analyzing many other attribute reduction algorithms, we utilize the discernibility matrix and the appeared attribute frequencies to determine each attribute's significance, based on the principle of maximum attribute frequency,we achieved the reduction of the information system. An illustrative example demonstrate the algorithm's effectiveness and validity.
Language models, probability of relevance and relevance likelihood
Authors: Richard Bache, Mark Baillie, Fabio Crestani
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper proposes a measure of relevance likelihood derived specifically for language models. Such a measure may be used to guide a user on how far to browse through the list of retrieved items or for pseudo-relevance feedback. To derive this measure, it is necessary to make the assumption that a user is seeking an ideal (usually non-existent) document and the actual relevant documents in the collection will contain fragments of this ideal document. Thus, in deriving this measure we propose a novel way of capturing relevance in Language Modelling.
Bitmap Filtering: An Efficient Speedup Method for XML Structural Matching
Authors: Feng Shao, Gang Chen, Lihua Yu, Yijun Bei, Jinxiang Dong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.
Biometrics: Proving Ground for Image and Pattern Recognition
Authors: Anil K. Jain
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The emerging requirements of reliable and highly accurate personal identification in a number of government and commercial applications (e.g., international border crossings, access to buildings, laptops and mobile phones) have served as an impetus for a tremendous growth in biometric recognition technology. Biometrics refers to the automatic recognition of an individual by using anatomical or behavioral traits associated with that person. By using biometrics, it is possible to recognize a person based on who you are, rather than by what you possess (e.g., an ID card) or what you remember (e.g., a password). Most of the authentication systems based on passwords (knowledge-based security) and ID cards (token-based security) can be easily breached when a password is divulged to an unauthorized user or a card is stolen by an impostor.
Vertical Migration for Performance Enhancement in Layered Hardware/Firmware/Software Systems
Authors: J. Stockenberg
Venue: Computer (1978)

Vertical migration is a technique which improves system performance by moving software primitives through layers of application program and operating system software and microcode.
An Approach to Global Sensitivity Analysis: FAST on COCOMO
Authors: Stefan Wagner
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

There are various models in software engineering that are used to predict quality-related aspects of the process or artefacts. The use of these models involves elaborate data collection in order to estimate the input parameters. Hence, an interesting question is which of these input factors are most important. More specifically, which factors need to be estimated best and which might be removed from the model? This paper describes an approach based on global sensitivity analysis to answer these questions and shows its applicability in a case study on the COCOMO application at NASA.
Numerical Function Generators Using Edge-Valued Binary Decision Diagrams
Authors: S. Nagayama
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, we introduce the edge-valued binary decision diagram (EVBDD) to reduce the memory and delay in numerical function generators (NFGs). An NFG realizes a function, such as a trigonometric, logarithmic, square root, or reciprocal function, in hardware. NFGs are important in, for example, digital signal applications, where high speed and accuracy are necessary. We use the EVBDD to produce a fast and compact segment index encoder (SIE) that is a key component in our NFG. We compare our approach with NFG designs based on multi-terminal BDDs (MTBDDs), and show that the EVBDD produces SIEs that have, on average, only 7% of the memory and 40% of the delay of those designed using MTBDDs. Therefore, our NFGs based on EVBDDs have, on average, only 38% of the memory and 59% of the delay of NFGs based on MTBDDs.
Spooky Lessons
Authors: Shari Lawrence Pfleeger
Venue: IEEE Security and Privacy (2007)

Book reviews on the latest in security and privacy.