ppxscal/embedding_network huggingface dataset:
Modeling Curled Leaves
Authors: Shenglian Lu, Chunjiang Zhao, Xinyu Guo, Changfeng Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this article we present a modeling method that allows easy generation of plant leaves and creating realistic images of curled leaves. Spline curve has been used to describe the skeleton and silhouette of a leaf, and the surface of the leaf blade is meshed with Delaunay triangulation based on the skeleton and silhouette. Then an adaptive refinement scheme is introduced to smooth the triangular mesh. This provides a common method for describing the morphology of plant leaf blade. In addition, our adaptive subdivision scheme can generate relatively smooth leaf surface and serve the need of curling, a variety of curled effects of the leaf can be created interactively basing on the subdivided surface. The results verify the validity of the proposed method.
DATC Newsletter
Authors: Joe Damore
Venue: IEEE Design Test (2007)

This newsletter provides news, events, and information related to the IEEE Computer Society's Design Automation Technical Committee and the EDA community.
QoS-Aware Web Service Selection by a Synthetic Weight
Authors: Pengcheng Xiong, Yushun Fan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The selection of web services according to different quality of service (QoS) is one of the most important decision issues for which complex considerations are involved. In many cases, the values for the qualitative QoS criteria are often imprecisely defined or acquired. Moreover, it is also not easy to accurately quantify the weight of each QoS criterion since human judgments including preference are often vague. In this paper, we apply the fundamental principles in the fuzzy set theory and model the decision making problem as Fuzzy Multiple Criteria Decision Making (FMCDM). The main contribution of this paper is to balance the subjective weight which reflects human rating and objective weight which represents reliability of evaluation criteria to form a synthetic weight. The detailed analysis of the synthetic weight for QoS-aware web service selection application is also presented.
A Case Study: CRM Adoption Success Factor Analysis and Six Sigma DMAIC Application
Authors: Zhedan Pan, Hoyeon Ryu, Jongmoon Baik
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

With today's increasingly competitive economy, many organizations have initiated customer relationship management (CRM) projects to improve customer satisfaction, revenue growth and employee productivity gains. However, only a few successful CRM implementations have successfully completed. In order to enhance the CRM implementation process and increase the success rate, in this paper, first we present the most significant success factors for CRM implementation identified by the results of literature reviews and a survey we conducted. Then we propose a strategy to integrate Six Sigma DMAIC methodology with the CRM implementation process addressing five critical success factors (CSF). Finally, we provide a case study to show how the proposed approach can be applied in the real CRM implementation projects. We conclude that by considering the critical success factors, the proposed approach can emphasize the critical part of implementation process and provide high possibility of CRM adoption success.
An efficient and resilient approach to filtering and disseminating streaming data
Authors: Shetal Shah, Shyamshankar Dharmarajan, Krithi Ramamritham
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Many web users monitor dynamic data such as stock prices, real-time sensor data and traffic data for making on-line decisions. Instances of such data can be viewed as data streams. In this paper, we consider techniques for creating a resilient and efficient content distribution network for such dynamically changing streaming data. We address the problem of maintaining the coherency of dynamic data items in a network of repositories: data disseminated to one repository is filtered by that repository and disseminated to repositories dependent on it. Our method is resilient to link failures and repository failures. This resiliency implies that data fidelity is not lost even when the repository from which (or a communication path through which) a user obtains data experiences failures. Experimental evaluation, using real world traces of streaming data, demonstrates that (i) the (computational and communication) cost of adding this redundancy is low, and (ii) surprisingly, in many cases, adding resiliency enhancing features actually improves the fidelity provided by the system even in cases when there are no failures. To further enhance fidelity, we also propose efficient techniques for filtering data arriving at one repository and for scheduling the dissemination of filtered data to another repository. Our results show that the combination of resiliency enhancing and efficiency improving techniques in fact help derive the potential that push based systems are said to have in delivering 100% fidelity. Without them, computational and communication delays inherent in dissemination networks can lead to a large fidelity loss even in push based dissemination.
Checking equivalence of quantum circuits and states
Authors: George F. Viamontes, Igor L. Markov, John P. Hayes
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as determining if two states or circuits are functionally equivalent. While differences in classical states are easy to detect, quantum states, which are represented by complex-valued vectors, exhibit subtle differences leading to several notions of equivalence. This provides flexibility in optimizing quantum circuits, but leads to difficult new equivalence-checking issues for simulation and synthesis. We identify several different equivalence-checking problems and present algorithms for practical benchmarks, including quantum communication and search circuits, which are shown to be very fast and robust for hundreds of qubits.
Women and men in the IT profession
Authors: Vicki R. McKinney Darryl D. Wilson, Nita Brooks, Anne O'Leary-Kelly, Bill Hardgrave
Venue: Communications of the ACM (2008)

