ppxscal/embedding_network huggingface dataset:
Healthy daily meal planner
Authors: Aynur Kahraman, H. Aydolu Seven
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

The purpose of this project is to develop a program that solves a bi-objective diet problem to propose the user a "healthy" daily meal according to some parameters specified by the user. The program will interact with the user via a graphical interface to receive information such as age and gender that is necessary to determine daily nutritional and energy requirements and also information on the preferences of the user among the dishes available. The user will be presented all the dishes and is expected to rate some of them on a scale from 1 to 10. The main goal is to present the user a combination of dishes that satisfies the daily nutritional requirements, minimizes the cost of the daily meal and maximizes the total rating of the meal. In this paper, first the diet problem is going to be introduced, then a genetic algorithm to solve the problem will be presented.
The sociology of computing in sociology
Authors: Hans Lee, Harry Perlstadt
Venue: ACM SIGSOC Bulletin (1975)

One of the consequences of the introduction and extension of computing in sociology is the division of sociologists into two antagonistic groups: the empiricists and the humanists. The empiricists expect the computer to be the basic vehicle of salvation, whereas the humanists believe the computer to be the incarnation of all that is evil. A prolonged battle over computation and the utilization of computers in sociology may widen the cleavage between the two groups and make their differences irreconcilable. The major purpose of this paper is to trace how computation in sociology has contributed to this political cleavage and to present a possible start towards a future synthesis.
DBXML - Connecting XML with Relational Databases
Authors: Ventzislav Tzvetkov, Xiong Wang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we introduce a software system, called DBXML that provides a transformation utility to connect XML with relational databases. The transformation utility can convert data both ways - from XML-Schema to relational database schema and from relational database schema to XML-Schema. In the meantime it performs conversions between the data in the XML documents and the relational database. XML-Schema as defined by the World Wide Web Consortium is used to enforce data type constraints and primary/foreign key relationships in the generated XML document. Most similar systems support conversion between relational databases and the Document Type Definitions (DTD). The XML-Schema is preferred over DTD for several reasons, such as customizable data types, stricter XML structures, and ability to enforce referential constraints. The system has a simple GUI (Graphical User Interface) that currently works on all versions of Windows. It can be extended to support other platforms, operating systems, and RDBMS.
Training Sequence Aided Signature Waveform Estimation
Authors: Hasan Amca, Ahmet Rizaner, Kadri Hacioğlu Ali H. Ulusoy
Venue: Wireless Personal Communications: An International Journal (2006)

In code division multiple access channels multiuser detection techniques are known to be effective strategies to counter the presence of multiuser interference towards improving spectral efficiency. Generally, multiuser detectors can provide excellent performance only when the signature waveforms of all users are precisely known. Hence, the estimation of signature waveforms is a challenging issue in mobile communication systems. In this paper, we compare the performance of two short training sequence aided signature waveform estimators. One is maximum likelihood type signature waveform estimator that requires the knowledge of spreading sequences and short training sequences. The other estimator is recently proposed based on subspace method and requires the knowledge of training sequences only. Through the simulations, we show the signature waveform estimation performance of both systems and the effect of the estimation error on the performance of a multiuser detector. The complexity comparisons of both systems are also given.
The bivariate beta distribution: comparison of Monte Carlo generators and evaluation of parameter estimates
Authors: James H. Macomber, Buddy L. Myers
Venue: ACM SIGSIM Simulation Digest (1983)

The bivariate and multivariate beta distributions may provide appropriate stochastic models for a number of processes, particularly those involving random proportions. Researchers may therefore find it necessary to estimate the parameters of such distributions or generate Monte Carlo samples with known parameter values. Two possible generating technique for beta bivariates are presented and compared in this paper. Estimating equations for the three parameters of the bivariate beta distribution are presented. These use the method of moments, the only tractable estimating techniques and an analysis of their properties is also presented.This paper focuses on the bivariate beta distribution, but a user of a higher-dimensioned beta model will be able to make use of the discussion herein to provide assistance in determining many of the properties of such a model.
Using Agent Technology for Coordination in Loose Inter-Organizational Workflow
Authors: Eric Andonoff, Lotfi Bouzguenda, Chihab Hanachi, Christophe Sibertin-Blanc
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

