ppxscal/embedding_network huggingface dataset:
Investigation and modeling of the structure of texting language
Authors: Monojit Choudhury, Rahul Saraf, Vijit Jain, Animesh Mukherjee, Sudeshna Sarkar, Anupam Basu
Venue: International Journal on Document Analysis and Recognition (2007)

Language usage over computer mediated discourses, such as chats, emails and SMS texts, significantly differs from the standard form of the language and is referred to as texting language (TL). The presence of intentional misspellings significantly decrease the accuracy of existing spell checking techniques for TL words. In this work, we formally investigate the nature and type of compressions used in SMS texts, and develop a Hidden Markov Model based word-model for TL. The model parameters have been estimated through standard machine learning techniques from a word-aligned SMS and standard English parallel corpus. The accuracy of the model in correcting TL words is 57.7%, which is almost a threefold improvement over the performance of Aspell. The use of simple bigram language model results in a 35% reduction of the relative word level error rates.
Use of Psychological Experimentation as an Aid to Development of a Query Language
Authors: P. Reisner
Venue: IEEE Transactions on Software Engineering (1977)

This paper describes a series of psychological experiments used to test a new data base query language. The intent is to make psychological testing of a language part of the design and development process. By testing a language while it is still under development, features that require changing can bs identified and the changes made.
Dynamic and distributed packet aggregation to solve the performance anomaly in 802.11 wireless networks
Authors: Tahiry Razafindralambo, Isabelle Guérin-lassous, Luigi Iannone, Serge Fdida
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In the widely used IEEE 802.11 standard, the so-called performance anomaly is a well-known issue. Several works have tried to solve this problem by introducing mechanisms such as packet fragmentation, backoff adaptation, or packet aggregation during a fixed time interval. In this article, we present and thoroughly analyze PAS, a dynamic and distributed approach solving the performance anomaly problem. PAS is based on packets' aggregation using a dynamic time interval, which depends on the wireless channel occupation time perceived by each node. Since each station senses the medium independently, this makes PAS a totally distributed solution. Even more, PAS may coexist with standard IEEE 802.11 nodes without any particular adaptation, yet being able to improve performance. Our solution differs from other propositions in the literature because of its dynamic and distributed nature, which makes it suitable in the context of multi-hop networks. Furthermore, it allows increasing fairness, reactivity, and in some cases efficiency. In this article, we thoroughly analyze and emphasize the performance evaluation of our proposal.
SIP security problems in NGM Services
Authors: Ferenc Leitold, Anna Medve, Levente Kovacs
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

A variety of wireless interfaces are available to access Internet content in a heterogeneous network composed by technologies with limited QoS abilities. Performance increasing solutions become economic in specific parts of the network architecture, as the network sizes and the clients' numbers increase. SIP is used to locate the called party to check that the capabilities of the calling and called parties are consistent and to establish and control the connection. In this paper, we propose an addition to the SIP header/message compression methodology to improve the network QoS by implementations of SIP protocol quality options. We also deal with related SIP security issues regarding practicality and realization possibilities. This paper would like to highlight that security vulnerabilities, open problems may exist using the SIP protocol in usual cases of the practical usage.
Multidimensional Height-Balanced Trees
Authors: V. K. Vaishnavi
Venue: IEEE Transactions on Computers (1984)

A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown that the data structure can be used to manage a set of n k-dimensional records or data items such that the records can be searched or updated in O(log2 n) + k time, which is optimal. The data structure is a multidimensional generalization of the height-balanced trees and retains much of their simplicity and efficiency. The insertion algorithm, in particular, retains a very important property of the height-balanced trees: an insertion of a record results in the application of a restructuring operation at most once.
Inaudible watermarking via phase manipulation of random frequencies
Authors: P. Y. Liew, M. A. Armand
Venue: Multimedia Tools and Applications (2007)

