ppxscal/embedding_network huggingface dataset:
Discriminative estimation of interpolation parameters for language model classifiers
Authors: V. Warnke
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In this paper we present a new approach for estimating the interpolation parameters of language models (LM) which are used as classifiers. With the classical maximum likelihood (ML) estimation theoretically one needs to have a huge amount of data and the fundamental density assumption has to be correct. Usually one of these conditions is violated, so different optimization techniques like maximum mutual information (MMI) and minimum classification error (MCE) can be used instead, where the interpolation parameters are not optimized on their own but in consideration of all models together. In this paper we present how MCE and MMI techniques can be applied to two different kind of interpolation strategies: the linear interpolation, which is the standard interpolation method and the rational interpolation. We compare ML, MCE and MMI on the German part of the Verbmobil corpus, where we get a reduction of 3% of classification error when discriminating between 18 dialog act classes.
Headlight prefetching for mobile media streaming
Authors: Shiow-yang Wu, Jungchu Hsu, Chieh-Ming Chen
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

Multimedia information services in mobile environments are becoming more and more important with the proliferation of 3G technologies. Media streaming, in particular, is a promising technology for providing services such as news clips, live sports, and hot movies on the fly. To avoid service interruption when the users keep moving, proper data management strategies must be employed. We propose a new headlight prefetching technique for the streaming access points to deal with the uncertainty of client movement and the requirement of seamless service hand-off. For each mobile client, we maintain a virtual fan-shaped prefetching zone along the direction of movement similar to the headlight of a moving vehicle. The overlapping area and the accumulated virtual illuminance of the headlight zone on a particular cell determines the degree and volume of prefetching to be made by the streaming access point of that cell. Headlight prefetching solves the issues of identifying the streaming access points responsible for prefetching, the timing and the amount of data to prefetch in a single mechanism which is simple and effective. Simulation results demonstrate that our techniques can significantly decrease streaming disruptions, reduce bandwidth consumption, increase cache utilization and improve service response time.
Validation of in-vehicle-protocol network topologies
Authors: Wolfhard Lawrenz, David Bollati
Venue: Proceedings of the Second International Conference on Systems (2007)

Network systems in vehicles represent very high complex systems. As such, topologies typically become very complex and in their layout criticality a major topic to be considered. Analysis of almost one hundred different topologies of vehicle manufactures worldwide led to the conclusion that less than 50 % of these layouts had been non-critical, if tolerances of all the parameters involved had been considered in their realistic worst-case scenario. C&S group developed a methodology based on electrical network topology components modelling for a couple of years together with the major German vehicle OEMs. As such, line models had been developed along with other models for the components being involved such as transceivers, termination coupling circuits, common mode chokes, electrostatic protection elements, etc. Along with the OEM specification of the desired topologies, simulations of these modelled topologies had been executed. The result of the simulation shows the electrical signal behaviour of the communication passing through the network. Signal distortion emerges due to the discrete components and the topology geometry itself and leads to signal ringing and reflections which may corrupt the individual bits to be transmitted and received.
Separating AC0 from depth-2 majority circuits
Authors: Alexander A. Sherstov
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We prove that AC0 cannot be efficiently simulated by MAJºMAJ circuits. Namely, we construct an AC0 circuit of depth 3 that requires MAJºMAJ circuits of size 2Ω(n1/5). This matches Allender's classic result that AC0 can be simulated by MAJºMAJºMAJ circuits of quasipolynomial size. Our proof is based on communication complexity. To obtain the above result, we develop a novel technique for communication lower bounds, the Degree/Discrepancy Theorem. This technique is a separate contribution of our paper. It translates lower bounds on the threshold degree of a Boolean function into upper bounds on the discrepancy of a related function. Upper bounds on the discrepancy, in turn, immediately imply communication lower bounds as well as lower bounds against threshold circuits. As part of our proof, we use the Degree/Discrepancy Theorem to obtain an explicit AC0 circuit of depth 3 that has discrepancy 2-Ω(n1/5), under an explicit distribution. This yields the first known AC0 function with exponentially small discrepancy. Finally, we apply our work to learning theory, showing that polynomial-size DNF and CNF formulas have margin complexity 2Ω(n1/5).
Toward Requirements Engineering for Self - Organizing Multi - Agent Systems
Authors: Jan Sudeikat, Wolfgang Renz
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Since Multi-Agent Systems (MAS) are composed of sets of (inter)acting autonomous and pro-active agents, they provide suitable concepts to the construction of self- organizing processes, promising robust and adaptive system behaviors. An examination of current software-engineering approaches to self-organizing MAS identified a lack of requirement engineering approaches, established in generalpurpose engineering methodologies. As self-organizing dynamics are typically utilized to enforce continuous MAS adjustment we discuss how expectations on MAS adaptivity can be expressed and validated, considering both the intended system configurations as well as the system dynamics that steer system (re)configuration. We argue that self-organizing MAS development typically intends recurring pattern of system dynamics and exemplify their specification and validation, transferring requirements engineering practices to self-organizing MAS development.
Optimized Schwarz Waveform Relaxation Methods for Advection Reaction Diffusion Problems
Authors: M. J. Gander, L. Halpern
Venue: SIAM Journal on Numerical Analysis (2007)

