ppxscal/embedding_network huggingface dataset:
The Neural Circuitry Involved in the Reading of German Words and Pseudowords: A PET Study
Authors: Peter Hagoort, Peter Indefrey, Colin Brown, Hans Herzog, Helmuth Steinmetz, Rüdiger J. Seitz
Venue: Journal of Cognitive Neuroscience (1999)

Silent reading and reading aloud of German words and pseudowords were used in a PET study using (15O)butanol to examine the neural correlates of reading and of the phonological conversion of legal letter strings, with or without meaning. The results of 11 healthy, right-handed volunteers in the age range of 25 to 30 years showed activation of the lingual gyri during silent reading in comparison with viewing a fixation cross. Comparisons between the reading of words and pseudowords suggest the involvement of the middle temporal gyri in retrieving both the phonological and semantic code for words. The reading of pseudowords activates the left inferior frontal gyrus, including the ventral part of Broca's area, to a larger extent than the reading of words. This suggests that this area might be involved in the sublexical conversion of orthographic input strings into phonological output codes. (Pre)motor areas were found to be activated during both silent reading and reading aloud. On the basis of the obtained activation patterns, it is hypothesized that the articulation of high-frequency syllables requires the retrieval of their concomitant articulatory gestures from the SMA and that the articulation of low-frequency syllables recruits the left medial premotor cortex.
Quantifying Skype user satisfaction
Authors: Kuan-Ta Chen, Chun-Ying Huang, Polly Huang, Chin-Laung Lei
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

The success of Skype has inspired a generation of peer-to-peer-based solutions for satisfactory real-time multimedia services over the Internet. However, fundamental questions, such as whether VoIP services like Skype are good enough in terms of user satisfaction,have not been formally addressed. One of the major challenges lies in the lack of an easily accessible and objective index to quantify the degree of user satisfaction.In this work, we propose a model, geared to Skype, but generalizable to other VoIP services, to quantify VoIP user satisfaction based on a rigorous analysis of the call duration from actual Skype traces. The User Satisfaction Index (USI) derived from the model is unique in that 1) it is composed by objective source-and network-level metrics, such as the bit rate, bit rate jitter, and round-trip time, 2) unlike speech quality measures based on voice signals, such as the PESQ model standardized by ITU-T, the metrics are easily accessible and computable for real-time adaptation, and 3) the model development only requires network measurements, i.e., no user surveys or voice signals are necessary. Our model is validated by an independent set of metrics that quantifies the degree of user interaction from the actual traces.
Adaptive Service-Oriented Application Architecture and System Engineering
Authors: Raymond Paul
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Service-oriented computing is making strides due to acceptance by government and major computer and software companies, however there are several issues that we need to address. SOA is related to a number of traditional professional areas such as business models, programming languages, model construction, verification, software architecture and design, software reusability, databases, ontology, autonomic computing, grid computing, and computer networks.
Visual analysis of network centralities
Authors: Tim Dwyer, Seok-Hee Hong, Dirk Koschützki, Falk Schreiber, Kai Xu
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-structured data. A particularly important task is the comparison of different centrality measures within one network. We present three methods for the exploration and comparison of centrality measures within a network: 3D parallel coordinates orbit-based comparison and hierarchy-based comparison. There is a common underlying idea to all three methods: for each centrality measure the graph is copied and drawn in a separate 2D plane with vertex position dependent on centrality. These planes are then stacked into the third dimension so that the different centrality measures may be easily compared. Only the details of how centrality is mapped to vertex position are dierent in each method. For 3D parallel coordinates vertices are placed on vertical lines; for orbit-based comparison vertices are placed on concentric circles and for hierarchy-based comparison vertices are placed on horizontal lines. The second and third solutions make it particularly easy to track changing vertex-centrality values in the context of the underlying network structure. The usability of these methods is demonstrated on biological and social networks.
A DSP laboratory designed for teaching fundamental concepts
Authors: H. J. Trussell, S. A. Rajala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The senior level digital signal processing (DSP) course at North Carolina State University is designed to teach basic methods of describing and analyzing digital signals and systems. In order to reinforce this approach, the laboratory is designed to demonstrate DSP concepts with actual signals and systems. The lab requires no programming but gives the student the opportunity to see the application of theory by manipulating and analyzing real signals. The basis for the lab is a dual channel, multiple scope software package that allows the student simultaneous viewing of time domain and frequency domain signals.
Improving the flexibility of active grids through web services
Authors: Laurent Lefèvre, Paul Roe
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Active Grids are a form of grid infrastructure where the grid network is active and programmable. These grids directly support applications with value added services such as data migration, compression, adaptation and monitoring. Services such as these are particularly important for eResearch applications which by their very nature are performance critical and data intensive.We propose an architecture for improving the flexibility of Active Grids through web services. These enable Active Grid services to be easily and flexibly configured, monitored and deployed from practically any platform or application. The architecture is called WeSPNI ("Web Services based on Programmable Networks Infrastructure"). We present the architecture together with some early experimental results on using web services to monitor data movement in an active grid.
Pre-Indexing for Fast Partial Shape Matching of Vertebrae Images
Authors: Xiaoqian Xu, D. J. Lee, S. Antani, L. R. Long
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Fast retrieval of images from large databases especially from large medical image databases is of great interest to researchers. We have developed shape-based image retrieval system for spine X-ray images that applies Dynamic Programming (DP) in Partial Shape Matching (PSM) techniques to vertebral boundary data. As we enable Internet access to this system with an aim to enable CBIR access to the entire NHANES II spine X-ray image collection, retrieval efficiency has become critical. In this paper, we present enhancements to our existing sequential retrieval model to provide faster partialshape- based vertebrae retrieval. Based on the characteristics of vertebral osteophyte pathology, anterior superior and anterior inferior parts are the areas with the most interest to the users and are indexed for each shape. Pair-wise distances between indexed parts are pre-calculated and used by agglomerative clustering algorithm to index the whole database. To increase the retrieval speed, PSM with DP is therefore conducted only on a small selected set of shapes by the pre-indexing retrieval.
Stability-constrained optimization for energy efficiency in polling-based wireless networks
Authors: Yi Xie, Rocky K. C. Chang
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

