ppxscal/embedding_network huggingface dataset:
Coordinating Linear and 2D Displays to Support Exploratory Search
Authors: Anselm Spoerri
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

Linear and 2D displays have complementary strengths and this paper illustrates how they can be used in concert to support users in the search process. Linear lists are the dominant way for presenting search results and users are most familiar with such result displays. However, ranked lists can only display a limited number of results, whereas 2D layouts can display many results. This paper illustrates how several tightly coupled displays and controls can help users to explore large result sets. Further, it shows how linear and 2D displays can be combined to enable users to see structural relationships between the search results, such as being related to the same topics, tags or being stored on the same web host.
Text Categorization for Multi-label Documents and Many Categories
Authors: I. Sandu Popa, K. Zeitouni, G. Gardarin, D. Nakache, E. Metais
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In this paper, we propose a new classification method that addresses classification in multiple categories of textual documents. We call it Matrix Regression (MR) due to its resemblance to regression in a high dimensional space. Experiences on a medical corpus of hospital records to be classified by ICD (International Classification of Diseases) code demonstrate the validity of the MR approach. We compared MR with three frequently used algorithms in text categorization that are k-Nearest Neighbors, Centroide and Support Vector Machine. The experimental results show that our method outperforms them in both precision and time of classification.
A statistical text-to-phone function using ngrams and rules
Authors: W. M. Fisher
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Adopting concepts from statistical language modeling and rule-based transformations can lead to effective and efficient text-to-phone (TTP) functions. We present here the methods and results of one such effort, resulting in a relatively compact and fast set of TTP rules that achieves 94.5% segmental phonemic accuracy.
POSIX: a developer's view of standards
Authors: Heiko Eißfeldt
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

First I give an introduction to the POSIX.1 set of standards. I am going to continue with an survey of POSIX.1, POSIX.1b and POSIX.1c. Standards as treated here are seen as an application programming interface (API), defined by some kind of protocol between application and system programming. In the following I am going to examine what functionality is provided and what is available under Linux. Mostly I take the perspective of an application programmer however sometimes some additional remarks on POSIX.1 certification issues are given. Included topics are POSIX.1, its extensions and a short review of XPG4 features.
Proceedings of the 24th international conference on Machine learning
Authors: Zoubin Ghahramani
Venue: ICML; Vol. 227 (2007)

This volume contains the papers accepted to the 24th International Conference on Machine Learning (ICML 2007), which was held at Oregon State University in Corvalis, Oregon, from June 20th to 24th, 2007. ICML is the annual conference of the International Machine Learning Society (IMLS), and provides a venue for the presentation and discussion of current research in the field of machine learning. These proceedings can also be found online at: http://www.machinelearning.org. This year there were 522 submissions to ICML. There was a very thorough review process, in which each paper was reviewed by three program committee (PC) members. Authors were able to respond to the initial reviews, and the PC members could then modify their reviews based on online discussions and the content of this author response. For the first time this year there were two discussion periods led by the senior program committee (SPC), one just before and one after the submission of author responses. At the end of the second discussion period, the SPC members gave their recommendations and provided a summary review for each of their papers. Also for the first time, authors were asked to submit a list of changes with their final accepted papers, which was checked by the SPCs to ensure that reviewer comments had been addressed. Apart from the length restrictions on papers and the compressed time frame, the review process for ICML resembles that of many journal publications. In total, 150 papers were accepted to ICML this year, including a very small number of papers which were initially conditionally accepted, yielding an overall acceptance rate of 29%. ICML attracts submissions from machine learning researchers around the globe. The 150 accepted papers this year were geographically distributed as follows: 66 papers had a first author from the US, 32 from Europe, 19 from China or Hong Kong, 11 from Canada, 6 from India, 5 each from Australia and Japan, 3 from Israel, and 1 each from Korea, Russia and Taiwan. In addition to the main program of accepted papers, which includes both a talk and poster presentation for each paper, the ICML program included 3 workshops and 8 tutorials on machine learning topics which are currently of broad interest. We were also extremely pleased to have David Heckerman (Microsoft Research), Joshua Tenenbaum (Massachussetts Institute of Technology), and Bernhard Sch&ouml;lkopf (Max Planck Institute for Biological Cybernetics) as the invited speakers this year. Thanks to sponsorship by the Machine Learning Journal, we were able to award a number of outstanding student paper prizes. We were fortunate this year that ICML was co-located with the International Conference on Inductive Logic Programming (ILP 2007). ICML and ILP held joint sessions on the first day of ICML 2007.
Design and development of sub-micron scale specimens with electroplated structures for the microtensile testing of thin films
Authors: Ming-Tzer Lin, Chi-Jia Tong, Chung-Hsun Chiang
Venue: Microsystem Technologies (2007)

