ppxscal/embedding_network huggingface dataset:
Enhancing Workflow Automation in Insurance Underwriting Processes with Web Services and Alerts
Authors: Raymond C. M. Lee, Kai Pan Mark, Dickson K. W. Chiu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Underwriting is one of the important processes in insurance operations. The applicant's information, including various kinds of medical information, must be evaluated before the insurance company can decide to accept the application. These activities are usually supported by process automation facility. However, the support of exception handling mechanism and the monitoring of turnaround time in those process automation solutions are usually inadequate. This results in a low efficiency of the underwriting operations or even loss of business opportunities. To address the problem, this paper presents an Alertenhanced Underwriting System (AUS), which handles the exception events and monitors the turnaround time with the concept of alerts. We further illustrate how Web services facilitate workflow integration and process communications.
ISPIHT-Improved SPIHT: A Simplified and Efficient Subband Coding Scheme
Authors: Yumnam Kirani Singh
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Propsed here is a new subband coding scheme entitled ISPIHT (Improved SPIHT). It is simpler in its coding approach yet it is more efficient in time and memory keeping the performance of SPIHT preserved. It requires less no of compression operations during the coding. The memory requirement for ISPIHT is about two times less than SPIHT.
An Approach for Pre-Silicon Power Modeling
Authors: Prashant Agrawal, Srinivasa R. STG, Ajit N. Oke, Saurabh Vijay
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Accurate estimation of power in pre-silicon is very important and finally to validate this against post-silicon measurement is essential throughout product lifecycle. Thermal Design Power (TDP)1 estimates are used to design package thermal solutions. In this paper a modeling approach for dynamic power estimation under TDP conditions is proposed. In this approach, separate models are built for each partition in the design. The model uses only bandwidth and the effective toggle rate of the input data for estimating the total switched capacitance and dynamic power. The model takes into account the effect of cross-coupling capacitance on dynamic power. The results obtained from the model are within 7% of the measured data.
Evolution of Next Generation Networks towards an Integrated Platform for IMS-Based IPTV Services
Authors: Oliver Friedrich, Adel Al-Hezmi, Stefan Arbanowski, Thomas Magedanz
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Next Generation Networks offer dedicated subsystems for each task to be fulfilled within the overall architecture defined in TISPAN NGN Release 1 [1]. There exist different subsystems for PSTN/ISDN emulation, streaming services and the 3GPP driven IP Multimedia Subsystem (IMS) which has been adapted to the NGN architecture. In NGN Release 2.0 IPTV shall be integrated into that architecture to support extended streaming services for next generation television. Current developments within ETSI TISPAN show two different approaches when speaking of the integration of IPTV services into the NGN: One IMS-based solution that relies on IMS/SIP signaling for new services and a non-IMS black box approach as an independent NGN subsystem. Our research activities are focused on the IMS-based activities and aim on the development of a reference architecture and on the service definition towards the now starting ETSI TISPAN standardization activities. This work shall introduce our architecture approach and evaluation based on precedent scenario and requirement analysis.
Estimating mechanical properties of the heart using dynamic modeling and magnetic resonance imaging
Authors: A. Jeremic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We present an algorithm for estimating active and passive mechanical properties of the heart using magnetic resonance imaging (MRI) tissue-tagging and blood pressure measurements. We combine physical modeling with a finite-element formulation and dynamic analysis, and apply non-linear optimization to estimate the unknown parameters. We assume that the myocardium's stiffness tensor is anisotropic and non-homogeneous.
Audio-visual speaker verification using continuous fused HMMs
Authors: David Dean, Sridha Sridharan, Tim Wark
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

This paper examines audio-visual speaker verification using a novel adaptation of fused hidden Markov models, in comparison to output fusion of individual classifiers in the audio and video modalities. A comparison of both hidden Markov model (HMM) and Gaussian mixture model (GMM) classifiers in both modalities under output fusion shows that the choice of audio classifier is more important than video. Although temporal information allows a HMM to outperform a GMM individually in video, this temporal information does not carry through to output fusion with an audio classifier, where the difference between the two video classifiers is minor. An adaptation of fused hidden Markov models, designed to be more robust to within-speaker variation, is used to show that the temporal relationship between video observations and audio states can be harnessed to reduce errors in audio-visual speaker verification when compared to output fusion.
Do No Harm: Model Checking eHome Applications
Authors: Zebin Chen, Stephen Fickas
Venue: Proceedings of the 1st International Workshop on Software Engineering for Pervasive Computing Applications, Systems, and Environments (2007)