A wireless device's energy can be saved by putting it into the sleeping mode (power saving mode, PSM) or decreasing its transmission power (transmission power control, TPC) which prolongs the packet transmission time. However, decreasing one's transmission power would prevent others from transmitting their packets. Clearly, there are complex interactions when each tries to optimize its own energy efficiency. Therefore, in this paper we are considering the problem of optimizing the energy efficiency for all wireless devices in the network with the constraint that they are all stable. In particular, we consider the polling-based MAC protocols with phase grouping and mobile grouping schedules, and we employ both the PSM and TPC to save the energy. We have formulated stability-constrained optimization problems for them, and have proposed an iterative algorithm to compute the optimal power allocations for the wireless devices. We have conducted a lot of experiments to validate the accuracy of the algorithm and to evaluate the gains in the energy efficiency for the two schedules. The mobile grouping schedule is found to be much more energy efficient than the PG schedule, especially when the downlink traffic is higher than the uplink traffic. We have also studied the impact of the optimized schedules on the delay performance.
AR registration by merging multiple planar markers at arbitrary positions and poses via projective space
Authors: Yuko Uematsu, Hideo Saito
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents a vision-based registration method for Augmented Reality by merging multiple planar markers, which are placed at arbitrary positions and poses. In our approach, we use planar markers like AR-Toolkit markers. We need no information about geometrical relationship of the markers while most of marker-based approaches require the measurement of the markers' 3D positions and poses. Thus we can implement an AR system very easily without time-consuming calibration of markers and a camera.In the proposed registration method, we assign a 3D co-ordinate system for each marker independently, and compute a projection matrix between each marker's 3D coordinate system and the input image coordinate system. For merging all markers' 3D coordinate, we construct a projective 3D space defined by projective geometry between two reference images which are selected while the on-line process automatically. This merging process enables to use the multiple markers at arbitrary positions and poses, and also to reduce errors in registration. For demonstrating the effectiveness of the proposed method, we implement a real-time on-line AR system. Virtual objects are superimposed onto input image sequences that are captured with a handy camera. Since the multiple markers are placed in the wide area, the virtual objects can move around the real world widely. Moreover, the registration can be carried out stably, because the markers face to various directions and some of them can be always recognized from most view points.
The Design of Internet Collaborative Learning System with Embedded Load-Balancing Broker
Authors: Fu-Chien Kao, Chia-Wei Liu, Zhi-Hua Ji, Chia-Liang Kuo
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