This paper deals with coordination in the context of loose Inter-Organizational Workflow (IOW). The aim of IOW is to support the cooperation between business processes running in different organizations. Loose IOW refers to occasional cooperation between organizations, free of structural constraints, where the organizations involved and their number are not predefined. This paper shows that the agent technology is appropriate to coordinate business processes in the context of loose IOW. More precisely, this paper proposes an agent-oriented architecture, compliant with the Workflow Management Coalition reference architecture, which represents business processes as agents and uses mediators to coordinate them. This paper also defines an agent-oriented organizational model that describes the business processes coordination according to the Agent-Group-Role meta model.
A Capability-Based Transparent Cryptographic File System
Authors: Frank Graf, Stephen D. Wolthusen
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Data on the file system in mobile internetworked working environments are exposed data to a number of threats ranging from physical theft of storage devices to industrial espionage and intelligence activities. This paper describes a fully transparent, capability-based file system security mechanism for use in heterogeneous computing environments with emphasis on the implementation on the Microsoft Windows NT/XP family of operating systems. This mechanism can provide confidentiality and integrity protection for on- and off-line use through modular cryptographic means and is interoperable between several operating system platforms.
Similarity search over time series and trajectory data
Authors: Lei Chen
Venue:  (2005)

Time series data have been used in many applications, such as financial data analysis and weather forecasting. Similarly, trajectories of moving objects are often used to perform movement pattern analysis in surveillance video and sensor monitoring systems. All these applications are closely related to similarity-based time series or trajectory data retrieval. In this dissertation, various similarity models are proposed to capture the similarities among time series and trajectory data under various circumstances and requirements, such as the appearance of noise and local time shifting. A novel representation, called multi-scale time series histograms , is proposed to answer pattern existence queries and shape match queries. Earlier proposals generally address one or the other; multi-scale time series histograms can answer both types, which offers users more flexibility. A metric distance function, called Edit distance with Real Penalty (ERP), is proposed that can support local time shifting in time series and trajectory data. A second distance function, Edit Distance on Real sequence (EDR) is proposed to measure the similarity between time series or trajectories with local time shifting and noise. Since the proposed similarity models are computationally expensive, several indexing and pruning methods are proposed to improve the retrieval efficiency. For multi-scale time series histograms, A multi-step filtering process is introduced to improve the retrieval efficiency without introducing false dismissals. For ERP, a framework is developed to index time series or trajectory data under a metric distance function, which exploits the pruning power of lower bounding and triangle inequality. For EDR, three pruning techniques&mdash;mean value Q-grams, near triangle inequality, and trajectory histograms&mdash;are developed to improve the retrieval efficiency.
Polynomial Representations of Symmetric Partial Boolean Functions
Authors: Mart de Graaf, Paul Valiant
Venue: SIAM Journal on Discrete Mathematics (2005)

For Boolean polynomials in $\mathbb{Z}_p$ of sufficiently low degree we derive a relation expressing their values on one level set in terms of their values on another level set. We use this relation to derive linear upper and lower bounds, tight to within constant factor, on the degrees of various approximate majority functions, namely, functions that take the value 0 on one level set, the value 1 on a different level set, and arbitrary 0-1 values on other Boolean inputs. We show sublinear upper bounds in the case of moduli that are not prime powers.
Workflow Enactment Based on a Chemical Metaphor
Authors: Zsolt Nemeth, Christian Perez, Thierry Priol
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Executing workflows on large-scale heterogeneous distributed computing systems is a challenging task. Albeit there have been many well elaborated approaches, they are often motivated by a certain class of applications and focus on some implementation specific problems. The work presented in this paper aimed at establishing a highly abstract coordination model for distributed work- flow enactment where decentralized control, autonomy, adaptation to high dynamics and partial lack of information are of primary concerns. The model is based on a nature metaphor and envisioned as a chemical reaction where molecules react autonomously according to local and actual conditions. The execution model of such chemical workflow enactment is formalized using the ã-calculus. In the ã-calculus control, scheduling, dependencies, errors and the state of the computation are all represented in a single uniform declarative formalism that has a mathematically founded clear semantics. The paper shows that the abstract coordination model expressed in ã-calculus is able to grasp all aspects of such a chemical enactment, provides a more complex and adaptive framework than most current approaches, and actual realizations may be founded on it.
An Experimental Investigation into Wayfinding Directions for Visually Impaired People
Authors: Nicholas A. Bradley, Mark D. Dunlop
Venue: Personal and Ubiquitous Computing (2005)

