ppxscal/embedding_network huggingface dataset:
How to disregard irrelevant stimulus dimensions: evidence from comparative visual search
Authors: M. Pomplun, E. Carbone, L. Sichelschmidt, B. M. Velichkovskv
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

To what extent is it possible to disregard stimulus dimensions that are irrelevant to a certain task? This question was tackled in three experiments using the paradigm of comparative visual search. Reaction times and eye-movement data were recorded in order to study the cognitive processes in this series of tasks. For the data analysis, task-specific variables were defined and their values computed across subjects and tasks. The results show that on the basis of top-down processes only, it is easier to ignore shape information, and that disregarding color information requires additional bottom-up processes.
Selective-partial-update NLMS and affine projection algorithms for acoustic echo cancellation
Authors: K. Dogancay
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Adaptive filters used in acoustic echo cancellation often require a large number of coefficients to model the acoustic echo path with sufficient accuracy. The computational complexity of adaptation algorithms such as the NLMS algorithm is proportional to the filter length, which means that for long filters the adaptation task can become prohibitively expensive. The purpose of partial coefficient update is to reduce the computational complexity by adapting a subset of the filter coefficients at every iteration. In this paper we develop selective-partial-update NLMS and AP algorithms based on the principle of minimum disturbance. The algorithms are based on sound theoretical justification and appear to have good convergence performance as attested to by computer simulations with real speech signals.
Workshop: Assessing the Quality of a Business Process Implemented across Systems of Systems
Authors: Robert Ellison, Carol Woody
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

A team at the SEI has developed a framework that has shown promise in assessing the survivability of a business process in a system of systems environment. Assessment outputs in pilot use included survivability requirements and gaps among interoperable systems. It is anticipated that the framework can be of use in the evaluation of other quality attributes. Researchers and practitioners in software design, architecture, quality assurance, and requirements validation are asked to participate in this workshop to review the work done for survivability and assist in the determination of its broader applicability.
Adaptive contour coding using warped polynomials
Authors: W. Philips
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper presents a new method for compactly representing contours. The new method is a generalization of the Fourier descriptor (FD) method. Like the FD method it approximates a complex-valued parameter representation of the contour by a trigonometric polynomial (TP). In the FD method, the TP is the best least mean squares approximation of the parameter representation. However, the mean squared error is not a good a criterion for judging the accuracy of a contour approximation. The paper proposes a better criterion and a method for computing the corresponding optimal TP. It shows that computing this optimal TP is equivalent to fitting a so-called warped TP to the parameter representation in the least mean squares sense. The paper presents preliminary results which show that the new method produces more accurate contour approximations than FD approximations of the same degree.
Sensor Scheduling for Optimal Observability Using Estimation Entropy
Authors: Mohammad Rezaeian
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process is observed by a single sensor which needs to be dynamically adjusted or by a set of sensors which are selected one at a time in a way that maximizes the information acquisition from the process. Similar to conventional POMDP problems, in this model the control action is based on all past measurements; however here this action is not for the control of state process, which is autonomous, but it is for influencing the measurement of that process. This POMDP is a controlled version of the hidden Markov process, and we show that its optimal observability problem can be formulated as an average cost Markov decision process (MDP) scheduling problem. In this problem, a policy is a rule for selecting sensors or adjusting the measuring device based on the measurement history. Given a policy, we can evaluate the estimation entropy for the joint state-measurement processes which inversely measures the observability of state process for that policy. Considering estimation entropy as the cost of a policy, we show that the problem of finding optimal policy is equivalent to an average cost MDP scheduling problem where the cost function is the entropy function over the belief space. This allows the application of the policy iteration algorithm for finding the policy achieving minimum estimation entropy, thus optimum observability.
The 0-1 knapsack problem with fuzzy data
Authors: Adam Kasperski, Michał Kulej
Venue: Fuzzy Optimization and Decision Making (2007)

The 0-1 knapsack problem with imprecise profits and imprecise weights of items is considered. The imprecise parameters are modeled as fuzzy intervals. A method of choosing a solution under the uncertainty is proposed and two methods for solving the constructed models are provided.
Dynamic Collaboration Simulation in Service-Oriented Computing Paradigm
Authors: W. T. Tsai, Qian Huang, Xin Sun, Yinong Chen
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

