ppxscal/embedding_network huggingface dataset:
East meets west: making the best of two worlds
Authors: Y. Morton
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In the past two decades, large numbers of Chinese engineering students have come to the US to pursue graduate studies. These Chinese students brought their drastically different learning styles to America's engineering classrooms and laboratories. Today, Chinese engineers play an important role in American high tech industry. Their success demonstrates that it is possible for students of different cultural background and learning style to excel in America's engineering education system. The bigger question is: can we improve engineering education in both the US and China by learning from each other's success and failure? The author presents his personal observations of the differences between the traditional Chinese education system and the modern American way of teaching and learning and provides his opinions on how to improve engineering education in both countries.
Vowel recognition of English and German language using facial movement (SEMG) for speech control based HCI
Authors: Sridhar P. Arjunan, Hans Weghorn, Dinesh K Kumar, Wai C. Yau
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

This paper examines the use of facial muscle activity (Surface Electromyogram) to recognise speech based commands in English and German language without any audio signals. The system is designed for applications based on speech control for Human Computer Interaction (HCI). The paper presents an effective technique that uses the facial muscle activity of the articulatory muscles and human factors for recognition. The difference in the speed and style of speaking varies between experiments, and this variation appears to be more pronounced when people are speaking a foreign language. To overcome this difficulty, the paper reports measuring the relative activity of the articulatory muscles for recognition of unvoiced vowels of English and German languages. In these investigations, three English vowels and three German vowels were used as recognition variables. The moving root mean square (RMS) of surface electromyo-gram (SEMG) of four facial muscles is used to segment the signal and to identify the start and end of a silently spoken utterance. The relative muscle activity is computed by integrating and normalising the RMS values of the signals between the detected start and end markers. The output vector of this is classified using a back propagation neural network to identify the voiceless speech. The data is also tested using K means clustering technique to determine the linearity of separation of the data. The experimental results show that this technique gives high recognition rate when used for each of the participants for both of the languages. The investigations also show that the system is easy to train for a new user. The visual inspection of the plot of the experimental data suggests the formation of clusters. The results suggest that such a system is reliable for simple vowel based commands for human computer interface when it is trained for the user, who can speak one or more languages and for the people who have speech disability.
Evaluation of kernel-based link analysis measures on research paper recommendation
Authors: Masashi Shimbo, Takahiko Ito, Yuji Matsumoto
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

We compare various kernel-based link analysis measures on graph nodes to evaluate their utility as a research paper recommendation system. The compared measures include the Kandola et al.'s von Neumann kernel, its extension that takes communities into account, and Smola and Kondor's regularized Laplacian. Chebotarev and Shamis' matrix forest-based algorithm, Kleinberg's HITS authority ranking, and classic co-citation coupling are also evaluated. The experimental result shows that kernel-based methods outperform HITS and co-citation coupling, with the community-based von Neumann kernel achieving the highest score.
A Multiresolution Approach to the Electric Field Integral Equation in Antenna Problems
Authors: F. P. Andriulli, A. Tabacco, G. Vecchi
Venue: SIAM Journal on Scientific Computing (2007)

This paper deals with a multiresolution approach to the finite-element solution of the electric field integral equation (EFIE) formulation of the boundary value problem for Maxwell equations. After defining a multiresolution set of discretized spaces, each of them is first separated into solenoidal and nonsolenoidal complementary spaces. The possibility of obtaining these two spaces with a scalar-to-vector space mapping is used to consider first two separate scalar wavelet decompositions, and then to transform them properly into the two desired vector finite-element sets, finally joined to obtain the complete multiresolution basis. Numerical results, obtained for real life antennas, are presented to verify the actual sparsity of the system matrix and to show the fast convergence behavior of iterative solvers.
Network Distribution of Security Policies via Ant-like Foraging Behavior
Authors: Attila Ondi, Ronaldo Menezes, Richard Ford
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