To transplant the six characteristics of traditional collaborative learning into the network collaborative learning environment, this paper proposes the design of an Internet collaborative learning system with embedded load-balancing brokers. To express the six characteristics through Internet collaborative learning, this research uses Access Grid tools and Remote Control Parameter Delivering Technology to design the structure of the system, and integrate traditional elements to create a web-based collaborative learning environment based around documentation, video conferences or 3D virtual sets. In order to save the cost of system building, the proposed embedded load-balancing brokers are applied to replace the higher-cost Servers.
An Efficient ZHLS Routing Protocol for Mobile Ad Hoc Networks
Authors: Takashi Hamma, Takashi Katoh, Bhed Bahadur Bista, Toyoo Takata
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper, in order to reduce communication overhead in mobile ad hoc networks, we present a Zone-Based Hierarchical Link State Routing Protocol with Gateway Flooding (ZHLS-GF) in which a new flooding scheme, called Gateway Flooding is proposed. ZHLS-GF is based on ZHLS, a Zone-Based Hierarchical Link State Routing Protocol. ZHLS is a hierarchical routing protocol for mobile ad hoc networks in which a network is divided into nonoverlapping zones. All network nodes in ZHLS construct two routing tables, an intrazone routing table and an interzone routing table, by flooding NodeLSPs within the zone and ZoneLSPs throughout the network. However, this incurs a large communication overhead in the network. Our proposed flooding scheme floods ZoneLSPs only to the gateway nodes of zones thus reduces the communication overhead significantly. Furthermore in ZHLS-GF, only the gateway nodes store ZoneLSPs and construct interzone routing tables therefore the total storage capacity required in the network is less than ZHLS.
A Differential Evolution Based Flexible QoS Multicast Routing Algorithm in NGI
Authors: Junwei Wang, Xingwei Wang, Pengcheng Liu, Min Huang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Taking the characteristics of difficulty on exact measurement and complete expression of NGI (Next Generation Internet) into account, a flexible QoS multicast routing algorithm based on DE (Differential Evolution) is presented with introduction of principle of fuzzy mathematics. The corresponding model and its mathematical description are introduced. Under inaccurate information of QoS parameters and users' flexible QoS constraints, the proposed algorithm tries to find the multicast tree with maximum reliability degree and user's QoS satisfaction degree. Simulation results have shown that the proposed algorithm is both feasible and effective.
Book Reviews
Authors: Bob O'Malley
Venue: SIAM Review (2006)

One might think it a dreary chore to write a lively featured review of the Oxford Users&apos; Guide to Mathematics, but that depends on the author. Jonathan Borwein certainly made a colorful job of it, suggesting that the forthcoming Collins Dictionary might also be a worthwhile one to review, perhaps by Eberhard Zeidler. A number of other significant books in pure and applied mathematics are also reviewed in this issue by a diverse variety of mathematicians. We thank them all for providing us opinions about this new literature.
An analysis of the quality of text as fifth-grade formerly identified title I reading students write and revise from paper and pencil to word processor
Authors: Shelly M. Bucci
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Research confirms that the use of a word processor by students (generally college and adult writers) for writing assignments increases the quantity of writing (Azarmsa, 1991; Sewell, 1990), improves writers' attitudes toward writing (Geisert & Futrell, 1990; Snyder, 1993), encourages the view of writing as a process (Dudley-Marling, 1985), and makes revising easier (MacArthur, 1988; Williams, 1992). However, only a small body of literature concentrates on elementary-age school writers (Cochran-Smith, 1991), and because of this it is too early to make broad generalizations about (1) word processing and writing quality of young children (Owston, Murphy & Wideman, 1992); and (2) the number and types of revisions made by elementary school children (Cochran-Smith, 1991). This study will describe fifth-grade formerly identified Title I reading students writing and revising behavior as they begin a writing assignment with paper and pencil, make revisions during a student-teacher conference, then proceed to the word processor, and their teachers' attitudes and perceptions about the use of word processing for writing instruction.
Morphosyntax, Prosody, and Linking Elements: The Auditory Processing of German Nominal Compounds
Authors: Dirk Koester, Th. C. Gunter, S. Wagner, A. D. Friederici
Venue: Journal of Cognitive Neuroscience (2004)

