ppxscal/embedding_network huggingface dataset:
The implications of enterprise-wide pipeline management tools for organizational relations and exchanges
Authors: Melissa Cefkin, Jakita O. Thomas, Jeanette Blomberg
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

This paper explores the impact of enterprise-wide processes and technologies on group relations and exchanges. We examine the use of Customer Relationship Management (CRM) tools in sales pipeline management. Through an ethnographic study of globally-distributed sales teams we show that the way enterprise-wide tools are integrated into daily practices impacts organizational relations and exchange. We pay particular attention to information exchange as a vehicle for building, leveraging and deterring organizational relations. Our analysis suggests that different approaches to using standardized tools and processes have variable impact on team relations. We provide support for the argument that technologies should be designed and deployed in accordance with an understanding of the contexts of use and in consideration for their impact on organizational relations.
Modularity in Design: Skit Registers and Counters Used as System Building Blocks
Authors: K. H. O'Keefe
Venue: IEEE Transactions on Computers (1973)

An algorithm for determining whether or not an arbitrary sequential machine can be synthesized using only shift registers or up-down counters as memory elements is presented. When realization is possible, a basis for state assignment is given. State-partitioning techniques are used to this end and it is concluded that by means of a single test, it is possible to simultaneously check for realizability using either of the two module types.
Quality Assessment for Embedded SQL
Authors: Huib van den Brink, Rob van der Leek, Joost Visser
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

The access of information systems to underlying relational databases is commonly programmed using embedded SQL queries. Such embedded queries may take the form of string literals that are programmatically concatenated into queries to be submitted to the DBMS, or they may be written in a mixture of the syntax of SQL and a host programming language. The particular ways in which embedded queries are constructed and intertwined with the surrounding code can have significant impact on the understandability, testability, adaptability, and other quality aspects of the overall system. We present an approach to tool-based analysis of the quality of systems that employ embedded SQL queries. The basis of the approach is the identification and reconstruction of embedded queries. These queries are then submitted to a variety of analyses. For example, we chart the relationships of queries to the surrounding code and, via the control and data flow of that code, to each other. Also, we define a suite of metric extractors for embedded queries. Through a number of case studies, involving PL/SQL, Cobol, and Visual Basic, we show how the results of these analyses can be employed to make an assessment of various quality aspects related to the use of embedded queries.
Improving image segmentation by gradient vector flow and mean shift
Authors: Tangwei Liu, Huiyu Zhou, Faquan Lin, Yusheng Pang, Ji Wu
Venue: Pattern Recognition Letters (2008)

The classical gradient vector flow (GVF) method suffers from deficiency in the presence of other significant edges adjacent to the real boundary. In this paper, we propose an improved energy function to challenge this problem by consistently reducing the Euclidean distance between the inspected centroid of the real boundary and the estimated one of the snake. Experimental work shows the proposed framework outperforms the classical GVF algorithm in different circumstances.
Interpretation of Binary Strings as Security Protocols for their Evolution by means of Genetic Algorithms
Authors: Luis Zarza, Josep Pegueroles, Miguel Soriano
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The design of cryptographic and security protocols for new scenarios and applications can be computationally expensive. Examples of these can be sensor or mobile ad-hoc networks and electronic voting or auctions applications. In such cases, the aid of an automated tool generating protocols for a predefined problem can be of great utility. This work uses the Genetic Algorithms (GA) techniques for the automatic design of security networked protocols. When using GA for optimizing protocols the genome definition is critical. We discuss how security protocols can be represented as binary strings. Arbitrary criteria can lead to improper strings for our GA tools. We explain and justify the steps to define genome interpretation in our optimization method. Analysis of the proposal attending is also presented as part of our contribution.
Diconic addition of failsafe fault-tolerance
Authors: Ali Ebnenasir
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its safety specification even when faults occur. Specifically, instead of adding fault-tolerance to a program as a whole, we separately revise program actions so that the entire program becomes failsafe fault-tolerant. Our DiConic algorithm has the potential to utilize the processing power of a large number of machines working in parallel, thereby enabling automatic addition of failsafe fault-tolerance to distributed programs with a large number of processes. We formulate our DiConic synthesis algorithm in terms of the satisfiability problem and demonstrate our approach for the Byzantine Generals problem and an industrial application.
A quantitative optimization model for dynamic risk-based compliance management
Authors: S. Müller, C. Supatgiat
Venue: IBM Journal of Research and Development (2007)