We study in this paper a new class of waveform relaxation algorithms for large systems of ordinary differential equations arising from discretizations of partial differential equations of advection reaction diffusion type. We show that the transmission conditions between the subsystems have a tremendous influence on the convergence speed of the waveform relaxation algorithms, and we identify transmission conditions with optimal performance. Since these optimal transmission conditions are expensive to use, we introduce a class of local transmission conditions of Robin type, which approximate the optimal ones and can be used at the same cost as the classical transmission conditions. We determine the transmission conditions in this class with the best performance of the associated waveform relaxation algorithm. We show that the new algorithm is well posed and converges much faster than the classical one. We illustrate our analysis with numerical experiments.
PIMS--Multispectral Image Processing Tool for Semantic Information Detection Based on Vegetation Indices
Authors: Cornelia Melenti, Daniel Safta, Dorian Gorgan
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

This paper approaches the opportunity of the use of medium and high spatial resolution satellite images for the study of the extent and structure of the vegetation cover for a certain geographic area. A computerized system for the classification of vegetation was created based on vegetation indices determined from various combinations of spectral bands from high resolution multispectral satellite images. The comparative study and analysis of vegetation indices in a given image, the acquirement of statistical data and their export to a database are reported.
Recent evolutions of GridICE: a monitoring tool for grid systems
Authors: Cristina Aiftimiei, Sergio Andreozzi, Guido Cuscela, Giacinto Donvito, Vihang Dudhalkar, Sergio Fantinel, Enrico Fattibene, Giorgio Maggi, Giuseppe Misurelli, Antonio Pierro
Venue: Proceedings of the 2007 workshop on Grid monitoring (2007)

Grid systems must provide its users with precise and reliableinformation about the status and usage of available resources. The efficient distribution of this information enables Virtual Organizations (VOs) to optimize the utilization strategies of theirresources and to complete the planned computations. In this paper, we describe the recent evolution of GridICE, a monitoring tool for Grid systems. Such evolutions are targeted at satisfying the requirements from the main categories of users: Grid operators, site administrators, Virtual Organization (VO) managers and Grid users.
Selective all-pole modeling of degraded speech using M-band decomposition
Authors: C. D. Yoo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes a speech enhancement system which exploits both time- and frequency-localized behavior. The local characteristics are obtained from stationary regions selected by M-band decomposition with an adaptive analysis window. The spectrum of each selected region is estimated with an all-pole model. In order to model only the spectral region of interest, selective linear prediction (SLP) is used. By modeling the local spectrum, either independently or dependently, with respect to other enhanced spectral regions, and adjusting the model order to the local characteristics, a balanced-tradeoff between noise reduction and speech distortion can be achieved.
Tomography with diffusing photons: a Feynman path integral perspective
Authors: J. C. Schotland
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We consider the problem of imaging the optical absorption or fluorescent source distribution of a highly-scattering medium probed by diffusive light. Analytic solutions to the tomographic image reconstruction problem are presented. 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
Value Webs in the Digital Economy
Authors: Helmut Krcmar, Kalle Lyytinen, Jan Marco Leimeister
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In its fourth year the minitrack on Value Webs again attracted several diverse and interesting submissions. Value Webs consist of networks of partners who collaborate within different stages of interlinked value chains enabled by ICT. They form a basis for establishing a new interdisciplinary research field. Diffusion of Internet, web services as well as deployment of mobile and pervasive technologies result in both industry wide and organizational transformations with far reaching micro- and macro economic effects. These transformations are triggered by pervasive ICT infrastructures, and new products and services that enable sustained product- and process-innovations. Examples of such innovations include Zero Latency Business, Mass Customisation, Enterprise Application Integration, Collaborative Supply Chain Management, Mobile Commerce, and Customer Integration in product development and distribution. Each one of them echoes deep changes that the Internet and Mobile Technologies are creating in that Internet and Mobile Technologies affect now all facets of production, distribution and usage of information goods and significantly transform development-, production- and distribution of physical goods.
An innovative top-down approach to teaching engineering courses
Authors: J. Hadjilogiou
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

