ppxscal/embedding_network huggingface dataset:
MOPCVE: A New CVE Prototype Running on Mobile Phone
Authors: Wenhang Li, Jianhua Gong, Daojun Wang, Mingxiang Huang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Recent years have seen the rapid development of mobile technology, and it is really possible for people to implement collaborative work on mobile instruments. This paper aims to explore the design and implementation of a multi-participant oriented, avatar-based, 3-dimentional CVE running on mobile network and mobile instruments. The paper presents solutions to data transmission restriction, computation limitation, and 3-D display limitation for developing mobile CVE system. Key technologies such as connection keeping, scene data management, and custom protocols are scrutinized. A prototype system of mobile CVE, called Mobile Phone Collaborative Virtual Environment (MOPCVE), is developed with Java ME, Java ME 3D in this study. Mobile CVE is promising to be a new collaborative working mode, whose future possible typical applications may include immersive collaborative mobile phone game, immersive mobile meeting/education, collaborative field investigation and integration with Internet CVE.
Automatic Analysis of Control Flow inWeb Services Composition Processes
Authors: Giusy Di Lorenzo, Francesco Moscato, Nicola Mazzocca, Valeria Vittorini
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Composition of web services is of great interest to support business-to-business collaboration and provide value added services with desired properties or capabilities. Nevertheless, the standard languages used to create business processes from composite web services lack of formal definition of their semantics and tools to support the analysis of a business process. In this paper we provide a practical approach to formal verification of BPEL4WS executable processes. A syntax-driven operational semantics for BPEL4WS is introduced and an automatic verifier is presented in order to perform a semantic analysis of the flow constructs used in the definition of BPEL4WS processes.
Performance analysis of a statistical test for presence of cyclostationarity in a noisy observation
Authors: P. Rostaing
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The purpose of this paper is to evaluate theoretically in terms of receiver operating characteristics (ROC) the performance of a statistical test (based on the second order statistic) for the presence of cyclostationarity in a noisy observation. In order to obtain false alarm and detection probabilities, we consider the following specific situation: we choose a cycle frequency contained in a binary-phase-shift-keyed (BPSK) signal of interest (SOI) (BPSK signal is considered for its increasing attention in digital communications) and we test the presence of cyclostationarity of the SOI in a noisy observation. Two examples are considered, the SOI is buried either in a stationary Gaussian noise or in an another BPSK signal.
Joint maximum a posteriori estimation of transformation and hidden Markov model parameters
Authors: O. Siohan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Model adaptation techniques can usually be divided into indirect and direct approaches. On one hand, indirect or transformation-based techniques assume that a general transformation shared amongst different acoustic units is applied to clusters of model parameters. Such approaches (e.g. MLLR-maximum likelihood linear regression) are quite efficient when the amount of adaptation data is limited, but have poor asymptotic properties as the amount of adaptation data increases. On the other hand, direct adaptation approaches, like maximum a posteriori (MAP) estimation have nice asymptotic properties but provide only a moderate improvement when the amount of adaptation data is small. In this work, we jointly optimize a direct and indirect adaptation to take advantage of both approaches. Contrary to published approaches where direct and indirect adaptation are performed one after the other with a very loose interaction and no joint estimation criterion, we propose to estimate a MLLR-like transformation as well as the HMM mean vectors simultaneously, using a MAP estimation criterion. The optimal interaction between the direct and indirect adaptation associated with the prior knowledge provided by the MAP criterion leads to improvement over MLLR and MAP for all size of adaptation data evaluated.
An Internet based learning environment
Authors: J. Lockledge
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The World Wide Web has generated considerable interest in using the Internet to distribute educational materials. Going beyond materials distribution to using the Internet to effectively support learning is more complicated. This paper is an examination of the issues that arise in using the Internet to support students and instructors in the learning process. It proposes an architecture that will enhance communication between faculty and student, enable online test-taking and encourage inquiry-based learning.
Integrating audio and visual information to provide highly robust speech recognition
Authors: M. J. Tomlinson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