Our group is building eHome applications for the Cognitively Impaired population. We have chosen to work with an existing framework, OSGi, that allows us to more quickly develop specific applications. We use a combination of traditional testing and formal verification to insure that the OSGi-based applications we build will cause no harm to the cognitively impaired users of our systems. This paper will focus on our results to date of using model checking to verify OSGi applications. In this paper, we describe the construction of a formal model parallel to the OSGi framework, which can be reused for rapid development of formal models for OSGi applications. With this approach, we have found the existence of stale references in several real examples. Stale references are a known concurrency problem in OSGi applications but difficult to get rid of. We argue that domain-specific reuse at the model level is an effective way to bring model checking closer to typical developers and tackle the concurrency errors. We also proposed and verified potential solutions, which can be used as generic paradigms to tackle the stale references problem in OSGi applications.
Efficient quadrature for highly oscillatory integrals involving critical points
Authors: Shuhuang Xiang
Venue: Journal of Computational and Applied Mathematics (2007)

This paper based on the Levin collocation method and Levin-type method together with composite two-point Gauss-Legendre quadrature presents efficient quadrature for integral transformations of highly oscillatory functions with critical points. The effectiveness and accuracy of the quadrature are tested.
Dynamic Parity Grouping for Improving Write Performance of RAID-5 Disk Arrays
Authors: Philip S. Yu, Kun-Lung Wu, Asit Dan
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

One major drawback of a RAIDS disk array system is that an update to a data block may involve four disk accesses. Such a high overhead is especially undesirable for workloads with a high update rate. In this paper, we present a dynamic parity grouping (DPG) scheme for efficient parity buffering to reduce the write overhead of a RAID-5 system. In DPG, special parity groups are dynamically created for data blocks with high write activity, referred to as the hot data blocks, in addition to default parity groups for the remaining cold data blocks. The parity blocks of the special parity groups are then buffered in the disk controller cache. As a result, the number of disk accesses on a write to a hot data block is reduced to two.
A table-based layout editor
Authors: George A. Howlett
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

This paper describes a user-interface layout editor built upon the BLT library. It offers a drag-and-drop graphical model where new layout designs can be created or existing designs can be tuned.
Some new results on node-capacitated packing of A-paths
Authors: Gyula Pap
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In this paper we propose a (semi-strongly) polynomial time algorithm to find a maximum packing subject to node-capacities, and thus we obtain a generalization of Keijsper, Pendavingh and Stougie algorithm concerning edge-capacities. Our method is based on Gerards' strongly polynomial time algorithm to find a maximum b-matching in a graph, which is based on a so-called Proximity Lemma. Our node-capacitated A-path packing algorithm first constructs a maximum fractional packing by using an ellipsoid method subroutine, then takes its integer part to obtain a near-optimal integral packing, and finally we construct a maximum integer packing by a short sequence of augmentations. This short sequence of augmentations is constructed by applying the version of Gerards' Proximity Lemma, specially formulated for the node-capacitated A-path packing problem. In addition, we also state some related results on the fractional packing problem. We prove the primal- and dual integrality of the corresponding linear program. We mention that the fractional packing problem reduces to the matroid fractional matching problem.
Non-binary SOVA algorithms for decoding of block codes on a sectionalized trellis: Research Articles
Authors: Fabrice Labeau
Venue: Wireless Communications Mobile Computing (2007)

In this paper, we explore computationally efficient implementations of the soft output viterbi algorithm (SOVA) applied to Soft-Input Soft-Output (SISO) decoding of linear block codes. In order to simplify the trellis-based decoding of binary block codes with SOVA, we use the technique of sectionalization of the trellis, which has been successfully applied to the simplification of the MAP and Max-Log-MAP algorithms. Due to the branch complexity of the sectionalized trellis, we define a generalization of a non-binary version of SOVA. However, the computational complexity of directly applying this approach remains too high for efficient implementation; we thus introduce the concept of non-binary SOVA (NSOVA) with propagation of bit-level reliabilities (BLR). This new algorithm is analyzed from a computational complexity viewpoint. Both serial and parallel implementations are explored. Finally, optimal sectionalizations are derived for selected codes; since the normal SOVA decoding is a particular case of NSOVA with BLR, we show that our approach is more efficient than a bit-level trellis by showing that, for all the codes tested, the optimal trellis is a sectionalized one. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Tracking directions-of-arrival with invariant subspace updating
Authors: C. S. MacInnes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A new method for solving DOA tracking problems is presented. The complexity of the method is second order in L, where L is the number of array sensors. One advantage gained by using the invariant subspace updating method is the ability to track rapidly changing DOAs. A second technique allows the immediate detection of appearing and disappearing sources.
Improved lossless compression of color-mapped images by an approximate solution of the traveling salesman problem
Authors: A. Spira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A color-mapped image is composed of a palette and an image of indices. The color of each pixel is the palette color referenced by the pixel's index. The indices image is usually far from being smooth. This affects its compressibility by lossless image compression methods, due to their reliance on the natural smoothness of images. The indices images can be smoothed by re-ordering the palette, ie, assigning the indices to the colors in a better way. We propose a new method for palette ordering based on an approximate solution of the traveling salesman problem. The proposed method has low complexity, dependent only on the size of the palette. It is found to significantly improve the compression ratios of color-mapped images coded with the JPEG-LS lossless compression standard. The resulting compression ratios are better than those achieved by the popular GIF image file format.
Algebraic-geometry codes, one-point codes, and evaluation codes
Authors: Maria Bras-Amorós
Venue: Designs, Codes and Cryptography (2007)

