ppxscal/embedding_network huggingface dataset:
Ptolemy: A Language with Quantified, Typed Events
Authors: Hridesh Rajan, Gary T. Leavens
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Implicit invocation (II) and aspect-oriented (AO) languages provide related but distinct mechanisms for separation of concerns. II languages have explicitly announced events that run registered observer methods. AO languages have implicitly announced events that run method-like but more powerful advice. A limitation of II languages is their inability to refer to a large set of events succinctly. They also lack the expressive power of AO advice. Limitations of AO languages include potentially fragile dependence on syntactic structure that may hurt maintainability, and limits on the available set of implicit events and the reflective contextual information available. Quantified, typed events, as implemented in our language Ptolemy, solve all these problems. This paper describes Ptolemy and explores its advantages relative to both II and AO languages.
Facial Expression Synthesis Using PAD Emotional Parameters for a Chinese Expressive Avatar
Authors: Shen Zhang, Zhiyong Wu, Helen M. Meng, Lianhong Cai
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Facial expression plays an important role in face to face communication in that it conveys nonverbal information and emotional intent beyond speech. In this paper, an approach for facial expression synthesis with an expressive Chinese talking avatar is proposed, where a layered parametric framework is designed to synthesize intermediate facial expressions using PAD emotional parameters [5], which describe the human emotional state with three nearly orthogonal dimensions. Partial Expression Parameter (PEP) is proposed to depict the facial expression movements in specific face regions, which act as the mid-level expression parameters between the low-level Facial Animation Parameters (FAPs) [11] and the high-level PAD emotional parameters. A pseudo facial expression database is established by cloning the real human expression to avatar and the corresponding emotion states for each expression is annotated using PAD score. An emotion-expression mapping model is trained on the database to map the emotion state (PAD) into facial expression configuration (PEP). Perceptual evaluation shows the input PAD value is consistent with that of human perception on synthetic expression, which supports the effectiveness of our approach.
Service-Oriented Life Cycle Modeling: The Shift from Web Services to Enterprise Services
Authors: Michael Bell
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

The discontent over the limited capability of Web services to reflect the organization’s business model, and efficiently adhere to business strategies and requirements, caused a shift in business thinking. As a result, the enterprise has been recognizing the need for a more generalized model for services. This trend introduced a more abstracted notion of a service: a “meta-service” that can better explain business imperatives, foster business reuse, reduce time-to-market, and encourage asset consolidation across the enterprise. The recently published book which is also the base for this discussion: “Service-Oriented Modeling: Service Analysis, Design, and Architecture” provides answers to these organizational concerns.
A New Decision Rule for Statistical Word Sense Disambiguation
Authors: Dongmei Fan, Zhimao Lu, Rubo Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Word Sense Disambiguation (WSD) is usually considered to be a pattern classification to research and it has always being a key problem and one of difficult points in natural language processing. Statistical learning theory is a mainstream of the research method for WSD. The distribution of the word-senses of an ambiguous word is always not symmetrical and the distinction between word-senses' emergence frequency is great sometimes, so the judgment results are inclined to the maximum probability word-sense in the word-sense classification. The reflection of this phenomenon is obviously in the Bayesian model. When using the Bayesian model to carry on some research we find a new word-sense decision rule, which have a better precision than Bayesian model in WSD. In order to validate the credibility and stabilization of this method we carry through the experiment time and again, and acquire lots of experiment data. The results of the experiment indicate that new decision rule is more excellent than Bayesian decision rule. Furthermore this paper provides a theoretical foundation for this new decision rule.
Towards Technology-Supported Surgical Training
Authors: Minna Silvennoinen
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Technology offers alternatives for trainingsurgeons with patients and also possibilities to takepart in surgical learning from afar, outside theoperating room (OR). Simulated and other technicaltraining tools provide opportunities to practicesurgical skills in undisturbed learning environments.In order to implement effective educational methodsand create new environments for learning, we need tofind out what skills a surgeon must learn and what arethe elements affecting surgical performance.This paper describes a study designed toinvestigate surgical processes and presents anexploratory way of gathering data by combining videomaterial with interviews. The suitability oftriangulation as a method of data collection for thedevelopment of technology–supported surgicaleducation is then evaluated and discussed.The triangulation method provides data whichbenefits technology-supported surgical education.Advantages include a more accurate and detailedknowledge obtained from surgeons’ actions, surgicalprocedures and learning.
A Mysterious Advertisement
Authors: Brian Randell
Venue: IEEE Annals of the History of Computing (1983)