The changing nature of regulation forces businesses to continuously reevaluate the measures taken to comply with regulatory requirements. To prepare for compliance audits, businesses must also implement an effective internal inspection policy that identifies and rectifies instances of noncompliance. In this paper, we propose an approach to compliance management based on a quantitative risk-based optimization model. Our model allows dynamic selection of the optimal set of feasible measures for attaining an adequate level of compliance with a given set of regulatory requirements. The model is designed to minimize the expected total cost of compliance, including the costs of implementing a set of measures, the cost of carrying out periodic inspections, and the audit outcome cost for various compliance levels. Our approach is based on dynamic programming and naturally accounts for the dynamic nature of the regulatory environment. Our method can be used either as a scenario-based management support system or, depending on the availability of reliable input data, as a comprehensive tool for optimally selecting the needed compliance measures and inspection policy. We illustrate our approach in a hypothetical case study.
Automated Test Data Generation Algorithm Based on Reversed Binary Tree
Authors: Jun-Yi Li, Jia-Guang Sun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Automated test data generation technology is a hot researching area in automated software test. Some kinds of new concepts such as base node, control node, definition node and definition related control node set are proposed, and in addition, a solution to obtain the definition related control node set is designed. on the basis of combining both the method of linear approximation and DUC expression, an innovative algorithm based on reversed binary tree for automated test data generation is proposed, which can automatically find out all of the feasible paths in the program from the source node to the base node, and can automatically generate the test data for each founded feasible path also. Thereafter, the automated test data generation problem in the software tests has been solved finally. Algorithm analyses show that the newly proposed algorithm has the good features such as simple coding and better efficiency.
The Research on the Relationship Between Adrenergic Receptor Subtypes
Authors: Hailong Yu, Yan Xu, Yun Xiao, Xia Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The adrenergic receptors, which control the regulation of blood pressure, energy homeostasis and metabolism of glucose and lipids within the body, are a class of G protein-coupled receptors and a class of the most important receptors within the body. Adrenergic receptors are grouped into three types, 1, 2 and . Within each type, Molecular biological studies revealed further subtypes, they are designated as 1A, 1B, 1D, 2A, 2B, 2D, 1, 2, 3. Biological studies found that some subtypes interact with others in certain tissues, which means there are relations between these subtypes. Currently there have been fewer reports about the relationship between adrenergic receptor subtypes with a lack of selective agonists. Here we use bioinformatics tools and strategies to study the relationship between adrenergic receptor subtypes from three aspects, including molecular evolution, sequence similarity and protein-protein interaction. Finally we find that within the 1 three subtypes the evolution distance between 1A and 1B is relatively nearer, and their sequence similarity is higher; within the 2 three subtypes he evolution distance between 2A and 2C is relatively nearer, and their sequence similarity is higher. From the protein-protein aspect we find that 1A is directly interacting with 1, the three subtypes of 1 as well as 2 have more interacting proteins, and hence they are more active within the body.
Fuzzy Analytical Hierarchial Processes
Authors: A. de Korvin, R. Kleyle
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

Many problems in decision making structure reality into constituent parts, that is, into hierarchial charts in which the goal is at the top, while the decisions are at the lowest level of the chart. At the intermediate levels of the chart are the various attributes and/or conditions which must be considered in order to arrive at a decision. A rather simplified hierarchial chart is given, in which the goal, all attributes and all possible decisions occupy boxes in the hierarchial structure. The main idea in the Analytical Hierarchial Process (AHP) approach is to construct a pairwise ranking of the boxes at any given level relative to the boxes at the next highest level to which they are connected. These pairwise rankings are used to construct priorities which are then combined to create an overall priority for each course of action under consideration. The course of action with the highest priority is then chosen. Uncertainty in the assigning of priorities and the use of semantic variables in their assignment lead naturally to the inclusion of fuzzy logic into the structure of the AHP paradigm. In this paper we propose a method for using fuzzy sets in the context of the Analytical Hierarchial approach to decision making. A rather comprehensive example illustrates this method.
Encouraging Teamwork in an Undergraduate Software Engineering Course
Authors: Cynthia Y. Lester
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Students typically do not like to work in teams, especially computer science majors. Computer science is often perceived as an "a-social discipline that does not foster teamwork, interactivity, or collaboration. Yet, teamwork and collaboration are the very characteristics that the workplace demands, particularly when designing and developing large scale software projects. Therefore, being able to effectively work in teams is an essential learning outcome for software engineering students and as educators, we must ensure that students not only possess technical skills, but soft skills as well. The goal of the research in progress was to create a collaborative learning environment that fostered teamwork and team learning for students enrolled in an undergraduate software engineering course. The paper summarizes how previous computing experience, background, and computer self-efficacy were used to create teams that represent those found in today's workplace. Implications and suggestions for future research are also provided.
Ballot casting assurance via voter-initiated poll station auditing
Authors: Josh Benaloh
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