One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed---Muller codes. Given an $${\mathbb{F}}_q$$ -algebra A, an order function $$\rho$$ on A and given a surjective $${\mathbb{F}}_q$$ -morphism of algebras $$\varphi: A\rightarrow {\mathbb{F}}_q^{n}$$ , the ith evaluation code with respect to $$A,\rho,\varphi$$ is defined as the code $$C_i=\varphi(\{f\in A: \rho(f)\leq i\})$$ . In this work it is shown that under a certain hypothesis on the $$\mathbb{F}_q$$ -algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over $$\mathbb{F}_q$$ and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G i with associated divisors $$\Gamma_i$$ is the sequence of evaluation codes associated to some $${\mathbb{F}}_q$$ -algebra A, some order function $$\rho$$ and some surjective morphism $$\varphi$$ with $$\{f\in A: \rho(f)\leq i\}={\mathcal{L}}(\Gamma_i)$$ if and only if it is a sequence of one-point codes.
Mining Eclipse Developer Contributions via Author-Topic Models
Authors: Erik Linstead, Paul Rigor, Sushil Bajracharya, Cristina Lopes, Pierre Baldi
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

We present the results of applying statistical author-topic models to a subset of the Eclipse 3.0 source code consisting of 2,119 source files and 700,000 lines of code from 59 developers. This technique provides an intuitive and automated framework with which to mine developer contributions and competencies from a given code base while simultaneously extracting software function in the form of topics. In addition to serving as a convenient summary for program function and developer activities, our study shows that topic models provide a meaningful, effective, and statistical basis for developer similarity analysis.
Python for Internet GIS Applications
Authors: Xuan Shi
Venue: Computing in Science and Engineering (2007)

Python offers a unique capability in the field of geographic information system (GIS) applications by helping developers create multipurpose Internet maps.
Towards Model-Based Testing with Architecture Models
Authors: Stephan Schulz, Jukka Honkola, Antti Huima
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

As tools are maturing rapidly model-based testing is gaining wider attention by industry as a potential replacement for suite-based testing approaches. To use model-based testing tools users however specify often quite detailed test models, at level of the implementation to be tested. We present here a first attempt to generate tests from more abstract implementation models, which we call architecture models. With only little refinement these models can be used to validate implementations up to interaction accuracy. Our technique is applied to validate that the camera application software for Nokia Series 60 mobile devices conforms to its UML2 architecture model, employing the model-based testing tool Conformiq Qtronic.
Teacher Bridge: Creating a Community of Teacher Developers
Authors: Mary Beth Rosson, Daniel R. Dunlap, Philip L. Isenhour, John M. Carroll
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As teachers gain practical experience, they develop best practices, often exploring and refining personal innovations as part of their pedagogy. However, many of these good ideas are practiced in isolation there is little infrastructure for sharing and knowledge management in schools. We describe Teacher Bridge, a suite of tools and an associated online community for teachers' professional development. Teachers can use these tools to build online activities for their students and for themselves. Because the teachers develop these activities as part of an online community, the resulting content can be explored and used by other educators, either in direct support of their own teaching goals, or as a model for related activities. We report on the design process we followed to create Teacher Bridge and discuss how we have used it to create an online community of teacher developers.
Guest Editors' Introduction: Autonomic Computing
Authors: Daniel A. Menasce, Jeffrey O. Kephart
Venue: IEEE Internet Computing (2007)

