ppxscal/embedding_network huggingface dataset:
Guest Editors' Introduction: Hot Interconnects 12
Authors: James P. G. Sterbenz, Dimitrios Stiliadis
Venue: IEEE Micro (2005)

Hot Interconnects is an annual conference that specializes in state-of-the-art hardware and software architectures, and implementations of interconnection networks of all scales, ranging from on-chip, processor-memory interconnects to wide-area networks. It is the event where the high-performance computing and high-speed networking communities meet, and has a wide attendance both from industry and academia. Hot Interconnects 12 convened from 25 to 27 August 2004 at Stanford University; it included two days of paper sessions and one day of tutorials. Sponsored by the IEEE Computer Society Technical Committee on Microprocessors and Microcomputers, Hot Interconnects also has technical cosponsorship from the IEEE Communications Society Technical Committees on High-Speed Networking and Communications Switching and Routing.
Transforming an Operational System Model to a Data Warehouse Model: A Survey of Techniques
Authors: Dov Dori, Roman Feldman, Arnon Sturm
Venue: Proceedings of the IEEE International Conference on Software - Science, Technology & Engineering (2005)

Data warehouse modeling is a complicated task, which involves both knowledge of business processes, as well as familiarity with operational information systems structure and behavior. Several modeling techniques were suggested to utilize the operational system structural or behavioral model in order to construct a data warehouse conceptual model. In this paper, we survey these techniques and analyze their capabilities using a feature-based comparison method. Our analysis clearly indicates that the various techniques are limited in their applicability to model large-scale systems, as they require acquaintance with the business processes and ability to select relevant transactional entities. These techniques also require multiple manual actions, since discovering measures and relevant dimensional entities are unassisted, and usually disregard the process perspective. Our analysis points out the need for improving the surveyed techniques.
A comparison of parsing technologies for the biomedical domain
Authors: Claire Grover, Alex Lascarides, Mirella Lapata
Venue: Natural Language Engineering (2005)

This paper reports on a number of experiments which are designed to investigate the extent to which current NLP resources are able to syntactically and semantically analyse biomedical text. We address two tasks: (a) parsing a real corpus with a hand-built wide-coverage grammar, producing both syntactic analyses and logical forms and (b) automatically computing the interpretation of compound nouns where the head is a nominalisation (e.g. hospital arrival means an arrival at hospital, while patient arrival means an arrival of a patient). For the former task we demonstrate that flexible and yet constrained pre-processing techniques are crucial to success: these enable us to use part-of-speech tags to overcome inadequate lexical coverage, and to package up complex technical expressions prior to parsing so that they are blocked from creating misleading amounts of syntactic complexity. We argue that the XML-processing paradigm is ideally suited for automatically preparing the corpus for parsing. For the latter task, we compute interpretations of the compounds by exploiting surface cues and meaning paraphrases, which in turn are extracted from the parsed corpus. This provides an empirical setting in which we can compare the utility of a comparatively deep parser vs. a shallow one, exploring the trade-off between resolving attachment ambiguities on the one hand and generating errors in the parses on the other. We demonstrate that a model of the meaning of compound nominalisations is achievable with the aid of current broad-coverage parsers.
Numerical valuation of options with jumps in the underlying
Authors: Ariel Almendral, Cornelis W. Oosterlee
Venue: Applied Numerical Mathematics (2005)

A jump-diffusion model for a single-asset market is considered. Under this assumption the value of a European contingency claim satisfies a general partial integro-differential equation (PIDE). The equation is localized and discretized in space using finite differences and finite elements and in time by the second order backward differentiation formula (BDF2). The resulting system is solved by an iterative method based on a simple splitting of the matrix. Using the fast Fourier transform, the amount of work per iteration may be reduced to O(n log2 n) and only O(n) entries need to be stored for each time level. Numerical results showing the quadratic convergence of the methods are given for Merton's model and Kou's model.
Combining unsupervised and supervised methods for PP attachment disambiguation
Authors: Martin Volk
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

Statistical methods for PP attachment fall into two classes according to the training material used: first, unsupervised methods trained on raw text corpora and second, supervised methods trained on manually disambiguated examples. Usually supervised methods win over unsupervised methods with regard to attachment accuracy. But what if only small sets of manually disambiguated material are available? We show that in this case it is advantageous to intertwine unsupervised and supervised methods into one disambiguation algorithm that outperforms both methods used alone.
Using automatically learnt verb selectional preferences for classification of biomedical terms
Authors: Irena Spasić, Sophia Ananiadou
Venue: Journal of Biomedical Informatics (2004)