The technology for verifiable, open-audit elections has advanced substantially since research on this topic began a quarter century ago. Many of the problems are well-understood and have solid solutions. Ballot casting assurance -- the problem of ensuring that a programmatically encrypted ballot matches the intentions of an individual human voter -- has recently been recognized as perhaps the last substantial obstacle to making this technology fully viable. Several clever schemes have been developed to engage humans in interactive proofs to challenge and check validity of each ballot cast, but such a high standard may be neither practical nor necessary. If done properly, substantial integrity can be obtained by giving voters and observers the option to challenge ballot validity without requiring all voters to do so. This option can be made unobtrusive so as to not interfere with the normal process for most voters, but there are numerous risks and subtleties that necessitate a careful examination of the process. This paper identifies some heretofore unobserved issues with this "simple" method of casting ballots and describes a detailed process that mitigates all known threats. In doing so, it provides a blueprint for how verifiable, open-audit elections can reasonably be conducted in practice.
Evaluating Universal Quantification in XML
Authors: Shurug Al-Khalifa, Bin Liu, H. V. Jagadish
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Queries posed to database systems often involve Universal Quantification. Such queries are typically expensive to evaluate. While they can be handled by basic access methods, for selection, grouping, etc., new access methods specifically tailored to evaluate universal quantification can greatly decrease the computational cost. In this paper, we study the efficient evaluation of universal quantification in an XML database. Specifically, we develop a small taxonomy of universal quantification types, and define a family of algorithms suitable for handling each. We experimentally demonstrate the performance benefits of the new family of algorithms.
A Visual Modeling Environment for Embedded Component Systems
Authors: Takuya Azumi, Shimpei Yamada, Hiroshi Oyama, Yukikazu Nakamoto, Hiroaki Takada
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper proposes a new visual modeling environment for embedded component systems that improves the produc- tivity of application developers. This embedded component system decreases the complexity and the difficulty of soft- ware development for embedded systems. Furthermore, it is possible to estimate the memory consumption of an entire application, since the proposed system uses a static config- uration. This environment builds the development compo- nents for the application. As well, the visual modeling envi- ronment can automatically generate a build description that is part of the component description language. Finally, this environment can be used to generate C-language interface code, either .h or .c, from the component descriptions.
The Benefit of Using Tag-Based Profiles
Authors: Claudiu S. Firan, Wolfgang Nejdl, Raluca Paiu
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

Collaborative tagging, i.e. the process of assigning metadata in the form of keywords to shared content by many users, has emerged as an important way to provide information about resources on the Web and elsewhere. Such keywords (tags) are used to enable the organization of information within personal information spaces, such as photo collections, but can also be shared, allowing browsing and searching with the help of tags attached by other users to information resources from the Web. Recent research has shown that such tag distributions stabilize over time and can be used to improve search on the Web. In this paper we are interested in another aspect, namely how they characterize the user and enable personalized recommendations. Using data from a frequently used music search portal, Last.fm, we analyze tag usage and statistics and investigate the use of tag-based user profiles in contrast to conventional user profiles based on song and track usage. We specify recommendation algorithms based on tag user profiles, and explore how collaborative filtering recommendations based on these tag profiles are different from recommendations based on song/track profiles. Finally, we describe a new search-based method, which uses tags to recommend songs interesting to a user, yielding substantially improved results. The paper finishes with a discussion of some future work to further improve tag-based search and recommendation in community web sites.
Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance
Authors: T. Murata
Venue: IEEE Transactions on Software Engineering (1980)