A novel designed microtensile specimen with electroplated structures is described here. It can be fit into a specially designed microtensile apparatus, which is capable of carrying out a series of tests on sub-micron scale freestanding thin films. Several thin films for microelectromechanical systems (MEMS) applications has been tested here including sputtered copper, gold, gold-chrome and tantalum nitride. All the metal specimens were fabricated by sputtering. For the tantalum nitride film samples, nitrogen gas was introduced into the chamber during the process of sputtering tantalum films on the silicon wafer. We have used copper, gold, 5% gold-chrome alloys and tantalum nitride thin films with thickness of 200&#x2013;800&#x00a0;nm. The E values of the thin films tested here are consistent with the results from other measurement methods. The test results of metal specimens show the similar trend of the Hall-Petch prediction. However, the values of tantalum nitride thin films do not exhibit any systematic variation with respect to the thickness.
An Alternative Formulation for Five Point Relative Pose Problem
Authors: Dhruv Batra, Bart Nabbe, Martial Hebert
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

The "Five Point Relative Pose Problem" is to find all possible camera configurations between two calibrated views of a scene given five point-correspondences. We take a fresh look at this well-studied problem with an emphasis on the parametrization of Essential Matrices used by various methods over the years. Using one of these parametrizations, a novel algorithm is proposed, in which the solution to the problem is encoded in a system of nine quadratic equations in six variables, and is reached by formulating this as a constrained optimization problem. We compare our algorithm with an existing 5-point method, and show our formulation to be more robust in the presence of noise.
Hardware Support for Accelerating Data Movement in Server Platform
Authors: Li Zhao, Laxmi N. Bhuyan, Ravi Iyer, Srihari Makineni, Donald Newell
Venue: IEEE Transactions on Computers (2007)

Data movement (memory copies) is a very common operation during network processing and application execution on servers. The performance of this operation is rather poor on today's microprocessors due to the following aspects: 1) Several long-latency memory accesses are involved because the source and/or the destination are typically in memory, 2) latency hiding techniques, such as out-of-order execution, hardware threading, and prefetching, are not very effective for bulk data movement, and 3) microprocessors move data at register (small) granularity. In this paper, we show this overhead of bulk data movement and propose the use of dedicated copy engines to minimize it. We present a detailed analysis of copy engine architectures along two dimensions: 1) on-die versus off-die and 2) synchronous versus asynchronous. These copy engine architectures are superior to traditional Direct Memory Access (DMA) engines because they are tightly coupled to the core architecture and enable lower overhead communication and signaling. We describe the hardware support required to implement these copy engines and integrate them into server platforms. We perform a detailed case study to evaluate the performance of these copy engines. The evaluation is based on an execution-driven simulator, which was extended with detailed models of copy engines. Our simulation results show that copy engines are effective in reducing the bulk data movement overhead and, hence, hold significant promise for high-performance server platforms.
Interactive multimedia database resources
Authors: M. D. Valdes
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The article proposes an alternative solution to support electronic technology education. A methodology oriented to the development of hypermedia applications for the analysis of complex technologies is commented upon and new resources to improve such a methodology is presented. The objective is to obtain a sturdy educational system favoring the acquisition of theoretical and practical knowledge in an intuitive way.
Strategic Value of IS Integration in M&A--The Relation between IS Integration and M&A as a Tool for Corporate Strategy
Authors: Stefan Henningsson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

During the last decade research in the scientific domain of information systems (IS) in corporate mergers and acquisitions (M&As) has become increasingly popular. A not very surprising development regarding the significance of the empirical phenomenon of M&A and the importance of IS for modern business. However, the idea of IS playing an important role in M&As rests on assumptions, anecdotes from the business press and only very vague empirical evidence. By contrary, it has been demonstrated that IS do not always play an important part. In this article we argue that the absence of insight into the relation between IS and M&A hampers the development of the scientific field and distract business professionals. To overcome this lack of understanding, this article draws on traditional strategic theory, represented by the Porterian I/O-, RBV, and strategic process- perspectives, and examines how IS relates to M&A as an act of corporate strategy.
Parametric global optimisation for bilevel programming
Authors: Nuno P. Faísca, Vivek Dua, Berç Rustem, Pedro M. Saraiva, Efstratios N. Pistikopoulos
Venue: Journal of Global Optimization (2007)