An innovative top-down teaching approach has been used for the first time in the Fall 2000 with a freshman electrical/computer engineering class using web and advanced technologies, such as: Blackboard learning software, Power point, Bisquare logic, Xilinx software, Omnipage Web, and Dreamweaver. Through the use of these technologies, more material was covered with greater understanding, greater participation among students, and with a sense of ownership and pride. In addition, the local engineering companies made more offers to those students for part time employment. The "Logic and Computer Design Fundamentals" a traditional sophomore or junior year course, has been taught for the last 10 years as a freshman level course at Florida Tech. With a generous grant from the F.W. Olin foundation, it became possible in the Fall 2000, to integrate the above-mentioned technologies to the-top down approach developed by the author during the last ten years. 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
An oblivious robust digital watermark technique for still images using DCT phase modulation
Authors: F. Alturki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Digital watermarking is the process of secretly embedding a short sequence of information inside a digital source without changing its perceptual quality. We present a new oblivious digital watermarking method for copyright protection of still images. The technique is based on modifying the sign of a subset of low frequency DCT magnitude coefficients. The robustness to a number of standard image processing attacks is demonstrated using the criteria of the latest Stirmark test.
Three dimensional face recognition using two dimensional principal component analysis
Authors: Mehmet Celenk
Venue:  (2006)

This dissertation describes a face recognition system that overcomes the problem of changes in gesture and mimics in three-dimensional (3D) range images. Here, we propose a local variation detection and restoration method based on the two-dimensional (2D) principal component analysis (PCA). The depth map of a 3D facial image is first thresholded to discard the background information. The detected face shape is normalized to a standard image size of 100x100 pixels and the forefront nose point is selected to be the image center. Facial depth-values are scaled between 0 and 255 for translation and scaling-invariant identification. The preprocessed face image is smoothed to minimize the local variations. The 2DPCA is applied to the resultant range data and the corresponding principal- (or eigen-) images are used as the characteristic feature vectors of the subject to find his/her identity in the database of pre-recorded faces. The system's performance is tested against the GavabDB and Notre Dame University facial databases. Experimental results show that the proposed method is able to identify subjects with different gesture and mimics in the presence of noise in their 3D facial images.
Marauder's Map--Bringing People Together
Authors: Raja Bose, Hen-I Yang, Abdelsalam (Sumi) Helal
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Social Networking applications have gained immense popularity amongst students in the last few years. Unfortunately, all such services currently require internet connectivity which inhibits their usefulness when a person is on the move. In this paper we describe a mobile platform, Marauder's Map which enables social networking on the go, by allowing users to keep track of their friends and their activities in a peer to peer fashion using a novel human-based social network routing protocol.
Evolutionary Support Vector Regression Machines
Authors: Ruxandra Stoean, D. Dumitrescu, Mike Preuss, Catalin Stoean
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Evolutionary support vector machines (ESVMs) are a novel technique that assimilates the learning engine of the state-of-the-art support vector machines (SVMs) but evolves the coefficients of the decision function by means of evolutionary algorithms (EAs). The new method has accomplished the purpose for which it has been initially developed, that of a simpler alternative to the canonical SVM approach for solving the optimization component of training. ESVMs, as SVMs, are natural tools for primary application to classification. However, since the latter had been further on extended to also handle regression, it is the scope of this paper to present the corresponding evolutionary paradigm. In particular, we consider the hybridization with the classical \in-support vector regression (\in-SVR) introduced by Vapnik and the subsequent evolution of the coefficients of the regression hyperplane. \in-evolutionary support regression (\in-ESVR) is validated on the Boston housing benchmark problem and the obtained results demonstrate the promise of ESVMs also as concerns regression.
Improved Client-to-Client Password-Authenticated Key Exchange Protocol
Authors: Yao Gang, Feng Dengguo, Han Xiaoxi
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Password-authenticated key exchange protocols allow two entities who only share a human-memorable password to authenticate each other and agree on a large session key. Most password authenticated key exchange protocols provide an authenticated key exchange between a client and a server based on a pre-shared password. With the development of modern communication environments, it is necessary to design a secure authenticated key exchange between clients. In ICICS'02, Byun et al. presented a client to client password-authenticated key exchange protocol in a crossrealm setting. But the protocol is vulnerable to some attacks by an insider adversary or outsider adversary. In this paper, we present an improved protocol to solve the problem, and prove the improved protocol is secure against all types of attacks considered in the paper.
Towards semantically enhanced Web service repositories
Authors: Marta Sabou, Jeff Pan
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2007)