In this paper, we present an approach to term classification based on verb selectional patterns (VSPs), where such a pattern is defined as a set of semantic classes that could be used in combination with a given domain-specific verb. VSPs have been automatically learnt based on the information found in a corpus and an ontology in the biomedical domain. Prior to the learning phase, the corpus is terminologically processed: term recognition is performed by both looking up the dictionary of terms listed in the ontology and applying the C/NC-value method for on-the-fly term extraction. Subsequently, domain-specific verbs are automatically identified in the corpus based on the frequency of occurrence and the frequency of their co-occurrence with terms. VSPs are then learnt automatically for these verbs. Two machine learning approaches are presented. The first approach has been implemented as an iterative generalisation procedure based on a partial order relation induced by the domain-specific ontology. The second approach exploits the idea of genetic algorithms. Once the VSPs are acquired, they can be used to classify newly recognised terms co-occurring with domain-specific verbs. Given a term, the most frequently co-occurring domain-specific verb is selected. Its VSP is used to constrain the search space by focusing on potential classes of the given term. A nearest-neighbour approach is then applied to select a class from the constrained space of candidate classes. The most similar candidate class is predicted for the given term. The similarity measure used for this purpose combines contextual, lexical, and syntactic properties of terms.
Nonlinear principal component analysis by learning nerve fields united by inhibitory connections
Authors: Jun Shirakura, Koji Kurata
Venue: Systems and Computers in Japan (2004)

The authors propose a model with feedforward and a recurrent self-organizing maps model which can extract nonlinear principal components. This model consists of several learning nerve fields that are mutually inhibiting each other, and is an extension of the self-organizing overlapping maps model proposed previously by the authors. The feedforward model is sufficient for nonlinear principal component analysis, but the recurrent model with symmetrical inhibitory connections between nerve fields has additional interesting characteristics. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(3): 68&ndash;78, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.1230
Improving the memory management performance of RTSJ: Research Articles
Authors: M. Teresa Higuera-Toledano, Valérie Issarny
Venue: Concurrency and Computation: Practice Experience (2005)

From a real-time perspective, the garbage collector (GC) introduces unpredictable pauses that are not tolerated by real-time tasks. Real-time collectors eliminate this problem but introduce a high overhead. Another approach is to use memory regions (MRs) within which allocation and deallocation is customized. This facility is supported by the memory model of the Real-Time Specification for Java (RTSJ). RTSJ imposes strict access and assignment rules to avoid both the dangling inter-region references and the delays of critical tasks of the GC. A dynamic check solution can incur high overhead, which can be reduced by taking advantage of hardware features. This paper provides an in-depth analytical investigation of the overhead introduced by dynamic assignments checks in RTSJ, describing and analysing several solutions to reduce the introduced overhead. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Testing system "archimedes" for local or remote assessment of student's knowledge
Authors: Borislave Slavov, Todor Dimov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The testing system "Archimedes" is designed for assessment of student's knowledge in whatever discipline of university curriculum. The determination of the field's discipline is given by generating of suitable database, containing questions and answers for the curriculum material. The dialog between the system and the tested student is clear and precludes any difficulties (misunderstandings). The system use allows the tested studying material and the visual environment both to be introduced in Latin alphabet (English) or in Cyrillic alphabet (Bulgarian). The system can be downloaded through the Internet by the customers, who want to check the level of their knowledge in certain subject. The system is based on the University server and its downloading could be done from the department of Programming and computer system applications - "PIIS". The tested student carries out the test by himself, using the computer system connected with internet and via e-mail returns the result as file. The tested student doesn't have the possibility neither to change the content of the database, nor to check and alter the test results. The subject tutor checks the students tests with the system and publishes in the department site the test results. The system gives the opportunity of group test in computer rooms with flock of students in different disciplines. The test results can be transferred through local network in the respective folder "Test N" in the computer of the tutor who tests the students. Using the system by the customers doesn't require any special hardware and software resources. Fairly enough is presence of computer system with operating system Windows 95+.
Channel Sounding of Industrial Sites in the 2.4 GHz ISM band
Authors: Andrew H. Kemp, Edmund B. Bryant
Venue: Wireless Personal Communications: An International Journal (2004)

The results of channel soundings taken on a selection of six different industrial sites are presented. These results focus on the RMS delay spreads calculated from the channel soundings and the distribution of these results for each site. The distribution of RMS delay spread values is analysed and forms the basis of a statistical description of the multipath propagation on the tested sites. In particular the distribution is used to define the expected propagation delay across the site. The relation between the RMS delay spread and the irreducible-BER is discussed and this is used to link the distribution of RMS delay spread values to bit error rate performance on industrial sites. It is seen that the environment surrounding sites is significant.
An Attentional Framework for Stereo Vision
Authors: Neil D. B. Bruce, John K. Tsotsos
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