Editor's Note: Brian Randell submitted the following notes on July 9, 1981, in response to seeing the text of the advertisement mentioned by Garry J. Tee in the preceding article. We invite our readers to provide Randell with any further information.
Sensing-based shape formation on modular multi-robot systems: a theoretical study
Authors: Chih-Han Yu, Radhika Nagpal
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multi-robot systems, where the desired shape is specified in terms of local sensor constraints between neighboring robot agents. We show that this problem can be formulated more generally as distributed constraint-maintenance on a networked multi-agent system. It is strongly related to a class of multi-agent algorithms called distributed consensus, which includes several bio-inspired algorithms such as flocking and firefly synchronization. By exploiting this connection, we can theoretically analyze several important aspects of the decentralized shape formation algorithm and generalize it to more complex multi-agent scenarios. We show that the convergence time depends on (a) the number of robot agents and agent connection topology, (b) the complexity of the user-specified goal, and (c) the initial state of the robots. Using these results, we can provide precise statements on how the approach scales, and how quickly the system can adapt to perturbations. These results provide a deeper understanding of the contrast between centralized and decentralized multi-agent algorithms.
Selected Problems of Knowledge Discovery Using Artificial Neural Networks
Authors: Keith Douglas Stuart, Maciej Majewski
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

The paper describes the application of an artificial neural network in natural language text reasoning. The task of knowledge discovery in text from a database, represented with a database file consisting of sentences with similar meanings but different lexico-grammatical patterns, was solved with the application of neural networks which recognize the meaning of the text using designed training files. We propose a new method for natural language text reasoning that utilizes three-layer neural networks. The paper deals with recognition algorithms of text meaning from a selected source using an artificial neural network. In this paper we present that new method for natural language text reasoning and also describe our research and tests performed on the neural network.
P4p: a practical framework for privacy-preserving distributed computation
Authors: John Canny
Venue:  (2007)

Privacy is becoming an increasingly important issue in electronic commerce and other online activities that are growing in popularity. This work introduces a framework, called Peers for Privacy (P4P), for implementing many useful algorithms with provable privacy and adequate efficiency in a realistic adversary model at a reasonably large scale. The basic idea is to decompose an algorithm into a series of addition-only steps, which have very efficient private implementation using cryptographic tools. This simple model is surprisingly general and supports many algorithms prevalent in distributed data mining. Examples include linear algorithms like voting and summation, as well as nonlinear algorithms such as regression, classification, SVD, PCA, k-means, ID3, machine learning algorithms based on Expectation Maximization (EM), etc. In fact all algorithms in the statistical query model are supported. The computation of the sums is based on a highly efficient verifiable secret sharing (VSS) scheme that allows secret-shared arithmetic operations to be done over small fields (e.g. 32 or 64 bits) where private arithmetic operations have the same cost as normal arithmetic. This thesis shows that this paradigm admits efficient zero-knowledge tools that can be used to verify the properties of user data such as equality and boundedness. These tools provide practical mechanisms to deal with cheating users. One such tool is an extremely efficient zero-knowledge proof that verifies the L2-norm of the user data is bounded by a constant. This is to prevent a malicious user from exerting too much influence on the computation. The verification uses a linear number of inexpensive small field operations, and only a logarithmic number of large-field (1024 bits or more) cryptographic operations, and can achieve orders of magnitude reduction in running time over standard techniques (from hours to seconds) for large-scale problems. Concrete examples are given to demonstrate how the framework supports private computation of popular algorithms such as SVD, link analysis and association rule mining. The thesis also includes schemes for scalable multicast encryption and bidirectional group communication. They provide secure data transmission support for the type of communication pattern required by the P4P framework and many other group-oriented applications.
On-Demand Capacity Framework
Authors: Chi-Hung Chi, Chao Wang
Venue: Proceedings of the 7th international conference on Algorithms and Architectures for Parallel Processing (2007)