Watermarking technology can be beneficial in digital rights protection. However, the industry's acceptance of the technology has been lukewarm as experts have been able to hear audible artifacts introduced during the watermarking process. In this paper, we present what we believe to be a truly inaudible solution to this problem. Our proposed watermarking technique embeds the watermark signal in the phase of an audio signal, with secrecy as to which frequency components carry the watermark bits, achieved via a pseudorandom generator. Inaudibility is realized by exploiting the human auditory system's insensitivity to absolute phase. Further, our algorithm includes a novel mechanism for segmenting an audio signal into variable frame-lengths to provide robustness against de-synchronization attacks such as jitter and time-scaling. It uses a short-time Fourier transform to first characterize local changes in the frequency content of an audio signal, from which, pairs of frequencies satisfying specified conditions are identified, to mark the start and end of a segment. The insertion of synchronization marks adds further robustness against such attacks. Robustness against other common attacks may be further enhanced through the use of concatenated error-control codes which enable the correction of random and/or burst errors, which may be introduced during an attack.
State Assignments for Asynchronous Sequential Machines
Authors: Chung-Jen Tan
Venue: IEEE Transactions on Computers (1971)

In this paper, a heuristic state assignment algorithm for asynchronous sequential machines is presented. Machines realized by this assignment scheme will result in circuits having a small amount of gate inputs and operating in single transition time. It is also shown that for a flow table having m1input columns, m input variables, and d stable states, the number of gate inputs required
Student perceptions of reflections as an aid to learning
Authors: Arnold Pears, Lars-Åke Larzon
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

An important aspect in any learning situation is the approach that students take to learning. Studies in the 1980's built an increasingly convincing case for the existance of three learning approaches; deep, surface and achieving. These approaches are not mutually exclusive, and a single student may use any or all of them in combination. In addition, a connection has been demonstrated between deep learning approaches and understanding of the material being learned. Encouraging deep learning behaviour, however, is a much more complex issue, since choice of learning approach seems to be dependent on the manner in which the student experiences the learning environment. This paper explores the use of reflections in the instructional design of two computing courses based on the text of the reflections and student feedback regarding the reflection exercise collected through surveys and interviews. Student's learning approaches are infered from a textual analysis of the reflection texts. Results describing student's perceptions of the utility of reflections as a learning tool are explored using interview data collected from students in one of the study cohorts.
A Novel Classification-Rejection Sphere SVMs for Multi-class Classification Problems
Authors: Qiang Wu, Chuanying Jia, Wenying Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

A new algorithm called classification-rejection sphere support vector machines (C-R sphere SVMs) is proposed based on the human thoughts of recognition and support vector machine (SVM) technology for multi-class classification problems. The new algorithm constructs a classifying sphere for each class instead of a minimum sphere. Like human being, C-R sphere SVMs can not only classify the multi-class data but reject the data which do not belong to any class known. In comparison with hyperplane SVMs, the algorithm can construct a new classifying sphere for a new class without affecting other classifying spheres so that it can reduce computational complexity obviously. The effect of the increment coefficient \lambda and Gaussian kernel parameter ó on the performance of C-R sphere SVMs is analyzed. Numerical simulations are performed on a real dataset (from the UCI dataset repository). The results show that the C-R sphere SVM algorithm exhibits good performance when appropriate values of \lambda and \sigma are taken.
Energy-Aware Scheduling Tasks on Chip Multiprocessor
Authors: Lei Miao, Yong Qi, Di Hou, Yuehua Dai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents a two-stage energy-aware schedule strategy to solve the problem of effective scheduling task set with interdependence on chip multiprocessor (CMP) system while saving energy. We propose a tri-dimensional coding based hybrid genetic algorithm (TCH) to allocate the task set on processor cores to minimize the execution time. Compared with traditional genetic algorithm, TCH uses the tri-dimensional coding scheme to match the architectural characteristics of CMP. We represent a heuristic algorithm using dynamic voltage scaling (DVS) method to reduce the system energy consumption. The simulation experimental results demonstrate that the strategy proposed in this paper efficiently allocates and schedules the tasks on CMP system.
Can Programmers Reuse Software?
Authors: S. N. Woodfield
Venue: IEEE Software (1987)

An experiment asked programmers untrained in reuse to evaluate component reusability. They did poorly. Are reusability's promises hollow? Or are there some answers?
Sponsored Search: Is Money a Motivator for Providing Relevant Results?
Authors: Bernard J. Jansen, Amanda Spink
Venue: Computer (2007)

Analysis of data from a major metasearch engine reveals that sponsored-link click-through rates appear lower than previously reported. Combining sponsored and nonsponsored links in a single listing, while providing some benefits to users, does not appear to increase clicks on sponsored listings.
Introduction
Authors: Alan Burns, Andy Wellings
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

