ppxscal/embedding_network huggingface dataset:
An approach for the high-level specification of QoS-aware grid workflows considering location affinity
Authors: Ivona Brandic, Sabri Pllana, Siegfried Benkner
Venue: Scientific Programming (2006)

Many important scientific and engineering problems may be solved by combining multiple applications in the form of a Grid workflow. We consider that for the wide acceptance of Grid technology it is important that the user has the possibility to express requirements on Quality of Service (QoS) at workflow specification time. However, most of the existing workflow languages lack constructs for QoS specification. In this paper we present an approach for high level workflow specification that considers a comprehensive set of QoS requirements. Besides performance related QoS, it includes economical, legal and security aspects. For instance, for security or legal reasons the user may express the location affinity regarding Grid resources on which certain workflow tasks may be executed. Our QoS-aware workflow system provides support for the whole workflow life cycle from specification to execution. Workflow is specified graphically, in an intuitive manner, based on a standard visual modeling language. A set of QoS-aware service-oriented components is provided for workflow planning to support automatic constraint-based service negotiation and workflow optimization. For reducing the complexity of workflow planning, we introduce a QoS-aware workflow reduction technique. We illustrate our approach with a real-world workflow for maxillo facial surgery simulation.
Visual Analytics for Requirements-driven Risk Assessment
Authors: Robin A. Gandhi, Seok-Won Lee
Venue: Proceedings of the Second International Workshop on Requirements Engineering Visualization (2007)

Risk assessment is a complex decision making process during Certification and Accreditation (C&A) activities. It requires to understand the multidimensional correlations among numerous C&A requirements to reason about their collective and adequate behavior to minimize risks to a software system. Also, diverse stakeholders in the organizational hierarchy should be able to comprehend and utilize the risk assessment artifacts to agree upon an acceptable level of risks and justify the criticality and cost of mitigation strategies related to C&A requirements. We believe requirements visualization plays an important role in providing rich contextual information for understanding and analyzing risk assessment artifacts and present our initial experiences in using intuitive visual metaphors and their explanations for requirements-driven risk assessment [8] [11].
Hidden menu options in automated human - computer telephone dialogues: dissonance in the user's mental model
Authors: J. Wilke, F. McInnes, M. A. Jack
Venue: Behaviour & Information Technology (2007)

This paper explores the consequences of adopting an alternative strategy to that of explicitly listing all options within the main menu of a speech-driven automated telephone banking service. An existing service was augmented with an overdraft request dialogue, accessible at its main menu, which could be triggered using the keyword "overdraft". However, the keyword was not explicitly mentioned as an option in the main menu. Instead, system-initiated proposals for an overdraft were introduced into the call flow, notifying callers that they could apply for an overdraft by saying "overdraft" at the main menu. An experiment with 114 participants was carried out to investigate the effectiveness of this strategy as a way of offering new services without increasing the length of the main menu. Results showed that a significant proportion of participants (37%) did not succeed in completing an overdraft request. The reasons for this failure are discussed.
A soft error analysis tool for high-speed digital designs
Authors: Jong Kang Park, Hyun Suk Choi, Jong Tae Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Evaluation of soft error hardness becomes more important for modern electrical and electronic devices as the semi-conductor technology advances. Recent studies have mainly focused on soft error rate analysis of combinational logic circuits which has been used with simulation and/or path-based statistical estimation. Only a few studies suggested the techniques for evaluating sequential circuits. To assess soft error susceptibility for general cell-based designs, it is essential to analyze variation of total SER between clock-to-clock transitions as well as initial soft error rates. This paper presents a two-pass soft error analysis technique, which provides both initial and dynamic error rate of digital circuits. Especially, the logical probabilities for noise generation and propagation are considered in detail without much computational complexity. Experimental results are reported from a pre-characterized 130nm technology cell library.
Independent component analysis and nongaussianity for blind image deconvolution and deblurring
Authors: Hujun Yin, Israr Hussain
Venue: Integrated Computer-Aided Engineering (2008)