The success of the Web services technology has brought topics as software reuse and discovery once again on the agenda of software engineers. While there are several efforts towards automating Web service discovery and composition, many developers still search for services via online Web service repositories and then combine them manually. However, from our analysis of these online repositories, it yields that, unlike traditional software libraries, they rely on little metadata to support service discovery. We believe that the major cause is the difficulty of automatically deriving metadata that would describe rapidly changing Web service collections. In this paper, we discuss the major shortcomings of state of the art Web service repositories and as a solution, we report on ongoing work and ideas on how to use techniques developed in the context of the Semantic Web (ontology learning, matching, metadata based presentation) to improve the current situation.
Percentile optimization in uncertain Markov decision processes with application to efficient exploration
Authors: Erick Delage, Shie Mannor
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Markov decision processes are an effective tool in modeling decision-making in uncertain dynamic environments. Since the parameters of these models are typically estimated from data, learned from experience, or designed by hand, it is not surprising that the actual performance of a chosen strategy often significantly differs from the designer's initial expectations due to unavoidable model uncertainty. In this paper, we present a percentile criterion that captures the trade-off between optimistic and pessimistic points of view on MDP with parameter uncertainty. We describe tractable methods that take parameter uncertainty into account in the process of decision making. Finally, we propose a cost-effective exploration strategy when it is possible to invest (money, time or computation efforts) in actions that will reduce the uncertainty in the parameters.
Memory behavior of an X11 window system
Authors: J. Bradley Chen
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

We used memory reference traces from a DEC Ultrix system running the X11 window system from MIT Project Athena and several freely available X11 applications to measure different aspects of memory system behavior and performance. Our measurements show that memory behavior for X11 workloads differs in several important ways from workloads more traditionally used in cache performance studies. User instruction cache behavior is a major component in overall memory system delays, with significant competition within and between address spaces. User TLB miss rates are up to a factor of two higher than other ill-behaved integer workloads. Write-buffer stalls, data cache behavior, and uncached memory reads can be problematic for microbenchmarks, but they are not an issue for the realistic applications we tested.
Lower bounds in communication complexity based on factorization norms
Authors: Nati Linial, Adi Shraibman
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory. This approach gives us access toseveral powerful tools from this area such as normed spaces duality and Grothendiek's inequality. This extends the arsenal of methods for deriving lower bounds in communication complexity. As we show,our method subsumes most of the previously known general approaches to lower bounds on communication complexity. Moreover, we extend all (but one) of these lower bounds to the realm of quantum communication complexity with entanglement. Our results also shed some light on the question how much communication can be saved by using entanglement.It is known that entanglement can save one of every two qubits, and examples for which this is tight are also known. It follows from our results that this bound on the saving in communication is tight almost always.
Supporting Reliable Software Evolution through Program Analysis
Authors: Cathal Boogerd
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

This paper motivates the need for more research to ensure a consistent level of reliability in software systems. We briefly outline the relevant developments that drive this need, define the necessary concepts, and sketch the context of the proposed research. We then define the research space by introducing three research questions and mention some first ideas of so- lutions to the problems they represent. Finally, we discuss the progress made so far in more detail, and conclude with a description of validation approaches and expected contribu- tions.