Web service technology has generated a lot interest, but its adoption rate has been slow. This paper discusses quality of service issues which is one of the contributing factors to this slow take up, and argues that nowadays policy, which requires the service providers to ensure a certain level of QoS, is not practical and will invoke high business risks. Therefore, we introduce four innovating concepts to SOA community, and propose an extending framework to ensure on-demand capacity by decoupling classical service provider into service logic provider and QoS provider. Moreover, we present a qualitative comparison in a typical web service scenario between the model proposed, classical SOA and enhanced SOA models introduced by previous publication.
Grammar-Based Classifier System for Recognition of Promoter Regions
Authors: Olgierd Unold
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Identifying bacterial promoters is an important step towards understanding gene regulation. In this paper, we address the problem of predicting the location of promoters in Escherichia coli. Language of bacterial sequence can be described using formal system such a context-free grammar, and problem of promoter region recognition replaced by grammar induction. The accepted method for this problem is to use grammar-based classifier system (GCS).
A rotation method for binary document images using DDA algorithm
Authors: Duc Thanh Nguyen
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

DDA (Digital Differential Analyzer) is a famous algorithm used commonly in computer graphics to interpolate integer coordinate pixels of a straight line. In this paper, we introduce a method of image rotation for binary document images using DDA algorithm with assumption that the true skew angles of the documents have already been computed. The proposed method applies the main idea of DDA algorithm with some modifications for the skew scanning lines along to the inverse direction of the skew angle. In this method the ratios between the length of black runs and the whole scan line are guaranteed. Thus the algorithm can overcome disadvantages of mathematical rotation such as white holes and over segmentation. Moreover, using DDA algorithm to approximate integer points helps this method reduce the number of rotation operations.
Simplest Scenario for Mutual Nested Modeling in Human-Machine-Interaction
Authors: Rustam Tagiew
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

The research aim of this paper is to represent everyday-life patterns of thought like "Because I know, what you think I think ..." by a process on a machine, which is involved in an interaction with humans, who also think in such patterns. It analyzes from the perspective of AI the relevant results of such fields as epistemic logic, game theory and psychological investigations of human behavior in strategic interactions. As a result of this interdisciplinary research, a very simple basic interaction scenario and a computer algorithm for managing machine "thoughts" and behavior are designed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Medical Reasoning and Rough Sets
Authors: Shusaku Tsumoto
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Pawlak showed that knowledge can be captured by data partition and proposed a rough set method where comparison between data partition gives knowledge about classification. Interestingly, thes approximations correspond to the focusing mechanism of differential medical diagnosis; upper approximation as selection of candidates and lower approximation as concluding a final diagnosis. This paper focuses on severl models of medical reasoning shows that core ideas of rough set theory can be observed in these diagnostic models.
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
Authors: Egon Balas, Pierre Bonami
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

We discuss an open source implementation and preliminary computational testing of three variants of the Balas-Perregaard procedure for generating lift-and-project cuts from the original simplex tableau, two of which are new. Variant 1 is the original procedure of [6] with minor modifications. Variant 2 uses a new procedure for choosing the pivot element: After identifying the set of row candidates for an improving pivot, the pivot element (and column) is chosen by optimizing over the entries of all candidate rows. Finally, Variant 3 replaces the source row with its disjunctive modularization, and after each pivot it again modularizes the resulting source row. We report on computational results with the above three variants and their combinations on 65 MIPLIB.3 instances.
Support Vector Machine with Composite Kernels for Time Series Prediction
Authors: Tiejun Jiang, Shuzong Wang, Ruxiang Wei
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In Support Vector Machine (SVM), Kernels are employed to map the nonlinear model into a higher dimensional feature space where the linear learning is adopted. The characteristics of kernels have great impacts on learning and predictive results of SVM. Considering the characteristics for fitting and generalization of two kinds of typical kernels---global kernel (polynomial kernel) and local kernel (RBF kernel), a new kind of SVM modeling method based on composite kernels is proposed. In order to evaluate the reasonable fitness of kernel functions, the particle swarm optimization (PSO) algorithm is used to adaptively evolve SVM to obtain the best prediction performance, in which each particle represented as a real vector corresponds to a set of the candidate parameters of SVM. Experiments in time series prediction demonstrate that the SVM with composite kernels has the better performance than with a single kernel.
Data Reconstruction Based on Factor Analysis
Authors: Zhong-Gai Zhao, Fei Liu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In industrial process, the method based on principal component analysis (PCA) for data reconstruction is popular during dealing with missing data. In the method, the objective for data reconstruction is to make minimum square prediction error (SPE), an index measuring the relationship among process variables. However, PCA is a special case of factor analysis (FA), it has more limitations than FA, above all, SPE is a Euclidian distance, which is a suitable measurement for variables meeting uniform distribution rather than normal distribution, while process variables often satisfy the latter distribution. Due to the extensive sense of FA, the paper proposes a Mahalanobis distance as the index to measure the degree that the sample accords with the FA model, and then introduces FA into data reconstruction. The proposed index can more reflect the relationship among variables and the estimation of missing data with more precision can be achieved by making the new index minimum than by SPE.
Chain-computerisation for interorganisational public policy implementation: A new approach to developing non-intrusive information infrastructures
Authors: Jan Grijpink
Venue: Information Polity (1999)

