ppxscal/embedding_network huggingface dataset:
Multi-disk scheduling for time-constrained requests in RAID-0 devices
Authors: Shi-Wu Lo, Tei-Wei Kuo, Kam-Yiu Lam
Venue: Journal of Systems and Software (2005)

In this paper, we study the scheduling problem of real-time disk requests in multi-disk systems, such as RAID-0. We first propose a multi-disk scheduling algorithm, called Least-Remaining-Request-Size-First (LRSF), to improve soft real-time performance of I/O systems. LRSF may be integrated with different real-time/non-real-time single-disk scheduling algorithms, such as SATF and SSEDV, adopted by the disks in a multi-disk system. We then extend LRSF by considering the serving requests on-the-way (OTW) to the target request to minimize the starvation problem for requests that need to retrieve a large amount of data. The pre-fetching issue in RAID-0 is also studied to further improve the I/O performance. The performance of the proposed algorithm and schemes is investigated and compared with other disk scheduling algorithms through a series of experiments using both randomly generated workload and realistic workload.
A resource management interface for the Java&trade; platform
Authors: Grzegorz Czajkowski, Stephen Hahn, Glenn Skinner, Pete Soper, Ciarán Bryce
Venue: Software&mdash;Practice Experience (2005)

Software systems in many circumstances need awareness of their resource usage. Meeting performance requirements often requires the ability to manage consumption of resources provided by the environment. Resource management is traditionally handled by operating systems, but the growing need to use safe languages in the systems programming domain adds increased pressure to equip them with resource management capabilities at a level of abstraction that fits gracefully with the language. This paper proposes an extensible, flexible, and widely applicable resource management interface for the Java platform. The interface is small, but capable of modeling a variety of resources and resource management policies. In particular, application-specific resources can be defined, as well as more traditional computational resources such as heap memory and processor time. The interface is presented here in detail, along with a series of examples and a description of a prototype implementation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The impact of IS sourcing type on service quality and maintenance efforts
Authors: Joo-Yeon Park, Joon S. Kim
Venue: Information and Management (2005)

The purpose of our work was to examine the effectiveness of information system sourcing from the perspective of service quality and maintenance efforts. We empirically found that there were significant differences in service quality, but not in maintenance efforts, between insourced and outsourced systems. We also found that the level of service quality and maintenance efforts across system sourcing types varied as a system grew older. Our results suggested that outsourcing may not always be the correct choice for reducing costs and increasing efficiency over the long term. This work also considered the effect of issues like productivity gains from a reduced need for system maintenance and the cost savings achieved by choosing sourcing options wisely.
An empirical evaluation of test case filtering techniques based on exercising complex information flows
Authors: David Leon, Wes Masri, Andy Podgurski
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Some software defects trigger failures only when certain complex information flows occur within the software. Profiling and analyzing such flows therefore provides a potentially important basis for filtering test cases. We report the results of an empirical evaluation of several test case filtering techniques that are based on exercising complex information flows. Both coverage-based and profile-distribution-based filtering techniques are considered. They are compared to filtering techniques based on exercising basic blocks, branches, function calls, and def-use pairs, with respect to their effectiveness for revealing defects.
Mixed-mode dialogue information access for the visually impaired
Authors: Xiaoyu Chen
Venue: Issue 81 (January 2005) (2005)

This paper describes mixed tactile and speech input modes implemented on a PDA as a solution to various problems of information access for the visually impaired. A prototype of the mixed-mode input dialogues has been developed in a non-visual news browser on a desktop computer. A pilot study is being conducted on this computer to determine how best to mix speech and touch input for visually impaired users. With the knowledge gained from the pilot study, a mixed-mode input environment will be built on PDA. Once the PDA prototype is operational a field study conducted on visually impaired subjects using this input environment will extend our understanding of how to effectively design mixed touch and speech input for various tasks and input contexts.
Neuromorphic architectures for nanoelectronic circuits: Research Articles
Authors: Özgür Türel, Jung Hoon Lee, Xiaolong Ma, Konstantin K. Likharev
Venue: International Journal of Circuit Theory and Applications (2004)