We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed parametric programming algorithms. We first describe how we can recast and solve the inner (follower's) problem of the bilevel formulation as a multi-parametric programming problem, with parameters being the (unknown) variables of the outer (leader's) problem. By inserting the obtained rational reaction sets in the upper level problem the overall problem is transformed into a set of independent quadratic, linear or mixed integer linear programming problems, which can be solved to global optimality. In particular, we solve bilevel quadratic and bilevel mixed integer linear problems, with or without right-hand-side uncertainty. A number of examples are presented to illustrate the steps and details of the proposed global optimisation strategy.
Efficient prefix cache for network processors
Authors: M. J. Akhbarizadeh, M. Nourani
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Conventional routing cache systems store destination IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve a significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes are obtained using an incremental technique without any modifications to the routing table. Consequently, our cache works with most of the common route lookup algorithms and efficiently maintains coherency with the routing table. Experiments show that, for a hit ratio over 0.96, our design can achieve more than 33 times reduction in cache size, compared to a conventional routing cache.
A cross entropy algorithm for the Knapsack problem with setups
Authors: M. Caserta, E. Quiñonez Rico, A. Márquez Uribe
Venue: Computers and Operations Research (2008)

In this article we propose a new metaheuristic-based algorithm for the Integer Knapsack Problem with Setups. This problem is a generalization of the standard Integer Knapsack Problem, complicated by the presence of setup costs in the objective function as well as in the constraints. We propose a cross entropy based algorithm, where the metaheuristic scheme allows to relax the original problem to a series of well chosen standard Knapsack problems, solved through a dynamic programming algorithm. To increase the computational effectiveness of the proposed algorithm, we use a turnpike theorem, which sensibly reduces the number of iterations of the dynamic algorithm. Finally, to testify the robustness of the proposed scheme, we present extensive computational results. First, we illustrate the step-by-step behavior of the algorithm on a smaller, yet difficult, problem. Subsequently, to test the solution quality of the algorithm, we compare the results obtained on very large scale instances with the output of a branch and bound scheme. We conclude that the proposed algorithm is effective in terms of solution quality as well as computational time.
Limit Allocation: An Efficient Processor Management Scheme for Hypercubes
Authors: Chansu Yu, Chita R. Das
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Efficient task management in a hypercube multi-processor becomes difficult due to system overflow, where an incoming job cannot be allocated in spite of a sufficient number of free processors. Overflow occurs either due to the inability of recognizing a free subcube or due to external fragmentation. In this paper, we propose an allocation strategy that tries to scale down an incoming job size if it cannot fit into a fragmented hypercube. We call it limit allocation. We discuss three simple schemes, Limit-k, Greedy and Average. We conduct both analysis and simulation to characterize and compare various allocation policies. An M/M/m queueing model is developed to predict the behavior of buddy, free list and limit-k policies. The simulation study shows that the two adaptive schemes, greedy and average, outperform all other schemes reported so far in the literature.
FFT-based fast polynomial rooting
Authors: L. Hoteit
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A fast, accurate and robust approach is proposed for the computation of the roots of complex polynomials. The method is derived from the DFT-based differential cepstrum estimation for moving average signals. This minimum/maximum-phase polynomial factorisation is easily extended to a factorisation along an arbitrary circle. In an iterative fashion, we estimate the largest root modulus from the differential cepstrum, then factor out the associated root(s) from the polynomial. For band-limited signals with roots located along the unit circle, the polynomial origin is slightly perturbed prior to the application of the algorithm. On average, three fast Fourier transforms are required per polynomial root, offering a significant computational advantage in the root estimation of moderate to high order polynomials. 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
Emulating Reconfigurable Arrays for Image Processing Using the MasPar Architecture
Authors: Jose Salinas, Fabrizio Lombardi
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