Blind deconvolution or deblurring is a challenging problem in many signal processing applications as signals and images often suffer from blurring or point spreading with unknown blurring kernels or point-spread functions as well as noise corruption. Most existing methods require certain knowledge about both the signal and the kernel and their performance depends on the amount of prior information regarding the both. Independent component analysis (ICA) has emerged as a useful method for recovering signals from their mixtures. However, ICA usually requires a number of different input signals to uncover the mixing mechanism. In this paper a blind deconvolution and deblurring method is proposed based on the nongaussianity measure of ICA as well as a genetic algorithm. The method is simple and does not require prior knowledge regarding either the image or the blurring process, but is able to estimate or approximate the blurring kernel from a single blurred image. Various blurring functions are described and discussed. The proposed method has been tested on images degraded by different blurring kernels and the results are compared to those of existing methods such as Wiener filter, regularization filter, and the Richardson-Lucy method. Experimental results show that the proposed method outperform these methods.
QoS-Based Learning Services Composition for Ubiquitous Learning
Authors: Fu-Ming Huang, Ci-Wei Lan, Stephen J. H. Yang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

With the advance of Internet technologies and handheld computer, lots of software components are built for ubiquitous learning activities. Meanwhile, many studies devote to the promotion of a universal access way and wider reuse-ability of these ubiquitous learning components with the Web services. Nevertheless, the QoS capability will be a decisive characteristic to distinguish services with identical functionalities from each other. In this paper, we propose an efficient service selection scheme to help teacher pick out learning services by considering two different contexts namely single QoS-based service discovery and QoS-based optimization of service composition. Based on different concerns, we present the corresponding solutions to demonstrate the evaluation process of QoS capability for service selection. The experimental results not only showed our solution is more efficient than the others but also proved our solution can work well for complicated scenarios.
Analyzing rigidity with pebble games
Authors: Audrey Lee, Ileana Streinu, Louis Theran
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

How many pair-wise distances must be prescribed between an unknown set of points, and how should they be distributed, to determine only a discrete set of possible solutions? These questions, and related generalizations, are central in a variety of applications. Combinatorial rigidity shows that in two-dimensions one can get the answer, generically, via an efficiently testable sparse graph property. We present a video and a web site illustrating algorithmic results for a variety of rigidity-related problems, as well as abstract generalizations. Our accompanying interactive software is based on a comprehensive implementation of the pebble game paradigm.
Incorporating Events into Cross-Organizational Business Processes
Authors: Payal Chakravarty, Munindar P. Singh
Venue: IEEE Internet Computing (2008)

Because Web-scale processes are inherently cross-organizational, they require the robust enactment of interactions among autonomous parties. However, specifying the processes involved is difficult. To overcome this obstacle, the authors use a business protocol that lets the applicable events and responses vary based on where the process is deployed and the infrastructure and IT applications installed therein. Treating events and business logic as separate concerns also yields clearer models and improves reusability. The authors describe the architecture and tools and outline a methodology by which each participant in a process can define, detect, and respond to events.
Visualising Product Line Requirement Selection Decision Inter-dependencies
Authors: David Sellier, Mike Mannion
Venue: Proceedings of the Second International Workshop on Requirements Engineering Visualization (2007)

A software product line is defined as a set of software products sharing a set of common features but containing significant variability. Mature software product lines generate a large number of variable requirements and complex interdependencies between them. A significant challenge is to provide engineers with clear and understandable views of these inter-dependencies and their impact. This paper presents a visualisation meta-model for representing inter-dependencies between product line and describes a tool to realise these visualisations.
A match made in Hollywood heaven: how video games made animation and filmmaking (a lot) easier
Authors: Philip Swinstead
Venue: ACM SIGGRAPH Computer Graphics (2008)

I may have some friends and relatives that would argue with me about this, but I am fairly certain that my knack for spotting the early signs of seismic shifts in the software industry is just about the only thing I have ever been any good at. And although I don't claim, nor do I desire, to be in the same sort of public standing as the Bill Gates' of the world, I have been fortunate enough to be involved in the steering of some wonderful software enterprises over the years.
Automatic gender recognition
Authors: Dat Tran, Dharmendra Sharma
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents an automatic gender recognition technique based on speaker's voice. Utterances spoken by same-gender speakers were used to train a text-independent hidden Markov gender model. Female and male models are continuous hidden Markov models. Experiments on the TI-46 database containing 46 words spoken by 8 female and 8 male speakers showed an acceptable recognition rate.
A wideband fractional-N frequency synthesizer with novel self-calibration technique
Authors: Shiwei Cheng, Ke Zhang, Shengguo Cao, Xiaofang Zhou, DianZhou DianZhou
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