This paper presents a method for synthesizing or growing live and safe marked graph models of decision-free concurrent comutations. The approach is modular in the sense that subsystems r represented by arcs (and nodes) are added one by one without the need of redesigning the entire system. The foliowing properties of marked graph models can be prescribed in the synthesis: liveness (absence of deadlocks), safeness (absence of overflows), the number of reachability classes, the maximum resource (temporary storage) requirement, computation rate (performance), as well as the numbers of arcs and states.
Stochastic DT-MRI Connectivity Mapping on the GPU
Authors: Tim McGraw, Mariappan Nadar
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a method for stochastic fiber tract mapping from diffusion tensor MRI (DT-MRI) implemented on graphics hardware. From the simulated fibers we compute a connectivity map that gives an indication of the probability that two points in the dataset are connected by a neuronal fiber path. A Bayesian formulation of the fiber model is given and it is shown that the inversion method can be used to construct plausible connectivity. An implementation of this fiber model on the graphics processing unit (GPU) is presented. Since the fiber paths can be stochastically generated independently of one another, the algorithm is highly parallelizable. This allows us to exploit the data-parallel nature of the GPU fragment processors. We also present a framework for the connectivity computation on the GPU. Our implementation allows the user to interactively select regions of interest and observe the evolving connectivity results during computation. Results are presented from the stochastic generation of over 250,000 fiber steps per iteration at interactive frame rates on consumer-grade graphics hardware.
?On the Fly? CRC-16 Byte-wise Calculation for 8088-based Computers
Authors: D. Shouse
Venue: IEEE Micro (1985)

A cyclic redundancy code, or CRC, is often used to ensure the integrity of messages in data communications. This program for generating the CRC is faster than its bit-wise counterpart. 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
A New Manifold Representation for Visual Speech Recognition
Authors: Dahai Yu, Ovidiu Ghita, Alistair Sutherland, Paul F. Whelan
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

In this paper, we propose a new manifold representation for visual speech recognition.
An Improved Hyper-sphere Support Vector Machine
Authors: Shuang Liu, Yongkui Liu, Bo Wang, Xiwei Feng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Hyper-sphere support vector machines are proposed for solving multi-class classification problem. How to correctly classify the intersections of hyper-spheres is important for sphere structure support vector machines. Based on the analysis of such data samples, this paper presents a new simple classification rule which leads to a better generalization accuracy than the existing sub-hypersphere SVMs. Experimental results show our method is feasible and improves the performance of the resulting minimum bounding sphere-based classifier.
Empirical Analysis of Software Fault Content and Fault Proneness Using Bayesian Methods
Authors: Ganesh J. Pai, Joanne Bechta Dugan
Venue: IEEE Transactions on Software Engineering (2007)

We present a methodology for Bayesian analysis of software quality. We cast our research in the broader context of constructing a causal framework that can include process, product and other diverse sources of information regarding fault introduction during the software development process. In this paper, we discuss the aspect of relating internal product metrics to external quality metrics. Specifically, we build a Bayesian network (BN) model to relate object-oriented software metrics to software fault content and fault proneness. Assuming that the relationship can be described as a generalized linear model, we derive parametric functional forms for the target node conditional distributions, in the BN. These functional forms are shown to be able to represent linear, Poisson and binomial logistic regression. The models are empirically evaluated using a public domain data set from a software subsystem. The results show that our approach produces statistically significant estimations, and that our overall modelling method performs no worse than existing techniques.
Network Protocols Analyzing by an Environmental Bisimulation Method
Authors: Min Gan, Guoying Yue, Hongfa Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Environmental bisimulation method is an important relation in the Spi calculus, which is usually used to reason about interactive systems. In this paper we adopted it in analyzing network protocols and intended to try it on checking the soundness of the Kerberos protocol. Rigorous proofs on its two security properties reveal that the authenticity property holds while its secrecy property is threatened by a possible attack.
Research on Common Coordination Model for SoftMan Society
Authors: Zhonggui Ma, Xianwei Zhou, Guangping Zeng, Xuyan Tu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The architecture of coordination model of SoftMan society is put forward, and the content of coordination model of SoftMan society is explained. According to the ideas of decomposition and coordination of large systems cybernetics, three kinds of common coordination models of SoftMan society, which include centralized coordination model, decentralized coordination model and hierarchical coordination model, are studied on the basis of reference to artificial society and Multi-Agent Systems. Coordination models and algorithms of SoftMan society are studied so as to reduce system resource use rate, and to improve coordination efficiency.