There is a requirement in many human machine interactions to provide accurate automatic speech recognition in the presence of high levels of interfering noise. The the paper shows that performance improvements in recognition accuracy can be obtained by including data derived from a speaker's lip images. We describe the combination of the audio and visual data in the construction of composite feature vectors and a hidden Markov model structure which allows for asynchrony between the audio and visual components. These ideas are applied to a speaker dependent recognition task involving a small vocabulary and subject to interfering noise. The recognition results obtained using composite vectors and cross-product models are compared with those based on an audio-only feature vector. The benefit of this approach is shown to be an increased performance over a very wide range of noise levels.
Constant Function Independent Test Set for Fault Detection in Bit Parallel Multipliers in GF(2^m)
Authors: H. Rahaman, J. Mathew, D. K. Pradhan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this paper, a C-testable implementation of polynomial basis (PB) bit parallel (BP) multiplier over the Galois fields of form GF(2m) for detecting stuck-at faults in multiplier circuits has been proposed. The length of the constant test set is only 8. The fault detection can be incorporated in the multiplier circuit with only three extra inputs for controllability. The gate counts of the proposed testable multiplier as a function of degree m is also analyzed. The proposed constant test set is much smaller than ATPG generated or algorithmic test set, resulting in low power testability. As the GF(2m) multipliers have found some critical field applications and need for efficient online testing, Built-in Self-Test (BIST) circuit is proposed to generate test pattern internally. This BIST also obviates the need of having three extra pins for the control inputs. Area and delay of testable circuits and BIST circuit are analyzed using 0.18ì CMOS technology library from UMC. The proposed test pattern has the intrinsic ability to detect single bit errors in the test pattern generator (TPG) itself. The test set provides 100 percent single fault coverage.
SOA: Some Assembly Required
Authors: Mark Schenecker
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

The ability of an organization to reinvent itself, then build and execute a new business process or business model, has improved little over the last thirty years. More and more, the business environment (mergers, acquisitions, new partnerships, spin-offs) is changing faster than enterprise architectures can respond. Architects confront having to embrace rapid change in enterprise information systems across multiple internal legacy applications as well as the external systems of key trading partners. COTS vendors are responding by inverting their delivery model. Enterprise-class systems that provide comprehensive business process functionality with integration at the fringe are now being delivered piecemeal in the form of thousands of services that inherently embody integration. This new architectural style delivers immense flexibility and agility but there are challenges in assembling robust, scalable and reliable enterprise solutions.
Concave microlens array mold fabrication in photoresist using UV proximity printing
Authors: Tsung-Hung Lin, Hsiharng Yang, Ching-Kong Chao
Venue: Microsystem Technologies (2007)

This paper presents a simple and effective method for fabricating a polydimethyl-siloxane (PDMS) microlens array with a high fill factor. The proposed method utilizes the UV proximity printing and photoresist replication methods. A concave microlens array mold is made using a printing gap in a lithography process. Optical UV light diffraction of UV light is used to deflect light away from the aperture edges to produce a certain exposure in the photo-resist material outside the aperture edges. This method can precisely control the geometric profile of a concave microlens array. The experimental results show that a concave micro-lens array can be formed automatically in photo-resist when the printing gap ranges from 240 to 720&#x00a0;&#x03bc;m. A high fill factor microlens array can be produced when the control pitch distance between the adjacent apertures of the concave microlens array is decreased to the aperture size.
Education
Authors: Andrew J. Bernoff
Venue: SIAM Review (2007)