Autonomic computing systems are self-monitoring, self-tuning, self-organizing, self-optimizing, self-healing, and self-protecting,and they can address quality of-service, failure-recovery, and security issues with minimal human intervention.
Audio-visual person authentication using lip-motion from orientation maps
Authors: Maycel-Isaac Faraj, Josef Bigun
Venue: Pattern Recognition Letters (2007)

This paper describes a new identity authentication technique by a synergetic use of lip-motion and speech. The lip-motion is defined as the distribution of apparent velocities in the movement of brightness patterns in an image and is estimated by computing the velocity components of the structure tensor by 1D processing, in 2D manifolds. Since the velocities are computed without extracting the speaker's lip-contours, more robust visual features can be obtained in comparison to motion features extracted from lip-contours. The motion estimations are performed in a rectangular lip-region, which affords increased computational efficiency. A person authentication implementation based on lip-movements and speech is presented along with experiments exhibiting a recognition rate of 98%. Besides its value in authentication, the technique can be used naturally to evaluate the ''liveness'' of someone speaking as it can be used in text-prompted dialogue. The XM2VTS database was used for performance quantification as it is currently the largest publicly available database (~300 persons) containing both lip-motion and speech. Comparisons with other techniques are presented.
Predictive Directional Greedy Routing in Vehicular Ad hoc Networks
Authors: Jiayu Gong, Cheng-Zhong Xu, James Holle
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

VANETs (Vehicle Ad hoc NETworks) are highly mobile wireless ad hoc networks targeted to support vehicular safety and other commercial applications. Conventional routing protocols in MANETs (Mobile Ad hoc NETworks) are unable to fully address the unique characteristics in vehicular networks. On the other hand, some characteristics inVANETs, like mobility constraints and predicable mobility, can benefit routing in vehicular networks. It is known that vehicles tend to move more regularly. We propose a new position-based routing strategy with the consideration of nodes moving direction for VANETs, called DGR (Directional Greedy Routing). Considering the fact that vehicles often have predicable mobility, we propose PDGR (Predictive Directional Greedy Routing) to forward packet to the most suitable next hop based on both current and predicable future situations. We evaluate the performance of the solutions via simulations with realistic mobility models in open environments. Simulation results show that our solutions outperform existing ones in terms of packet delivery ratio, end-to-end delay, and routing overhead.
A Study of the Effectiveness of Case Study Approach in Software Engineering Education
Authors: Kirti Garg, Vasudeva Varma
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Software Engineering (SE) educators have been advocating the use of non-conventional approaches for SE education since long. In this context, we conducted action-research to compare the effectiveness of a case study approach with conventional lecture based approach. We designed and taught a first course in SE, that involved case study approach as well as the traditional lecture based approach. We recorded and analyzed student's perception of learning over using well defined parameters that reconciled with cognitive, skills and metacognitive goals of SE education. Results corroborated that case study approach is more effective and interesting for learning SE than the lecture based approach. These results indicate that academia and industry should further explore learning-by-doing paradigm, specially the case studies. Benefits of approach include bridging of the industry- academia gap and creation of professionals who are well versed with theory and practice and have experienced the intricacies of real software development even before entering the industry. This paper provides empirical data to support that case study approach is very effective in SE education and hence useful for curriculum designers. This work is useful for SE educators and researchers as it describes methodology for rigorous scientific educational research.
Self-adaptive Intrusion Detection System for Computational Grid
Authors: NI Jiancheng, LI Zhishu, SUN Jirong, XING Jianchuan
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

As Conventional intrusion detection systems cannot evolve with ceaselessly changing environment of computational Grid, a model of intrusion detection system named GIDIA based on immunity and multi Agents is developed with hierarchical architecture. Following definitions of immune model, detecting Agent, decision-making Agent, preventing Agent, and controlling Agent, relevant abstract mathematical models, evolving trends and inferential equations of Agents that are used in intrusion detection module, decision-making module, response module, and vaccine formation and distribution module are founded respectively. Theoretical analysis and experimental results show that GIDIA possesses better self-adaptability, higher detection rate, and offers a novel way to secure Grid member sites in the same trust community or different ones cooperatively.
Business Process Modeling and Requirements Modeling
Authors: Heinrich C. Mayr, Christian Kop, Daniela Esberger
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Business process modeling is an important part of each software development project. No software is developed without specifying it's use within the context of business processes. Since business process modeling is an important task during requirements engineering, in our opinion the same basic modeling notions should be used. This paper gives a first proposal how this can be done.