ppxscal/embedding_network huggingface dataset:
Edge Detection of Skin Lesions Using Anisotropic Diffusion
Authors: Vincius Borges Pires, Celia Aparecida Zorzo Barcelos
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper the problem of skin lesions segmentation is studied. The clinical diagnosis of skin lesions is not an easy task for dermatologists. The segmentation method that makes the extraction of important characteristics of the im- age as edges possible, can also aid the dermatologists doc- tors in the diagnosis of lesions. In this paper we propose a segmentation method that combines partial differential equations and the Canny edges detector to the automatic detection of edges. Experimental results show the efficacy of the method proposed even when the lesion is noisy or contains hair.
Computer Architecture
Authors: C. C. Foster
Venue: Computer (1972)

Computer architecture is a relatively recently recognized discipline. The Technical Committee on Computer Architecture (TCCA) of the Computer Society was formed in 1970 and the Special Interest Committee on Computer Architecture (SICARCH) of ACM only in the summer of 1971. It is perhaps pertinent then, to ask what computer architecture is. A dictionary (1) defines architecture as: "the profession of designing buildings, open areas, communities, etc., usually with some regard to aesthetic effect." I once said (2) that computer architecture is "the art of designing a machine that will be a pleasure to work with," so I would tend to go along with the dictionary.
A High Order WENO Scheme for a Hierarchical Size-Structured Population Model
Authors: Jun Shen, Chi-Wang Shu, Mengping Zhang
Venue: Journal of Scientific Computing (2007)

In this paper we develop a high order explicit finite difference weighted essentially non-oscillatory (WENO) scheme for solving a hierarchical size-structured population model with nonlinear growth, mortality and reproduction rates. The main technical complication is the existence of global terms in the coefficient and boundary condition for this model. We carefully design approximations to these global terms and boundary conditions to ensure high order accuracy. Comparing with the first order monotone and second order total variation bounded schemes for the same model, the high order WENO scheme is more efficient and can produce accurate results with far fewer grid points. Numerical examples including one in computational biology for the evolution of the population of Gambussia affinis, are presented to illustrate the good performance of the high order WENO scheme.
Design of Asynchronous Circuits Assuming Unbounded Gate Delays
Authors: D. B. Armstrong, A. D. Friedman, P. R. Menon
Venue: IEEE Transactions on Computers (1969)

This paper considers the general problem of the synthesis of asynchronous combinational and sequential circuits based on the assumption that gate delays may be unbounded and that line delays are suitably constrained. Certain problems inherent to circuit realizations with unbounded gate delays are discussed and methods of solving them are proposed. Specific synthesis techniques are presented for both combinational and sequential circuits. The use of completion detection necessitated by the assumption of unbounded gate delays also causes the circuits to stop operating for approximately half of all possible single faults, thus achieving a degree of self-checking.
Gain-based Exploration: From Multi-armed Bandits to Partially Observable Environments
Authors: Bailu Si, J. Michael Herrmann, Klaus Pawelzik
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

We introduce gain-based policies for exploration in active learning problems. For exploration in multi-armed bandits with the knowledge of reward variances, an ideal gain-maximization exploration policy is described in a unified framework which also includes error-based and counter-based exploration. For realistic situations without prior knowledge of reward variances, we establish an upper bound on the gain function, resulting in a realistic gain-maximization exploration policy which achieves the optimal exploration asymptotically. Finally, we extend the gain-maximization exploration scheme towards partially observable environments. Approximating the environment by a set of local bandits, the agent actively selects its actions by maximizing discounted gain in learning local bandits. The resulting gain-based exploration not only outperforms random exploration, but also produces curiosity-driven behavior which is observed in natural agents.
Simple genetic algorithms with linear fitness
Authors: Michael D. Vose, Alden H. Wright
Venue: Evolutionary Computation (1994)

