ppxscal/embedding_network huggingface dataset:
Generation of F/sub 0/ contours using a model-constrained data-driven method
Authors: A. Sakurai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Introduces a model-constrained, data-driven method for generating fundamental frequency contours in Japanese text-to-speech synthesis. In the training phase, the parameters of a command-response F/sub 0/ contour generation model are learned by a prediction module, which can be a neural network or a set of binary regression trees. The input features consist of linguistic information related to accentual phrases that can be automatically derived from text, such as the position of the accentual phrase in the utterance, number of morae, accent type, and parts-of-speech. In the synthesis phase, the prediction module is used to generate appropriate values of model parameters. The use of the parametric model restricts the degrees of freedom of the problem, facilitating data-driven learning. Experimental results show that the method makes it possible to generate quite natural F/sub 0/ contours with a relatively small training database.
Modeling Subsurface Phenomena for Tetrahedral Meshes
Authors: Barry C. White, Owen J. Eslinger
Venue: Proceedings of the HPCMP Users Group Conference (2006)

SceneGen is a set of tools for creating a subsurface mesh with very little human interaction. The tool set created allows the user to incorporate structured lattice data, typically generated from geo-statistical packages, and make a smoothed boundary representation (b-rep) for each of its material regions. Tools have also been created to take ground surface height-field data and create b-reps for Boolean combination with the geostatistical information. Constructive solid geometry (CSG) techniques are being developed to add subsurface items such as rocks and debris and incorporate them into the model as well. This subsurface system of material boundary regions is then capable of being meshed for finite element simulations. In this way, multiple unstructured tetrahedral meshes may be simultaneously generated on high performance computers.
Consumers' Interest in Personalized Recommendations: The Role of Product-Involvement and Opinion Seeking
Authors: Nicolas Knotzer, Maria Madlberger
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The best recommender system is useless if consumers are not interested in its recommendations. Hence it is vital for e-commerce operators who apply recommender systems to get insights into the drivers of interest in personalized recommendations. This paper combines IS research and marketing research as it applies the theory of opinion seeking in order to investigate the influence of product involvement and opinion seeking on the interest of consumers in getting suggestions and reviews by recommender systems. The findings indicate that product involvement shows a considerable impact on opinion seeking tendency. Furthermore, opinion seeking tendency shows a significant influence on interest in receiving other users' product reviews and personalized recommendations. The results imply that different kinds of output data of a recommender system supplement each other. Furthermore, as opinion seeking tendency is related to the product category, recommender systems are faced with varying target groups, depending on the product offerings.
Some Challenges in Integrating Information on Protein Interactions and a Partial Solution
Authors: H. V. Jagadish
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Independently constructed sources of (scientific) data frequently have overlapping, and sometimes contradictory, information content. Current methods of use fall into two categories: force the integration step onto the user, or merely collate the data, at most transforming it into a common format. The first method places an undue burden on the user to fit all of the jigsaw puzzle pieces together. The second leads to redundancy and possible inconsistency. We propose a third: deep data integration. The idea is to provide a cohesive view of all information currently available for a protein, interaction, or other object of scientific interest. Doing so requires that multiple pieces of data about the object, in different sources, first be identified as referring to the same object, if required through "third party" information; then that a single "record" be created comprising the union of the information in multiple matched records, keeping track of differences where these occur; and finally by tracking the provenance of every value in the dataset so scientists can judge what items to use, and how to resolve differences.
Detecting backdoors
Authors: Yin Zhang, Vern Paxson
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

Backdoors are often installed by attackers who have compromised a system to ease their subsequent return to the system. We consider the problem of identifying a large class of backdoors, namely those providing interactive access on non-standard ports, by passively monitoring a site's Internet access link. We develop a general algorithm for detecting interactive traffic based on packet size and timing characteristics, and a set of protocol-specific algorithms that look for signatures distinctive to particular protocols. We evaluate the algorithms on large Internet access traces and find that they perform quite well. In addition, some of the algorithms are amenable to prefiltering using a stateless packet filter, which yields a major performance increase at little or no loss of accuracy. However, the success of the algorithms is tempered by the discovery that large sites have many users who routinely access what are in fact benign backdoors, such as servers running on non-standard ports not to hide, but for mundane administrative reasons. Hence, backdoor detection also requires a significant policy component for separating allowable backdoor access from surreptitious access.
Dynamics-based analysis and synthesis of human locomotion
Authors: Nicolas Pronost, Georges Dumont
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

