ppxscal/embedding_network huggingface dataset:
Flexible modelling of random effects in linear mixed models-A Bayesian approach
Authors: Remus K. W. Ho, Inchi Hu
Venue: Computational Statistics Data Analysis (2008)

Flexible modelling of random effects in linear mixed models has attracted some attention recently. In this paper, we propose the use of finite Gaussian mixtures as in Verbeke and Lesaffre [A linear mixed model with heterogeneity in the random-effects population, J. Amu. Statist. Assoc. 91, 217-221]. We adopt a fully Bayesian hierarchical framework that allows simultaneous estimation of the number of mixture components together with other model parameters. The technique employed is the Reversible Jump MCMC algorithm (Richardson and Green [On Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion). J. Roy. Statist. Soc. Ser. B 59, 731-792]). This approach has the advantage of producing a direct comparison of different mixture models through posterior probabilities from a single run of the MCMC algorithm. Moreover, the Bayesian setting allows us to integrate over different mixture models to obtain a more robust density estimate of the random effects. We focus on linear mixed models with a random intercept and a random slope. Numerical results on simulated data sets and a real data set are provided to demonstrate the usefulness of the proposed method.
Functional-link net with fuzzy integral for bankruptcy prediction
Authors: Yi-Chung Hu, Fang-Mei Tseng
Venue: Neurocomputing (2007)

The classification ability of a single-layer perceptron could be improved by considering some enhanced features. In particular, this form of neural networks is called a functional-link net. In the output neuron's activation function, such as the sigmoid function, an inner product of a connection weight vector with an input vector is computed. However, since the input features are not independent of each other for the enhanced pattern, an assumption of the additivity is not reasonable. This paper employs a non-additive technique, namely the fuzzy integral, to aggregate performance values for an input pattern by interpreting each of the connection weights as a fuzzy measure of the corresponding feature. A learning algorithm with the genetic algorithm is then designed to automatically find connection weights. The sample data for bankruptcy analysis obtained from Moody's Industrial Manuals is considered to examine the classification ability of the proposed method. The results demonstrate that the proposed method performs well in comparison with traditional functional-link net and multivariate techniques.
Outlining Developers' Testing Process Model
Authors: Mira Kajko-Mattsson, Therez Bjornsson
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Most of the effort has been spent on formalizing processes for system testing. Little has been done regarding developers' unit and unit integration testing. In this paper, we study the routines of six developers when testing their software components. Our contribution is twofold. It first outlines a process model for unit and unit integration testing. It then provides feedback on the state of practice within six organizations.
Prototype based fuzzy classification in clinical proteomics
Authors: F. -M. Schleif, T. Villmann, B. Hammer
Venue: International Journal of Approximate Reasoning (2008)

Proteomic profiling based on mass spectrometry is an important tool for studies at the protein and peptide level in medicine and health care. Thereby, the identification of relevant masses, which are characteristic for specific sample states e.g. a disease state is complicated. Further, the classification accuracy and safety is especially important in medicine. The determination of classification models for such high dimensional clinical data is a complex task. Specific methods, which are robust with respect to the large number of dimensions and fit to clinical needs, are required. In this contribution two such methods for the construction of nearest prototype classifiers are compared in the context of clinical proteomic studies, which are specifically suited to deal with such high-dimensional functional data. Both methods are suitable to the adaptation of the underling metric, which is useful in proteomic research to get a problem adequate representation of the clinical data. In addition they allow fuzzy classification and for one of them allows fuzzy classified training data. Both algorithms are investigated in detail with respect to their specific properties. A performance analyses is taken on real clinical proteomic cancer data in a comparative manner.
Autoprobing on the L200 Functional Tester
Authors: Tim Moore, Stephen Garner
Venue: IEEE Design Test (1985)

The X-Y autoprobing process was developed to eliminate the need to manually probe prototype modules, and to diagnose productionmodules. The goal of the X-Y autoprobing process is to increase the throughput of the L200 functional tester by decreasingthe average diagnostic time, through automatic control of the probe's movement and positioning. The X-Y autoprobing systemsinstalled have demonstrated that the amount of time to probe manually can be reduced by a factor of ten.
Synthesis of Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops
Authors: H. Y. H. Chuang
Venue: IEEE Transactions on Computers (1973)

