ppxscal/embedding_network huggingface dataset:
A new technique for blind source separation using subband subspace analysis in correlated multichannel signal environments
Authors: K. G. Oweiss
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We investigated a new framework for the problem of blind source identification in multichannel signal processing. Inspired by a neurophysiological data environment, where an array of closely spaced recording electrodes is surrounded by multiple neural cell sources, significant spatial correlation of source signals motivated the need for an efficient technique for reliable multichannel blind source identification. In a previous work Oweiss and Anderson (see Proceedings of the 34th. Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2000) adopted a new approach for noise suppression based on thresholding an array discrete wavelet transform (ADWT) representation of the multichannel data. We extend the work of Oweiss and Anderson to identify sources from the observation mixtures. The technique relies on separating sources with highest spatial energy distribution in each frequency subband spanned by the corresponding wavelet basis. Accordingly, the best basis selection criterion we propose benefits from the additional degree of freedom offered by the space domain. The amplitude and shift invariance properties revealed by this technique make it very efficient to track spatial source variations sometimes encountered in multichannel neural recordings. Results from multichannel multiunit neural data are presented and the overall performance is evaluated.
XSEM: a conceptual model for XML
Authors: Martin Necasky
Venue: Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67 (2007)

We propose a new conceptual model for XML data called XSEM as a combination of several approaches in the area of the conceptual modeling for XML. The model divides the conceptual modeling process of XML data to two levels. On the first level, a designer designs an overall non-hierarchical conceptual schema of a domain. On the second level, he or she derives different hierarchical representations of parts of the overall conceptual schema using transformation operators. These hierarchical representations describe how the data is organized in an XML form.
A Transmission Power Control MAC Protocol for Wireless Sensor Networks
Authors: Zhiwei Zhao, Xinming Zhang, Peng Sun, Pengxi Liu
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Wireless sensor networks have been widely used in many important fields. Medium Access Control (MAC) protocols have a significant effect on the function and performance of sensor networks. At present, most MAC protocols use the same transmission power when sensor nodes send packets. However, the deployment of the sensor nodes is asymmetrical in wireless sensor networks, which will bring more energy consumption and unnecessary collisions. By jointing the MAC layer and physical layer of the senor nodes, and based on Sensor MAC (SMAC) [1] protocol, we propose a transmission power control MAC protocol in wireless sensor networks (transmission Power control in SMAC, PSMAC). The simulation results show that, compared with the SMAC protocol, our protocol has improved a lot in the delay of packets, reception rate, energy consumption and throughput of the networks.
Feedback based performance management and fault tolerance for networked and embedded computing systems
Authors: Lui Sha
Venue:  (2006)

Performance management and fault tolerance are two important issues faced by computing systems research. In this dissertation, we exploit the use of feedback control for performance management and fault tolerance. Specifically, we propose Queueing Model Based Feedback Control scheme to achieve performance regulation. Traditionally, queueing theory was used for modeling computing system's performance. It usually serves as an offline capacity planning tool. On the other hand, feedback control theory was used for dynamically controlling the performance of electro-mechanical systems. How to utilize the "descriptive" power of queueing theory and the "prescriptive" power of feedback control to control computing system's performance was an open problem. Queueing Model Based Feedback Control answers this question by integrating the strengths of both queueing model and feedback control into one unified framework. It provides better performance regulation compared with other control-theoretic approaches. We show the advantages of Queueing Model Based Feedback Control for two networked server applications: one is response time regulation for Apache Web server via dynamic resource allocations; the other is response time regulation for a multi-tiered Web service application via dynamic admission control. In the second part of this dissertation, we further exploit the use of feedback control to achieve fault tolerance for real-time embedded control systems. We propose ORTGA (On-demand Real-Time GuArd), a new fault tolerance architecture which utilizes feedback control based software execution. ORTGA delivers the same functionalities as previously proposed Simplex architecture, with the same high fault coverage and reliability but with much more efficient resource utilization and flexibility. Hence it can be deployed in a wide range of real-time embedded applications to provide fault tolerance. We implemented ORTGA in an inverted pendulum testbed to demonstrate its efficacy and efficiency. Based on the ORTGA design, we discussed the fault tolerance and scheduling co-design problem and its solutions.
Address Sequences Generation for Multiple Run Memory Testing
Authors: S. V. Yarmolik, I. Mrozek, B. Sokol
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