The goals of this session were to &bull; Discuss implementation experience with the new realtime features &bull; Review the support provided by the new real-time features &bull; Review features proposed but omitted from Ada 2005
A simulated annealing algorithm for multiple sequence alignment with guaranteed accuracy
Authors: Hongwei Huo, Vojislav Stojkovic
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

For multiple sequence alignment problem in molecular biological sequence analysis, when input sequence number is very large, many heuristic algorithms have been proposed to improve the computation speed and the quality of alignment. We present a novel algorithm SASAlign for multiple sequence alignment. This can guarantee that the multiple alignment obtained from the SASAlign is within a factor of two from the optimal multiple sequence alignment. Experimental results show that the proposed algorithm is feasible, as the SASAlign algorithm outperforms the HMMT and SA for most of the cases and is competitive with the other methods, such as ClustalW, SAGA, MultAlign, and DiAlign.
A Proposal of Anonymous IEEE802.1X Authentication Protocol for Wireless Networks
Authors: Nobuo Funabiki, Toru Nakanishi, Hideo Takahashi, Kouhei Miki, Jun Kawashima
Venue: Proceedings of the 2006 2nd IEEE Workshop on Secure Network Protocols (2006)

Recently, wireless network services ar e available at a variety of public spaces such as stations, air ports, and hotels. In such services, the IEEE802.1X-based authentication protocol has been often used to permit only register ed users in network connections. However, this protocol allows Inter net service providers (ISPs) to collect the privacy information of users such as their access locations and network service use records. Besides, ISPs have to keep in secret the personal information of their users for authentication, although they only need the legitimacy of them. To solve these problems, this paper presents an anonymous authentication protocol based on IEEE802.1X. The group signatur e scheme is adopted to anonymously verify the legitimacy of users, wher eas misbeha ving users can be traced in case. We implement the proposed protocol by modifying open sour ce softwar es for IEEE802.1X and verify the effectiveness in terms of the processing time and the pack et size.
A 1.8-V 91-dB DR second-order ΣΔ modulator in 0.18-μm CMOS technology
Authors: Juan M. Carrillo, Miguel A. Montecelo, Harald Neubauer, Hans Hauer, J. Francisco Duque-Carrillo
Venue: Analog Integrated Circuits and Signal Processing (2007)

This paper deals with the implementation of a second-order ΣΔ modulator in 0.18-μm CMOS technology. The analog-to-digital converter structure combines a 1-bit approach along with a high oversampling ratio (OSR). A silicon circuit prototype, including the modulator itself, a current reference, and the clock signals generator, was designed to operate with a 1.8-V supply, fabricated and tested. Measured values of 87 dB and 91 dB were obtained for the signal-to-noise-plus-distortion ratio (SNDR) and the dynamic range (DR), respectively, for a clock frequency of 8 MHz and an OSR of 256. The effective number of bits (ENOB) was above 14. The experimental performance of the ΣΔ modulator maintains a good level over a modulator clock range higher than 16 MHz, featuring an ENOB equal to 13 at 16 MHz.
A semantic framework for open processes
Authors: P. Baldan, A. Bracciali, R. Bruni
Venue: Theoretical Computer Science (2007)

We propose a general methodology for analysing the behaviour of open systems modelled as coordinators, i.e., open terms of suitable process calculi. A coordinator is understood as a process with holes or placeholders where other coordinators and components (i.e., closed terms) can be plugged in, thus influencing its behaviour. The operational semantics of coordinators is given by means of a symbolic transition system, where states are coordinators and transitions are labeled by spatial/modal formulae expressing the potential interaction that plugged components may enable. Behavioural equivalences for coordinators, like strong and weak bisimilarities, can be straightforwardly defined over such a transition system. Different from other approaches based on universal closures, i.e., where two coordinators are considered equivalent when all their closed instances are equivalent, our semantics preserves the openness of the system during its evolution, thus allowing dynamic instantiation to be accounted for in the semantics. To further support the adequacy of the construction, we show that our symbolic equivalences provide correct approximations of their universally closed counterparts, coinciding with them over closed components. For process calculi in suitable formats, we show how tractable symbolic semantics can be defined constructively using unification.
An overview of evolutionary algorithms in multiobjective optimization
Authors: Carlos M. Fonseca, Peter J. Fleming
Venue: Evolutionary Computation (1995)

