ppxscal/embedding_network huggingface dataset:
Improved Compression Algorithm Based on Region of Interest of Face
Authors: Herong Zheng, Yanlin Lu, Xiaofei Feng
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper presents a compression algorithm based on region of interest (ROI) of face to gain a high compressing ratio and to assure the quality of compressed result. First, the ROI including facial features is detected by the FC2VQ (Feature Correction two-stage Vector Quantization) algorithm. Then the mask of ROI is calculated. Finally the proposed algorithm is used to compress .The compression ratios of ROI and background can be adjusted randomly according to the requirement. Experimental results show that our algorithm can make the compressing quality of ROI better than that of the background, and the facial features region can be well recognized by eyes.
Piecewise convex estimation for signal processing
Authors: K. S. Riedel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Additional methods of nonparametric function estimation (splines, kernels and especially wavelet filters) usually produce artificial features/spurious oscillations. Piecewise convex function estimation seeks to reliably estimate the geometric shape of the unknown function. We outline how piecewise convex fitting may be applied to signal recovery, instantaneous frequency estimation, surface reconstruction, image segmentation, spectral estimation and multivariate adaptive regression. Two distinct methodologies for shape-correct estimation are given. First, we propose a piecewise convex information criterion that strongly penalizes additional inflection points and "efficiently" penalizes additional degrees of freedom. Second, a two-stage adaptive (pilot) estimator is described. In the first stage, the number and location of the change points are estimated using strong smoothing. In the second stage, a constrained smoothing spline fit is performed with the smoothing level chosen to minimize the MSE. The imposed constraint is that a single second-stage change point occurs in a region about each empirical change point of the first-stage estimate. This constraint is equivalent to requiring that the third derivative of the second-stage estimate has a single sign in a small neighborhood about each first-stage change point.
On developmental mental architectures
Authors: Juyang Weng
Venue: Neurocomputing (2007)

This paper presents a computational theory of developmental mental architectures for artificial and natural systems, motivated by neuroscience. The work is an attempt to approximately model biological mental architectures using mathematical tools. Six types of architecture are presented, beginning with the observation-driven Markov decision process as Type-1. From Type-1 to Type-6, the architecture progressively becomes more complete toward the necessary functions of autonomous mental development. Properties of each type are presented. Experiments are discussed with emphasis on their architectures.
The estimates of approximation by using a new type of weighted modulus of continuity
Authors: A. D. Gadjiev, A. Aral
Venue: Computers Mathematics with Applications (2007)

In this paper, we introduce a new type modulus of continuity for function f belonging to a particular weighted subspace of C[0,~) and show that it has some properties of ordinary modulus of continuity. We obtain some estimates of approximation of functions with respect to a suitable weighted norm via the new type moduli of continuity. Finally, we give some examples.
Detection and analysis of packet loss on underutilized enterprise network links
Authors: Seung-Hwa Chung, Y. J. Won, D. Agrawal, Seong-Cheol Hong
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

ISPs and enterprises usually overprovision their networks as a means of supporting QoS. In spite of that, the service quality of QoS-sensitive applications such as VoIP, video conferencing and streaming media may not be up to expectations. We believe this is due to sporadic but non-negligible packet losses due to traffic bursts even in underutilized links. Our earlier work attempted to detect and analyze packet losses in underutilized links in an enterprise network environment using SNMP. This paper presents an extension of our earlier work by attempting to detect and analyze packet loss at finer granularity of time scale. We have developed a passive traffic capturing system, which can provide smaller time scale analysis of packet loss. We have analyzed the data and identified parts that are representative of packet loss across various time scales: 10 milliseconds, one second, 10 seconds and one minute. Analysis reveals that packet losses on underutilized link do occur due to bursty traffic packets in a small time scale. We also present analysis of other traffic properties such as packet size distribution and flows for the packet loss.
Reliability Evaluation of Disk Array Architectures
Authors: John A. Chandy, Prithviraj Banerjee
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Numerous redundant disk organizations have been proposed and used to provide increased performance and reliability from the I/O subsystems architecture, and once a disk fails in such a system, different forms of spar ing and reconstruction have also been proposed. In this paper, we offer a comprehensive evaluation of the relation ship between various disk array architectures, various disk reconstruction strategies, and their reliability under various failure rate and repair rate distributions. Specifically, we perform the evaluations of the reliabilities (through a mea sure of system mean time to failure) of different redundant disk organizations with variations in each of the following orthogonal directions. We also consider the effect of the reconstruction strategy on the reliability. A third and im portant dimension to our study involves the use of realistic failure rates and repair rates of disks that are dependent on the workload and the organization of the disks. Finally, we perform our study of scalability of the results to varying sys tem sizes, by specifically addressing disk organizations with 16 to 10&4 disks. The paper's contribution is in presenting a uniform framework for evaluation of these multidimen sional studies, as well as offering an improved model for predicting disk array reliability taking into account system load as well as disk organization.
Testing and Diagnosis of Realistic Defects in Digital Microfluidic Biochips
Authors: Fei Su, William Hwang, Arindam Mukherjee, Krishnendu Chakrabarty
Venue: Journal of Electronic Testing: Theory and Applications (2007)