Our knowledge in mathematics often expands by taking familiar problems and revisiting them with a new twist. In this issue we have two papers that examine problems that are usually first encountered in an introductory PDE course, though shown from a new perspective. Our first contribution, &ldquo;Fundamental Solutions for Some Partial Differential Operators from Fluid Dynamics and Statistical Physics,&rdquo; by Jorge Aara&tilde;o, offers an answer to a wearisome question that often arises in introductory PDE classes, namely, can one find only the fundamental solution for a few special problems such as the heat equation and Laplace&rsquo;s equation? The author describes a method for computing the fundamental solution for a set of PDEs that arise, among other places, in fluid mechanics, where they describe diffusion and advection by a linear flow. The methodology described here should be accessible to students in an introductory course on PDEs, and the examples could form the foundation for a supplemental lecture or an independent research project. The second paper, &ldquo;Determining Sets for the Discrete Laplacian,&rdquo; by Aviad Rubinstein, Jacob Rubinstein, and Gershon Wolansky, adds a nice twist to the idea of solving a discrete approximation for Laplace&rsquo;s equation which yields a discrete analogue of a harmonic function. A continuous harmonic function $u (x, y)$ is determined by the mean-value property; that is, its value at a point is equal to the average of the values of the function over the set of points a fixed distance away. A discrete harmonic function defined on a lattice, $u (i, j)$, has the same property, except the average is now taken over the nearest neighbors. It is well known in both cases that specifying the function on the boundary of, say, a square domain uniquely specifies the function. However, the discrete problem allows a fascinating generalization: can we specify the function at some other set of points which still determines the function uniquely? The answer is yes, and this idea has a natural application in a phase detection problem that comes out of optics. This paper nicely ties to problems that arise in PDEs, numerical methods, and linear algebra with a soupc&cedil;on of physical applications, yet is written at a level accessible to any student with a solid understanding of linear algebra and has enough open questions to be an ideal springboard for undergraduate research.
The gray lady gets a new dress: a field study of the times news reader
Authors: Catherine C. Marshall
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Increasingly individuals are turning to online sources for their daily news. Traditional newspapers have developed significant web presences to compete with newer services such as news aggregators and emerging genres such as blogs and other forms of citizen journalism. This paper reports the results of a field study to investigate the use of a new RSS-driven, template-based presentation mechanism that delivers a daily newspaper to subscribers' laptops and desktops; the Times News Reader hybridizes elements of print newspapers with aspects of online news. We explore how this application compares with print and web-based news reading and evaluate functionality developed to draw in readers from both audiences. Finally we examine three general technological implications drawn from current use: how the news reader may adapt to different styles of reading; how the news reader's functionality may be extended to highlight the timeliness of the content and to personalize the application; and how long-term use of the news reader can result in a personal news archive.
Visualizing Multivariate Volume Data from Turbulent Combustion Simulations
Authors: Hiroshi Akiba, Kwan-Liu Ma, Jacqueline H. Chen, Evatt R. Hawkes
Venue: Computing in Science and Engineering (2007)

To understand dynamic mechanisms, scientists need intuitive and convenient ways to validate known relationships and reveal hidden ones among multiple variables.
Understanding Open Source Software through Software Archaeology: The Case of Nethack
Authors: Melissa M. Simmons, Pam Vercellone-Smith, Phillip A. Laplante
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

In this study open source software was examined from an archaeological perspective. The objective: to explore the evolution of a long-lived open source project with the intention of learning how code evolution has progressed over time. This investigation provides a case study of Nethack, an enormously popular open source game that has been in development for more than a decade. The Goal Question Metric approach was employed to derive measurement goals for the evaluation of open source software (OSS) evolution in Nethack. According to Lehman's laws, the incremental growth size of successive releases tends to decline during the active life of an evolving program. Our results demonstrate that the evolution patterns observed for Nethack do not consistently conform to Lehman's laws. The growth in Nethack's tarball distribution size, as well as lines of code, exhibited a linear increase in growth in this investigation. Additionally, Lehman's laws dictate that the complexity of a system will increase as it ages. Interestingly, in Nethack, the McCabe cyclomatic complexity was found to decrease with successive releases while the Halstead complexity increased. These results suggest that while the structure complexity of Nethack declined with successive releases, the complexity of calculational logic increased. These findings raise questions concerning the evolution of other OSS applications.
Exploiting internet route sharing for large scale available bandwidth estimation
Authors: Ningning Hu, Peter Steenkiste
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Recent progress in active measurement techniques has made it possible to estimate end-to-end path available bandwidth. However, how to efficiently obtain available bandwidth information for the N2 paths in a large N-node system remains an open problem. While researchers have developed coordinate-based models that allow any node to quickly and accurately estimate latency in a scalable fashion, no such models exist for available bandwidth. In this paper we introduce BRoute--a scalable available bandwidth estimation system that is based on a route sharing model. The characteristics of BRoute are that its overhead is linear with the number of end nodes in the system, and that it requires only limited cooperation among end nodes. BRoute leverages the fact that most Internet bottlenecks are on path edges, and that edges are shared by many different paths. It uses AS-level source and sink trees to characterize and infer path-edge sharing in a scalable fashion. In this paper, we describe the BRoute architecture and evaluate the performance of its components. Initial experiments show that BRoute can infer path edges with an accuracy of over 80%. In a small case study on Planetlab, 80% of the available bandwidth estimates obtained from BRoute are accurate within 50%.
On Modeling Adaptation in Context-Aware Mobile Grid Systems
Authors: Otebolaku A.M., Adigun M.O., J. S. Iyilade, Ekabua O.O.
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Mobile and smart devices have the potential to form part of Grid infrastructures. These devices can serve two important functions in Grid environment either as service consumer or as valuable service providers. However, there are a number of challenging issues in using a mobile device as service consumer in Grid systems when this fluctuating mobile environment is taken into consideration. Intermittent connectivity, bandwidth fluctuations, high response time between service request and delivery, device heterogeneity and weak security among others. Among these, this paper focuses on modeling a context aware solution to address the problem of high response time in this environment which is caused by some execution context variations. A model of an adaptation mechanism is proposed that monitors execution context of the Grid clients, it evaluates the monitored contexts and decides on what reconfiguration decision to take. The overall impact is to reduce the time between when a service request is made and when the service is delivered to mobile clients.
Dissociation of excitons in organic light-emitting diodes
Authors: Jin Zhao Huang, Zheng Xu, Fu Jun Zhang, Su Ling Zhao, Yuan Li, Lin Song, Xu Rong Xu
Venue: Microelectronics Journal (2007)