A synthesis method for multiple-input change asynchronous sequential machines is proposed. The method is based on the self-synchronization principle. The internal states are realized with edge-sensitive flip-flops which are triggered selectively. The new concept of selective triggering or controlled excitation results in considerable saving in logic and more flexible design. The state assignment is arbitrary, and the number of state variables required can be made absolutely minimum. A detailed comparison of the speed of operation is made with one of the well-known methods of realization. It is found that our realization is, in general, as fast, and sometimes could be even faster.
Application of the bootstrap method for estimation of the quantile function
Authors: B. V. Vishnyakov, A. I. Kibzun
Venue: Automation and Remote Control (2007)

The bootstrap method was used to reduce the sample volume at estimating the quantile function. Accuracy of the quantile sample estimate vs. the distribution of random variable was established analytically. A numerical example of calculation of the quantiles using the proposed bootstrap procedure for the uniform, normal, and Cauchy distributions was considered. An approximate formula for calculation of the quantile of the normal distribution was determined.
Towards an internet-scale XML dissemination service
Authors: Yanlei Diao, Shariq Rizvi, Michael J. Franklin
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Publish/subscribe systems have demonstrated the ability to scale to large numbers of users and high data rates when providing content-based data dissemination services on the Internet. However, their services are limited by the data semantics and query expressiveness that they support. On the other hand, the recent work on selective dissemination of XML data has made significant progress in moving from XML filtering to the richer functionality of transformation for result customization, but in general has ignored the challenges of deploying such XML-based services on an Internet-scale. In this paper, we address these challenges in the context of incorporating the rich functionality of XML data dissemination in a highly scalable system. We present the architectural design of ONYX, a system based on an overlay network. We identify the salient technical challenges in supporting XML filtering and transformation in this environment and propose techniques for solving them.
Application of Language Models to Suspect Prioritisation and Suspect Likelihood in Serial Crimes
Authors: Richard Bache, Fabio Crestani, David Canter, Donna Youngs
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Language Models are successfully applied to the problem of analysing crime descriptions from a police database with the purpose of prioritising suspects for an unsolved crime, given details of solved crimes. The frequency of terms in each description relates to the behaviour of the offender and this can be used to link crimes to a common offender. Language Modelling uses Bayes' theorem and thus require a prior probability. Such a prior can be based on each offender's past propensity to offend, derived from historic data. Language Modelling yields a probability of a document being relevant, which in this case is interpreted as the probability of a suspect being the culprit. Although the absolute value of the probability does not carry any direct applied implications, the study does show that the general likelihood of identification of the actual suspect does correspond to the relative values. Thus these probabilities can be used for more than just ranking suspects.
Fuzzy logic control of adaptive ARQ for video distribution over a bluetooth wireless link
Authors: R. Razavi, M. Fleury, M. Ghanbari
Venue: Advances in Multimedia (2007)

Bluetooth's default automatic repeat request (ARQ) scheme is not suited to video distribution resulting in missed display and decoded deadlines. Adaptive ARQ with active discard of expired packets from the send buffer is an alternative approach. However, even with the addition of cross-layer adaptation to picture-type packet importance, ARQ is not ideal in conditions of a deteriorating RF channel. The paper presents fuzzy logic control of ARQ, based on send buffer fullness and the head-of-line packet's deadline. The advantage of the fuzzy logic approach, which also scales its output according to picture type importance, is that the impact of delay can be directly introduced to the model, causing retransmissions to be reduced compared to all other schemes. The scheme considers both the delay constraints of the video stream and at the same time avoids send buffer overflow. Tests explore a variety of Bluetooth send buffer sizes and channel conditions. For adverse channel conditions and buffer size, the tests show an improvement of at least 4 dB in video quality compared to nonfuzzy schemes. The scheme can be applied to any codec with I-, P-, and (possibly) B-slices by inspection of packet headers without the need for encoder intervention.
Experimenting with buffer sizes in routers
Authors: Neda Beheshti, Jad Naous, Yashar Ganjali, Nick McKeown
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Recent theoretical results in buffer sizing research suggest that core Internet routers can achieve high link utilization, if they are capable of storing only a handful of packets. The underlying assumption is that the traffic is non-bursty, and that the system is operated below 85-90% utilization. In this paper, we present a test-bed for buffer sizing experiments using NetFPGA [2], a PCI-form factor board that contains reprogrammable FPGA elements, and four Gigabit Ethernet interfaces. We have designed and implemented a NetFPGA-based Ethernet switch with finely tunable buffer sizes, and an event capturing system to monitor buffer occupancies inside the switch. We show that reducing buffer sizes down to 20-50 packets does not necessarily degrade system performance.
Automating Product-Line Variant Selection for Mobile Devices
Authors: Jules White, Douglas C. Schmidt, Egon Wuchner, Andrey Nechypurenko
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Product-line architectures (PLAs) designed for mobile devices create a unique challenge for automated product variant selection engines since variants must be derived on-the-fly as devices are discovered. Current automation techniques do not incorporate device resource consumption constraints into variant selection and do not address how a PLA can be designed to improve automated variant selection speed. This paper presents a tool called Scatter whose input is (1) the requirements of PLA construction and (2) the resources available on a discovered mobile device and whose output is the optimal variant that can be deployed to the device. Scatter provides automatic variant selection based on configuration and resource constraints and also ensures that variant selection is optimal with regard to a configurable cost function. The paper presents our results from experiments with Scatter and how PLA design decisions affect a constraint-based variant selection engine's solving speed.
Engineering Rich Internet Application User Interfaces over Legacy Web Models
Authors: Marino Linaje, Juan Carlos Preciado, Fernando Sánchez-Figueroa
Venue: IEEE Internet Computing (2007)