Microfluidics-based biochips are soon expected to revolutionize biosensing, clinical diagnostics and drug discovery. Robust off-line and on-line test techniques are required to ensure system dependability as these biochips are deployed for safety-critical applications. Due to the underlying mixed-technology and mixed-energy domains, biochips exhibit unique failure mechanisms and defects. We first relate some realistic defects to fault models and observable errors. We next set up an experiment to evaluate the manifestations of electrode-short faults. Motivated by the experimental results, we present a testing and diagnosis methodology to detect catastrophic faults and locate faulty regions. The proposed method is evaluated using a biochip performing real-life multiplexed bioassays.
Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler
Authors: Shankar Ramaswamy, Prithviraj Banerjee
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Functional or Control parallelism is an efiectiuc way to increase speedups in Multicomputers. Programs for these machines are represented by Macro Dataflow Graphs (MRGsJ for the purpose of functional parallelism analysk and exploitation. Algorithms for allocation and schedttlang of MDGs have been discussed along with some analysis of their optirnality. These algorithms attempt to minimize the execution time of any given MDG through exploitation of functional parallelism. Our preliminary results show their eflectiveness over naive algorithms.
VLSI Architecture for Matrix Inversion using Modified Gram-Schmidt based QR Decomposition
Authors: Chitranjan K. Singh, Sushma Honnavara Prasad, Poras T. Balsara
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Matrix inversion and triangularization problems are common to a wide variety of communication systems, signal processing applications and solution of a set of linear equations. Matrix inversion is a computationally intensive process and its hardware implementation based on fixed-point (FP) arithmetic is a challenging problem. This paper proposes a fully parallel VLSI architecture under fixed-precision for the inverse computation of a real square matrix using QR decomposition with Modified Gram-Schmidt (MGS) orthogonalization. The MGS algorithm is stable and accurate to the integral multiples of machine precision under fixed-precision for a well-conditioned non-singular matrix. For typical matrices (4x4) found in MIMO communication systems, the proposed architecture was able to achieve a clock rate of 277 MHz with a latency of 18 time units and area of 72K gates using 0.18-um CMOS technology. For a generic square matrix of order n,the latency required is5n - 2 which is better than all previously known architectures. With the use of LUTs and log-domain computations, the total area has been reduced compared to architectures based on linear-domain computations.
Controlling of satisfaction of the end-users and profits of the ISPs in the DS enabled Internet
Authors: K. Pulakka
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In the DS (differentiated services) enabled networks, the ISPs (Internet service providers) should consider that the quality of the offered data transmission services correspond with the definitions of the established service level agreements (SLAs). Furthermore, the economic profit aims of the ISPs should also be fulfilled. We describe a SLA management system for the IP domains of the ISPs. The system considers the requirements of the ISPs customers and the profit aims of the ISPs without knowing the data transmission resources of the network environment. The operations of the system are based on the use of the mamdani type of fuzzy controller.
Robust algorithm for watermark recovery from cropped speech
Authors: A. Gurijala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Most digital watermarking techniques are susceptible to damage by data cropping. Although the effects of cropping might not be perceptible, watermark recovery may be rendered difficult or impossible due to the desynchronization of the recovery process. The transform encryption coding (TEC) based watermarking algorithm was presented at ICASSP 2000 (see Ruiz, F.J. and Deller, J.R., Jr, IEEE International Conference on Acoustics, Speech and Signal Processing 2000). This paper investigates the performance of TEC watermarking in the presence of cropping, and presents an algorithm that identifies cropped samples and recovers watermarks from the damaged record. Implementation details and experimental results under different environmental conditions are presented.
Scheduling of Transactions under Resource Constraint Based on Extended Preemptive Time Petri Nets for SoC System-Level Test-Case Generation
Authors: JinShan Yu, Tun Li, QingPing Tan
Venue: Proceedings of the Second International Conference on Systems (2007)

The transaction-based verification method and the effective scheduling of transactions have a great potential for SoC functional verification. Petri nets have proven to be a promising technique for solving scheduling problem. This paper aims at presenting a extended preemptive time Petri net (EPTPN) based approach to the scheduling of transactions under TAM resource constraint generated by a transaction test-case generator. Firstly, the short term of "scheduling of transactions problem' is formulated by means of an EPTPN. Secondly, transactions scheduling algorithm based on EPTPN is given. Finally, cases are studied to show the method effective.
Decision support systems in product development: a bayesian network approach for injection-molded products
Authors: Paul V. Engelmann
Venue:  (2006)

Attribute defects cause a majority of the scrap for many manufacturers injection-molding aesthetic parts, yet these defects receive little attention during product development. Methods for preventing attribute defects have been hampered by the inability to quantify complex cause-effect relationships. However, the qualities of a burgeoning branch of knowledge-based systems, called Bayesian networks, have benefited various fields faced with similar circumstances. Bayesian networks have the capability of presenting causal relationships between variables in a graphical structure and quantitatively explaining their effects throughout that structure. These effects can be characterized by probabilities derived from sources, such as equations, historical data, rules-of-thumb or expert knowledge. Thus, a Bayesian network was selected to model the decisions and uncertainty involved in preventing shear splay in polypropylene products. Shear splay is an attribute defect that occurs when shear generated during processing causes the polymer to degrade and release volatiles, which appear as silvery streaks on a part's surface. The shear splay network consisted of 17 conditional probability tables, 859 probabilities and 37 variables from areas of materials, part and mold design and processing. A computer-based system was created to elicit 296 subjective probabilities from 25 experts in the field of plastics. A user interface based on past research was designed to interact with experts to efficiently provide relatively unbiased and consistent probabilities. A bootstrap method using trimmed means of their responses was employed to develop a statistic for the probabilities, make inferences about the sample and assess the variability. Interpolation and modified shear rate equations were used to calculate the remaining probabilities. Both the qualitative and quantitative aspects of the network were evaluated by introducing evidence to validate relationships, comparing data of existing products against actual results and allowing several experts to review the model first-hand. Overall, the network performed as expected. It displayed the ability to be used as a decision-support system in preventing shear splay and explained cause-effect relationships that until now have never been quantified. In addition, the elicitation software and method for analyzing response data showed potential for becoming a standard in building Bayesian networks.
Evaluation of a Mobile Multimodal Application Design - Major Usability Criteria and Usability Test Results
Authors: Wolfgang Gottesheim, Stefan Mitsch, Rene Prokop, Johannes Schonbock
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Mobile broadband internet access and powerful mobile devices make interesting and novel communication applications possible (e.g., recently emerging VoIP applications). Additionally, speech recognition has matured to the point that companies can seriously consider its use. We developed a distributed framework [1] that enables multimodal user interfaces with speech recognition (dictation and command/control) on any type of mobile device. But do users already accept speech as additional input modality, and if so, which usability challenges arise when developing multimodal applications? This paper presents the results from usability tests that we conducted with a mobile multimodal e-mail and contact application. Based on the results we point out major usability criteria that need to be met in developing mobile multimodal applications.
Performance Considerations Relating to the Design of Interconnection Networks for Multiprocessors Systems
Authors: Earl Hokens, Ahmed Louri
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Choosing the best interconnection scheme for a multiprocessor is no easy task. This paper presents a two phase analysis to assist in this task. The two phases of the analysis are analyti cal, and simulation. The analytical phase introduces a new metric called the network bandwidth require ment, or nbr. The nbr is an estimate for the in terconnecting network link speed of a multiprocessor. This result is used in the second phase of the analy sis, different multiprocessor configurations are simu lated using stochastic activity networks to verify the results of the analytical phase, and analyze the effects of contention and memory design on performance.
Dynamic power management under uncertain information
Authors: Hwisung Jung, Massoud Pedram
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper tackles the problem of dynamic power management (DPM) in nanoscale CMOS design technologies that are typically affected by increasing levels of process, voltage, and temperature (PVT) variations and fluctuations. This uncertainty significantly undermines the accuracy and effectiveness of traditional DPM approaches. More specifically, we propose a stochastic framework to improve the accuracy of decision making in power management, while considering the manufacturing process and/or design induced uncertainties. A key characteristic of the framework is that uncertainties are effectively captured by a partially observable semi-Markov decision process. As a result, the proposed framework brings the underlying probabilistic PVT effects to the forefront of power management policy determination. Experimental results with a RISC processor demonstrate the effectiveness of the technique and show that our proposed variability-aware power management technique ensures robust system-wide energy savings under probabilistic variations.
Utilizing interband acoustical information for modeling stationary time-frequency regions of noisy speech
Authors: C. D. Yoo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A novel enhancement system is developed that exploits the properties of stationary regions localized in both time and frequency. This system selects stationary time-frequency (TF) regions and adaptively enhances each region according to its local signal-to-noise ratio (LSNR) while utilizing both the acoustical knowledge of speech and the masking properties of the human auditory system. Each region is enhanced for maximum noise reduction while minimizing distortion. This paper evaluates the proposed system through informal listening tests and some objective measures.
Towards a Framework for Dynamic Verification of Peer-to-Peer Systems
Authors: Theofrastos Koulouris, George Spanoudakis, Theocharis Tsigkritis
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Ensuring dependability and security of Peer-to- Peer (P2P) systems is an intricate task due to the autonomous and volatile nature of peers and the decentralization that characterizes such systems. Dynamic verification provides the means of monitoring aspects of peer behaviour at runtime and the capacity to react to identified violations with the aim of preserving the system in the desired state. Thus, it can provide an extra layer of checking properties like security and dependability and lead to enhanced system resilience in this respect. In this paper, we introduce a framework that supports the dynamic verification of P2P systems.
Search landscape of a realistic single-machine scheduling task: peaks with big differences
Authors: P. J. Darwen
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Some scheduling problems, including the Travelling Salesman Problem (TSP), have a "big valley" search landscape: the best solutions have common building blocks, so crossover works well. Unfortunately, in a realistic single-machine problem (TSP with batching, sequence-dependent setups, and multi-level precedence constraints) the best solutions have little in common. A mutation-only approach works better.
Distributing Congestions in NoCs through a Dynamic Routing Algorithm based on Input and Output Selections
Authors: M. Daneshtalab, A. Pedram, M. H. Neishaburi, M. Riazati, A. Afzali-Kusha, S. Mohammadi
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The routing algorithm benefits from congestionaware flow control, making better routing decisions. Our proposed routing algorithm is architected to fully exploit congestion-aware flow controls which come from neighboring switches and versatile reuse of available resources for concurrent input and output selections to remedy unbalance energy distribution due to peak-power and congested area. We simulate and evaluate the proposed architecture in term of network latency, hardware overhead and energy consumption. Our results show for effectiveness of the proposed technique in balancing the performance and energy of NoC designs.
Reflections on a distance education experiment in DSP
Authors: D. M. Etter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Distance education is becoming an increasingly important means of reaching a wider variety of traditional and non-traditional students and of developing unique educational partnerships between universities. In an effort to assist engineering departments just beginning to pursue distance education, the authors reflect on an innovative four year experiment in Internet based distance education involving students and faculty from the University of Colorado at Boulder, George Mason University, Rice University, Cornell University, and Sandia National Labs. The educational and research benefits to both the students and faculty are discussed in detail. In addition, the weaknesses and limitations of this experiment are also addressed. It is hoped that these comments and observations will benefit other institutions beginning to pursue similar distance education programs.
The communicating technologist: an educational challenge
Authors: P. Bakker, D. Carrington, A. Goodchild, I. Hayes, H. Purchase, P. Strooper
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The ability to work in groups and communicate effectively is essential for every science and engineering graduate. In Computing Curricula 1991, produced by a joint ACM/IEEE task force, the importance of communication and group work was recognized by suggesting that they should be incorporated into classroom lectures, laboratories and extracurricular activities. Although these skills can be taught in separate subject, this is not sufficient. It is important that group work and communication are integrated with core technical material. We present a different style of tutorial and report on experience with, and feedback on, introducing this style of tutorial in several Computer Science subjects. Based on feedback from students and teaching staff, we have developed guidelines and recommendations for such classes. We believe we have improved the quality of the Department's small-group teaching and encouraged students to treat communication skills as valuable. Our results show that small-group teaching can be enhanced by including group work and presentation activities, but that care must be taken to achieve appropriate structure and content for such tutorials.