The necessity and utility of visual attention are discussed in the context of stereo vision in machines and primates. Specific problems that arise in this domain including binocular rivalry, and the deployment of attention in three-dimensional space are considered. Necessary conditions are outlined for achieving appropriate attentional behaviour in both the aforementioned domains. In this light, we outline classes of existing computational models of attention and discuss their applicability for realizing binocular attention. Finally, a stereo attention framework is presented by considering the tenets of an existing attentional architecture that extends naturally to the binocular domain, in conjunction with the connectivity of units involved in achieving stereo vision.
Digital Sports Photography
Authors: G. Newman Lowrance
Venue:  (2005)

Coverage includes- G. NEWMAN LOWRANCE has been a photographer for more than 16 years, with a major emphasis in sports. His images have appeared in ESPN The Magazine; Sports Illustrated; Sports Illustrated for Kids; Official NFL Super Bowl and Pro Bowl game magazines; NFL videos and team calendars; NFL Insider magazine; The New York Times Magazine; various covers and interior photographs for Street & Smith's sports annuals; Athlon Sports annuals; ATS Consultants annuals; Human Kinetics publications; DK publications; and Scholastic Inc. His photos have also appeared for various commercial uses such as DirecTV; USA Today; Sports Weekly; Time Warner, Inc.; and Reebok, Inc. Geared toward beginning to intermediate photographers, this book provides basic techniques, industry secrets, and expert advice on sports photography. Offers unique insight from an NFL editor on what editors look for in sports photography. Gives true, autobiographical examples of how to get started and succeed as a sports photography professional. Features fantastic, eye-catching sports action photographs that will generate excitement and inspiration. Provides information on the latest digital technology and how it has benefited the sports photography industry.
Wideband communication characteristics of subway stations with and without trains: Research Articles
Authors: Chien-Ching Chiu, Ting-Chieh Tu, Chien-Hung Lin
Venue: Wireless Communications Mobile Computing (2005)

The bit error rate (BER) performance for high-speed personal communication service in subway station with and without trains is investigated. The impulse responses of subway stations for any transmitter&ndash;receiver location are computed by shooting and bouncing ray&#x002F;image techniques. By using the impulse responses of these multipath channels, the BER performance of binary phase shift keying (BPSK) with orthogonal frequency division multiplexing (OFDM) system are calculated. Numerical results have shown that the multipath effect by the trains in the subway stations is an important factor for BER performance. In addition, the effect of space diversity techniques and polarization diversity techniques as well as sectored antenna on mitigating the multipath fading is also investigated. Finally, it is worth noting that in these cases the present work provides not only comparative information but also quantitative information on the performance reduction. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An exact algorithm for the channel assignment problem
Authors: Daniel Král'
Venue: Discrete Applied Mathematics (2005)

A channel assignment problem is a triple (V, E, w) where V is a vertex set, E is an edge set and w is a function assigning edges positive integer weights. An assignment c of integers between 1 and K to the vertices is proper if |c(u) - c(v)| ≥ w(uv) for each uv ∈ E; the smallest K for which there is a proper assignment is called the span. The input problem is set to be l-bounded if the values of w do not exceed l. We present an algorithm running in time O(n(l + 2)n) which outputs the span for l-bounded channel assignment problems with n vertices. An algorithm running in time O(nl(l + 2)n) for computing the number of different proper assignments of span at most K is further presented.
Differential Games with Ergodic Payoff
Authors: Mrinal K. Ghosh, K. S. Mallikarjuna Rao
Venue: SIAM Journal on Control and Optimization (2005)

We address a zero-sum differential game with ergodic payoff. We study this problem via the viscosity solutions of an associated Hamilton--Jacobi--Isaacs equation. Under certain condition, we establish the existence of a value and prove certain representation formulae.
Maximum Split Clustering Under Connectivity Constraints
Authors: Pierre Hansen, Brigitte Jaumard, Christophe Meyer, Bruno Simeone, Valeria Doring
Venue: Journal of Classification (2003)