A general form of stochastic search is described (random heuristic search), and some of its general properties are proved. This provides a framework in which the simple genetic algorithm (SGA) is a special case. The framework is used to illuminate relationships between seemingly different probabilistic perspectives of SGA behavior. Next, the SGA is formalized as an instance of random heuristic search. The formalization then used to show expected population fitness is a Lyapunov function in the infinite population model when mutation is zero and fitness is linear. In particular, the infinite population algorithm must converge, and average population fitness increases from one generation to the next. The consequence for a finite population SGA is that the expected population fitness increases from one generation to the next. Moreover, the only stable fixed point of the expected next population operator corresponds to the population consisting entirely of the optimal string. This result is then extended by way of a perturbation argument to allow nonzero mutation.
Invited Talk 1: Testing of Power Constraint Computing
Authors: T. M. Mak
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Computing trend has taken a right hand turn. Instead of utmost performance at any cost, performance level have to be capped with the maximum power dissipation affordable at any given platform. With thermal dissipation mechanisms and energy cost as the primary drivers, computing at any level, from handheld devices to high-end servers, have to be power constraint. Various innovations arise to this challenge: Clock gating, power gating (sleep) transistors, multiple (and individually controlled) power supplies and power regions, fine grain frequency and power control, in-package Voltage Regulator Module, just to name a few. The power issues are also driving some interesting architectural and interconnect/packaging options into the main stream. While there have been innovations in the Test area for the past 25 years, including advanced fault models, such as bridges and opens, various favors of transition, delay path, crosstalk and the various ATPG that support them, power related test innovations have been seriously lacking. Power related testing issues have mostly been restricted to those of scan shifting and matching up of average power consumption. More recently, some papers have pointed to fast (launch and capture) clock related power transients and IR drops related issues, but the solutions is still far from being able to mimic the real situations and solve real world test problems. This talk will mostly focus on the test implications of power constraints over the spectrum of computing products. These implications are also intertwined with extreme process scaling to make conventional testing paradigm no longer valid. Some discussions of the various test options to deal with the power issues will also be reviewed.
A Wireless MAC Protocol with Collision Detection
Authors: Jun Peng, Liang Cheng, Biplab Sikdar
Venue: IEEE Transactions on Mobile Computing (2007)

The most popular strategies for dealing with packet collisions at the Medium Access Control (MAC) layer in distributed wireless networks use a combination of carrier sensing and collision avoidance. When the collision avoidance strategy fails such schemes cannot detect collisions, and corrupted data frames are still transmitted in their entirety, thereby wasting the channel bandwidth and significantly reducing the network throughput. To address this problem, this paper proposes a new wireless MAC protocol capable of collision detection. The basic idea of the proposed protocol is the use of pulses in an out-of-band control channel for exploring channel condition and medium reservation and achieving both collision avoidance and collision detection. The performance of the proposed MAC protocol has been investigated using extensive analysis and simulations. Our results show that as compared with existing MAC protocols, the proposed protocol has significant performance gains in terms of node throughput. Additionally, the proposed protocol is fully distributed and requires no time synchronization among nodes.
Text Categorization Method Based on Improved Mutual Information and Characteristic Weights Evaluation Algorithms
Authors: Zhili Pei, Xiaohu Shi, Maurizio Marchese, Yanchun Liang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The improvement of text categorization by statistical methods can be performed from two main directions, namely the feature selection and the evaluation of characteristic weights. In this paper, we propose an enhanced text categorization method based on a modified mutual information algorithm and evaluation algorithm of characteristic weights which improves both aspects. The proposed method is applied to the benchmark test set Reuters-21578 Top10 to examine its effectiveness. Numerical results show that the precision, the recall and the value of F1 of the proposed method are all superior tothose of existing conventional methods.
Workshop Report: The Coming Decade of Innovation
Authors: R. M. Englund
Venue: Computer (1981)

New technology is not without its failures. Will gallium arsenide ICs, Josephson junctions, and SOS be among those of the 1980's? 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
Modified immune algorithm for job selection and operation allocation problem in flexible manufacturing systems
Authors: Anoop Prakash, Nitesh Khilwani, M. K. Tiwari, Yuval Cohen
Venue: Advances in Engineering Software (2008)

The advent of automated manufacturing systems and the variability in demand pattern have forced the manufacturers to increase the flexibility and efficiency of their automated systems to stay competitive in the dynamic market. Loading decisions play an important role in determining the efficiency of manufacturing systems. Machine loading problems in flexible manufacturing systems (FMSs) are known to be NP-hard problems. Although some NP-hard problems could still be optimized for very small instances, machine loading complexity is so extensive that even small problems take excessive computational time to reach the optimal solution. To ease the tedious computations, and to get a good solution for large problems, this paper develops a special Immune Algorithm (IA) named 'Modified immune algorithm (MIA)'. IA is a suitable method due to its self learning capability and memory acquisition. This paper improves some issues inherent in existing IAs and proposes a more effective immune algorithm with reduced memory requirements and reduced computational complexity. In order to verify the efficacy and robustness of the proposed algorithm, the paper presents comparisons to existing immune algorithms with benchmark functions and standard data sets related to the machine loading problem. In addition proposed algorithm has been tested at different noise level to examine the efficiency of algorithm on different platforms. The comparisons show consistently that the proposed algorithm outperforms the existing techniques. For all machine loading dataset proposed algorithm has shown good results as compared to the best results reported in the literature.
Overview Use in Multiple Visual Information Resolution Interfaces
Authors: Heidi Lam Tamara Munzner, Robert Kincaid
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