This paper examines a fault tolerant scheme for two-dimensional arrays of processors which functionally reconfigures the array without the use of spares. Reconfiguration approaches for different interconnection networks are analyzed. Also, three approaches are proposed for mapping image data to and from the array, depending on the type of array and computational power available in each processing element. The proposed reconfiguration approaches have been emulated on a 32x64 processor MasPar array computer.
HomeRF(TM)/sup //SWAP: a wireless voice and data system for the home
Authors: J. Lansford
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The HomeRF Working Group is an industry association comprised of over 100 companies from the computer, telecommunications, and consumer electronics industries. This group has developed an open specification for a voice and data network for the home called the Shared Wireless Access Protocol, or SWAP. The SWAP specification for wireless voice and data networking within the home will enable a new class of mobile consumer devices that draw from the power and content of the Internet and the Home PC. If cable modems and xDSL represent the "last mile" access to the home, then HomeRF's mission with SWAP: could be called the "very last 150 feet" within and around the home. HomeRF has the broad backing of the major corporate stakeholders for networking within the home and is optimized specifically for the cost/performance point needed for consumers. The technology leverages the existing PC-industry infrastructure around the Internet, TCP/IP and Ethernet and adds a standard way to connect to the PSTN for voice telephony. First products should appear in early 2000 and future versions with enhanced features and/or higher data rates should follow by 1-2 years.
Capacity improvement of a hybrid CDMA/WDMA system by various bandwidth allocations
Authors: Po-Hao Chang, Wan-Chi Lin
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

We propose a hybrid CDMA/WDMA LAN architecture. The CDMA scheme is based upon spectral coding. For CDMA, the system performance will be improved greatly by increasing the code length so that it can accommodate more users. We calculate the system capacity under three types of code length, namely 128, 256, and 512. When the proportion of usable bandwidth that is allocated to CDMA users is decreased, the total number of users of hybrid system will decrease but the total bit rate will increase. 100 GHz and 50 GHz are used as the adjacent channel spacing of WDMA.
Towards Aspect-Oriented Programming for Context-Aware Systems: A Comparative Study
Authors: Francisco Dantas, Thais Batista, Nelio Cacho
Venue: Proceedings of the 1st International Workshop on Software Engineering for Pervasive Computing Applications, Systems, and Environments (2007)

Development of modular context-aware applications has been a deep challenge to software engineers. One of the main reasons is the crosscutting nature of certain context-awareness concerns. Specific distributed aspect-oriented programming (AOP) techniques have recently emerged as a promising candidate to address these shortcomings. This paper reports our ongoing effort on the definition of relevant criteria to perform a comparative analysis of five emerging AOP approaches for context-aware systems. We evaluate to what extent their specialized linguistic mechanisms scale to distributed systems, in particular context-aware mobile systems.
Passive measurement of one-way and two-way flow lifetimes
Authors: DongJin Lee, Nevil Brownlee
Venue: ACM SIGCOMM Computer Communication Review (2007)

Flow based analysis has been considered a simple and effective approach in network analysis. 5-tuple (unidirectional) flows are used in many network traffic, however, often these analyses require bidirectional packet matching to observe the interactions. Separating the flows into two categories as one-way (packets in one direction only) and two-way (packets in both directions) flows can yield further insight. We have examined traces of Auckland traffic for 2000, 2003 and 2006, and analyzed their one-way and two-way flows. We observed several behaviors and the changes in flow sizes and their lifetimes over time. In our traces, we observe that one-way flows are mostly malicious, re-transmissions, and some are long-lived. Two-way flows are mostly normal end-to-end transmissions with their lifetimes/RTTs decreasing, their sizes increasing, and many short-lived flows mostly depict errors in TCP. Also, we observe similarity between one-way and two-way flow sizes for their lifetimes.
Dynamic Task Scheduling and Processing Element Allocation for Multi-Function SoCs
Authors: Ya-Shu Chen, Chi-Sheng Shih, Tei-Wei Kuo
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

This work is motivated by the rapid increasing of the design complexity of many embedded systems. It aims at the proposing of solutions to resolve the hardware contention issues of non-preemptive processing elements shared among tasks and the cost optimization. A software solution based on the starting time management is proposed to interleave task executions on processing elements. Algorithms are proposed to determine the required processing elements of selected types, when there is no knowledge on the releasing time of any task: When task release orders are known a priori, an optimal algorithm is presented if processing elements have the same cost; otherwise, a pseudo-polynomial-time algorithm based on dynamic programming is presented for optimal solutions. The performance of the algorithms is also evaluated for general cases.