The application of evolutionary algorithms (EAs) in multiobjective optimization is currently receiving growing interest from researchers with various backgrounds. Most research in this area has understandably concentrated on the selection stage of EAs, due to the need to integrate vectorial performance measures with the inherently scalar way in which EAs reward individual performance, that is, number of offspring. In this review, current multiobjective evolutionary approaches are discussed, ranging from the conventional analytical aggregation of the different objectives into a single function to a number of population-based approaches and the more recent ranking schemes based on the definition of Pareto optimality. The sensitivity of different methods to objective scaling and/or possible concavities in the trade-off surface is considered, and related to the (static) fitness landscapes such methods induce on the search space. From the discussion, directions for future research in multiobjective fitness assignment and search strategies are identified, including the incorporation of decision making in the selection procedure, fitness sharing, and adaptive representations.
Segmentation of Color Images Using Multi-FART Network
Authors: Dou Yiwen, Ma Guobing
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

This paper proposed a multi-FART neural network for color image segmentation. The network received three transformed color components - hue, value and saturation. Then, using multi-FART network categorical ability, its output will send the categorized values to the decision layer. After combined post-processing, the right categorization of color vector is output from the last layer. Compared with color watershed algorithm, experiments on color image show promising results.
GeoHealth: a location-based service for nomadic home healthcare workers
Authors: Claus M. Christensen, Jesper Kjeldskov, Klaus K. Rasmussen
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

In this paper, we describe GeoHealth - a geographical information system prototype for home healthcare workers who during a normal workday have to attend clients and patients that are physically distributed over a large geographical area. Informed by field studies of work activities and interviews with the healthcare workers, we have designed an interactive location-based service for supporting distributed mobile collaboration. The prototype explores a representational approach to context-awareness and represents live contextual information about clients/patients, co-workers, current and scheduled work activities, and alarms adapted to the users' location. The prototype application is web-based and uses Google Maps, GPS positioning, and Web 2.0 technology to provide a lightweight dynamic and interactive representation of the work domain supporting distributed collaboration, communication, and peripheral awareness among nomadic workers.
A Type System Based on End-User Vocabulary
Authors: Robin Abraham, Martin Erwig, Scott Andrew
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

In previous work we have developed a system that automatically checks for unit errors in spreadsheets. In this paper we describe our experiences using the system in a workshop on spreadsheet safety aimed at high school teachers and students. We present the results from a think-aloud study we conducted with five high school teachers and one high school student as the subjects. The study is the first ever to investigate the usability of a type system in spreadsheets. We discovered that end users can effectively use the system to debug a variety of errors in their spreadsheets. This result is encouraging given that type systems are difficult even for programmers. Since the subjects had difficulty debugging "non-local" unit errors, we devised new methods to improve the error-location inference. We also extended the system to generate change suggestions for cells with unit errors, which when applied, would correct unit errors. These extensions solved the problem that the study revealed in the original system.
Evolution towards an ATD multiservice network
Authors: M. Littlewood, I. D. Gallagher, J. L. Adams
Venue: BT Technology Journal (2007)

Public networks will continue to evolve in order to provide additional services and to make use of emerging technologies. This evolution is being directed toward multiservice networks which allow the cheaper introduction of new services. Asynchronous time division (ATD) techniques are preferred as the basis for implementing multiservice networks, such as LANs, because they can provide full service integration, rate adaption and the statistical multiplexing of variable bit rate services.This paper outlines some gradual evolutionary paths which are directed toward a single ATD multiservice network and could provide immediate benefits. An eventual ATD network could be expected to use short fixed length packets, a mixture of datagram and virtual circuit techniques and a mixture of switch architectures in order to most economically meet the requirements of a public network. The Orwell protocol, developed within British Telecom, provides a means of meeting the performance requirements of such a network.
A Neural Network Ensemble Approach for the Recognition of SPC Chart Patterns
Authors: Jianbo Yu, Lifeng Xi, Bin Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Unnatural patterns exhibited by control charts can be associated with certain assignable causes for process variation. Hence, accurately recognizing control chart patterns (CCPs) can significantly narrow down the scope of possible causes, and speeds up the troubleshooting process. This paper proposes a selective neural network (NN) ensemble approach DPSOEN, which employs a collection of several NNs trained for CCP identifications. DPSOEN provides more simple training and better performance than single NN. To further improve the performance of recognizers, several statistical features extracted from raw observations are used in the representation of input features. The simulation results indicate that integration of raw data and statistical features-based DPSOEN shows the best performance. Analysis from this study provides guidelines in developing NN ensemble-based SPC recognition systems.