In interfaces that provide multiple visual information resolutions (VIR), low-VIR overviews typically sacrifice visual details for display capacity, with the assumption that users can select regions of interest to examine at higher VIRs. Designers can create low-VIRs based on multi-level structure inherent in the data, but have little guidance with single-level data. To better guide design tradeoff between display capacity and visual target perceivability, we looked at overview use in two multiple-VIR interfaces with high-VIR displays either embedded within, or separate from, the overviews. We studied two visual requirements for effective overview and found that participants would reliably use the low-VIR overviews only when the visual targets were simple and had small visual spans. Otherwise, at least 20% chose to use the high-VIR view exclusively. Surprisingly, neither of the multiple-VIR interfaces provided performance benefits when compared to using the high-VIR view alone. However, we did observe benefits in providing side-by-side comparisons for target matching. We conjecture that the high cognitive load of multiple-VIR interface interactions, whether real or perceived, is a more considerable barrier to their effective use than was previously considered.
A Scalable Hybrid Approach to Switching in Metro Ethernet Networks
Authors: Minh Huynh, Prasant Mohapatra
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The most common technology in Local Area Networks is the Ethernet protocol. The continuing evolution of Ethernet has propelled it into the scope of Metropolitan Area Networks. Even though Ethernet is fast and simple, the Spanning Tree in Ethernet is inefficient in terms of network utilization and load balancing. In this work, we compare the performance of Spanning Tree and Link State algorithms in the context of layer 2 switching. In addition, we introduce a hybrid scheme that is customized for Metro Ethernet Networks. The results show that the hybrid scheme increases utilization and reduces the congestion ratio and delay. The performance gained as compared to RSTP, link state, and MSTP are 20.9%, 9.4%, and 11.4%, respectively. In addition, the hybrid scheme is more scalable than using pure link state.
USE: A UML-based specification environment for validating UML and OCL
Authors: Martin Gogolla, Fabian Büttner, Mark Richters
Venue: Science of Computer Programming (2007)

The Unified Modeling Language (UML) is accepted today as an important standard for developing software. UML tools however provide little support for validating and checking models in early development phases. There is also no substantial support for the Object Constraint Language (OCL). We present an approach for the validation of UML models and OCL constraints based on animation and certification. The USE tool (UML-based Specification Environment) supports analysts, designers and developers in executing UML models and checking OCL constraints and thus enables them to employ model-driven techniques for software production.
FCA for contextual semantic navigation and information retrieval in heterogeneous information systems
Authors: Geraldine Polaillon, Marie-Aude Aufaure, Benedicte Le Grand, Michel Soto
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper presents an information retrieval methodology which uses Formal Concept Analysis in conjunction with semantics to provide contextual answers to users' queries. User formulates a query on a set of heterogeneous data sources. This set is semantically unified by the proposed notion conceptual context. A context can be global: it defines a semantic space the user can query - or instantaneous- it defines the current position of the user in the semantic space. Our methodology consists first in a pre-treatment providing the global conceptual context and then in an online contextual processing of users' requests, associated to an instantaneous context This methodology can be applied to heterogeneous data sources such as web pages, databases, email, personal documents and images, etc. One interest of our approach is to perform a more relevant and refined information retrieval and contextual navigation, closer to the users' expectation.
A Hybrid Hopfield Network-Simulated Annealing approach to Optimize Routing Processes in Telecommunications Networks
Authors: W. H. Schuler, C. J. A. Bastos-Filho, A. L. I. Oliveira
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This article proposes a new hybrid technique to optimize an intelligent routing algorithm in telecommunications based on Hopfield Neural Networks (HNN) and Simulated Annealing (SA). The SA obtains the optimal parameters for Hopfield Neural Networks. The optimization was carried out considering as performance criterion a combination of (1) the error of the HNN routing algorithm as applied to find the shortest path between two nodes, and (2) the number of iterations employed by the HNN algorithm to find the shortest path. By using this approach better results have been achieved, with lower number of iterations and smaller error rates.
Processing Global Nearest Neighbor Query
Authors: Liu Xiaofeng, Chen Chuanbo, Liu YunSheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