Fewer women entering IT drives the underrepresentation problem.
Preliminary experiments in layout analysis of handwritten letters based on textural and spatial information and a 2D Markovian approach
Authors: Melanie Lemaitre, Emmanuele Grosicki, Francoise Preteux
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper addresses the problem of layout analysis of handwritten letters using textural and spatial information with a bidimensional Markovian approach. In this framework, the layout extraction is viewed as a labeling problem which aims to find the optimal configuration of the Markov Random Field performed by the 2D Dynamic Programming method [8]. Preliminary experiments have been led on a small part of the RIMES database [3] for which an error rate of 15% has been achieved.
Sharing Data on the Grid using Ontologies and distributed SPARQL Queries
Authors: Andreas Langegger, Martin Blochl, Wolfram Woss
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The vision of the Semantic Web is to make Web content machine-readable. To describe data, the Resource Descrip- tion Framework has been extended with a schema-level and description logics (e.g. RDF-S and OWL DL). To success- fully retrieve data described by RDF-based ontologies, the query language SPARQL is currently being developed at W3C. However, although SPARQL also provides a clien- t/server protocol, currently queries are targeted to single sites only. For a large-scale data integration, which is the scope of a middleware developed within the Austrian Grid project, it is necessary to execute queries on distributed data nodes. Because of the large amount of research un- dertaken in the field of relational database systems, it is reasonable to apply relational algebra to SPARQL query processors. In fact, most RDF triple stores are based on re- lational database systems. In this paper, several concepts are proposed to enable the integration of heterogeneous, distributed data sources with SPARQL.
Statistical and Fuzzy Approach for Database Security
Authors: Gang Lu, Junkai Yi, Kevin Lu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A new type of database anomaly is described by addressing the concept of Cumulated Anomaly in this paper. Dubiety-Determining Model (DDM), which is a detection model basing on statistical and fuzzy set theories for Cumulated Anomaly, is proposed. DDM can measure the dubiety degree of each database transaction quantitatively. Software system architecture to support the DDM for monitoring database transactions is designed. We also implemented the system and tested it. Our experimental results show that the DDM method is feasible and effective.
Region-based Image Fusion by Using Region Priorities
Authors: Zhang Yingjie, Ge Liling
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, a new region-based approach to multi-resolution image fusion is presented. To make fusion decision better, a master image is selected from the source images. Then, it is segmented using the background subtraction based Mumford and Shah algorithm, which significantly improves the segmentation at quality and convergence speed. After that, the fusion rules on every region of the image are determined based on the best priority-first strategy. Moreover, the fusion on the whole image domain is replaced by using different rules on every segmented region of the image. The corresponding regions in other images are located by linear mapping methods. Some numerical results have been given and compared to the pixel-based fusion methods. Despite an increase in complexity, more intelligent fusion rules may be applied to remove side effects like reducing contrast and sensitive to error of registration.
Cell Broadband Engine Debugging for Unknown Events
Authors: Mack W. Riley, Mike Genden
Venue: IEEE Design Test (2007)

Architecture and design of debugging logic for high-speed processor chips is somewhat of an art form, requiring the design of logic intended to isolate events that have not occurred. In fact, the goal is for such events never to occur, but history has shown that there are usually a few problems that need debugging. The Cell Broadband Engine processor is a new multicore processor that pushed the design limits. This article explores some of the debugging features that were added to the Cell Broadband Engine design to help debug unknown events.
Building a RCP (Rate Control Protocol) Test Network
Authors: Nandita Dukkipati, Glen Gibb, Nick McKeown, Jiang Zhu
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