A steadily growing trend in Web applications is the development of user interfaces through rich Internet applications. Among other capabilities, RIAs offer high interactivity and native multimedia support, giving them a major advantage over standard HTML. To update existing HTML Web applications, the authors propose the RUX-Model, which facilitates the user interface adaptation of existing Web 1.0 applications to Web 2.0. Their proposal focuses on new RIA capacities that exploit the data and business logic already provided in legacy Web models.
Transactive memory systems in organizations: Implications for knowledge directories
Authors: Paul Jackson, Jane Klobas
Venue: Decision Support Systems (2008)

This article describes a detailed case study in which the authors observed organizational Transactive Memory Systems (TMS). The concept of TMS was originally used to describe sets of directories that are used to locate, allocate and retrieve knowledge in pairs and small groups. Our case study of head office and distributed knowledge workers revealed that the basic TMS processes and directories appear to be present at an organizational level as well. The results imply that an organization can indeed be seen as a TMS and suggest that information systems which are intended to support TMS should be approached as a component within a complex and multi-dimensional information retrieval ecology.
Object Tracking at Multiple Levels of Spatial Resolutions
Authors: Son D. Tran, Larry S. Davis
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Tracking is usually performed at a single level of data resolution. This paper describes a multi-resolution tracking framework developed with efficiency and robustness in mind. Efficiency is achieved by processing low resolution data whenever possible. Robustness results from multiple level coarse-to-fine searching in the tracking state space. We combine sequential filtering both in time and resolution levels int a probabilistic framework. A color blob tracker is implemented and the tracking results are evaluated in a number of experiments.
First-year students' impressions of pair programming in CS1
Authors: Beth Simon, Brian Hanks
Venue: Journal on Educational Resources in Computing (JERIC) (2008)

Pair programming, as part of the Agile Development process, has noted benefits in professional software development scenarios. These successes have led to a rise in use of pair programming in educational settings, particularly in Computer Science 1 (CS1). Specifically, McDowell et al. [2006] has shown that students using pair programming in CS1 do better in a CS2 class (with solo programming) than students who don't pair in CS1. This paper seeks to address a similar question, but from a qualitative, student-focused approach. How do students define, experience, and value the pair programming experience? How do they experience and value it compared to solo programming? Does pairing in CS1 impact their confidence in their abilities? We report on semi-structured interviews with 11 subjects from two institutions where pair programming was used in CS1, and solo programming was used in the CS2. Many of the responses met our expectations; students get stuck less and explore more ideas while pairing, and believe that pair programming helped them in CS1. Other responses were more surprising. Students reported that when solo programming they were more confident and understood their programs better. Many students also said that they started work on their assignments earlier when soloing. Students also continue to use other students as resources even when working "solo."
Distributed Processing
Authors: A. van Dam
Venue: Computer (1978)

This issue of Computer is based on two workshops in distributed processing held at Brown University August 17-19, 1976, and August 3-5, 1977. Sponsored by the Army Research Office, the National Science Foundation, and the Office of Naval Research, the workshops attempted to define what distributed processing means and to develop a taxonomy of distributed processing applications and techniques. Achievements to date and outstanding research problems were examined in an attempt to find either commonality of problems and solutions or substantial differences.
A Simulation Based Fuzzy Goal Programming Model for Cell Formation
Authors: Ozgur Eski, Irem Ozkarahan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Cell formation decisions are made based on several factors such as machining times, utilization, workload, alternative routings, capacities, operation sequences. Most of the traditional Cell Formation procedures ignore the existence of stochastic production requirements and alternative routes. In this study, a simulation based Fuzzy Goal Programming model is proposed for solving cell formation problems considering stochastic production requirements and alternative routes. A tabu search based solution methodology is used for solution.
PeRSSonal's core functionality evaluation: Enhancing text labeling through personalized summaries
Authors: Christos Bouras, Vassilis Poulopoulos, Vassilis Tsogkas
Venue: Data Knowledge Engineering (2008)