In this paper, a programmable phase-locked-loop (PLL)-based fractional-N frequency synthesizer, with the capacity of automatically adjusting the nominal frequency of voltage-controlled oscillator (VCO) is presented. The monolithic wideband VCO, with digital and analog control, is capable of operating from 1.6GHz to 2.5GHz. Analog control voltage is only varied from 0.8V to 1.2 V to improve the linearity of varactors in submicron process. The synthesizer is, designed in UMC 0.18um RF process, consumes 30.8mW.
Distributed Source Coding Using Raptor Codes for Hidden Markov Sources
Authors: M. Fresia, L. Vandendorpe, H. V. Poor
Venue: Proceedings of the Data Compression Conference (2008)

In this paper the problem of distributed source coding (DSC) of binary sources with side information at the decoder is addressed. A scheme is proposed based on Raptor codes which are a new class of rateless codes. The decoding scheme is adapted to this problem by implementing a message passing strategy between the constituent decoders of Raptor codes at each decoding iteration. The general case in which the sources are modeled as hidden Markov processes (HMPs) is considered. To exploit the Markovian nature of the sources, a module is added to the decoder to help the estimation process. This module is necessary to achieve good performance.
Specific Absorption Rate (SAR) on the Human Head as Function of Orientation of Plane Wave Radiation: FDTD-Based Analysis
Authors: Akram Gasmelseed, Jasmy Yunus
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this paper we have evaluated the specific absorption rate (SAR) in two-dimensional (2D) human head model at GSM 900 MHz (Global System for Mobile telecommunication) radiation. The head model is exposed to an incident plane wave with amplitude of 61.4 V/m. Two cases of incidence are considered in this paper. The first is the coronal incidence case where the incident field is directed toward the coronal plane of the head model. The second is the sagittal incidence where the incident field is directed toward the sagittal plane. The computations are performed in both cases using the finite difference time domain (FDTD) method. The FDTD code is implemented using Laboratory Virtual Instrument Engineering Workbench (LabVIEW) software. It is observed that the two incidence cases have almost the same whole head averaged SAR.
Face Detection in Color Images Using AdaBoost Algorithm Based on Skin Color Information
Authors: Yanwen Wu, Xueyi Ai
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This paper proposes a novel technique for detecting faces in color images using AdaBoost algorithm combined with skin color segmentation.First,skin color model in the YCbCr chrominance space is built to segment the non-skin-color pixels from the image. Then, mathematical morphological operators are used to remove noisy regions and fill holes in the skin-color region, so we can extract candidate human face regions. Finally,these face candidates are scanned by cascade classifier based on AdaBoost for more accurate face detection. This system detects human face in different scales, various poses, different expressions, lighting conditions, and orientation. Experimental results show the proposed system obtains competitive results and improves detection performance substantially.
Service oriented system for business cooperation
Authors: Anca Daniela Ionita, Alessandra Catapano, Stelian Giuroiu, Monica Florea
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

A European system giving a one-stop access point to complex business services from various countries has to overcome some important challenges: to create an integrated framework of interoperable services, to grasp the commonalities of the necessary processes and terminologies, to allow the introduction of specificities for each country. LD-CAST system supports the commonalities, using Service Oriented Architecture (SOA), business ontology and generic web services, while the country specificities are introduced by modelling particular business processes and invoking web services delivered by local service providers. The link between the two aspects is realised at run-time, with the help of semantic technologies, despite the coexistence of manual and automatic activities.
Telecom Alarm Prioritization Using Neural Networks
Authors: Stefan Wallin, Leif Landen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Telecom Service Providers are faced with an overwhelming flow of alarms. Network administrators need to judge which alarms to resolve in order to maintain the service quality. The problem is that it is hard to pick the most important alarms. Which alarms have the highest priority? A solution that automatically assigns priorities to alarms would increase the efficiency of Network Management Centers. We have prototyped a solution that uses neural networks to assign alarm priority. The neural network learns from network administrators by using the manually assigned priorities in trouble-tickets. Our tests are based on live-data from a large mobile service provider and we show that neural networks can learn to assign relevant priorities to 75% of the alarms.
Incorporating constraints in probabilistic XML
Authors: Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