One of the best ways to synthesize realistic human motions is to animate characters from captured motion data that inherently respect motion laws. Retargeting and interpolation methods are often used to adapt these motions to different representations of the character and to various environmental constraints but they may introduce physical inaccuracies, although the synthesized motions are natural looking. This paper presents a method for evaluating the physical correctness of retargeted and interpolated locomotions using an inverse dynamics analysis. Furthermore, we propose to improve an initial database with analysed motions that are synthesized again by using a forward dynamics approach. The analysis algorithm consists in determining the resulting forces and torques at joints. With this intention, we develop an automatic creation process of the mass/inertia model of the character. Then using support phase recognition, we compute resulting forces and torques by an inverse dynamics method. The retargeting and the interpolation methods change the physics of the motions. This change is evaluated by using the results of our analysis on artificial and real motions and by using literature results and experimental data from force plates. The evaluation relies on the study of several retargeting and interpolation parameters such as the global size of the character or the structure of the model. The output of this evaluation, the resulting forces and torques at joints, are used to produce physically valid motions by using forward dynamics simulation. With this purpose, we introduce forces and torques normalizations, and finally the synthesized motions may improve the initial database.
An empirical approach to modeling inter-AS traffic matrices
Authors: Hyunseok Chang, Sugih Jamin, Z. Morley Mao, Walter Willinger
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Recently developed techniques have been very successful in accurately estimating intra-Autonomous System (AS) traffic matrices. These techniques rely on link measurements, flow measurements, or routing-related data to infer traffic demand between every pair of ingress-egress points of an AS. They also illustrate an inherent mismatch between data needed (e.g., ingress-egress demand) and data most readily available (e.g., link measurements). This mismatch is exacerbated when we try to estimate inter-AS traffic matrices, i.e., snapshots of Internet-wide traffic behavior over coarse time scale (a week or longer) between ASs. We present a method for modeling inter-AS traffic demand that relies exclusively on publicly available/obtainable measurements. We first perform extensive Internet-wide measurement experiments to infer the "business rationale" of individual ASs. We then use these business profiles to characterize individual ASs, classifying them by their "utility" into ASs providing Web hosting, residential access, and business access. We rank ASs by their utilities which drive our gravity-model based approach for generating inter-AS traffic demand. In a first attempt to validate our methodology, we test our inter-AS traffic generation method on an inferred Internet AS graph and present some preliminary findings about the resulting inter-AS traffic matrices.
Time Convex Hull with a Highway
Authors: Teng-Kai Yu, D. T. Lee
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed to be much slower than that along the highway. The shortest time path between two arbitrary points is either the straight-line segment connecting these two points or a path that passes through the highway. The time convex hull, CH_t(P), of a set P of n points is the smallest set containing P such that all the shortest time paths between any two points lie in CH_t(P). In this paper we give a \Theta(n log n) time algorithm for solving the time convex hull problem for a set of n points in the presence of a highway.
Multiclass core vector machine
Authors: S. Asharaf, M. Narasimha Murty, S. K. Shevade
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Even though several techniques have been proposed in the literature for achieving multiclass classification using Support Vector Machine(SVM), the scalability aspect of these approaches to handle large data sets still needs much of exploration. Core Vector Machine(CVM) is a technique for scaling up a two class SVM to handle large data sets. In this paper we propose a Multiclass Core Vector Machine(MCVM). Here we formulate the multiclass SVM problem as a Quadratic Programming(QP) problem defining an SVM with vector valued output. This QP problem is then solved using the CVM technique to achieve scalability to handle large data sets. Experiments done with several large synthetic and real world data sets show that the proposed MCVM technique gives good generalization performance as that of SVM at a much lesser computational expense. Further, it is observed that MCVM scales well with the size of the data set.
TkPerl: a port of the Tk toolkit to perl5
Authors: Malcolm Beattie
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