In Service-Oriented Architecture (SOA) and Service-Oriented Computing (SOC), service collaboration is an important aspect. While service collaboration protocols for data exchange are well explored, the Dynamic Process Collaboration (DPC) is still a challenging issue. The DPC brings new features and uncertainty to the current SOA/SOC, such as run-time behavior evaluation, dynamic collaboration performance measurement and dynamic Recomposition/ Reconfiguration capability assessment. This paper presents the Dynamic Service-Oriented Collaboration Simulation (DSOCS) framework we have developed, which supports the dynamic collaboration, development, simulation, and evaluation of large scale SOA systems. The distinct features of the framework include automated simulation code generation from the specification, code deployment, and simulation of different architectures with a template-based platform builder, service-oriented multi-agent simulation for easy reconfiguration, and dynamic analyses of results from evaluation and monitoring. The framework and the associated tools have been implemented and applied in several governmental and industrial projects.
CS2 for an IS curriculum
Authors: Lee D. Cornell
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In this paper, the elimination of the implementation of data structures from CS2 courses is discussed.
Threshold-based 3D Tumor Segmentation using Level Set (TSL)
Authors: Sima Taheri, Sim Heng Ong, Vincent Chong
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Three-dimensional segmentation is reliable approach to achieve a proper estimation of tumor volume. Among all possible methods for this purpose, level set can be used as a powerful tool which implicitly extracts the tumor surface. In this paper, we introduce a threshold-based algorithm for 3D tumor segmentation using level set (TSL). This algorithm uses a global threshold to form the level set speed function which is updated iteratively throughout the level set growing process. An important feature of TSL is that no explicit knowledge about the tumor and non-tumor density functions is required. The proposed method can be implemented in the automatic and semi-automatic forms depending on the complexity of the tumor shape. TSL is examined on several clinical MRIs for both visual and quantitative evaluation. Experimental results demonstrate the effectiveness of our approach.
Using CTL formulae as component abstraction in a design and verification flow
Authors: Cecile Braunstein, Emmanuelle Encrenaz
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

In the context of component-based design, the verification of global properties (involving several components) is difficult to achieve, due to combinatorial explosion problem, while the verification of each component is easier to perform. Following the idea of [24], we propose to build an abstraction of a component already verified, starting from a subset of its specification described as CTL formulae. This abstraction replaces the concrete component and alleviates the state-space explosion problem for checking global properties expressed in ACTL
Freshman design projects in the Foundation Coalition
Authors: J. Richardson
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Many talented engineering students abandon engineering before taking a single engineering course. Herded into large sections of "pre-engineering" mathematics, chemistry and physics courses, many students prove themselves academically but walk away from engineering, disillusioned. Numerous schools have instituted freshmen engineering courses to retain some of these capable but disinterested students in the engineering program. Freshman engineering courses spark students' interest by showing students that engineers communicate, lead and create as well as analyze. One of the most successful ways of showing first-year students the diversity of skills needed to practice engineering is through freshman design projects. The authors have each selected three of their favorite freshmen design projects (a total of fifteen projects) and posted detailed descriptions on the web (www.foundation.ua.edu/projects). This paper provides: a brief description of the freshman programs at each school (the schools are participants in the NSF-sponsored Foundation Coalition); short summaries of each project; and answers to frequently asked questions about freshman design projects.
Building Environmental Information Systems: Myths and Interdisciplinary Lessons
Authors: Karen S. Baker, Karen I. Stocks
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With databases and information systems playing an increasing role in large scientific research projects, there is a growing stake in understanding how to design a useful information system and in broadening our understanding of what constitutes the scientific work involved in building these systems. Both experience and theory indicate that non-technical considerations, such as management and communication structures, are as important as technical decisions in system development. We examine four case examples of environmental information system development: the Ocean Biogeographic Information System, the Long Term Ecological Research Network, the California Cooperative Oceanic Fisheries Investigation, and SeamountsOnline. We then draw from a wide interdisciplinary literature, including science and technology studies and social informatics, to identify common myths and misconceptions about system development and consider alternatives. Our goal is both to provide a set of concrete models and a theoretical foundation useful to other projects.
General Model of Human-Robot Cooperation Using a Novel Velocity Based Variable Impedance Control
Authors: Vincent Duchaine, Clement M. Gosselin
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In the future, robots will have to assist human beings in the performance of several tasks. In order to achieve this goal, robots have to be able to follow human movement in a way that is transparent to the human operator. This paper presents a new method to make this cooperation more transparent. The method is based on an online variable impedance control using differentiation of the force as a natural sensor of human intention. This work will also demonstrate why velocity control should be used in the controller of a human-friendly robot rather than typical position control.The performance of the control scheme introduced here is also validated in an experimental cooperative drawing task involving a parallel manipulator and a human operator.
Evaluation of segmental unit input HMM
Authors: S. Nakagawa, K. Yamamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The standard HMM cannot fully express the time variant features while staying at the same state. So as not to ignore the dynamic changes of the speech characteristics, various methods have been studied. In this paper, we compare a segmental unit input HMM where several successive frames are combined and become an input vector, with conditional density HMM or the use of regression coefficients and evaluate them. Using segmental statistics, since the dimension of the parameters increases, results in a lesser precision in estimation of the covariance matrix. Therefore we used methods for compressing dimension and reducing computation by K-L expansion and MQDF. By segmental unit inputting for the basic structure HMM, we got a better recognition rate than by traditional methods and the combination of a segmental unit of successive mel-cepstrum frames and regression coefficients showed the best recognition rate.
Computing is a natural science
Authors: Peter J. Denning
Venue: Communications of the ACM (2007)

