ppxscal/embedding_network huggingface dataset:
Two hardware-based approaches for deterministic multiprocessor replay
Authors: Derek R. Hower, Pablo Montesinos, Luis Ceze, Mark D. Hill, Josep Torrellas
Venue: Communications of the ACM (2009)

Modern computer systems are inherently nondeterministic due to a variety of events that occur during an execution, including I/O, interrupts, and DMA fills. The lack of repeatability that arises from this nondeterminism can make it difficult to develop and maintain correct software. Furthermore, it is likely that the impact of nondeterminism will only increase in the coming years, as commodity systems are now shared-memory multiprocessors. Such systems are not only impacted by the sources of nondeterminism in uniprocessors, but also by the outcome of memory races among concurrent threads. In an effort to help ease the pain of developing software in a nondeterministic environment, researchers have proposed adding deterministic replay capabilities to computer systems. A system with a deterministic replay capability can record sufficient information during an execution to enable a replayer to (later) create an equivalent execution despite the inherent sources of nondeterminism that exist. With the ability to replay an execution verbatim, many new applications may be possible: Debugging: Deterministic replay could be used to provide the illusion of a time-travel debugger that has the ability to selectively execute both forward and backward in time. Security: Deterministic replay could also be used to enhance the security of software by providing the means for an in-depth analysis of an attack, hopefully leading to rapid patch deployment and a reduction in the economic impact of new threats. Fault Tolerance: With the ability to replay an execution, it may also be possible to develop hot-standby systems for critical service providers using commodity hardware. A virtual machine (VM) could, for example, be fed, in real time, the replay log of a primary server running on a physically separate machine. The standby VM could use the replay log to mimic the primary's execution, so that in the event that the primary fails, the backup can take over operation with almost zero downtime.
Self-interruption on the computer: a typology of discretionary task interleaving
Authors: Jing Jin, Laura A. Dabbish
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

The typical information worker is interrupted every 12 minutes, and half of the time they are interrupting themselves. However, most of the research on interruption in the area of human-computer interaction has focused on understanding and managing interruptions from external sources. Internal interruptions -- user-initiated switches away from a task prior to its completion -- are not well understood. In this paper we describe a qualitative study of self-interruption on the computer. Using a grounded theory approach, we identify seven categories of self-interruptions in computer-related activities. These categories are derived from direct observations of users, and describe the motivation, potential consequences, and benefits associated with each type of self-interruption observed. Our research extends the understanding of the self-interruption phenomenon, and informs the design of systems to support discretionary task interleaving on the computer.
Active Vibration Control of Flexible Structures Using Piezoelectric Materials
Authors: Jingjun Zhang, Lili He, Ercheng Wang, Ruizhen Gao
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Considerable attentions have been devoted recently to active vibration control using intelligent materials as sensors/actuators. This paper presents results on active control schemes for vibration suppression of flexible cantilever beam with bonded piezoelectric sensors and actuators. State equations which the generalized modal coordinates as variables are built.With the piezoelectric elements are surface-bonded near the same position to the fixed end of flexible cantilever beam, two active vibration control methods such as Linear Quadratic Gauss (LQG) optimal control and robust H∞ control are investigated. Finally, the simulation results are given to demonstrate the effectiveness of the control method in this paper, compared with the LQG control method, robust H control has strong robustness to modal parameters variation, and it has a good closed-loop dynamic performance, can suppress the vibration better at the circumstance of the system with uncertainty factors.
3D game programming as service-learning for CS students
Authors: Kris Stewart
Venue: Journal of Computing Sciences in Colleges (2009)

This talk presents the upper division, university curriculum that has been developed over three years of teaching a topics class that engages our current raised digital (see 3.1.2) undergraduates to demonstrate their creativity through programming a game that can be used in alternate situations. This has been deployed in a high school physics course to demonstrate "Projectile Motion under Magnetic Force".
Performance of function point analysis through UML modeling
Authors: Vipin Saxena, Manish Shrivastava
Venue: ACM SIGSOFT Software Engineering Notes (2009)

