ppxscal/embedding_network huggingface dataset:
Descriptive Analysis of Fear and Distrust in Early Phases of GSD Projects
Authors: Arttu Piri, Tuomas Niinimaki, Casper Lassenius
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

When globally distributed software development (GSD) is understood as knowledge intensive collaborative work, many of the reasons for problems encountered in GSD projects can be traced back to social conditions framing the collaboration between people at onsite and offsite. A total of 59 interviews were conducted in 8 GSD projects of two major software companies located in Finland. As a result of categorization of problems related to group relations in GSD projects, the lack of trust between onsite and offsite and fears of losing jobs at onsite was found as major problems in the early phases of the projects. Our analysis suggests that poorly communicated reasons GSD can cause severe problems in collaboration between people by laying the ground for fears and for distrust between sites. The study contributes to the GSD research by creating a novel empirical description of the linkages between fear and distrust in GSD.
Augmented robot agent: Enhancing co-presence of the remote participant
Authors: Jane Hwang, Sangyup Lee, Sang Chul Ahn, Hyoung-gon Kim
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

In this paper, we present a tele-meeting system which uses an augmented robot agent as the representation of the remote participant. In this system, we augment a 3D volume video of the remote participant over the on-site robot. The robot agent in this system represents a remote user with camera, microphone, and mobility. Using this robot agent, the remote user and the local user can show their appearances and interact with tangible interfaces. This robot agent system can be applied to various tele-meeting applications such as tele-marketing and tele-tutoring. For example, we implemented a tele-marketing system to show the feasibility of the suggested system.
Approximation of Event Probabilities in Noisy Cellular Processes
Authors: Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete -state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive.We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required.
Chucking: A One-Handed Document Sharing Technique
Authors: Nabeel Hassan, Md. Mahfuzur Rahman, Pourang Irani, Peter Graham
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Usage patterns of private mobile devices are constantly evolving. For example, researchers have recently found that mobile users prefer using their devices with only one hand. Furthermore, current hardware in these devices reduces the need for a stylus and instead relies on finger input. However, current interactive techniques, such as those used for sharing documents between private and public devices have not taken advantage of these recent developments. For example a popular technique, Flick for sharing documents between devices relies on pen and stylus use and has not been adapted to support one-handed interaction. In this paper, we present Chucking, a gesture-based technique for sharing documents between private mobile devices and public displays. Chucking is based on the natural human gesture used for throwing or passing objects. We present the various design parameters that make Chucking an effective document sharing technique. In a document positioning task, we evaluated Chucking against Flicking. Our results show that under certain contexts users were more accurate and effective with Chucking. Participants also preferred Chucking as it maps closely the type of interaction one naturally performs to share objects. We also introduce extensions to Chucking, such as Chuck-Back, Chuck-and-Rotate, and Chuck-and-Place that constitute a suite of techniques that facilitate a large range of document sharing interactions between private mobile devices and public displays.
Brief paper: Adaptive observers for nonlinearly parameterized class of nonlinear systems
Authors: M. Farza, M. M'Saad, T. Maatoug, M. Kamoun
Venue: Automatica (Journal of IFAC) (2009)

In this paper, one proposes adaptive observers for a class of uniformly observable MIMO nonlinear systems with general nonlinear parameterizations. The state and the unknown parameters of the considered systems are supposed to lie in bounded domains which size can be arbitrarily large and the exponential convergence of the observers is shown to result under a well-defined persistent excitation condition. Moreover, the gain of the observers involves a design function that has to satisfy a simple condition which is given. Different expressions of such a function are proposed and it is shown that adaptive high gain like observers and adaptive sliding mode like observers can be derived by considering particular expressions of the design function. The theory is supported by simulation results related to the estimation of the biomass concentration and the Contois model parameters in a bioreactor.
Recognition of Occluded Shapes Using Size Functions
Authors: Barbara Fabio, Claudia Landi, Filippo Medri
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The robustness against occlusions and the ability to perform not only global matching, but also partial matching are investigated in computer vision in order to evaluate the performance of shape descriptors. In this paper we consider the size function shape descriptor, and we illustrate some results about size functions of occluded shapes. Theoretical results indicate that size functions are able to detect a partial matching between shapes by showing a common subset of cornerpoints. Experiments are presented which outline the potential of the proposed approach in recognition tasks in the presence of occlusions.
Efficient mining of multilevel gene association rules from microarray and gene ontology
Authors: Vincent S. Tseng, Hsieh-Hui Yu, Shih-Chiang Yang
Venue: Information Systems Frontiers (2009)