In this manuscript we present the summarization and categorization subsystems of a complete mechanism that begins with web-page fetching and concludes with representation of the collected data to the end users through a personalized portal. The system intends to collect articles from major news portals and, following an algorithmic procedure, to create a more user friendly and personalized ''view'' of the articles. Before presenting the information back to the end user, the core of our mechanism automatically categorizes data and then extracts personalized summaries. We focalize to the core of the mechanism and more specifically, we present the algorithms used for the summarization and the categorization of texts. The algorithms are not utilized only for producing isolated data, targeted to a specific subsystem, but a combination of the algorithms, which achieves co-operation of the categorization and summarization mechanisms, is introduced in order to enhance text labeling through the personalized summaries that are constructed.
Understanding of informatics systems: a theoretical framework implying levels of competence
Authors: Peer Stechert
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

Informatics education is concerned with how learners make sense of computational processes and devices in secondary institutions. In this article, we describe a learner-centred cognitive approach to informatics system comprehension for upper secondary education. It is part of a broader research study initiated by experience in first year informatics (CS 1) education at university level. The approach is based on object-oriented design patterns as knowledge representation carrying networked fundamental ideas of informatics and supporting the learning process. We develop a framework for informatics system comprehension consisting of three dimensions, namely learners' competencies (the learner), principles of informatics systems (Informatics) and knowledge representation (Didactics of Informatics). We conclude by describing means to achieve different levels of competence for informatics system comprehension and assign learners' activities to every level of competence.
Special Feature the Computer Software Industry in Japan
Authors: D. Tajima
Venue: Computer (1981)

Traditionally, Japanese users have defined their own systems, but reliance on software houses is increasing.
Ultrasonic Holographic Fourier Spectroscopy via Optical Fourier Transforms
Authors: P. Greguss
Venue: IEEE Transactions on Computers (1975)

Holographic Fourier spectroscopy has been extended to ultrasonic radiation. A recently developed acoustical-to-optical conversion cell (AOCC) was used to display the spectroscopic hologram. Real-time optical Fourier transformation of the ultrasonic interferogram can be obtained.
Visual Discovery in Computer Network Defense
Authors: Anita D. D'Amico, John R. Goodall, Daniel R. Tesone, Jason K. Kopylec
Venue: IEEE Computer Graphics and Applications (2007)

Computer network defense (CND) requires analysts to detect both known and novel forms of attacks in massive volumes of network data. Visualization tools can potentially assist in the discovery of suspicious patterns of network activity and relationships between seemingly disparate security events, but few CND analysts are leveraging visualization technologies in their current practice. To address this, we created a new visualization framework, VIAssist, based on a comprehensive cognitive task analysis of CND analysts. We designed VIAssist to fit the work practices and operational environments of those analysts. This article describes the major visual analytic features of VIAssist that address the needs of CND analysts, including its coordinated visualizations and interactive report building capabilities. A scenario illustrates how it can be used to discover the unexpected in network flow data.
Information technology (IT) in Saudi Arabia: Culture and the acceptance and use of IT
Authors: Said S. Al-Gahtani, Geoffrey S. Hubona, Jijie Wang
Venue: Information and Management (2007)

The unified theory of acceptance and use of technology (UTAUT), a model of the user acceptance of IT, synthesizes elements from several prevailing user acceptance models. It has been credited with explaining a larger proportion of the variance of 'intention to use' and 'usage behavior' than do preceding models. However, it has not been validated in non-Western cultures. Using a survey sample collected from 722 knowledge workers using desktop computer applications on a voluntary basis in Saudi Arabia, we examined the relative power of a modified version of UTAUT in determining 'intention to use' and 'usage behavior'. We found that the model explained 39.1% of intention to use variance, and 42.1% of usage variance. In addition, drawing on the theory of cultural dimensions, we hypothesized and tested the similarities and differences between the North American and Saudi validations of UTAUT in terms of cultural differences that affected the organizational acceptance of IT in the two societies.