In recent years, there has been an escalation of orientation and wayfinding technologies and systems for visually impaired people. These technological advancements, however, have not been matched by a suitable investigation of human-computer interaction (e.g. designing navigation aids for people who form different cognitive maps for navigation). The aim of this study is to investigate whether a group of sighted participants and a group of visually impaired participants experience a difference in mental and physical demands when given two different sets of verbal instructions directing them to four landmarks. The content of the first set of instructions was proportioned to route descriptions derived from sighted people, and the second set proportioned to descriptions derived from visually impaired people. The objective assessment involved measuring the time taken by participants to reach landmarks and the number of deviations that occurred. A NASA&#x2013;Task Load Index questionnaire provided an indication of participants subjective perception of workload. The results revealed that instructions formed from visually impaired people resulted in a lower weighted workload score, less minor deviations, and quicker times for visually impaired participants. In contrast, these instructions were found to cause a higher weighted workload score for sighted participants. The results are discussed in relation to the issue of personalisation of mobile context-aware systems for visually impaired people.
Semantic Navigation of Large Code Bases in Higher-Order, Dynamically Typed Languages
Authors: S. Alexander Spoon, Olin Shivers
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Chuck is a new code browser that allows navigation of a code base along semantic structures, such as data-flow and higher-order control-flow relationships. Employing the fast DDP type inferencer, it is effective on dynamically typed code bases an order of magnitude larger than the code bases supported by previous browsers. Chuck supports the full Smalltalk language, and is now shipped as a standard component of the Squeak open-source Smalltalk system, where it routinely works with code bases exceeding 300,000 lines of code. Chuck's implementation is tuned for interactive use, and is transparently integrated with the Squeak system's existing code-browsing tools. Thus, it provides semantic navigation of a live code base that is still being edited without requiring long pauses for reanalysis due to edits of the code.
Comparing clusterings: an axiomatic view
Authors: Marina Meilǎ
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper views clusterings as elements of a lattice. Distances between clusterings are analyzed in their relationship to the lattice. From this vantage point, we first give an axiomatic characterization of some criteria for comparing clusterings, including the variation of information and the unadjusted Rand index. Then we study other distances between partitions w.r.t these axioms and prove an impossibility result: there is no "sensible" criterion for comparing clusterings that is simultaneously (1) aligned with the lattice of partitions, (2) convexely additive, and (3) bounded.
A Low-Power Asymmetric Source Driver Level Converter Based Current-Mode Signaling Scheme for Global Interconnects
Authors: Ashok Narasimhan, Bhooma Srinivasaraghavan, Ramalingam Sridhar
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Global interconnects pose a significant challenge to the dense Very Deep Submicron (VDSM) System-on-Chips (SoC), due to increasing wire delay and its variations. Hence, interconnection techniques which decrease delay, delay variation and ensure signal integrity, play an important role in future technologies. In this regard, current-mode low-swing interconnection techniques provide an attractive alternative to conventional full-swing voltage-mode techniques in terms of delay, power and noise immunity. In this paper, we present a new current-mode low swing interconnection technique that reduces the delay and delay variations in global interconnects. Simulation results indicate significant savings in power, reduction in delay and increase in noise immunity compared to other techniques.
Using educational theory and moral psychology to inform the teaching of ethics in computing
Authors: Melissa J. Dark, Jeanne Winstead
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

In this paper, we explore the teaching of ethics in computing related fields. The article intends to share ideas on moral development and the nature of morality, specifically as it relates to changes that educators may be trying to elicit within students when teaching ethics. The paper then addresses educational theories that are better suited to enabling moral development with suggestions on how these theories might shape classroom climate and instructional approaches.
Adapting to Different Needs in Different Locations: Handheld Computers in University Education
Authors: Susan Bull, Yanchun Cui, Harald Robig, Mike Sharples
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Educational use of handheld computers is becoming more common. It is therefore important to examine differences between standard educational interactions, and possibilities offered by handheld devices. Handheld computers allow the opportunity to study at times and locations where individualised interactions would not normally be possible or convenient. Conditions in such locations may differently affect a user's choice of task or ability to carry out an activity successfully. This paper introduces two adaptive systems: (1) a system that adapts to learner knowledge as in a standard intelligent tutoring system, but also to time available for study and location-related features of concentration level and likelihood of interruption; (2) a system providing easy access to commonly used files, applications and tasks, according to location of use.
Evolutionary training of hardware realizable multilayer perceptrons
Authors: P. Plagianakos, D. Magoulas, N. Vrahatis
Venue: Neural Computing and Applications (2006)