Some recent studies have shown that association rules can reveal the interactions between genes that might not have been revealed using traditional analysis methods like clustering. However, the existing studies consider only the association rules among individual genes. In this paper, we propose a new data mining method named MAGO for discovering the multilevel gene association rules from the gene microarray data and the concept hierarchy of Gene Ontology (GO). The proposed method can efficiently find out the relations between GO terms by analyzing the gene expressions with the hierarchy of GO. For example, with the biological process in GO, some rules like Process A (up) ¿ Process B (up) cab be discovered, which indicates that the genes involved in Process B of GO are likely to be up-regulated whenever those involved in Process A are up-regulated. Moreover, we also propose a constrained mining method named CMAGO for discovering the multilevel gene expression rules with user-specified constraints. Through empirical evaluation, the proposed methods are shown to have excellent performance in discovering the hidden multilevel gene association rules.
Perceptions of Risk and Control: Understanding Acceptance of Advanced Driver Assistance Systems
Authors: Somya Joshi, Thierry Bellet, Vanessa Bodard, Angelos Amditis
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

With a marked increase in advanced driver assistance systems (ADAS) being designed and deployed for cars, there is a logical emergence of studies that critically examine the influence these have on driver behavior and attitudes towards risk and safety. The research question addressed within this paper asks to what extent the level of perceived criticality or risk on the part of drivers influences their acceptance of advanced assistance.
The Genie in the Machine: How Computer-Automated Inventing Is Revolutionizing Law and Business
Authors: Robert Plotkin
Venue:  (2009)

We have long considered inventing to be a uniquely human activity. But just as the assembly line automated the process of manufacturing, today's computers are automating the process of inventing. Software can automatically generate designs for everything from toothbrushes to antennas to automobile frames more quickly and inexpensively than ever before, thereby ushering in a new era of artificial invention. Inventors will use artificial invention technology to boost their inventive abilities to previously undreamed-of heights, enabling small teams of inventors to compete with mega-corporations who insist on inventing the old-fashioned way. Even consumers will be able to use artificial invention technology to become inventors themselves. We stand poised to see the emergence of the "digital renaissance artisan"a person who will have the ability to not only design new inventions at the touch of a button, but also to manufacture them automatically from the comfort of home. As Robert Plotkin reveals in this landmark book, our decisions about these inventions today will dictate who gets to control this powerful technology tomorrow.Should inventions designed by software be patentable? Should the software that produces those designs be patentable? The Genie in the Machine offers the first-ever examination of the implications of artificial invention technology for patent law, the law of invention. Along with practical advice for inventors, high-tech companies, and patent lawyers, this forward-looking book provides concrete recommendations for reforming patent law in light of the growing importance of invention-automation technology. 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
OE: WSD using optimal ensembling (OE) method
Authors: Harri M. T. Saarikoski
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

Optimal ensembling (OE) is a word sense disambiguation (WSD) method using word-specific training factors (average positive vs negative training per sense, posex and negex) to predict best system (classifier algorithm / applicable feature set) for given target word. Our official entry (OE1) in Senseval-4 Task 17 (coarse-grained English lexical sample task) contained many design flaws and thus failed to show the whole potential of the method, finishing -4.9% behind top system (+0.5 gain over best base system). A fixed system (OE2) finished only -3.4% behind (+2.0% net gain). All our systems were 'closed', i.e. used the official training data only (average 56 training examples per each sense). We also show that the official evaluation measure tends to favor systems that do well with high-trained words.
Collaborative Development and New Devices for Human-Computer Interaction
Authors: Hans-Jörg Bullinger, Gunnar Brink
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