In two articles See&colon; Chain-computerisation for better privacy protection, p. 95 of this issue. the author presents some key elements from his recently completed thesis about functional, non-intrusive information infrastructures for interorganisational public policy implementation. The development of these information infrastructures requires a new approach, chain-computerisation, based on new concepts and practices. This methodology is vital for public administration, if the problems associated with interorganisational policy implementation are to be overcome. Chain-computerisation recognises the impossibility in many interorganisational settings of implementing government policy, because no single organisational actor has authority over the system. Thus, for example, a Dutch requirement that prisoners serving longer prison sentences must notify the Benefits system so that benefit paid can be adjusted, cannot be enforced because this multi-agency setting is too complex to allow adequate co-ordinated control. What is needed is an informational solution which automatically signals to the Imprisonment system that a prisoner is receiving benefits. Such highly automated communication systems can also protect privacy, in this particular example by signalling that a note must be sent by the prisoner to his benefit agency rather than by triggering enforcement by the Imprisonment system without the prisoner concerned knowing it. This methodology can be seen as emerged from &ldquo;lessons learned&rdquo; during the period that the author was responsible for the development of information policies at the Dutch Ministry of Justice. Chain-computerisation is explained here by means of examples taken from the penal and social welfare systems, but it should be emphasized that the methodology of chain-computerisation can be applied to many other situations where public policy is to be implemented by close co-operation of many autonomous public and private organisations. J.H.A.M. Grijpink (1946) studied Economics (1969) and Law (1971) at the University of Groningen, the Netherlands. He received his doctor&rsquo;s degree (1997) at the Technical University of Eindhoven, the Netherlands. He is Principal Adviser at the Dutch Ministry of Justice. He is a Certified Management Consultant (CMC) and a Registered Information Expert (RI). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The IT model curriculum: a status update
Authors: Barry M. Lunt, Joseph J. Ekstrom
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

The first complete draft of the IT model curriculum was posted on the ACM website in October 2005. Since then, a number of comments and requests for changes have been received, the most significant of which occurred in January 2007. In response to these comments, a number of meetings and discussions have been held. In addition, committee membership has evolved. During the review process it became clear that there were clarity issues in the writing, structural issues in the curriculum and also that the release of the CC2005 document included information that needed to be correlated with the IT document. In order to address these issues the following updates were integrated into the current revision, IT2008: 1. Potential areas of misunderstanding were revised. 2. The IT2008 was more closely tied to the CC2005 document. 3. Math was moved from the "rounding the curriculum" section to become part of the core and one of the Knowledge Areas. 4. Outcomes were fully aligned with ABET program outcomes for IT programs. 5. The relationship between the core IT material, the advanced material, and the overall IT curriculum was revised. 6. The concept of pervasive themes was integrated more completely into the overall document. 7. The curricular example was revised and another example was added. 8. The Body of Knowledge was updated structurally and the learning levels were revised. The purpose of this paper is to explain the reasoning and context of the revisions present in the IT2008 from the perspective of two participants in the process from its inception.