In software development, estimation of software size is one of the major activities. Various types of metrics are available for computation of software size. It is necessary to check the performance of each metric. Lines of code, objects and function point analysis are widely used for measurements of software size, cost and schedule of development. The Function Point (FP) Analysis is one of the most promising techniques for measuring the functionality delivered by a system. Mostly, this method is used with traditional software development practices but can also be applied for object-oriented software development. The present paper deals with judging of the performance of function point analysis for the object-oriented software systems by the use of well know Unified Modeling Language (UML). A case study of Web-based Document Management System is reported for FP analysis through UML class diagram.
Designing a text parsing programme for a specialized bilingual online dictionary
Authors: Livia Sangeorzan, Marinela Burada, Kinga Kiss Iakab
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The main topic of this contribution is the description of one particular stage in the process of online dictionary development: the design of a reliable, customized parsing tool used in the selection of the relevant lexicographic input to be included in an online bilingual dictionary of terminology associated with European Community legal texts. Starting with a succinct reference to a number of problems found in the macrostructure and interstructure of bilingual/multilingual online dictionaries involving the English and Romanian domains, we go on to discuss the criteria, principles, approach and steps that the design of this particular component of our software support system is based on.
Taming the Wild Child: From Living Hell to Living Well
Authors: Aaron Lederer
Venue:  (2008)

Is your child impossible to control? Have you tried time-out, behavior modification, therapy, medication, all to no avail? If so, you need to read Taming the Wild Child. Psychoanalyst Aaron Lederer has devoted his entire professional life to developing ways for mothers to rescue their out-of-control children. He calls his method "corrective communication" and says, "If you want to change a child, just change the way you communicate with him." In Taming the Wild Child, you will discover how mothers use Lederer's corrective communication to bring about dramatic improvement in their children within just four to six weeks. After a few months, their children typically turn completely around. When you apply these techniques, you will see: -Why your child needs some time free of pressure to change. -Why punishing backfires and rewarding fails. -How to talk to your child in ways that make him want to cooperate. -How to get your child to assist in his own recovery. Inspiring and motivating, Taming the Wild Child is filled with real-life examples of harrowing experiences and amazing transformations that will give you the hope and the confidence you need to bring your own lost child home.
Simulation-based optimization for the quay crane scheduling problem
Authors: Pasquale Legato, Rina Mary Mazza, Roberto Trunfio
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should be optimized in a dynamic, non deterministic environment. The assignment of expensive quay cranes to multiple vessel-holds for container discharging and loading operations is a major problem, whose solution affects the operational performance of the whole terminal container. In OR literature, this problem is known as the quay crane scheduling problem. With the objective of minimizing the vessel's overall completion time, we first give our IP formulation and then, under the more realistic assumption that discharge-loading times are non deterministic, we focus on a simulation-based optimization approach which embodies the IP formulation. Two different simulation optimization algorithms are tailored to the problem: simulated annealing and adaptive balanced explorative and exploitative search. Preliminary numerical results are presented on real vessel data.
Incremental construction of classifier and discriminant ensembles
Authors: Aydın Ulaş, Murat Semerci, Olcay Taner Yıldız, Ethem Alpaydın
Venue: Information Sciences: an International Journal (2009)

We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier is used for some classes only. We investigate criteria including accuracy, significant improvement, diversity, correlation, and the role of search direction. For discriminant ensembles, we test subset selection and trees. Fusion is by voting or by a linear model. Using 14 classifiers on 38 data sets, incremental search finds small, accurate ensembles in polynomial time. The discriminant ensemble uses a subset of discriminants and is simpler, interpretable, and accurate. We see that an incremental ensemble has higher accuracy than bagging and random subspace method; and it has a comparable accuracy to AdaBoost, but fewer classifiers.
eKISS: sharing experiences in families through a picture blog
Authors: Thomas Dalsgaard, Mikael B. Skov, Bo Ramsdahl Thomassen
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

Contemporary family life can be very stressful and many families are often busy and separated by time or distance. Physical separation makes it difficult to maintain an awareness of each other and the feeling of intimacy. But lack of such intimacy can result in insecure and troubled children. This paper outlines eKISS, a picture weblog for mediating intimacy between children and parents. eKISS supports asynchronous sharing of experiences from the children to their parents while being physically separated. Communication is based on pictures and text sent through mobile technology and shared on a weblog available to the family. A longitudinal field evaluation revealed that eKISS was able to support acts of intimacy by providing insight, new communication channel, and the possibility to easily share experiences. It also revealed that eKISS was most useful when the family was separated for longer periods of time.
Towards a precise semantics for authenticity and trust
Authors: Reto Kohlas, Jacek Jonczy, Rolf Haenni
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

