ppxscal/embedding_network huggingface dataset:
Online education and learning management systems from service-centered perspective
Authors: Aki Lassila, Päivi Pöyry
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper we explore how Learning Management Systems (LMS) can be offered and used as a service. We use the Software as a Service (SaaS) framework as we study how the service-centered view can be applied in the context of e-learning and offering LMSs as online services. The phenomenon is approached from two different stakeholders' viewpoints: the LMS developer's and universities'. This paper reports a case study of a LMS called Optima and how it is used as a SaaS service by two major universities in Finland. Empirical data was collected via interviews, and the data was analysed from both the LMS provider's and the universities' perspectives. On the basis of our findings, we conclude that the SaaS model can help the different stakeholders to more efficiently take advantage of the online LMSs' benefits provided that the LMS developer and the universities adopt a more service-centered view on offering e-learning. In addition, there are still many obstacles that hinder the optimal use of LMS, such as insufficient user interface design, learning content creation and packaging using the LMS, i.e. in the overall process of providing an online teaching and learning environment.
Use clustering to improve neural network in financial time series prediction
Authors: Feng Liu, Peng Du, Fangfei Weng, Jun Qu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, a time series prediction method using clustering to improve neural network is studied. The big data group is divided into some small parts by clustering. By this way, every small part has a higher conformity, and data in these small parts is used to train corresponding neural network for prediction. The prediction model is constructed from neural network with the addition of clustering and is applied to the financial time series prediction. The experiment results demonstrate the effectiveness of the improvement. Comparison with the primitive neural network prediction model shows that clustering increases neural network's trend accuracy in continuous prediction, while debasing the cost of time and reducing the complexity of the prediction model.
New Products
Authors: D. A. Michalopoulos
Venue: Computer (1978)

Hewlett-Packard claims a new high in ruggedness, based on more than three machine-years of life testing prior to production introduction, for its new dot-matrix, 400-lpm line printer. The printer uses a virtually frictionless print mechanism under the control of a microprocessor that provides self-diagnostics, improves operating speed, and makes possible a variety of character and graphic print modes.
Design and performance analysis of an adaptive receiver for multicarrier DS-CDMA
Authors: Huahui Wang, Kai Yen, Kay Wee Ang, Yong Huat Chew
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

An adaptive parallel interference cancelation (APIC) scheme is proposed for the multicarrier direct sequence code division multiple access (MC-DS-CDMA) system. Frequency diversity inherent in the MC system is exploited through maximal ratio combining, and an adaptive least mean square algorithm is used to estimate the multiple access interference. Theoretical analysis on the bit-error rate (BER) of the APIC receiver is presented. Under a unified signal model, the conventional PIC (CPIC) is shown to be a special case of the APIC. Hence the BER derivation for the APIC is also applicable to the CPIC. The performance and the accuracy of the theoretical results are examined via simulations under dierent design parameters, which show that the APIC outperforms the CPIC receiver provided that the adaptive parameters are properly selected.
WiSE: Best-Path Selection in Wireless Multihoming Environments
Authors: Roberta Fracchia, Claudio Casetti, Carla-Fabiana Chiasserini, Michela Meo
Venue: IEEE Transactions on Mobile Computing (2007)

This paper introduces WiSE, a sender-side, transport-layer protocol that modifies the standard SCTP protocol. WiSE aims at exploiting SCTP’s multihoming capabilities by selecting in real time the best choice among available, alternate paths to the same destination. Through the use of bandwidth estimation techniques, WiSE tries to infer whether losses are due to congestion or to radio channel errors. At the same time, the available bandwidth of the current path used for transmission is matched to that of an alternate path, also probed for available bandwidth. If the current path is severely congested, and the alternate path is lightly loaded,WiSE switches the transmission onto the alternate path, using SCTP’s flexible path management capabilities. Extensive simulations under different scenarios highlight the superiority of the proposed solution with respect to TCP and the standard SCTP implementation.
Introduction to the NS16000 Architecture
Authors: Colin Hunter, Erin Farquhar
Venue: IEEE Micro (1984)