The morphosyntactic decomposition of German compound words and a proposed function of linking elements were examined during auditory processing using event-related brain potentials. In Experiment 1, the syntactic gender agreement was manipulated between a determiner and the initial compound constituent (the ''nonhead'' constituent), and between a determiner and the last constituent (''head''). Although only the head is (morpho)syntactically relevant in German, both constituents elicited a left-anterior negativity if its gender was incongruent. This strongly suggests that compounds are morphosyntactically decomposed. Experiment 2 tested the function of those linking elements which are homophonous to plural morphemes. It has been previously suggested that these indicate the number of nonhead constituents. The number agreement was manipulated for both constituents analogous to Experiment 1. Number-incongruent heads, but not nonhead constituents, elicited an N400 and a subsequent broad negativity, suggesting that linking elements are not processed as plural morphemes. Experiment 3 showed that prosodic cues (duration and fundamental frequency) are employed to differentiate between compounds and single nouns and, thereby, betwen linking elements and plural morphemes. Number-incongruent words elicited a broad negativity if they were produced with a single noun prosody; the same words elicited no event-related potential effect if produced with a compound prosody. A dual-route model can account for the influence of prosody on morphosyntactic processing.
Making Hard Problems Harder
Authors: Joshua Buresh-Oppenheim, Rahul Santhanam
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corresponding notions from the computational theory of randomness. A hardness condenser is a procedure that takes in a Boolean function as input, as well as an advice string, and outputs a Boolean function on a smaller number of bits which has greater hardness when measured in terms of input length. A hardness extractor takes in a Boolean function as input, as well as an advice string, and outputs a Boolean function defined on a smaller number of bits which has close to maximum hardness. We prove several positive and negative results about these objects.
Rank determination in time-series analysis
Authors: D. W. Tufts, A. A. Shah
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In this paper we present a nested sequence of hypothesis tests for determining the number of signals. The procedure is based on the interpretation of the sum of singular values, of the backward/forward-backward matrix as energy in a particular subspace. The threshold selected is based on a user-specified significance level. Using matrix perturbation ideas, we provide an approximation to the probability of overestimation.
Experiments with AdaBoost.RT, an improved boosting scheme for regression
Authors: D. L. Shrestha, D. P. Solomatine
Venue: Neural Computation (2006)

The application of boosting technique to regression problems has received relatively little attention in contrast to research aimed at classification problems. This letter describes a new boosting algorithm, AdaBoost.RT, for regression problems. Its idea is in filtering out the examples with the relative estimation error that is higher than the preset threshold value, and then following the AdaBoost procedure. Thus, it requires selecting the suboptimal value of the error threshold to demarcate examples as poorly or well predicted. Some experimental results using the M5 model tree as a weak learning machine for several benchmark data sets are reported. The results are compared to other boosting methods, bagging, artificial neural networks, and a single M5 model tree. The preliminary empirical comparisons show higher performance of AdaBoost.RT for most of the considered data sets.
A case for a complexity-effective, width-partitioned microarchitecture
Authors: Olivier Rochecouste, Gilles Pokam, André Seznec
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2006)

The analysis of program executions reveals that most integer and multimedia applications make heavy use of narrow-width operations, i.e., instructions exclusively using narrow-width operands and producing a narrow-width result. Moreover, this usage is relatively well distributed over the application. We observed this program property on the MediaBench and SPEC2000 benchmarks with about 40&percnt; of the instructions being narrow-width operations. Current superscalar processors use 64-bit datapaths to execute all the instructions of the applications. In this paper, we suggest the use of a width-partitioned microarchitecture (WPM) to master the hardware complexity of a superscalar processor. For a four-way issue machine, we split the processor in two two-way clusters: the main cluster executing 64-bit operations, load/store, and complex operations and a narrow cluster executing the 16-bit operations. We resort to partitioning to decouple the treatment of the narrow-width operations from that of the other program instructions. This provides the benefit of greatly simplifying the design of the critical processor components in each cluster (e.g., the register file and the bypass network). The dynamic interleaving of the two instruction types allows maintaining the workload balanced among clusters. WPM also helps to reduce the complexity of the interconnection fabric and of the issue logic. In fact, since the 16-bit cluster can only communicate narrow-width data, the datapath-width of the interconnect fabric can be significantly reduced, yielding a corresponding saving of the interconnect power and area. We explore different possible configurations of WPM, discussing the various implementation tradeoffs. We also examine a speculative steering heuristic to distribute the narrow-width operations among clusters. A detailed analysis of the complexity factors shows using WPM instead of a classical 64-bit two-cluster microarchitecture can save power and silicon area with a minimal impact on the overall performance.