The article pays tribute to the emergence in 1993 of graphical browsers that allow users to address electronic information with a point-and-click interface, and places this development on a par with other important historical events that shaped society and the life of the individuals. It describes the resistance that some voiced at the time to the prompt economical utilization of the Internet's new possibilities. It goes on to describe current technical developments in the human-computer interface environment that could be very, perhaps even comparably, important. It concludes with an appeal for the courage to develop technical innovations, particularly in difficult economic times.
Phase transitions and complexity of weighted satisfiability and other intractable parameterized problems
Authors: Yong Gao
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effort to extend this line of research to random instances of intractable parameterized problems. We propose random models for a representative intractable parameterized problem, the weighted d-CNF satisfiability, and its generalization to the constraint satisfaction problem. The exact threshold for the phase transition of the proposed models is determined. Lower bounds on the time complexity of variants of the DPLL algorithm for these parameterized problems are also established. In particularly, we show that random instances of the weighted 2-CNF satisfiability, already an intractable parameterized problem, are typically easy in both of the satisfiable and unsatisfiable regions by exploiting an interesting connection between the unsatisfiability of a weighted 2-CNF formula and the existence of a Hamiltonian-cycle-like global structure.
An Extended ACL for Solving Authorization Conflicts
Authors: Chisong Li, Zhensong Liao
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Authorization is an important means to endow the access requestors with different access rights according to their identities. In trust management and access control systems, authorization is used to ensure that legitimate users can access the required resources or accomplish the valid operations towards some resources. However, unlimited authorization transfer may lead to conflicts in access right. Explicit conflict and implicit conflict are two typical conflicts. When authorization conflicts happen, the access control system may involve in chaotic states and cannot provide natural services for the users. To figure out such a problem, a new approach for solving authorization conflicts is proposed. In the approach, an extended ACL is presented to carry the authorization information, and the authorization can be easily implemented by some simple functions. Thereto, a use case is given to show how the approach works, which illustrates that the approach is sound and reasonable.
Evaluating the Effect of Huge Page on Large Scale Applications
Authors: Panyong Zhang, Bo Li, Zhigang Huo, Dan Meng
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

The ever-increasing memory footprint in large scale applications not only requires efficient computation, but also needs efficient communication. Traditionally huge page is used to reduce CPU’s TLB miss, but how huge page impacts communication performance, and how HPC applications in large scale benefit from huge page are still not clear. In this paper, we support huge page in our D5000A platform and micro-benchmark the communication impacts of huge page in detail, also we evaluate the huge page impact on large scale HPC applications. Results show that huge page improves communication bandwidth by 40MB/s in large message sizes, greatly benefits communication performance when multiple connections share the same NIC. Applications such as NPB, Sweep3D, HPL show good performance improvement and good scalability in large scale. With huge page support, HPL achieves 2.76% improvement in 16384 cores.
Proceedings of the Third ACL-SIGSEM Workshop on Prepositions
Venue: Annual Meeting of the ACL (2006)