This paper reviews recent important results in the development of neuromorphic network architectures (&lsquo;CrossNets&rsquo;) for future hybrid semiconductor&#x002F;nanodevice-integrated circuits. In particular, we have shown that despite the hardware-imposed limitations, a simple weight import procedure allows the CrossNets using simple two-terminal nanodevices to perform functions (such as image recognition and pattern classification) that had been earlier demonstrated in neural networks with continuous, deterministic synaptic weights. Moreover, CrossNets can also be trained to work as classifiers by the faster error-backpropagation method, despite the absence of a layered structure typical for the usual neural networks. Finally, one more method, &lsquo;global reinforcement&rsquo;, may be suitable for training CrossNets to perform not only the pattern classification, but also more intellectual tasks. A demonstration of such training would open a way towards artificial cerebral-cortex-scale networks capable of advanced information processing (and possibly self-development) at a speed several orders of magnitude higher than that of their biological prototypes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Evaluation and selection in product design for mass customization: A knowledge decision support approach
Authors: Xuan F. Zha, Ram D. Sriram, Wen F. Lu
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

Mass customization has been identified as a competitive strategy by an increasing number of companies. Family-based product design is an efficient and effective means to realize sufficient product variety, while satisfying a range of customer demands in support for mass customization. This paper presents a knowledge decision support approach to product family design evaluation and selection for mass customization process. Here, product family design is viewed as a selection problem with the following stages: product family (design alternatives) generation, product family design evaluation, and selection for customization. The fundamental issues underlying product family design for mass customization are discussed. Then, a knowledge support framework and its relevant technologies are developed for module-based product family design for mass customization. A systematic fuzzy clustering and ranking model is proposed and discussed in detail. This model supports the imprecision inherent in decision making with fuzzy customers' preference relations and uses fuzzy analysis techniques for evaluation and selection. A neural network technique is also adopted to adjust the membership function to enhance the model. The focus of this paper is on the development of a knowledge-intensive support scheme and a comprehensive systematic fuzzy clustering and ranking methodology for product family design evaluation and selection. A case study and the scenario of knowledge support for power supply family evaluation, selection, and customization are provided for illustration.
A unifying look at clustering in mobile ad hoc networks: Research Articles
Authors: Lan Wang, Stephan Olariu
Venue: Wireless Communications Mobile Computing (2004)

In recent years, a significant number of clustering schemes have been proposed in the literature. Most of them treat cluster initialization and cluster maintenance differently as if they were two entirely different undertakings. The main contribution of this work is a unifying way of looking at clustering in MANET. We make an important point: there is no difference between cluster initialization and cluster maintenance, and one algorithm should gracefully blend into the other. To illustrate the feasibility of this concept, we propose a novel tree-based clustering algorithm for MANET based on a number of properties of diameter-2 graphs. The algorithm is cluster-centric and, unlike the vast majority of algorithms in the literature, works in the presence of node mobility. Extensive simulation results show the effectiveness of our algorithm when compared to other clustering schemes proposed in the recent literature. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Human-Machine Admittance and Transparency Adaptation in Passive User Interaction with a Haptic Interface
Authors: Samuel T. McJunkin, Yanfang Li, Marcia K. O'Malley
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper addresses human adaptation to changes in coupling impedance and force amplitude during passive user induced (PUI) interactions with a haptic interface. PUI interactions are characterized as event-based haptic interactions or haptic recordings that are replayed to the user. In the study, virtual environments are displayed to passive users with variable coupling stiffness and force amplitudes, and transparency bandwidth and human-machine admittance are measured. Results indicate that transparency bandwidth and the human-machine admittance do not change significantly for permutations of force amplitudes and coupling impedances, nor do they vary significantly across users. The reason for this invariance is that, during a PUI interaction, users tend approach a similar displacement profile. As a result, all users will have similar apparent admittance and transparency. The findings give sufficient justification for the use of universal compensators that improve transparency bandwidth, and that can be designed based solely on a priori transparency measurements for a typical user.
Transforming low-discrepancy sequences from a cube to a simplex
Authors: Tim Pillards, Ronald Cools
Venue: Journal of Computational and Applied Mathematics (2005)

Sequences of points with a low discrepancy are the basic building blocks for quasi-Monte Carlo methods. Traditionally these points are generated in a unit cube.To develop point sets on a simplex we will transform the low-discrepancy points from the unit cube to a simplex. An advantage of this approach is that most of the known results on low-discrepancy sequences can be re-used. After introducing several transformations, their efficiency as well as their quality will be evaluated. We present a Koksma-Hlawka inequality which says that under certain conditions the order of convergence using the new point set is the same as that of the original set.
Nanoelectronic pulse generators based on gated resonant tunnelling diodes: Research Articles
Authors: Lars-Erik Wernersson, Peter Lindström, André Nauen, Erik Lind
Venue: International Journal of Circuit Theory and Applications (2004)