Information processes and computation continue to be found abundantly in the deep structures of many fields. Computing is not---in fact, never was---a science only of the artificial.
A Massively Parallel Algorithm for Compact Finite Difference Schemes
Authors: Xian-He Sun, Ronald D. Joslin
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm consists of prefix communications and AXPY computations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study has been conducted to provide a simple truncation formula. Experimental results have been measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for symmetric, almost symmetric Toeplitz tridiagonal systems and for the compact scheme on high-performance computers.
Blind multi-user access interference cancellation for CDMA based PCS/cellular using antenna arrays
Authors: M. D. Zoltowski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We previously presented a blind 2D RAKE receiver for CDMA that cancels strong multi-user access interference and optimally combines multipath. After passing the output of each antenna through a matched filter based on the spreading waveform of the desired user, one estimates the signal plus interference spatio-frequency correlation matrix during that portion of the bit interval where the fingers of the RAKE occur, and the interference alone spatio-frequency correlation matrix during that portion of the bit interval away from the fingers. The weight vector yielding the optimum signal to interference plus noise ratio for bit decisions is the "largest" generalized eigenvector of the resulting matrix pencil. However, even when the number of elements comprising the array is relatively small, this spatio-frequency correlation matrix pencil is of large dimension. In addition to detracting from the real-time applicability of the scheme, this slows up the time to convergence. A reduced complexity scheme is presented based on a data adaptive transformation to a beamspace of dimension equal to the effective number of spatial degrees of freedom taken up by the desired user's multipath.
A rate adaptation scheme for layered multicast using MSS in mobile networks
Authors: Seungik Lee
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

Layered multicast was introduced to address the heterogeneity problem of network and receivers in multimedia multicast. With the highly increasing interest in mobile communication, the need for extending layered multicast to mobile communications has increased. However, the conventional layered multicast approaches have not considered host mobility and a handoff can cause stability and fairness problems in wireless networks. We propose a new rate adaptation scheme using a mobile support station (MSS) to provide quick resolution of an unstable state of a network and fair bandwidth allocation at handoff by priority dropping of the less important layers in the outgoing queue and MSS-controlled rate adaptation. The proposed scheme is evaluated using network simulator ns-2 and its result shows that the proposed one outperforms RLM (receiver-driven layered multicast) (see McCanne, S. et al., ACM SIGCOMM, 1996) by about 80% in terms of stability and fairness at handoff.
Phrase splicing and variable substitution using the IBM trainable speech synthesis system
Authors: R. E. Donovan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes a phrase splicing and variable substitution system which offers an intermediate form of automated speech production lying in-between the extremes of recorded utterance playback and full text-to-speech synthesis. The system incorporates a trainable speech synthesiser and an application specific set of pre-recorded phrases. The text to be synthesised is converted to a phone sequence using phone sequences present in the pre-recorded phrases wherever possible, and a pronunciation dictionary elsewhere. The synthesis inventory of the synthesiser is augmented with the synthesis information associated with the pre-recorded phrases used to construct the phone sequence. The synthesiser then performs a dynamic programming search over the augmented inventory to select a segment sequence to produce the output speech. The system enables the seamless splicing of pre-recorded phrases both with other phrases and with synthetic speech. It enables very high quality speech to be produced automatically within a limited domain.
Mumford-Shah algorithm applied to videokeratography image processing and consequences to refractive power values
Authors: João Batista Florindo, Sérgio Henrique Monari Soares, Luis Alberto Vieira de Carvalho, Odemir Martinez Bruno
Venue: Computer Methods and Programs in Biomedicine (2007)