In this paper, the dissociation of excitons in both doped and undoped organic light-emitting diodes is investigated in detail by means of electric-field-induced photoluminescence quenching. The results show that the doped devices demonstrate lower quenching than that of undoped device. The reason is that the narrower energy band gap of guest molecules compared to that of the host molecules. In doped devices the increasing concentration of the guest molecules leads to a decrease in dissociation of excitons. The reason is that the increasing of the guest molecules concentration can result in an increase in the fraction of excitons residing on the guest molecules. Besides, the decreasing energy band gap of guest molecules can also make lower quenching in the doped devices.
A Distributed Multicast Algorithm for Hypercube Multicomputers
Authors: Jyh-Charn Liu, Hung-Ju Lee
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

This paper proposes a novel distributed multicast algo rithm for hypercubes. Based on our algorithm, any node in a multicast-set can directly initiate a multicast to other nodes in the same set. The Dimension-PArtition Tech nique (DIPAT) is the underlying message routing tech nique. This routing technique is valid only for certain con nected graphs, called DIPAT-graphs whose necessary and sufficient conditions are derived. A heuristic algorithm is developed for construction of DIPAT-graphs. In addition, DIP AT is integrated with a simple spanning tree algorithm to form a hierarchical multicasting graph, which retains a higher level of distributed multicasting capability with a similar level of extra traffic as that of the existing single spanning tree based solutions.
Efficient image representation by anisotropic refinement in matching pursuit
Authors: P. Vandergheynst
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents a new image representation method based on anisotropic refinement. It has been shown that wavelets are not optimal to code 2-D objects which need true 2-D dictionaries for efficient approximation. We propose to use rotations and anisotropic scaling to build a real bi-dimensional dictionary. Matching pursuit then stands as a natural candidate to provide an image representation with an anisotropic refinement scheme. It basically decomposes the image as a series of basis functions weighted by their respective coefficients. Even if the basis functions can a priori take any form, bi-dimensional dictionaries are almost exclusively composed of two-dimensional Gabor functions. We present here a new dictionary design by introducing orientation and anisotropic refinement of a Gaussian generating function. The new dictionary permits to efficiently code 2-D objects and more particularly oriented contours. It is shown to clearly outperform common nonoriented Gabor dictionaries.
Formal Software Analysis Emerging Trends in Software Model Checking
Authors: Matthew B. Dwyer, John Hatcliff, Robby Robby, Corina S. Pasareanu, Willem Visser
Venue: 2007 Future of Software Engineering (2007)

The study of methodologies and techniques to produce correct software has been active for four decades. During this period, researchers have developed and investigated a wide variety of approaches, but techniques based on mathematical modeling of program behavior have been a particular focus since they offer the promise of both finding errors and assuring important program properties. The past fifteen years have seen a marked and accelerating shift towards algorithmic formal reasoning about program behavior - we refer to these as formal software analysis. In this paper, we define formal software analyses as having several important properties that distinguish them from other forms of software analysis. We describe three foundational formal software analyses, but focus on the adaptation of model checking to reason about software. We review emerging trends in software model checking and identify future directions that promise to significantly improve its cost-effectiveness.
An Architectural Framework for Non Functional Requirements in Enterprise SOA Adoption
Authors: Naveen Kulkarni, Srinivas Padmanabhuni
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Service oriented architecture (SAO) is latest trend in trying to bridge the gap between business strategists and IT architects. Architecting services from an enterprise perspective does not just involve identifying and fitting pieces together, but managing and addressing cross cutting concerns or non functional requirements (NFRs).