We study the operation of a gated resonant tunnel diode placed in an oscillator tank circuit for application as a pulse generator. The gated diode is realized by a metal gate placed 30nm away from a resonant tunnelling double barrier heterostructure, where the gate is used to control the current of the tunnelling diode. A large signal model is developed for the gated resonant tunnelling diode and we use this model to study the operation of the pulsed oscillator. It is demonstrated that the gate can be used to switch the oscillations on and off and to tune the oscillation frequency via changes in the internal capacitances in the gated diode. A modulation in the oscillation frequency of 7.6 GHz around 220 GHz is obtained for a change in the gate bias from 0.2 to -0.6V. Short pulses applied to the gate results in only four periods of oscillation with a broad power spectrum. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workload
Authors: Pierfrancesco Foglia, Roberto Giorgi, Cosimo Antonio Prete
Venue: Journal of Parallel and Distributed Computing (2005)

In this work, we characterized the memory performance-and in particular the impact of coherence overhead and process migration-of a shared-bus shared-memory multiprocessor running a DSS workload. When the number of processors is increased in order to achieve higher computational power, the bus becomes a major bottleneck of such architecture. We evaluated solutions that can greatly reduce that bottleneck. An area where this kind of optimization is important regards data base systems. For this reason, we considered a DSS workload and we setup the experiments following TPC-D specifications on the PostgreSQL DBMS in order to explore different optimizations on same kind of workloads as evaluated in the literature. In this scenario, we compare possible solutions to boost performance and we show the impact of process migration on coherence overhead. We found that the consequences of coherence overhead and process migration on performance are very important in machines with 16 or more processors. In this case, even little sharing, as in DSS applications, can become crucial for system performance. Another important result of our analysis regards the interaction between the coherence protocol and the scheduler. The basic cache affinity scheduling is useful in reducing migration, but it is not effective in every load condition. Specific coherence protocols can help reduce the effects of process migration, especially in situations when the scheduler cannot apply the affinity requirement. In these conditions, the use of a write-update protocol with a selective invalidation strategy for private data improves performance (and scalability) of about 20% with respect to a classical MESI-based solution. This advantage is about 50% in the case of high cache-to-cache transfer.
MIMO Systems in Random Uncorrelated, Correlated and Deterministic Radio Channels
Authors: Beza Negash Getu, Jørgen Bach Andersen
Venue: Wireless Personal Communications: An International Journal (2004)

The paper discusses the BER and spectral efficiency of different MIMO systems in random uncorrelated, correlated and deterministic environments, and more specifically uncorrelated and correlated Rayleigh and Ricean fading channels. It is known that the so-called MIMO eigenmode transmission assumes channel knowledge at the transmitter for pre-coding, whereas V-BLAST and STC do not assume the channel knowledge at the transmitter, instead they use it at the receiver for recovering the transmitted information. It is shown that for the same spectral efficiency, the BER performance of the MIMO eigenmode transmission outperforms MIMO systems like V-BLAST and STBC. In fully correlated random environment, transmitting through the largest eigenmode exploits the full transmitter-receiver array gain and diversity order, giving the maximal possible performance in terms of reducing the BER. In any of the scenarios, transmitting through the largest eigenmode gives better performance in terms of reducing the BER compared with STBC systems. Spatial multiplexing through the so-called eigensets (sets which consist of transmission modes with significant channel gain) outperforms systems like V-BLAST. In this context, adaptive modulation has been used to minimize the overall BER for a given spectral efficiency.
Modeling of Human Texture Perception for Tactile Displays and Sensors
Authors: Hirokazu Shirado, Takashi Maeno
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

It is necessary to ascertain texture perception of humans in developing tactile devices that create or detect lifelike texture. In this paper, the relationship between object surface physical properties and texture perception is discussed through multivariate analysis. We quantified the tactile sensation and texture perception through sensory evaluation. From the results, we built a model of the relationship.
mudibo: multiple dialog boxes for multiple monitors
Authors: Dugald Ralph Hutchings, John Stasko
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