This paper presented a new kind of query, global nearest neighbors query, which is based on a special distance, global distance, between two objects during given time interval. According to the relationship with continuous nearest neighbor query, a native algorithm is proposed. In terms of the mobility of data set, global distances at different situation are refined and some heuristics are presented for data set indexed by data structure of R tree family. Based on branch and bound technique and proposed pruning, updating and visiting heuristics, recursive depth-first and heap-based best-first query processing algorithms are developed for both cases. An extensive study based on experiments performed with synthetic data sets shows that the best-first algorithms outperform the depth-first algorithms.
WWTW: the world wide telecom web
Authors: Arun Kumar, Nitendra Rajput, Dipanjan Chakraborty, Sheetal K. Agarwal, Amit A. Nanavati
Venue: Proceedings of the 2007 workshop on Networked systems for developing regions (2007)

The World Wide Web (WWW) enabled quick and easy information dissemination and brought about fundamental changes to various aspects of our lives. However, a very large number of people, mostly in developing regions, are still untouched by this revolution. Compared to PCs, the primary access mechanism to WWW, mobile phones have made a phenomenal penetration into this population segment. Low cost of ownership, the simple user interface consisting of a small keyboard, limited menu and voice-based access contribute to the success of mobile phones with the less literate. However, apart from basic voice communication, these people are not being able to exploit the benefits of information and services available to WWW users. In this paper, we present the World Wide Telecom Web (WWTW) --- our vision of a voice-driven ecosystem parallel to that of the WWW. WWTW is a network of interconnected voice sites that are voice driven applications created by users and hosted in the network. It has the potential to enable the underprivileged population to become a part of the next generation converged networked world. We present a whole gamut of existing technology enablers for our vision as well as present research directions and open challenges that need to be solved to not only realize a WWTW but also to enable the two Webs to cross leverage each other.
XFlat: Query-friendly encrypted XML view publishing
Authors: Jun Gao, Tengjiao Wang, Dongqing Yang
Venue: Information Sciences: an International Journal (2008)

The security of published XML data receives exceptional attention due to its sensitive nature in many applications. This paper proposes an XML view publishing method called XFlat. Compared with other methods, XFlat focuses on query performance over the published XML view while simultaneously protecting the sensitive data via encryption techniques. XFlat decomposes an XML tree into a set of sub-trees, in each of which multiple users have the same accessibility to all nodes, and may encrypt and store each sub-tree in a flat, sequential manner. This storage strategy can avoid the nested encryption cost in view construction and the nested decryption cost in query evaluation. In addition, we discuss how to generate a user-specific schema and how to minimize the total space cost of the published XML view when considering the overhead of the relationships among the sub-trees. We also propose an XML schema index to enhance query performance over the final XML view. The experimental results demonstrate the effectiveness and efficiency of the proposed XFlat method.
Testing against Natural Language Requirements
Authors: Harry M. Sneed
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Testingagainstnaturallanguage requirementsisthestandardapproachforsystem andacceptancetesting.Thistestisoftenperformed byanindependenttestorganizationunfamiliarwith the application area. The only things the testers have togobyarethewrittenrequirements.Soitis essentialtobeabletoanalyzethoserequirements and to extract test cases from them. In this paper an automated approach to requirements based testing is presented andillustrated on an industrial application.
New formulation of robust MPC by incorporating off-line approach with on-line optimization
Authors: Baocang Ding, Biao Huang
Venue: International Journal of Systems Science (2007)

This article addresses robust model predictive control (MPC) for systems with polytopic description. An existing off-line robust MPC enables the on-line computation as simple as searching a state feedback gain among the look-up table. We consider enlarging the region of attraction of the off-line MPC by incorporating free perturbation items. First, a larger ellipsoidal region of attraction is off-line constructed, in which a simple optimization problem is solved on-line. Then, outside of this larger ellipsoid, a standard robust MPC is solved on-line such that the overall region of attraction can be rendered as a much larger nonellipsoidal one. The proposed approach possesses all the merits of the off-line MPC and greatly enlarges the region of attraction. A simulation example is given to demonstrate the effectiveness.
Segmentation by Morphological Reconstruction and Non-linear Diffusion
Authors: JaeMyeong Yoo, Toan Nguyen Dinh, GueeSang Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Existing methods for color image segmentation using diffusion can't preserve contour information and noises with high gradients become more salient as the number of times of the diffusion increases, resulting in over-segmentation when applied to watershed. This paper proposes a new method for color image segmentation by applying morphological operations together with nonlinear diffusion. Morphological reconstruction works very effectively for the removal of high frequency noises, while nonlinear diffusion can remove low frequency noises. Based on the idea, the input image can be transformed into a simplified image which preserves contour information with noises removed. With gradients computed from this simplified image, watershed algorithm is applied to get the segmentation. Experiments show that color images are segmented very effectively without over- segmentation.