The 32-bit NS16000 was specifically designed to support high-level languages. Its page-based virtual memory system helps give it true mainframe capability.
Classifying XML Documents by Using Genre Features
Authors: Malcolm Clark, Stuart Watt
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The categorization of documents is traditionally topic-based. This paper presents a complementary analysis of research and experiments on genre to show that encouraging results can be obtained by using genre structure (form) features. We conducted an experiment to assess the effectiveness of using extensible mark-up language (XML) tag information, and part-of-speech (P-O-S) features, for the classification of genres, testing the hypothesis that if a focus on genre can lead to high precision on normal textual documents, then good results can be achieved using XML tag information in addition to P-O-S information. An experiment was carried out on a subsection of the initiative for the evaluation of XML (INEX) 1.4 collection. The features were extracted and documents were classified using machine learning algorithms, which yielded encouraging results for logistic regression and neural networks. We propose that utilizing these features and training a classifier may benefit retrieval for most world wide web (WWW) technologies such as XML and extensible hypertext markup language) XHTML.
Enhancement of Old Manuscript Images
Authors: A. Gupta, S. Kumar, R. Gupta, S. Chaudhury, S. Joshi
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we address the issue of enhancement in the quality of scanned images of old manuscripts. Small por- tions of the text in these manuscripts have degraded with time and are not readable. We propose a segmentation based histogram matching scheme for enhancing these de- graded text regions. To automatically identify the degraded text we use a matched wavelet based text extraction algo- rithm followed by MRF(Markov Random Field) post pro- cessing. Additionally we do background clearing to improve the quality of results. This method does not require any a priori information about the font, font size, background texture or geometric transformation. We have tested our method on a variety of manuscript images. The results show proposed method to be a robust, versatile and effective tool for enhancement of manuscript images.
Refinable Kernels
Authors: Yuesheng Xu, Haizhang Zhang
Venue: The Journal of Machine Learning Research (2007)

Motivated by mathematical learning from training data, we introduce the notion of refinable kernels. Various characterizations of refinable kernels are presented. The concept of refinable kernels leads to the introduction of wavelet-like reproducing kernels. We also investigate a refinable kernel that forms a Riesz basis. In particular, we characterize refinable translation invariant kernels, and refinable kernels defined by refinable functions. This study leads to multiresolution analysis of reproducing kernel Hilbert spaces.
Low-Capture-Power Test Generation by Specifying A Minimum Set of Controlling Inputs
Authors: Nan-Cheng Lai, Sying-Jyan Wang
Venue: Proceedings of the 16th Asian Test Symposium (2007)

We propose a low capture power test generation method to address the capture power issue in scan-based designs. The proposed approach tries to find a minimum set of input values to determine the output values and thus leave as many X-bits in the input side as possible. These X-bits can be assigned to values that minimize capture power. In the proposed method, the global information of circuit structure is considered to reduce the appearance of unnecessary inconsistent assignments in X-filling procedure. As a result, the algorithm runs similar to previous methods in worst case. Experimental results show that the proposed method provides a better result than previous method and the approach can be adopted with any other advanced test pattern generator.
The Neuroscience Display Processor
Authors: J. J. Capowski
Venue: Computer (1978)

After five years of experience meeting neuroscientists' display requirements, a university computer center constructed a low-cost, special-purpose, highly successful graphics processor. 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
GeRoMeSuite: a system for holistic generic model management
Authors: David Kensche, Christoph Quix, Xiang Li, Yong Li
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Manipulation of models and mappings is a common task in the design and development of information systems. Research in Model Management aims at supporting these tasks by providing a set of operators to manipulate models and mappings. As a framework, GeRoMeSuite provides an environment to simplify the implementation of model management operators. GeRoMeSuite is based on the generic role based metamodel GeRoMe [10], which represents models from different modeling languages (such as XML Schema, OWL, SQL) in a generic way. Thereby, the management of models in a polymorphic fashion is enabled, i.e. the same operator implementations are used regardless of the original modeling language of the schemas. In addition to providing a framework for model management, GeRoMeSuite implements several fundamental operators such as Match, Merge, and Compose.
Machine Complexity Versus Interconnection Complexity in Iterative Arrays
Authors: V. C. Hamacher
Venue: IEEE Transactions on Computers (1971)

A procedure is given for the construction of a von Neumann neighborhood iterative array to simulate a Moore neighborhood array in real time for the cases of up to three-dimensional arrays. The increase in the typical machine complexity accompanying this neighborhood complexity reduction is significantly less than that found in the general n-dimensional study of Cole [1].
Applications of the Proposed IEEE 754 Standard for Floating-Point Arithetic
Authors: D. Hough
Venue: Computer (1981)

Various features of the proposed standard provide an especially convenient environment for programming numerical procedures such as the familiar elementary functions.
How probes work
Authors: Connor Graham, Mark Rouncefield, Martin Gibbs, Frank Vetere, Keith Cheverst
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