This paper deals with address generation for multiple run memory tests. It presents the algorithms for address sequences generation and proposes the new method for address sequences generation. The experimental results with the proposed address sequence are also shown.
Fast data extrapolating
Authors: Chunlin Wu, Jiansong Deng, Falai Chen
Venue: Journal of Computational and Applied Mathematics (2007)

Data-extrapolating (extension) technique has important applications in image processing on implicit surfaces and in level set methods. The existing data-extrapolating techniques are inefficient because they are designed without concerning the specialities of the extrapolating equations. Besides, there exists little work on locating the narrow band after data extrapolating-a very important problem in narrow band level set methods. In this paper, we put forward the general Huygens' principle, and based on the principle we present two efficient data-extrapolating algorithms. The algorithms can easily locate the narrow band in data extrapolating. Furthermore, we propose a prediction-correction version for the data-extrapolating algorithms and the corresponding band locating method for a special case where the direct band locating method is hard to apply. Experiments demonstrate the efficiency of our algorithms and the convenience of the band locating method.
Persisting and querying biometric event streams with hybrid relational-XML DBMS
Authors: Daby M. Sow, Lipyeow Lim, Min Wang, Kyu Hyun Kim
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Remote monitoring of patients' biometric data streams offers the possibility to physicians to extend and improve their services to chronically ill patients who are away from medical institutions. This emerging technology is a promising way to address important aspects of the cost issues that most health care systems are experiencing. In order to fulfill its potential, several challenges need to be overcome. First, the data collected needs to be filtered and annotated intelligently to help physicians cope with and navigate the large amount of patient sensor data received as a result of large scale remote health monitoring deployments. Secondly, efficient stream persistence and query mechanisms for these data need to be designed to satisfy health care regulations and help physicians track patient health histories accurately and efficiently. In this paper, we concentrate on the second challenge. We leverage emerging hybrid relational-XML database management systems to design a storage sub-system for remote health monitoring. We evaluate this approach by performing series of performance tests to assess the ability of the proposed system to handle the huge amount of biometric data streams requiring persistence.
Quantitative ethics problem examples
Authors: J. A. Pearce
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Quantitative hypothetical ethics problems have been formulated and applied at the freshman level. The problems are of multiple sequential parts conducted over more than one homework assignment period. The outcome of each part is determined among several possibilities "blind" to the students. Students are asked to solve ensuing problem chapters based on the outcomes. An effort has been made to include some sense of jeopardy on the part of the student writing the solution.
SQL query optimization through nested relational algebra
Authors: Bin Cao, Antonio Badia
Venue: ACM Transactions on Database Systems (TODS) (2007)