TkPerl is a port (work in progress) of the Tk toolkit to Perl5. It takes advantage of Perl5's object oriented features and magic variables to implement the Tk toolkit in Perl5. Nothing passes through the Tcl parser so knowledge of Tcl syntax is not required to use TkPerl. TkPerl is freeware (distributed under the GNU General Public License) and is currently in alpha testing. Section 1 of the paper introduces TkPerl and is followed by a brief section on its target uses. Since TkPerl relies heavily on the object oriented features of Perl5 (which is itself only just into beta test), section 3 explains how Perl5 implements classes, objects and methods. Section 4 discusses the differences between Tk/Tcl and TkPerl both at scripting level and at C level. Section 5 looks at some of the porting issues and problems and how Tcl conventions affect the design of Tk itself. Section 6 explains the current intentions for the future of TkPerl and section 7 gives availability information.
Architecting a course for engineering design, critical inquiry, and creativity
Authors: S. Ghosh
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper describes an experimental architecture for "ECE 300:Intermediate design," a required junior- and senior-level course for all branches of engineering within the college of engineering and applied sciences, at ASU. ECE 300 is designated a "L1" course whose central objective is to induce critical inquiry. The course has been found to be highly successful, the evidence being the exceptional quality of the final projects, most of which are potentially patentable, unique and innovative answers to real-world design challenges in midterm and final exams, and the undeniably strong feelings of accomplishment reported by the students through anonymous feedback. 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
eTVRA, a Threat, Vulnerability and Risk Assessment Method and Tool for eEurope
Authors: Judith E. Y. Rossebo, Scott Cadzow, Paul Sijben
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The telecommunications environment is evolving into Next Generation Networks (NGN). On an NGN, telecommunications services are recreated on IP networks, this creates a demand on standardization bodies to adapt and meet the needs of these emerging networks. Securing the service environment for eBusiness and the underlying network are crucial areas cited in the eEurope action plan [1]. Standardization provides an important means for securing the NGN and establishing trust in its services and infrastructure in order to enable the development of modern public services. In response to this, we have developed a threat, vulnerability and risk assessment (eTVRA) method and tool for use in standardisation. Using the eTVRA method and tool, the threats to NGNs can be analyzed and a set of recommended countermeasures identified that when implemented will reduce the overall risk to users of NGNs. In this paper we present the eTVRA method and tool along with the results of its application to the use of Enhanced Number (ENUM) [2] and SIP [17] in the NGN.
Availability of multi-object operations
Authors: Haifeng Yu, Phillip B. Gibbons, Suman Nath
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Highly-available distributed storage systems are commonly designed to optimize the availability of individual data objects, despite the fact that user level tasks typically request multiple objects. In this paper, we show that the assignment of object replicas (or fragments, in the case of erasure coding) to machines plays a dramatic role in the availability of such multi-object operations, without affecting the availability of individual objects. For example, for the TPC-H benchmark under real-world failures, we observe differences of up to four nines between popular assignments used in existing systems. Experiments using our wide-area storage system prototype, MOAT, on the PlanetLab, as well as extensive simulations, show which assignments lead to the highest availability for a given setting.
Secure Implementations for Typed Session Abstractions
Authors: Ricardo Corin, Pierre-Malo Denielou, Cedric Fournet, Karthikeyan Bhargavan, James Leifer
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Distributed applications can be structured as parties that exchange messages according to some pre-arranged communication patterns. These sessions (or contracts, or protocols) simplify distributed programming: when coding a role for a given session, each party just has to follow the intended message flow, under the assumption that the other parties are also compliant. In an adversarial setting, remote parties may not be trusted to play their role. Hence, defensive implementations also have to monitor one another, in order to detect any deviation from the assigned roles of a session. This task involves low-level coding below session abstractions, thus giving up most of their benefits. We explore language-based support for sessions. We extend the ML language with session types that express flows of messages between roles, such that well-typed programs always play their roles. We compile session type declarations to cryptographic communication protocols that can shield programs from any low-level attempt by coalitions of remote peers to deviate from their roles. Our main result is that, when reasoning about programs that use our session implementation, one can safely assume that all session peers comply with their roles--without trusting their remote implementations.
Testing UML designs
Authors: Orest Pilskalns, Anneliese Andrews, Andrew Knight, Sudipto Ghosh, Robert France
Venue: Information and Software Technology (2007)