Constraints are important not just for maintaining data integrity, but also because they capture natural probabilistic dependencies among data items. A probabilistic XML database (PXDB) is the probability sub-space comprising the instances of a p-document that satisfy a set of constraints. In contrast to existing models that can express probabilistic dependencies, it is shown that query evaluation is tractable in PXDBs. The problems of sampling and determining well-definedness (i.e., whether the above subspace is nonempty) are also tractable. Furthermore, queries and constraints can include the aggregate functions count, max, min and ratio. Finally, this approach can be easily extended to allow a probabilistic interpretation of constraints.
Implementation and evaluation of a migration-based NUCA design for chip multiprocessors
Authors: Feihui Li, Mahmut Kandemir, Mary J. Irwin
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

Chip Multiprocessors (CMPs) and Non-Uniform Cache Architectures (NUCAs) represent two emerging trends in computer architecture. Targeting future CMP based systems with NUCA type L2 caches, this paper proposes a novel data migration algorithm for parallel applications and evaluates it. The goal of this migration scheme is to determine a suitable location for each data block within a large L2 space at any given point during execution. A unique characteristic of the proposed scheme is that it models the problem of optimal data placement in the L2 cache space as a two dimensional post office placement problem, presents a practical architectural implementation of this model, and gives an evaluation of the proposed implementation.
Slowing Down Sorting Networks To Obtain Faster Sorting Algorithm
Authors: R. Cole
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. We give a general method that trims a factor o f 0(logn) time (or more) for many applications of this technique. 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
Claw-free graphs. III. Circular interval graphs
Authors: Maria Chudnovsky, Paul Seymour
Venue: Journal of Combinatorial Theory Series B (2008)

Construct a graph as follows. Take a circle, and a collection of intervals from it, no three of which have union the entire circle; take a finite set of points V from the circle; and make a graph with vertex set V in which two vertices are adjacent if they both belong to one of the intervals. Such graphs are ''long circular interval graphs,'' and they form an important subclass of the class of all claw-free graphs. In this paper we characterize them by excluded induced subgraphs. This is a step towards the main goal of this series, to find a structural characterization of all claw-free graphs. This paper also gives an analysis of the connected claw-free graphs G with a clique the deletion of which disconnects G into two parts both with at least two vertices.
Alice: a dying man's passion
Authors: Randy Pausch
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

I have spent the last fifteen years of my life leading an incredible team. Our quest (which we did not even realize in the beginning) was to revolutionize the way computer programming is taught. Current versions of the Alice system (Alice v2.0, and Caitlin Kelleher's "Storytelling Alice") have been very effective in the college classroom and in tests with middle school girls. The use of drag-and-drop authoring to create 3D movies has proved to be a powerful motivator for students of all ages and both genders. In 2008, we will release Alice v3.0, which provides "real Java" programming and the characters from EA's "The Sims," the most popular PC video game in history. Damn shame I won't be there to see it. As you probably know, I'm dying of pancreatic cancer, as became widely known in my "Last Lecture." Like Moses, I get to see the promised land, but not set foot in it. But the vision is clear. Long before I became ill, Dennis Cosgrove took over the responsibility for the design of Alice v3.0, and he's doing a whale of a job. Steve Cooper (of St. Joseph's University), Wanda Dann, and Don Slater are handling the pedagogic materials for college and high school, and Caitlin Kelleher (now junior faculty at Washington University in St. Louis) is heading the efforts regarding middle school girls. This talk will address the history, philosophy, and future of the Alice project, and will include a behind-the-scenes look at a pre-release version of Alice v3.0. I will give this address in person if I am still alive and able, or by a combination of pre-taped video and help from the Alice team. I cannot imagine a better professional legacy than what the Alice team is currently building.
Optimization of students' anti-epidemic prophylaxis
Authors: I. D. Kolesin, E. M. Zhitkova
Venue: Automation and Remote Control (2008)

A possibility of applying a method of optimal control theory to constructing economical modes of students' prophylaxis during a seasonal growth of acute respiratory diseases is studied. A model of seasonal growth is represented and two schemes are compared: a scheme of two-stage optimization and a scheme of sliding plan. A conclusion is made in favor of the second scheme. Numerical examples of programs with optimal switching moments are represented.