'Cultural probes', since first being proposed and described by Bill Gaver and his colleagues, have been adapted and appropriated for a range of purposes within a variety of technology projects. In this paper we critically review different uses of Probes and discuss common aspects of different Probe variants. We also present and critique some of the debate around Probes through describing the detail of their use in two studies: The Digital Care Project (Lancaster University) and The Mediating Intimacy Project (University of Melbourne). We then reorient the discussion around Probes towards how probes work: both as interpretative fodder for social scientists and as a resource for 'designers'. Finally we discuss new possible directions for Probes as an approach and some of the challenges confronting Probes as an approach.
Classification of Direction perception EEG Based on PCA-SVM
Authors: Jing Jin, Xingyu Wang, Bei Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, an experiment was designed to get the electroencephalography (EEG) when people caught the vision of moving to different direction (right, left, front, back). Through Fourier Transform., the feature of the EEG was obtained. Then, the algorithm of principal component analysis (PCA) was used to simplify the feature. Finally, in order to classify the direction perception EEG, it was distinguished by the feature with support vector machine (SVM). Result proved that the classification of direction perception EEG was feasible.
Sharing Software Resources with Floating License In Grid Environment
Authors: Wei FU, Nong XIAO, Xicheng LU
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Software resources are always important and expensive for users. Sharing existing software resources and paying for their usages become big challenges in grid environment. While existing license management systems are only suitable for LAN environment, a novel grid middleware, named LicTraveler, is developed for global license sharing across various domains. The two-leveled hierarchical architecture allows both autonomous local service and cooperative global service. It provides strong security and flexible reservation & quota policies for licensing activities. Flexible license distributing and scheduling policies are also provided. Experiments show that LicTraveler helps corporations reducing their redundant investments and promoting license efficiencies as much as 50%.
The Slide Business
Authors: Thomas Hope
Venue: IEEE Computer Graphics and Applications (1983)

The use of slides took a big jump when Kodak introduced the Carousel projector. Will computerized slide-making systems have the same impact on the market? 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
A General Class of Maximal Codes ror Computer Applications
Authors: Se June Hong
Venue: IEEE Transactions on Computers (1972)

The error-correcting codes for symbols from GF (2b) are often used for correction of byte-errors in binary data. In these byte-error-correcting codes each check symbol in GF (2b) is expressed as b binary check digits and each information symbol in GF (2b), likewise, is expressed by b binary information digits. A new class of codes for single-byte-error correction is presented. The code is general in that the code structure does not depend on symbols from GF (2b). In particular, the number of check bits are not restricted to the multiples of b as in the case of the codes derived from GF (2b) codes. The new codes are either perfect or maximal and are easily implementable using shift registers.
Computing generalized inverses of a rational matrix and applications
Authors: Predrag S. Stanimirović, N. P. Karampetakis, Milan B. Tasić
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper we investigate symbolic implementation of two modifications of the Leverrier-Faddeev algorithm, which are applicable in computation of the Moore-Penrose and the Drazin inverse of rational matrices. We introduce an algorithm for computation of the Drazin inverse of rational matrices. This algorithm represents an extension of the papers [11] and [14]. and a continuation of the papers [15, 16]. The symbolic implementation of these algorithms in the package MATHEMATICA is developed. A few matrix equations are solved by means of the Drazin inverse and the Moore-Penrose inverse of rational matrices.
A Modified Constructive Neural Networks and Its Application for Large-scale Data Mining
Authors: Wenjiang Zhou, Yin Xu, Lunwen Wang, Ling Zhang, Ying Tan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The constructive neural networks based on the covering algorithms is suitable for large-scale data mining because it can be local processing and has little computational complexity, however, the local processing lows classification precision. In this paper, covering algorithms is firstly extended to kernel covering algorithms and we secondly construct a kind of finite mixture probabilistic model based on kernel covering algorithms according to the probability meaning of Gaussian function and finally introduce the global optimizing computation by "maximum likelihood theory", realize the global optimization problem of the covering algorithms so as to expand the range of application of covering algorithms and improve its precision. The results of the experiment are given as an example to illustrate the validation of the method.
A negotiation model for autonomous computational agents: Formal description and empirical evaluation
Authors: Fernando Lopes, Nuno Mamede, A. Q. Novais, Helder Coelho
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

Autonomous agents are being used in an increasing number of applications. The agents operate in complex environments and, over time, conflicts inevitably occur among them. Negotiation is the predominant process for resolving conflicts. This paper presents a generic negotiation model for autonomous agents that handles multi-party, multi-issue and single or repeated rounds. The model is based on computationally tractable assumptions and accounts for a tight integration of the individual capability of planning and the social capability of negotiation. This paper also describes an experiment conducted to evaluate the model in different types of situations. The experimental results confirmed a number of well-documented conclusions about human negotiation.
New Products
Authors: D. A. Michalopoulos
Venue: Computer (1981)