Early detection and correction of faults in the software design phase can reduce total cost and time to market of a software product. In this paper we describe an approach for testing UML design models to uncover inconsistencies. Our approach uses behavioral views such as Sequence Diagrams to simulate state change in an aggregate model. The aggregate model is the artifact of merging information from behavioral and structural UML views. OCL pre-conditions, post-conditions and invariants are used as a test oracle.
Extraction of flat and nested data records from web pages
Authors: Siddu P. Algur, P. S. Hiremath
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

This paper deals with studies the problem of identification and extraction of flat and nested data records from a given web page. With the explosive growth of information sources available on the World Wide Web, it has become increasingly difficult to identify the relevant pieces of information, since web pages are often cluttered with irrelevant content like advertisements, navigation-panels, copyright notices etc., surrounding the main content of the web page. Hence, it is useful to mine such data regions and data records in order to extract information from such web pages to provide value-added services. Currently available automatic techniques to mine data regions and data records from web pages are still unsatisfactory because of their poor performance. In this paper, we propose a new method to identify and extract the data records from the web pages automatically. Given a page, the proposed technique first identifies the data region based on the visual clue information. It then extracts each record from the data region and identifies it whether it is a flat or nested record based on visual information -- the area covered by and the number of data items present in each record. The experimental results show that the proposed technique is effective and better than existing techniques.
A class of coordinate descent methods for multiuser detection
Authors: J. Luo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A class of coordinate descent methods is proposed for the joint detection of binary symbols of K users in a synchronous correlated waveform multiple-access (CWMA) channel with Gaussian noise. We consider the detection problem as one of optimizing a quadratic objective function with binary constraints on decision variables. The proposed coordinate descent methods, while still maintaining a low computational complexity, are shown to provide as much as two orders of magnitude improvement in the probability of error, especially in situations where the existing methods do not perform well. The paper concludes with a discussion of how the proposed methods can be further improved.
Subband-domain filtering of MPEG audio signals
Authors: C. A. Lanciani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The cosine modulated filter bank is commonly used for the time-frequency decomposition of audio signals. For example, it is a basic element of the MPEG-1 and MPEG-2 audio coding standards. While this filter bank is not perfectly-reconstructing, it does provide for the cancelation of aliasing components that are introduced during the analysis decomposition. If the subband signals are to be processed, care must be taken to preserve the properties of the subband signals such that the aliased terms will be canceled successfully in the synthesis filter bank despite the modification of the subband signals. In this paper, a framework is provided for the generation and application of arbitrary FIR filters to signals that have been decomposed using the MPEG filter bank.
Speaker recognition with a MLP classifier and LPCC codebook
Authors: D. Rodriguez-Porcheron
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper improves the speaker recognition rates of a MLP classifier and LPCC codebook alone, using a linear combination between both methods. In simulations we have obtained an improvement of 4.7% over a LPCC codebook of 32 vectors and 1.5% for a codebook of 128 vectors (error rate drops from 3.68% to 2.1%). Also we propose an efficient algorithm that reduces the computational complexity of the LPCC-VQ system by a factor of 4.
Examining the Relationship between IT Governance Software and Business Value of IT: Evidence from Four Case Studies
Authors: Hauke Heier, Hans P. Borgman, Mervyn g. Maistry
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

What is the impact of information technology (IT) governance software on IT governance processes and through that on realizing business value from IT? This question has recently gained importance, as IT budgets continue to be under pressure, as IT governance is high on the corporate agenda, and as software applications have become available that promise to enforce and streamline IT governance processes. This article examines the underlying conceptual foundations, develops a comprehensive research framework that is subsequently applied using a multiple case design, and concludes with insights from four international implementation sites. The results indicate a positive impact on IT-related business value outcomes in three areas: portfolio management optimization, project visibility and control, and IT services efficiency.