This volume contains the papers accepted for presentation at the Third ACL-SIGSEM Workshop on Prepositions, hosted in conjunction with the 11th Conference of the European Chapter of the Association for Computational Linguistics on April 3rd, 2006, in Trento, Italy. This meeting is supported by the ACL Special Interest Group on Semantics (SIGSEM, http://mcs. open.ac.uk/pp2464/sigsem/), which aims to promote research in all aspects of computational semantics. Two successful workshops endorsed by ACL-SIGSEM devoted to the topic of prepositions were held in Toulouse, France in September 2003, and Colchester, UK in April 2005. Prepositions have received a considerable amount of attention in recent years, due to their importance in computational tasks. For instance, in NLP, PP attachment ambiguities have attracted a lot of attention, and different machine learning techniques have been employed with varying degrees of success. Researchers from various perspectives have also looked at spatial or temporal aspects of prepositions, and their cross-linguistic differences, monolingual and cross-linguistic contrasts or the role of prepositions in syntactic alternations. Moreover, in languages like English and German, phrasal verbs have also been the subject of considerable effort, ranging from techniques for their automatic extraction from corpora, to methods for the determination of their semantics. In other languages, like Romance languages or Hindi, the focus has been either on the incorporation of the preposition or its inclusion in the prepositional phrase. All these configurations are of much interest semantically as well as syntactically.
Factored models for probabilistic modal logic
Authors: Afsaneh Shirazi, Eyal Amir
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs. Models in those logics are useful for understanding and decision making in conversations, bargaining situations, and competitions. Unfortunately, probabilistic modal structures are impractical for large real-world applications because they represent their state space explicitly. In this paper we scale up probabilistic modal structures by giving them a factored representation. This representation applies conditional independence for factoring the probabilistic aspect of the structure (as in Bayesian Networks (BN)). We also present two exact and one approximate algorithm for reasoning about the truth value of probabilistic modal logic queries over a model encoded in a factored form. The first exact algorithm applies inference in BNs to answer a limited class of queries. Our second exact method applies a variable elimination scheme and is applicable without restrictions. Our approximate algorithm uses sampling and can be used for applications with very large models. Given a query, it computes an answer and its confidence level efficiently.
Safety Discrete Event Models for Holonic Cyclic Manufacturing Systems
Authors: Calin Ciufudean, Constantin Filote
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

In this paper the expression "holonic cyclic manufacturing systems" refers to complex assembly/disassembly systems or fork/join systems, kanban systems, and in general, to any discrete event system that transforms raw material and/or components into products. Such a system is said to be cyclic if it provides the same sequence of products indefinitely. This paper considers the scheduling of holonic cyclic manufacturing systems and describes a new approach using Petri nets formalism. We propose an approach to frame the optimum schedule of holonic cyclic manufacturing systems in order to maximize the throughput while minimize the work in process. We also propose an algorithm to verify the optimum schedule.
microRNA: human disease and development
Authors: Virendra S. Gomase, Akshay N. Parundekar
Venue: International Journal of Bioinformatics Research and Applications (2009)

microRNAs or miRNAs are an abundant class of highly conversed, small non-coding RNAs that present an entirely new theme of post-transcriptional gene regulation. miRNAs play a key role in diverse biological systems, such as virology, embryogenesis, differentiation, inflammation and cancer research. Research showed the importance of these non-coding small RNAs on immune system development and response. It plays important regulatory roles in various metabolic pathways in most eukaryotes. miRNAs are found to be involved in the regulation of immunity, including the development and differentiation of immune cells, antibody production and the inflammatory mediator release.
Browsing Unbounded Social, Linked Data Instances with User Perspectives
Authors: Hyun Namgoong, Sungkwon Yang, Mina Song, Hong-Gee Kim
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

With the emerging uses of semantically enriched social data on the Web, linked data are expected to envision a next generation of the current web. As ‘web of data’, they are spread as pieces of data into the Web with links to related objects or concepts. Data instances distributed with URIs, those that enable identification and combination of data instances, can be consumed with shared data vocabularies. Easy and intuitive access to the data should be provided for data-centered uses of the Web. This paper introduces a linked data browser providing an intuitive view, especially helping casual users’ understanding of data instances and their relationships. The browser also satisfies the requirement of a generic browser: handling unexpected domains of data across the links. By adapting user’s perspectives captured during browsing, the browser enables users to view any types of linked data instances with different views pertinent to their intentions and types of data.
Newborn Screening System Based on Adaptive Feature Selection and Support Vector Machines
Authors: Sung-Huai Hsieh, Yin-Hsiu Chien, Chia-Ping Shen, Wei-Hsin Chen, Po-Hao Chen, Sheau-Ling Hsieh, Po-Hsun Cheng, Feipei Lai
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

The clinical symptoms of metabolic disorders during neonatal period are often not apparent, if not treated early irreversible damages such as mental retardation may occur, even death. Therefore, practicing newborn screening is very important to prevent neonatal from these damages. In this paper, the newborn screening system used support vector machines (SVM) classification technique is proposed in place of cut-off value decision to evaluate the metabolic substances concentration raw data obtained from tandem mass spectrometry (MS/MS) and determine whether the newborn has some kinds of metabolic disorder diseases. On the basis of the proposed features, new analytic combinations are identified with superior discriminatory performance compared with the best published combinations. Classifiers built with the feature selection to find C3/C2, C3 and C16 of three key point features achieved diagnostic sensitivities, specificities and accuracy approaching 100%.
PSNUS: web people name disambiguation by simple clustering with rich features
Authors: Ergin Elmacioglu, Yee Fan Tan, Su Yan, Min-Yen Kan, Dongwon Lee
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

We describe about the system description of the PSNUS team for the SemEval-2007 Web People Search Task. The system is based on the clustering of the web pages by using a variety of features extracted and generated from the data provided. This system achieves F&alpha;=0.5 = 0.75 and F&alpha;=0.2 = 0.78 for the final test data set of the task.