The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks, provides tolerance to noise and improves the interpretation of the internal representations. In certain case, such as in learning stationary tasks, it may be sufficient to find appropriate weights for an MLP with threshold activation functions by software simulation and, then, transfer the weight values to the hardware implementation. Efficient training of these networks is a subject of considerable ongoing research. Methods available in the literature mainly focus on two-state (threshold) nodes and try to train the networks by approximating the gradient of the error function and modifying appropriately the gradient descent, or by progressively altering the shape of the activation functions. In this paper, we propose an evolution-motivated approach, which is eminently suitable for networks with threshold functions and compare its performance with four other methods. The proposed evolutionary strategy does not need gradient related information, it is applicable to a situation where threshold activations are used from the beginning of the training, as in &#x201c;on-chip&#x201d; training, and is able to train networks with integer weights.
A Petri Net Extended With Stochastic Priced Transition
Authors: XianMing Liu, ShiXian Li, Yue Jiang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The paper proposes a Petri net extended with stochastic priced transition and discusses the possible application domain of this new type of Petri net. Firstly we define stochastic priced Petri net (SPPN) by adding a stochastic price to transition. Then we use SPPN to establish the economic model for a simple business process and make profit analysis. Finally we draw a conclusion that using SPPN in business process modeling is feasible.
Learning, planning, and the life cycle of workflow management
Authors: Diogo R. Ferreira, Hugo M. Ferreira
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

This paper describes an approach towards workflow management based on the combination of learning and planning. Assuming that processes cannot be fully described at build-time, the approach makes use of learning techniques, namely Inductive Logic Programming (ILP), in order to discover workflow activities as planning operators. These operators will be subsequently fed to a partial-order planner in order to find the process model as a planning solution. The continuous interplay between learning, planning and execution aims at arriving at a feasible plan by successive refinement of the operators. The approach is illustrated in two simple scenarios. The paper concludes by relating the proposed approach with previous developments in this area.
Characterization of Security Notions for Probabilistic Private-Key Encryption
Authors: Jonathan Katz, Moti Yung
Venue: Journal of Cryptology (2006)

The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of private-key encryption. Extending security notions from the public-key setting, we define security in the sense of both indistinguishability and non-malleability against chosen-plaintext and chosen-ciphertext attacks, considering both non-adaptive (i.e., ``lunchtime'') and adaptive oracle access (adaptive here refers to an adversary's ability to interact with a given oracle even after viewing the challenge ciphertext). We then characterize the 18 resulting security notions in two ways. First, we construct a complete hierarchy of security notions; that is, for every pair of definitions we show whether one definition is stronger than the other, whether the definitions are equivalent, or whether they are incomparable. Second, we partition these notions of security into two classes (computational or information-theoretic) depending on whether one-way functions are necessary in order for encryption schemes satisfying the definition to exist. Perhaps our most surprising result is that security against adaptive chosen-plaintext attack is (polynomially) equivalent to security against non-adaptive chosen-plaintext attack. On the other hand, the ability of an adversary to mount a (non-adaptive) chosen-plaintext attack is the key feature distinguishing computational and information-theoretic notions of security. These results hold for all security notions considered here.
Geometry-Dependent Lighting
Authors: Chang Ha Lee Xuejun Hao Amitabh Varshney
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

In this paper, we introduce geometry-dependent lighting that allows lighting parameters to be defined independently and possibly discrepantly over an object or scene based on the local geometry. We present and discuss Light Collages, a lighting design system with geometry-dependent lights for effective feature-enhanced visualization. Our algorithm segments the objects into local surface patches and places lights that are locally consistent but globally discrepant to enhance the perception of shape. We use spherical harmonics for efficiently storing and computing light placement and assignment. We also outline a method to find the minimal number of light sources sufficient to illuminate an object well with our globally discrepant lighting approach.