Most research work on optimization of nested queries focuses on aggregate subqueries. In this article, we show that existing approaches are not adequate for nonaggregate subqueries, especially for those having multiple subqueries and certain comparison operators. We then propose a new efficient approach, the nested relational approach, based on the nested relational algebra. The nested relational approach treats all subqueries in a uniform manner, being able to deal with nested queries of any type and any level. We report on experimental work that confirms that existing approaches have difficulties dealing with nonaggregate subqueries, and that the nested relational approach offers better performance. We also discuss algebraic optimization rules for further optimizing the nested relational approach and the issue of integrating it into relational database systems.
MPLS Traffic Engineering in Satellite Networks
Authors: Arjan Durresi, Mimoza Durresi, Fatos Xhafa
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Broadband satellite constellation networks will be required to carry all types of IP traffic, real time interactive traffic as well as non-real time traffic, warranting the need for appropriate QoS for these different traffic flows. In this paper we investigate the need for MPLS traffic engineering in GEO/MEO/LEO satellite networks to address QoS issues. We compare the service received by TCP and UDP flows when they share a link and when they are routed on explicit MPLS traffic trunks. Since MPLS traffic trunks allow non-shortest path links also to be used, the total network throughput goes up with proper traffic engineering. If UDP and TCP flows are mixed in a trunk, TCP flows receive reduced service as the UDP flows increase their rates. Also, we found that with MPLS traffic engineering we can protect real time traffic and VoIP traffic from packet loss and excessive jitter by separating them from other congestion unresponsive flows.
Statistical language modeling for speech disfluencies
Authors: A. Stolcke, E. Shriberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Speech disfluencies (such as filled pauses, repetitions, restarts) are among the characteristics distinguishing spontaneous speech from planned or read speech. We introduce a language model that predicts disfluencies probabilistically and uses an edited, fluent context to predict following words. The model is based on a generalization of the standard N-gram language model. It uses dynamic programming to compute the probability of a word sequence, taking into account possible hidden disfluency events. We analyze the model's performance for various disfluency types on the Switchboard corpus. We find that the model reduces the word perplexity in the neighborhood of disfluency events; however, overall differences are small and have no significant impact on the recognition accuracy. We also note that for modeling of the most frequent type of disfluency, filled pauses, a segmentation of utterances into linguistic (rather than acoustic) units is required. Our analysis illustrates a generally useful technique for language model evaluation based on local perplexity comparisons.
B-to-B E-Commerce: Assessing the Impacts of RFID Technology in a Five Layer Supply Chain
Authors: Ygal Bendavid, Elisabeth Lefebvre, Louis A. Lefebvre, Samuel Fosso Wamba
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper attempts to track key performance indicators in order to assess the impacts of RFID technology in a five layer supply chain in the utility sector. Findings point to some performance improvements especially when RFID enables more integrated and more collaborative B-to-B e-commerce solutions. The research design involves multiple units and levels of analysis, and relies on diverse data collection methods and generates a vast amount of data. The concept of a living laboratory proved to be an insightful approach for exploring issues related to inter-company connectedness and relationship management.
Remote and local delivery of cisco education for the vision-impaired
Authors: Helen Armstrong, Iain Murray
Venue: ACM SIGCSE Bulletin (2007)