There are many corneal diseases that can be detected using an eye-care device called videokeratograph. The videokeratograph is based on the principle of an apparatus called Placido disc and is used to precisely measure the anterior surface of the cornea. This disc contains rings alternately white and black, which are reflected on the patient's cornea during the examination. The device can find anomalies by analyzing the reflected image, using image-processing algorithms. Although the efficiency of most commercial videokeratographs is acceptable, manufacturers do not disseminate to the scientific community the technique used in the image analysis algorithms. This makes it difficult for the specialized researcher in order to find better algorithms for the image-processing and, consequently, increase the instrument's precision. In this work we have segmented the Placido disc in polar coordinates by implementing a diagonal section of the image, in the radial direction. The objective is to find the inflection points in the signal obtained. In this paper the signal is studied by using the Mumford-Shah segmentation method. The results are compared to those obtained with other classic methods in the literature, e.g. Marr-Hildreth filters, numerical derivative, Fourier derivative, morphological Laplacian and Canny derivative. The best result was achieved by using the Mumford-Shah functional. Using this technique it was possible to find the inflection positions with higher accuracy. The method did not detect any false inflection. Mumford-Shah's method demonstrated also a high precision in the task of eliminating noises from the original signal.
Stackelberg thresholds in network routing games or the value of altruism
Authors: Yogeshwer Sharma, David P. Williamson
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Noncooperative network routing games are a natural model of userstrying to selfishly route flow through a network in order to minimize their own delays. It is well known that the solution resulting from this selfish routing (called the Nash equilibrium) can have social cost strictly higher than the cost of the optimum solution. One way to improve the quality of the resulting solution is to centrally control a fraction of the flow. A natural problem for the network administrator then is to route the centrally controlled flow in such a way that the overall cost of the solution is minimized after the remaining fraction has routed itself selfishl. This problem falls in the class of well-studied Stackelberg routing games. We consider the scenario where the network administrator wants the final solution to be (strictly) better than the Nash equilibrium. In other words, she wants to control enough flow such that the cost of the resulting solution is strictly less than the cost of the Nash equilibrium. We call the minimum fraction of users that must be centrally routed to improve the quality of the resulting solution the Stackelberg threshold. We give a closed form expression for the Stackelberg threshold for parallel links networks with linear latency functions. The expression is in terms of Nash equilibrium flows and optimum flows. It turns out that the Stackelberg threshold is the minimum of Nash flows on links which have more optimum flow than Nash flow. Using our approach to characterize the Stackelberg thresholds, we are able to give a simpler proof of an earlier result which finds the minimum fraction required to be centrally controlled to induce an optimum solution.
Roundtable: Design and CAD Challenges for Leading-Edge Multimedia Designs
Authors: Andrew Kahng, Ira Chayut, John Cohn, Toshihiro Hattori, Jeong-Taek Kong, Pierre Paulin, Richard Tobias
Venue: IEEE Design Test (2007)

Multimedia, game, and entertainment devices have pushed the leading edge of performance, complexity, power, form factor, design cycle time, and other key aspects of ASIC design for the past several technology nodes. This roundtable brings together experts who are defining the next generation of gaming, mobile-TV, digital-home, display, and multimedia-processing platforms. The discussion spans the underlying chip architectures and roadmaps, as well as the key design, technology, and market challenges for next-generation products.