Consider N entities to be classified (e.g., geographical areas), a matrix of dissimilarities between pairs of entities, a graph H with vertices associated with these entities such that the edges join the vertices corresponding to contiguous entities. The split of a cluster is the smallest dissimilarity between an entity of this cluster and an entity outside of it. The single-linkage algorithm (ignoring contiguity between entities) provides partitions into M clusters for which the smallest split of the clusters, called split of the partition, is maximum. We study here the partitioning of the set of entities into M connected clusters for all M between N - 1 and 2 (i.e., clusters such that the subgraphs of H induced by their corresponding sets of entities are connected) with maximum split subject to that condition. We first provide an exact algorithm with a ¿ (N2) complexity for the particular case in which H is a tree. This algorithm suggests in turn a first heuristic algorithm for the general problem. Several variants of this heuristic are Also explored. We then present an exact algorithm for the general case based on iterative determination of cocycles of subtrees and on the solution of auxiliary set covering problems. As solution of the latter problems is time-consuming for large instances, we provide another heuristic in which the auxiliary set covering problems are solved approximately. Computational results obtained with the exact and heuristic algorithms are presented on test problems from the literature.
Experiences with Soft-Core Processor Design
Authors: Franjo Plavec, Blair Fort, Zvonko G. Vranesic, Stephen D. Brown
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Soft-core processors exploit the flexibility of Field Programmable Gate Arrays (FPGAs) to allow a system designer to customize the processor to the needs of a target application. This paper describes the UT Nios implementation of Altera's Nios architecture. A benchmark set appropriate for soft-core processors is defined. Using the benchmark set, the performance of UT Nios is explored and compared with the commercial implementation.
Mobile devices: soft keyboard text-entry enhanced by Visual Cues
Authors: Laurent Magnien, Jean Leon Bouraoui, Nadine Vigouroux
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

Soft keyboards usually depict a minimal representation of standard desk keyboard. To optimize these devices, some researchers have proposed non-standard keyboard layouts (letters arrangement of the keys). This would theortically allow to reach greater performances. However these soft keyboards do not meet a wide audience. A probable explanation is the difficulty to become familiar with an unknown layout. In order to facilitate this process, we propose to use visual clues: keys likely to be selected are predicted and highlighted. Hence the user has to scan less key to enter a character. We start to evaluate this method through a user study, by designing a situation where subject is systematically faced with a novel layout. First results suggest that visual clues improve text entry rate on unknown soft keyboard layouts. Hence, according to the letter prediction system, visual clues could be used to improve immediate user satisfaction with optimized soft keyboard, contributing to enlarge their audience.
Fq-linear cyclic codes over Fqm: DFT approach
Authors: Bikash Kumar Dey, B. Sundar Rajan
Venue: Designs, Codes and Cryptography (2005)

Codes over Fqm that are closed under addition, and multiplication with elements from Fq are called Fq-linear codes over Fqm. For m ≠ 1, this class of codes is a subclass of nonlinear codes. Among Fq-linear codes, we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm. The class of FqLC codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes (n = qm - 1) studied by Hattori, McEliece and Solomon, (iii) linear cyclic codes over Fq (m = 1) and (iv) twisted BCH codes. Moreover, with respect to any particular Fq-basis of Fqm, any FqLC code over Fqm can be viewed as an m-quasi-cyclic code of length mn over Fq. In this correspondence, we obtain transform domain characterization of FqLC codes, using Discrete Fourier Transform (DFT) over an extension field of Fqm. The characterization is in terms of any decomposition of the code into certain subcodes and linearized polynomials over Fqm. We show how one can use this transform domain characterization to obtain a minimum distance bound for the corresponding quasi-cyclic code. We also prove nonexistence of self dual FqLC codes and self dual quasi-cyclic codes of certain parameters using the transform domain characterization.
On the scalability of many-to-many reliable multicast sessions: Research Articles
Authors: W. Y. Yoon, D. Lee, H. Y. Youn
Venue: Concurrency and Computation: Practice Experience (2004)

Even though tree-based reliable multicast protocols are known to be most scalable for one-to-many sessions, there is still an open question as to whether these protocols are also scalable for many-to-many sessions. In this paper, we analyze and compare two promising multicast protocols&mdash;the receiver-initiated protocol with NACK suppression and the tree-based protocol&mdash;using a new spatial loss model. The proposed model considers the correlation of packet loss events for more realistic analysis unlike the previous work. The analysis results show that the tree-based protocol achieves much higher throughput than the receiver-initiated protocol for a many-to-many session as the number of participants in the session becomes larger. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Path-aware overlay multicast
Authors: Minseok Kwon, Sonia Fahmy
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

We investigate a heuristic application-level (overlay) multicast approach, which we refer to as Topology Aware Grouping (TAG). TAG exploits underlying network topology data to construct overlay multicast networks. Specifically, TAG uses the overlap among routes from the source to group members to construct an efficient overlay network in a distributed, low-overhead manner. We can easily integrate TAG with delay and bandwidth bounds to construct overlays that satisfy application requirements. We study the properties of TAG, and quantify its economies of scale factor, compared to unicast and IP multicast. In addition, we compare TAG with delay-first and bandwidth-first Narada/End System Multicast (ESM) in a variety of simulation configurations. We also implement and experiment with TAG on the PlanetLab wide-area platform. Our results demonstrate the effectiveness of our heuristic in reducing delays and duplicate packets, especially when underlying routes are of high quality.