Designed for users of IBM Series/I Comers, the Program Executive System (PXS) available from Alan Hochschild, Inc., is a supplement to the EDX operating system that provides extensive user facilities for program development and distributed processing operations, integrating these facilities into one product with its own high-level language.
Walking Stability by Age A Feature Analysis Based on a Fourteen-Linkage Model
Authors: Bofeng Zhang, Takehiro Kanno, Wenxi Chen, Gengfeng Wu, Daming Wei
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

More and more researchers have been interested in walking analysis for health management of elderly people. Before understanding pathological gait, it is necessary to understand normal gait, since this pro- vides a quantitative standard to judge or evaluate the gait of a patient. A starting point to do this is to study the relationship between walking features and ages. For this purpose, this paper proposes a walking model called Fourteen-Linkage Walking (FLW) model to de- tect some useful features relative with age from 21 to 65 year old. The features of walking stability are then defined and extracted based on the FLW model. Two kinds of stability features, footprint features and walk- ing cycle features, are researched in this paper. To evaluate the walking pattern, a new concept, stability coefficient, is suggested. Our results show that the footprint and walking cycle features have close corre- lation with ages.
Multi-modal tracking of people using laser scanners and video camera
Authors: Jinshi Cui, Hongbin Zha, Huijing Zhao, Ryosuke Shibasaki
Venue: Image and Vision Computing (2008)

Inspite extensive research on visual tracking of multiple people in computer vision area, the robustness and usability of visual trackers are still discouraging. Recently, a few laser-based detection and tracking methods have been developed in robotics area. However, poor features provided by laser data make the tracker fail in many situations. In this paper, we present a novel method that aims at reliably detecting and tracking multiple people in an open area. Multiple laser scanners and one camera are used as input sensors. In detection stage, laser-based detection algorithm captures newly appeared people and initializes the mean-shift-based visual tracker. In tracking stage, laser-based feet trajectory tracking result and visual body region tracking result are combined with a decision-level Bayesian fusion method. The experimental results demonstrate reliable and real-time performance of the method.
Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast
Authors: Vidhyashankar Venkataraman, Kaouru Yoshida, Paul Francis
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

The rising popularity of live IPTV has triggered renewed interest in P2P multicast. In particular, the simple and robust `swarming'style of P2P multicast is currently favored over more traditional tree-based approaches, which are seen to be complex andfragile. Swarming approaches, however, exhibit a basic control-overhead-versus-latency tradeoff that gears it more towardshigh-volume, latency-tolerant applications. This paper presents a new unstructured P2P multicast protocol called Chunkyspread1that is tree-based yet simple and robust. Chunkyspread uses multiple trees to provide fine-grained control over member load,reacts quickly to membership changes, scales well, and has low overhead. This paper gives a detailed description of Chunkyspreadand an apples-to-apples comparison with the DHT-based Splitstream multi-tree P2P multicast algorithm. We show that Chunkyspreadexhibits far better control over transmit load than Splitstream, while exhibiting comparable or better latency and responsivenessto churn. This comparison establishes Chunkyspread as the `best of breed' among tree-based P2P multicast algorithms, thussetting the stage for future comparisons with swarming-based approaches.
Alternatives in Designing Level-Restoring Buffers for Interconnection Networks in Field-Programmable Gate Arrays
Authors: Scott MILLER, Mihai SIMA, Michael McGUIRE
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Programmable routing and logic in field-programmable gate arrays are implemented using nMOS pass transistors. Since the threshold voltage drop across an nMOS device degrades the high logic value, causing the pMOS transistor of the downstream buffer to not turn fully off, this approach suffers from static power consumption and reduced noise margins. The standard pMOS transistor pull-up in an active feedback of an inverter reduces the static power consumption, but degrades the switching time and/or active power consumption. We propose a circuit technique to build level-restoring buffers, which improves the propagation delay or active power consumption at a tiny area penalty. Our main idea is to replicate the nMOS element of the downstream buffer, where each replica is driven by a signal that originates from earlier stages of the nMOS-tree multiplexer. This way, when passing high logic values, signals from earlier stages directly drive the downstream buffer improving the delay or the slope of the transition edge. The passing of low logic values is still performed in the original way by the nMOS tree and the pMOS element of the downstream buffer. The simulations indicate an average improvement of the composite metric area-delay-energy product of 25% versus the standard approach across 180nm, 130nm, and 90nm technologies.