Vision-impaired students face tremendous obstacles in their quest to access learning materials delivered in web-based and other electronic formats. The predominance of visual prompts, use of flash and animation and the inability of screen reading applications to interpret images all contribute to make much of the current e-learning materials associated with computing studies inaccessible by blind or vision-impaired students. This paper describes a university research project undertaken to improve the accessibility of Cisco e-learning materials for vision-impaired computing students.allThe network architecture which supports the delivery of the Cisco courses to both local and remote vision-impaired students is also presented.
Efficient realizations of analysis and synthesis filters based on the 2-D discrete wavelet transform
Authors: C. Chakrabarti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents folded architectures and scheduling algorithms for computing the 2-D DWT for analysis and synthesis filters. The folded architectures consist of two parallel computation units (one for computations along the rows and the other for computations along the columns) and two storage units to store the intermediate outputs that are generated by the two units. The scheduling algorithms range from those that try to minimise the latency to those that try to minimise the control unit complexity and keep the data flow regular. A comparison of the scheduling algorithms has been included to aid the designer in choosing an algorithm that is best suited for a particular application.
A Framework for Identification and Resolution of Interoperability Mismatches in COTS-Based Systems
Authors: Jesal Bhuta, Barry Boehm
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Software systems today are frequently composed from prefabricated commercial components that provide complex functionality and engage in complex interactions. Such projects that utilize multiple commercial-off-the-shelf (COTS) products often confront interoperability conflicts resulting in budget and schedule overruns. These conflicts occur because of the incompatible assumptions made by developers of these products. Identification of such conflicts and planning strategies to resolve them is critical for developing such systems under budget and schedule constraints. In this paper we present an attribute-based framework that can be used to perform automated interoperability assessment to filter out COTS product combinations whose integration will not be feasible within the project constraints. Our framework is built upon standard definitions of both COTS components and connectors and is intended for use by architects and developers during the design phase of a software system. Our preliminary experience in using the framework indicates an increase in interoperability assessment productivity by 50% and accuracy by 20%.
Virtual services: a new abstraction for server consolidation
Authors: John Reumann, Ashish Mehra, Kang G. Shin, Dilip Kandlur
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Modern server operating systems (OS's) do not address the issue of interference between competing applications. This deficiency is a major road-block for Internet and Application Service Providers who want to multiplex server resources among their business clients. To insulate applications from each other, we introduce Virtual Services (VSs). Besides providing per-service resource budgets, VSs drastically reduce cross-service interference in the presence of shared backend services, such as databases and name services. VSs provide dynamic per-service resource partitioning and management in a manner completely transparent to applications. To accomplish this goal, we introduce a kernel-based work classification mechanism called gates. Gates track work that propagates from one service to another and are configured by the system administrator via simple rules. They automate the binding of processes and sockets to VSs, and ensure that any work done on behalf of a VS, even if it is done by shared services, is charged to the resource budget of the VS that requested it. Using our experimental Linux 2.0.36-based implementation we applied them effectively to co-hosted Web servers. Thus, nearly eliminating performance interference between the co-hosted sites.
Dependability analysis of reconfigurable information systems
Authors: Przemyslaw Krekora, Dariusz Caban
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Complex network information systems are usually responsible for realizing client requests of business level services. Often these services are critical for the company and it is very important to ensure that appropriate reconfiguration will be applied in case of system malfunction. Due to the complexity of systems, huge amount of dependencies and impacting factors, the analytical approach may be too limiting to evaluate the reconfiguration policy. The paper presents a method of analyzing new applicable configurations of information systems based on simulation. As a result, the reachability graph of configurations is constructed. Each transition in the graph defines the most adequate reconfiguration (compliant with user criteria) in case of a system failure.
Affordable Strategies for the Reduction of Future Tsunami Effects on Local Populations in Phuket, Krabi and Phang Nga, Southern Thailand
Authors: Richard Zobel, Pichaya Tandayya, Helmut Duerrast
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper initially reviews the sequence of events surrounding the tsunami disaster, which occurred on December 26, 2004, and how this affected Thailand. The authors then consider the concepts of minimisation of the after effects, on local people, homes, businesses, stock, supplies and services, and tourism. In these respects, consideration is first given to the built environment and its operation. Then the possibilities for protection, using both natural and man-made methods are reviewed. This is followed by suggestions for research projects, both small and large, suitable for undergraduate, masters, and doctoral students in an international collaborative environment, is presented. Finally, some conclusions are made on the feasibility of such projects.
Security services for remote data management
Authors: Gene Tsudik
Venue:  (2006)

Rapid advances in storage, computing and networking technologies have resulted in an explosion in the amount of content available online as well as the number of users of this content. The traditional model of data storage is giving way to new paradigms in remote decentralized data storage which are driven by today's data intensive applications. Providing efficient security services that work well with these applications is the main focus of this thesis. We consider two scenarios of the remote data storage model: the "in-house" scenario where the remote storage disks are controlled by the data owner and the more challenging "outsourced" data storage model where the storage infrastructure is controlled by a third-party service provider. For the in-house model, we propose a security architecture and a decentralized group key agreement protocol to enable secure data sharing. For the outsourced data storage model, we propose several cryptographic techniques to maintain the integrity of outsourced data. Specifically, Signature Aggregation and Signature Chaining techniques are proposed to ensure correctness and completeness of queried data. Signature Bouquet technique is proposed to prevent un-authorized distribution of authentic data. We also explore the applicability of proposed techniques in other application domains.
MKPLS approach: switching strategies for the non-linear multi-kernel PLSR
Authors: Raúl Rentería, Ruy Milidiú, Rafael Souza
Venue: Computational Statistics (2007)

We present two strategies to determine the kernel switching order for the non-linear multi-kernel PLSR algorithm. The multi-kernel PLS (MKPLS) algorithm builds upon a one kernel PLSR which uses a kernel matrix to hold the inner products of the projection of the independent data set onto a feature space. After building a PLSR model, MKPLS deflates the kernel matrix so that only that part which cannot be predicted by the model remains. This remainder is projected onto a different feature space and a new PLSR model is built. The switching algorithms presented for this approach address two questions: which kernel should be used at each iteration and; how many factors should be extracted before switching to another kernel.
Verification of Component Behavioral Compatibility
Authors: D. C. Craig, W. M. Zuberek
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

In component-based systems, two components are behaviorally compatible if all possible sequences of services requested by one component can be provided by the other component. Verification of this compatibility is essential if subtle software failures, which are difficult to detect and correct, are to be eliminated. For verification of compatibility, the behavior of interacting components, at their interfaces, is modeled by labeled Petri nets with labels representing the requested and provided services. The paper discusses the verification process for several classes of interface languages, with emphasis on the algorithmic aspects of verification.