In an a priori anonymous digitized world, notions such as authenticity and trust are of paramount importance. Unfortunately, the exact meaning of such key terms has never been consistently defined, and they are often used in an ambiguous way. In this paper, we introduce a new model for representing these fundamental notions in the context of rating systems in e-business applications as well as for public-key certification. When applied to existing systems, its goal is to shed light on the implicit assumptions actually made by the participants. As an example, we show that for the rating system used in eBay, there are a number of such implicit assumptions on which the drawn conclusions depend. A second example is PGP, where it turns out that the meaning of the (syntactically well-defined) certificates is not entirely clear.
Robust result merging using sample-based score estimates
Authors: Milad Shokouhi, Justin Zobel
Venue: ACM Transactions on Information Systems (TOIS) (2009)

In federated information retrieval, a query is routed to multiple collections and a single answer list is constructed by combining the results. Such metasearch provides a mechanism for locating documents on the hidden Web and, by use of sampling, can proceed even when the collections are uncooperative. However, the similarity scores for documents returned from different collections are not comparable, and, in uncooperative environments, document scores are unlikely to be reported. We introduce a new merging method for uncooperative environments, in which similarity scores for the sampled documents held for each collection are used to estimate global scores for the documents returned per query. This method requires no assumptions about properties such as the retrieval models used. Using experiments on a wide range of collections, we show that in many cases our merging methods are significantly more effective than previous techniques.
LBF: A Labeled-Based Forecasting Algorithm and Its Application to Electricity Price Time Series
Authors: Francisco Martínez-Álvarez, Alicia Troncoso, José C. Riquelme, Jesús S. Aguilar-Ruiz
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

A new approach is presented in this work with the aim of predicting time series behaviors. A previous labeling of the samples is obtained utilizing clustering techniques and the forecasting is applied using the information provided by the clustering. Thus, the whole data set is discretized with the labels assigned to each data point and the main novelty is that only these labels are used to predict the future behavior of the time series, avoiding using the real values of the time series until the process ends. The results returned by the algorithm, however, are not labels but the nominal value of the point that is required to be predicted. The algorithm based on labeled (LBF) has been tested in several energy-related time series and a notable improvement in the prediction has been achieved.
The GreatSPN tool: recent enhancements
Authors: Soheib Baarir, Marco Beccuti, Davide Cerotti, Massimiliano De Pierro, Susanna Donatelli, Giuliana Franceschinis
Venue: ACM SIGMETRICS Performance Evaluation Review (2009)

GreatSPN is a tool that supports the design and the qualitative and quantitative analysis of Generalized Stochastic Petri Nets (GSPN) and of Stochastic Well-Formed Nets (SWN). The very first version of GreatSPN saw the light in the late eighties of last century: since then two main releases where developed and widely distributed to the research community: GreatSPN1.7 [13], and GreatSPN2.0 [8]. This paper reviews the main functionalities of GreatSPN2.0 and presents some recently added features that significantly enhance the efficacy of the tool.
On adaptive time stepping for large-scale parabolic problems: Computer simulation of heat and mass transfer in vacuum freeze-drying
Authors: K. Georgiev, N. Kosturski, S. Margenov, J. Starý
Venue: Journal of Computational and Applied Mathematics (2009)

The work is motivated by the problem of freeze-drying, which is a process of dehydrating frozen materials by sublimation under high vacuum. In particular, it concerns the mathematical modelling and computer simulation of the heat and mass transfer with the core in solving the time-dependent nonlinear partial differential equation of parabolic type. Instead of a uniform discretization of the considered time interval, an adaptive time-stepping procedure is applied in an effort to optimize the whole simulation. The procedure is based on the local comparison of the Crank-Nicolson and backward Euler approximations. The results of numerical experiments performed on a selected real-life problem are included.
Neural Network Representation for the Forces and Torque of the Eccentric Sphere Model
Authors: Mostafa Y. Elbakry, Mohammed El-Helly, Mahmoud Y. Elbakry
Venue: Transactions on Computational Science III (2009)

An artificial neural network (ANN) has been designed to simulate and predict the torque and force acting on the outer stationary sphere due to steady state motion of the second order fluid between two eccentric spheres by a rotating inner sphere with an angular velocity ¿ The (ANN) model has been trained based on the experimental data to produce the torque and force at different eccentricities. The experimental and trained torque and force are compared .The designed ANN shows a good match to the experimental data.
Computer-assisted pit-pattern classification in different wavelet domains for supporting dignity assessment of colonic polyps
Authors: Michael Häfner, Roland Kwitt, Andreas Uhl, Friedrich Wrba, Alfred Gangl, Andreas Vécsei
Venue: Pattern Recognition (2009)