A general problem identified in recent research on multiple monitor systems is the placement of small windows such as dialog boxes and toolbars. These small windows could be placed on top of the application window or on a monitor next to the application window; different situations call for different placements. We present mudibo, a component of the window manager that alleviates this problem by initially placing a window in multiple locations simultaneously and subsequently allowing the user to easily interact with the window in a desired location. Additional important contributions of mudibo are that as a general technique it can be applied to a number of situations and windows beyond simple dialog boxes, exploits the additional screen space that multiple monitors provide to solve a specific problem with dialog box interaction, and is among the first research prototype UIs that explicitly account for multiple-monitor users.
New York University: description of the Proteus system as used for MUC-5
Authors: Ralph Grishman, John Sterling
Venue: Proceedings of the 5th conference on Message understanding (1993)

The Proteus system which we have used for MUC-5 is largely unchanged from that used for MUC-3 and MUC-4. It has three main components: a syntactic analyzer, a semantic analyzer, and a template generator.
A neural net architecture for hardware implementation of a temporal pattern discrimination model
Authors: Sei Takahashi, Yoshifumi Sekine
Venue: Systems and Computers in Japan (2004)

This paper proposes a neural net architecture for hardware implementation of a temporal pattern discrimination model. The elements constituting the hardware have the characteristics of delays, thresholds, and refractoriness that are useful for implementing a model in hardware. First, it shows that a temporal pattern short-term memory structure, similar to TDNN, can be implemented by connecting the hardware elements only serially. Next, it constructs a neocognitron-type temporal data recognition model (Neo-TDRM) using this short-term memory structure by using a neocognitron that is robust with respect to pattern positional lags or shape changes as a discrimination model. Results of computer simulation of single-channel mouse brain wave discrimination experiments show that the system can correctly discriminate even waveforms that are extended or contracted temporally or spatially. In addition, the proposed model is shown to be suitable for hardware implementation compared with the neocognitron constructed for similar discrimination experiments from the point of view of the number of cells or the number of wires required, since the number of cells of the Neo-TDRM can be reduced to about 1&sol;4 and the number of wires to about 1&sol;18. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 104&ndash;112, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20075
The RWTH system for statistical translation of spoken dialogues
Authors: H. Ney, F. J. Och, S. Vogel
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper gives an overview of our work on statistical machine translation of spoken dialogues, in particular in the framework of the VERBMOBIL project. The goal of the VERBMOBIL project is the translation of spoken dialogues in the domains of appointment scheduling and travel planning. Starting with the Bayes decision rule as in speech recognition, we show how the required probability distributions can be structured into three parts: the language model, the alignment model and the lexicon model. We describe the components of the system and report results on the VERBMOBIL task. The experience obtained in the VERBMOBIL project, in particular a large-scale end-to-end evaluation, showed that the statistical approach resulted in significantly lower error rates than three competing translation approaches: the sentence error rate was 29% in comparison with 52% to 62% for the other translation approaches.
Finding group shilling in recommendation system
Authors: Xue-Feng Su, Hua-Jun Zeng, Zheng Chen
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In the age of information explosion, recommendation system has been proved effective to cope with information overload in e-commerce area. However, unscrupulous producers shill the systems in many ways to make profit, and it makes the system imprecise and unreliable in a long term. Among many shilling behaviors, a new form of attack, called group shilling, appears and does great harm to the system. Because group shilling users are now well organized and become more hidden among various normal users, it is hard to find them by traditional methods. However, these group shilling users are similar to some extent, for they both shill the target items. We bring out a similarity spreading algorithm to find these group shilling users and protect recommendation system from unfair ratings. In our algorithm, we try to find these cunning group shilling users through propagating similarities from items to users iteratively. The experiment shows our similarity spreading algorithm improves the precision of the system and provides the system a reliable protection.
A Study of Global Optimization Using Particle Swarms
Authors: Jaco F. Schutte, Albert A. Groenwold
Venue: Journal of Global Optimization (2005)

A number of recently proposed variants of the particle swarm optimization algorithm (PSOA) are applied to an extended Dixon-Szeg und constrained test set in global optimization. Of the variants considered, it is shown that constriction as proposed by Clerc, and dynamic inertia and maximum velocity reduction as proposed by Fourie and Groenwold, represent the main contenders from a cost efficiency point of view. A parameter sensitivity analysis is then performed for these two variants in the interests of finding a reliable general purpose off-the-shelf PSOA for global optimization. In doing so, it is shown that inclusion of dynamic inertia renders the PSOA relatively insensitive to the values of the cognitive and social scaling factors.