We recently proposed the Rate Control Protocol (RCP) as way to minimize download times (or flow-completion times). Simulations suggest that if RCP were widely deployed, downloads would frequently finish ten times faster than with TCP. This is because RCP involves explicit feedback from the routers along the path, allowing a sender to pick a fast starting rate, and adapt quickly to network conditions. RCP is particularly appealing because it can be shown to be stable under broad operating conditions, and its performance is independent of the flow-size distribution and the RTT. Although it requires changes to the routers, the changes are small: The routers keep no per-flow state or per-flow queues, and the per-packet processing is minimal. However, the bar is high for a new congestion control mechanism - introducing a new scheme requires enormous change, and the argument needs to be compelling. And so, to enable some scientific and repeatable experiments with RCP, we have built and tested an open and public implementation of RCP; we have made available both the endhost software, and the router hardware. In this paper we describe our end-host implementation of RCP in Linux, and our router implementation in Verilog (on the NetFPGA platform). We hope that others will be able to use these implementations to experiment with RCP and further our understanding of congestion control.
Implementing Distributed Read-Only Transactions
Authors: A. Chan
Venue: IEEE Transactions on Software Engineering (1985)

This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to guarantee that distributed read-only transactions see semantically consistent snap-shots of the database, that they never have to be rolled-back due to their late arrival at retrieval sites, and that they inflict minimal synchronization delays on concurrent update transactions. Proof that the presented scheme guarantees semantic consistency is provided. Two important by-products of this scheme are that the recovery from transaction and system failures is greatly simplified and the taking of database dumps also can be accommodated while leaving the database on-line.
Measuring and Calculating Queue Length Distributions
Authors: J. P. Buzen
Venue: Computer (1980)

Operational analysis, an alternative to stochastic analysis based on measurable variables rather than abstract parameters, simplifies proofs of formulas for computing response times and queue lengths.
Measurement Based Call Quality Reporting
Authors: Rene Serral-Gracia, Lorand Jakab, Jordi Domingo-Pascual
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Real-time traffic is an important issue when designing networks. The growth in the deployment of voice applications in packet switched networks requires that the network can guarantee a minimum level of quality. At the same time, customers want guaranties that the proper Quality of Service is provided for their contracted services. In this environment service providers need means of reporting the quality level of their networks. Standardisation bodies define general metrics, such as delay, jitter or losses without giving detailed information regarding the actual user's perception of the traffic. Other approaches such as the Mean Opinion Score (MOS), are too coarse to be significant on best-effort based environments such as the Internet. This work is motivated by the potential change in the Quality of Service (QoS) parameters found in packet switched networks. Which highlights the inaccuracy of metrics such as MOS, since they were designed for the stable circuit switched networks. This paper proposes a novel approach to on-line voice quality measurement which is more suitable for packet switched networks than the classical alternatives, while keeping the subjective approach of MOS. Moreover, our solution permits the real-time reporting of the voice communication's quality. Along with the specification of this metric, the paper provides an experimental validation of the proposal using a real testbed with real applications. The results show the higher accuracy in reporting using this proposal over the standard metrics currently used.
Time-Series Data Prediction Based on Trending Structure Sequence and Rough Set
Authors: Fei Hao, Zheng Pei
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Time series data is a series of observation data accord- ing to a certain time sequence. It has been penetrate various field. This paper applies Rough set to the knowledge dis- covery of time series. The process of knowledge discovery in time series includes preprocessing of time series data, at- tributes selection and similarity sequence searching. Then, the time series is partitioned to a set of pattern(each pattern represents a trend of time series)by mobile window method. An information table is formed by the most important pre- dicting attributes and target attribute which in the trend- ing structure sequence identified from each pattern. This information table is suitable for the Rough set to discover knowledge. The extracted rules can predict the time series behavior in the future. We demonstrate our method on time series stock market data.
Research on the Fuzzy Quantitative Association Rules Mining Algorithm and Its Simulation
Authors: Shuhong Zhang, Jianxun Sun, Pengcheng Wu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A key problem of mining quantitative association rules is to partition the continuous quantitative attribute. In this paper, it has been solved by using fuzzy partition, which can provide a smooth transition of data partition. Further more, based on the formal definition of fuzzy quantitative association rules, a quantitative association rules mining algorithm is proposed. This algorithm partitions continuous quantitative attribute using fuzzy clustering method to transform the original continuous quantitative attribute data into fuzzy membership function matrix, and then association rules can be mining. The simulation research based on large scale database shows that the mining algorithm of fuzzy quantitative association rules is effective and suitable for the quantitative association rules mining and knowledge discovery of large scale database.
Robust Face Detection for Video Summary Using Illumination-Compensation and Morphological Processing
Authors: Jae-Ung Yun, Hyung-Jin Lee, Anjan Kumar Paul, Joong-Hwan Baek
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper presents a simple and robust face detection algorithm that can be utilized to video summary. Because the characteristic of the face can be change from unexpected condition like as shadows or lighting, we firstly process the Illumination-Compensation for maintaining face components. And then, we analyze color-based face region in YCbCr space to obtain the skin color. Also, we try the morphological image processing called closing algorithm to improve the detection performance and reducing the number of false detected face regions. The steps of the closing algorithm are dilation and erosion that find the candidates in face region and removes noise from the non-face region. For localization of the face region, we make a proper face location based on golden ratio. We evaluate our algorithm in the various genres. Experimental results demonstrate the effectiveness of our face detection algorithm that leads 96.7 % precision ratio on average. The proposed method is applicable to video summary because of these high performances with low complexity.
VLSI Design of Multi Standard Turbo Decoder for 3G and Beyond
Authors: Imran Ahmed, Tughrul Arslan
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Turbo decoding architectures have greater error correcting capability than any other known code. Due to their excellent performance turbo codes have been employed in several transmission systems such as CDMA2000, WCDMA (UMTS), ADSL, IEEE 802.16 metropolitan networks etc. The computation kernel of the algorithm is very similar and we have exploited this commonality for a turbo decoder VLSI design suitable for deployment using platform based system on chip methodologies. Turbo and viterbi components of the unified array are also individually reconfigurable for different standards. This supports the 4G concept that user can be simultaneously connected to several access technologies (for example Wi-Fi, 3G, GSM etc) and can seamlessly move between them. A new normalization scheme for turbo decoding is presented to suit reconfigurable mappings. We have also shown dynamic reconfiguration methodology for a context switch between Turbo and Viterbi decoders which does not waste any clock cycles. The reconfigurable Turbo decoder fabric is implemented reusing components of Viterbi decoder on a 180 nm UMC process technology.
TTTC Newsletter
Authors: Bruce C. Kim
Venue: IEEE Design Test (2007)