In this paper, we show that zoom-endoscopy images can be well classified according to the pit-pattern classification scheme by using texture-analysis methods in different wavelet domains. We base our approach on three different variants of the wavelet transform and propose that the color channels of the RGB and LAB color model are an important source for computing image features with high discriminative power. Color-channel information is incorporated by either using simple feature vector concatenation and cross-cooccurrence matrices in the wavelet domain. Our experimental results based on k-nearest neighbor classification and forward feature selection exemplify the advantages of the different wavelet transforms and show that color-image analysis is superior to grayscale-image analysis regarding our medical image classification problem.
Fujimaki-Takahashi Squeeze: Linear Time Construction of Constraint Graphs of Floorplan for a Given Permutation
Authors: Toshihiko Takahashi, Ryo Fujimaki
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. We call a floorplan room-to-room when adjacencies between rooms are considered. Fujimaki and Takahashi showed that any room-to-room floorplan can be represented as a permutation. In this paper, we give an O(n)-time algorithm that constructs the vertical and the horizontal constraint graphs of a floorplan for a given permutation under this representation.
Multi-product lot merging/splitting algorithms for a semiconductor wafer fabrication
Authors: June-Young Bang, Jae-Hun Kang, Bong-Kyun Kim, Yeong-Dae Kim
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper focuses on a lot merging/splitting problem in a semiconductor wafer fabrication facility. In the fab, two or more lots can be merged into a single lot if routes and all the processing conditions of the lots are the same for a number of subsequent operations, and the merged lot is split into the original lots at the point where the routes or processing conditions become different. We suggest lot merging/splitting algorithms to reduce the total tardiness of orders and the cycle times of the lots. The suggested algorithms are evaluated through a series of simulation experiments and the result shows that the algorithms work better than a method used in a real fab.
Rough Set Algebras as Description Domains
Authors: Jānis Cīrulis
Venue: Fundamenta Informaticae (2009)

Study of the so called knowledge ordering of rough sets was initiated by V.W. Marek and M. Truszczynski at the end of 90-ies. Under this ordering, the rough sets of a fixed approximation space form a domain in which every set &darr; is a Boolean algebra. In the paper, an additional operation inversion on rough set domains is introduced and an abstract axiomatic description of obtained algebras of rough set is given. It is shown that the resulting class of algebras is essentially different from those traditional in rough set theory: it is not definable, for instance, in the class of regular double Stone algebras, and conversely.
A latent variable regression model for capture-recapture data
Authors: Joanne Thandrayen, Yan Wang
Venue: Computational Statistics Data Analysis (2009)

Capture-recapture methods are used to estimate the prevalence of diseases in the field of epidemiology. The information used for estimation purposes are available from multiple lists, whereby giving rise to the problems of list dependence and heterogeneity. In this paper, modelling is focused on the heterogeneity part. We present a new binomial latent class model which takes into account both the observed and unobserved heterogeneity within capture-recapture data. We adopt the conditional likelihood approach and perform estimation via the EM algorithm. We also derive the mathematical expressions for the computation of the standard error of the unknown population size. An application to data on diabetes patients in a town in northern Italy is discussed.
Cardinality constrained and multicriteria (multi)cut problems
Authors: C. Bentz, M. -C. Costa, N. Derhy, F. Roupin
Venue: Journal of Discrete Algorithms (2009)

In this paper, we consider multicriteria and cardinality constrained multicut problems. Let G be a graph where each edge is weighted by R positive costs corresponding to R criteria and consider k source-sink pairs of vertices of G and R integers B"1,...,B"R. The problem R-CriMultiCut consists in finding a set of edges whose removal leaves no path between the ith source and the ith sink for each i, and whose cost, with respect to the jth criterion, is at most B"j, for 1=
Analysis of the biological clock of Neurospora
Authors: Bálint Nagy
Venue: Journal of Computational and Applied Mathematics (2009)

A dynamical system describing the circadian fluctuation of a protein (FRQ) in Neurospora cells is investigated from the bifurcation point of view. The possible phase portraits and local bifurcations are studied. The saddle-node and Hopf-bifurcation curves are determined in the plane of two parameters using the parametric representation method. The number and the stability of the stationary points are determined. Using center manifold approximation we determine the Bautin-bifurcation point numerically.