The amount of media time given to computer security breaches added to a general culture of emphasizing problems rather than solutions make it appear, in many ways, that researchers in computer security are loosing the battle against attackers. Furthermore, current trends tend to show that if novel approaches to solving security problems are not explored, things are likely to get worse, not better. A possible approach that may give security experts the upper hand requires them to examine the fundamental causes of security problems. Is it possible that our security woes exist primarily due to an antiquated approach to solving the problem? In this paper, we argue that the answer is yes: one of the fundamental weaknesses of our collective approach is the static nature of most security systems. We then suggest the use of countermeasures based on a more dynamic approach `a la swarm intelligence. We concentrate here on the very important issue of security policy updates and show simulation results which demonstrate the potential of our approach.
Code reordering on limited branch offset
Authors: Yu Chen, Fuxin Zhang
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2007)

Since the 1980's code reordering has gained popularity as an important way to improve the spatial locality of programs. While the effect of the processor's microarchitecture and memory hierarchy on this optimization technique has been investigated, little research has focused on the impact of the instruction set. In this paper, we analyze the effect of limited branch offset of the MIPS-like instruction set [Hwu et al. 2004, 2005] on code reordering, explore two simple methods to handle the exceeded branches, and propose the bidirectional code layout (BCL) algorithm to reduce the number of branches exceeding the offset limit. The BCL algorithm sorts the chains according to the position of related chains, avoids cache conflict misses deliberately and lays out the code bidirectionally. It strikes a balance among the distance of related blocks, the instruction cache miss rate, the memory size required, and the control flow transfer. Experimental results show that BCL can effectively reduce exceeded branches by 50.1&percnt;, on average, with up to 100&percnt; for some programs. Except for some programs with little spatial locality, the BCL algorithm can achieve the performance, as the case with no branch offset limitation.
An improved mixed excitation linear prediction (MELP) coder
Authors: T. Unno
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper presents an improved mixed excitation linear prediction (MELP) coder. The MELP is the linear-prediction-based speech coder that was chosen as the new 2400 bps US Federal Standard. Even though the MELP is quite good, there are still some perceivable distortions, particularly around non-stationary speech segments and for some low-pitch male speakers. The key features of our new coder include a robust pitch detection algorithm, a new plosive analysis/synthesis method, and a post processor for the Fourier magnitude model. Formal quality tests are used to show that the new MELP improves the quality of the US Federal Standard MELP coder while requiring only a small increase in algorithmic delay and while also retaining compatibility with the Federal Standard MELP bit-stream specification.
When virtual is harder than real: security challenges in virtual machine based computing environments
Authors: Tal Garfinkel, Mendel Rosenblum
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

As virtual machines become pervasive users will be able to create, modify and distribute new "machines" with unprecedented ease. This flexibility provides tremendous benefits for users. Unfortunately, it can also undermine many assumptions that today's relatively static security architectures rely on about the number of hosts in a system, their mobility, connectivity, patch cycle, etc. We examine a variety of security problems virtual computing environments give rise to. We then discuss potential directions for changing security architectures to adapt to these demands.
Lag-indexed VQ for pitch filter coding
Authors: S. McClellan, J. D. Gibson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The presence of a pitch predictor is critical to low-rate performance of CELP coders. Unfortunately the rate required for high-quality encoding of pitch filter parameters is often a large fraction of the available bandwidth. Moreover, the application of analysis-by-synthesis techniques to pitch filter optimization can require excessive computation. We present a vector quantization (VQ) approach for coding pitch filter parameters which maintains a subjective quality equivalent to other coding schemes while requiring lower (variable) rate with less closed-loop computation than other VQ techniques.
On the Communication Architecture for Wide-Area Real-Time Monitoring in Power Networks
Authors: Shrut Kirti, Zhifang Wang, Anna Scaglione, Robert Thomas
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Reliable and efficient operation of power networks is of paramount importance. In this paper we explore communication architectures that leverage Phasor Measurement Units (PMUs) and fusion centers to enable robust real-time monitoring of power networks over wide areas. We examine scalability issues in data aggregation for a power network in which PMUs are attached to every bus. We argue that in power networks, the data recorded by the PMUs are spatially correlated and therefore the data admit a sparse representation in a given basis. Furthermore, the number of bits required to reconstruct the PMU data to within a given accuracy at a remote location grows sublinearly with the density of the power network. Our results are: i) the PMUs should not transmit their data to the fusion center independently or asynchronously - an intermediate data aggregation step is beneficial, and ii) if we perform data aggregation then we can add more PMUs to the network to achieve finer network monitoring without causing network congestion.
Impact of Adaptive Resource Allocation Requests in Utility Cluster Computing Environments
Authors: Marco A. S. Netto, Rajkumar Buyya
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Maximizing resource provider profit and satisfying user requirements at the same time is a challenging problem in utility computing environments. In this paper, we intro- duce adaptive resource allocation requests and investigate the impact of using them in utility cluster computing en- vironments. The Service Level Agreements established be- tween users and resource providers rely not only on fixed values, but also on functions that associate allocation pa- rameters. In addition, the resource provider scheduler can automatically modify the number of resources and usage time of allocation requests, as well as split them into subre- quests. Users may receive incentives for supplying flexible requests which produce more scheduling options. By us- ing rescheduling, resource providers are able to prioritize the most profitable requests dynamically and still satisfy the requirements of the already accepted user requests. From our experimental results we observed an increase of 14% in the resource provider profit and a reduction of 20% in the average response time of user requests when compared to traditional approaches.
Modelling performance optimizations for content-based publish/subscribe
Authors: Alex Wun, Hans-Arno Jacobsen
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Content-based Publish/Subscribe (CPS) systems can efficiently deliver messages to large numbers of subscribers with diverse interests and consequently, have often been considered an appropriate technology for large-scale, event-based applications. In fact, a significant amount of existing research addresses the issue of providing scalable CPS services [3, 8, 7, 11]. In these approaches, scalability and high performance matching is often achieved by taking advantage of similarities between subscriptions. However, even though such optimization techniques are widely used, no model has been developed yet to capture them. Such an abstraction would allow CPS matching algorithms to be studied, analyzed, and optimized at a more fundamental and formal level. In this work-in-progress paper, we present the initial results of our work towards modelling and analyzing matching optimizations frequently used by CPS systems. Using our proposed model, we find that probabilistically optimal CPS matching is possible in certain types of subscription sets and that there is also a non-obvious upper bound on the expected cost of some subscription sets. We also provide experimental results that support the model proposed and studied in this paper.
An Outcome-Based Learning Model to Identify Emerging Threats: Experimental and Simulation Results
Authors: Ignacio J. Martinez-Moyano, Stephen H. Conrad, David F. Andersen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The authors present experimental and simulation results of an outcome-based learning model as it applies to the identification of emerging threats. This model integrates judgment, decision making, and learning theories to provide an integrated framework for the behavioral study of emerging threats.
Being aware: where we think the action is
Authors: Martin E. M&#x00fc;ller
Venue: Cognition, Technology and Work (2007)

The term awareness has become one of the core concepts in human (computer-) interaction. By awareness we usually try to describe a human&#x2019;s capability of perception and the cognitive effort related to an apperception task as well as similar abilities of a computer system to act sensitively with respect to context. But what does it mean to be aware in or of some context? Are not all things assembled in a system affected by being in that system&#x2014;being aware of it or not? What does it take to be aware and what are the consequences of being not aware? This article discusses recent paradigms of computer science in the context of philosophy of mind, psychology of perception and sociology to shed light on awareness, context, perception and affection. The conclusion that is drawn is that any observation is inherently predetermined by our model of the world: the meaning of data we collect is determined by the model assumptions under which the observer is running.
Managing Information on Industrial Automation Projects
Authors: Jan Jekielek
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Today's perpetually improving industrial automation technology brings new equipment, systems, solutions and semantics. Project requirements become greater and the level of complexity, cost, documentation, and humbug tend to increase. Managing information becomes critical for project success. This paper offers solutions based on the use of "nutshell' learning models that are simplified presentations of complex or vague concepts, designed to accelerate the learning process and extend retention of the acquired knowledge. A brief review of some aspects of automation technologies follows. Some traps and urban myths surrounding industrial projects and automation are unveiled. Needs for integration of technical and non-technical content, as well as an investment in project's "social capital" are stressed. Pragmatic management skills and practices are pointed out. Case study stories address data integration challenges and lead to a "meta consulting' concept where technical and non-technical aspects are quickly assessed to form a basis for the powerful, rapid-engagement, priority-based solutions.
Engineering Tele-Health Solutions in the Ambient Assisted Living Lab
Authors: Eric Ras, Martin Becker, Jan Koch
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Despite the advancement in electronic industry and the high potential of ambient intelligence applications in the domain of tele-health, the task of engineering such systems is non-trivial and convincing solutions are still missing. The engineering challenges to cope with and the inappropriateness of current engineering methods and research approaches complicate the process of tele-health system development. The purpose of this paper is twofold: (i) to list the current research challenges for tele-health systems from an engineering perspective and (ii) to show how we approach the challenges by means of an assisted living laboratory for engineering and evaluation purposes.
2000 IEEE International Conference on Acoustics, Speech, and Signal Processing
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We consider the problem of optimal FIR linear and regression filters for jointly stationary symmetric alpha stable processes with index alpha greater than one. We then consider the signed-error and sign-sign adaptive filtering algorithms and provide various convergence results for the signal and tap weights estimation errors. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Survey of Hybrid Techniques for Functional Verification
Authors: Jayanta Bhadra, Magdy S. Abadir, Li-C. Wang, Sandip Ray
Venue: IEEE Design Test (2007)

The increasing size and complexity of industry hardware designs, along with stringent time-to-market requirements, have put a heavy burden on verification to ensure that designs are relatively bug free. A general theme successfully adopted by academia and several vendors is to apply multiple verification techniques so that they complement one another, resulting in an increase of the verification tool's overall effectiveness. Such integration must be carried out delicately and precisely so that the overall technique becomes more than merely a sum of the techniques. This article surveys the research that has taken place in this area.
Robust adaptive subspace extraction for DOA tracking
Authors: Dekun Yang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper addresses the problem of extracting a time-varying signal subspace from noisy signal measurements for direction-of-arrival (DOA) estimation and tracking. A robust adaptive method for extracting the signal subspace is developed based on robust statistics. The method is more resistant to the presence of outliers than existing adaptive methods. Robust DOA estimation and tracking are achieved by incorporating the method with the TLS-ESPRIT method. Experimental results demonstrate the viability and superiority of the proposed method over existing methods.
The Design and Implementation of the Cicada Wireless Sensor Network Indoor Localization System
Authors: Wenfeng Jiang, Yu Chen, Yuanchun Shi, Yunfeng Sun
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The wireless sensor network based localization system--Cicada is designed to support the location-awareness in indoor environment. The system is based on TDOA (time difference of arrival) between radio frequency and ultrasonic to measure the distances, uses the SWF(slide window filter) and least square fitting for the rough distance correction, adopts the UKF (unscented kalman filter) to ultimately estimate the coordinates, and then sends the coordinate values to the network to provide location services. The system has several notable merits: it not only can provide the coordinates within 5cm average deviation either for static object or for mobile object, but also can support multiple objects at the same time; it not only has a nearly omni-directional working area, but also be convenient for deployment and portability. Compared with other indoor localization system, the Cicada system adopts a more accurate algorithm and the whole system is more portable and convenient to deploy. Experiment results show the system can well satisfy the requirements in smart space.
Pipeline architecture for 8/spl times/8 discrete cosine transform
Authors: J. Takala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

An array processor architecture for the 2-D discrete cosine transform (DCT) based on the row-column decomposition of the 2-D DCT. The utilized 1-D DCT architectures are derived by applying the principles used to construct pipelined fast Fourier transform architectures. In general, this approach has not been used due to the irregularities found in the fast DCT algorithms. The basis of our architectural derivation is the constant geometry fast algorithms for DCT described earlier. By rescheduling the operations; an in-place algorithm can be obtained, which can be mapped onto a pipelined structure with the aid of vertical projection. In addition, a sequential matrix transposition network is described, which is based on shift-exchange units.
Social Cognition and Knowledge Creation using Collaborative Technology
Authors: Souren Paul, Derek L. Nazareth
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Social Cognition and Knowledge Creation using Collaborative Technology Minitrack serves as an outlet for research that addresses the use of collaboration technology to create knowledge. Of special interest is the role of social interactions that take place within the creation, codification, and verification of this knowledge. Group knowledge is enhanced through sharing of individual knowledge, and collaboration technologies can enable to access, share, and add to group knowledge, based on prevailing group attitudes. This is the second year that the Minitrack has been offered, though the emphasis has shifted from gains and losses in traditional group support systems to knowledge creation through the use of these systems. The papers in the Minitrack are clustered into three sessions that focus on distinct themes associated with the use of collaboration technology for knowledge creation.