This newsletter provides information on past and upcoming events related to the IEEE Computer Society's Test Technology Technical Council and the test community.
Machine Learning to Boost the Next Generation of Visualization Technology
Authors: Kwan-Liu Ma
Venue: IEEE Computer Graphics and Applications (2007)

Many visualization systems do not get widespread adoption because they confront the user with sophisticated operations and interfaces. The author suggests augmenting visualization systems with learning capability to improve both the performance and usability of visualization systems. Several examples including volume segmentation, flow feature extraction, and network security are given illustrating how machine learning can help streamline the process of visualization, simplify the user interface and interaction, and support collaborative work.
An Analytical Model for Link Evaluation of Wireless Sensor Networks
Authors: Xu Jiu-qiang, Sun Pei-gang, Zhao Hai, Zhang Xi-yuan, Zhu Jian, Cheng Da-wei
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

It is very important to design the upper protocols for wireless sensor networks by underlying link quality evaluation. Firstly, the respective characteristics of several typical transceiver chips in WSNs are analyzed and an analytical model for 2.4GHz communication link is established based on CC2420 chip of MicaZ nodes. Secondly, a test environment is built based on the existing MicaZ nodes and the above model is validated by doing some statistical analysis for large numbers of samples. Finally, the correlative empirical values and the corresponding receiver BER formula required by the model are presented in the light of different environments and different wireless transceiver chips. The reasoning in the paper takes on universality and the conclusion drawn from the paper can be used as theoretical basis for the link simulation and can be provided with the reference value for the upper protocol analyzers and designers.
Aggregation of fuzzy preference relations to multicriteria decision making
Authors: Vania Peneva, Ivan Popchev
Venue: Fuzzy Optimization and Decision Making (2007)

Weighted aggregation of fuzzy preference relations on the set of alternatives by several criteria in decision-making problems is considered. Pairwise comparisons with respect to importance of the criteria are given in fuzzy preference relation as well. The aggregation procedure uses the composition between each two relations of the alternatives. The membership function of the newly constructed fuzzy preference relation includes t-norms and t-conorms to take into account the relation between the criteria importance. Properties of the composition and new relation, giving a possibility to make a consistent choice or to rank the alternatives, are proved. An illustrative numerical study and comparative examples are presented.