ppxscal/embedding_network huggingface dataset:
The Ubiquitous Factory of the Future based on STEP-NC
Authors: Van Khai Nguyen, Alain Brail
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The survival of traditional factories (especially manufacturing SMEs) within the global economy, with productivity pressures, scarce resources and capabilities, relies on their ability to embrace new ideas and new organizational forms and to imagine new ways of delivering value to customers, new approaches to collaborating with suppliers. Eliminating the barriers to make possible the new paradigm “design anywhere, build anywhere” is a crucial challenge for manufacturing industry to gain competitiveness in the new emerging markets, and to better cooperate (and not only to compete) with low-wage countries. Information Technology plays a strategic role and the unbundling of modern global enterprise depends on the connection of machinery over the internet and the ubiquitous behaviour of machines-tools. Full interoperability towards digital factory and extended manufacturing process opens up new perspectives of collaboration between OEM firms and their suppliers. STEP-NC is being identified as the main enabling “IT bus” for manufacturing industry and is driving the opportunity for change towards the targets of digital, adaptive, networking, and knowledge-based manufacturing for the factory of the future. The higher information level provided by STEP-NC allows the development of a new breed of intelligent (holonic) controllers, capable to be self-adaptive and autonomous to meet the manufacturing requirements to deliver the final part as requested by the customer. This paper starts to describe the results achieved within the previous projects for the definition of the STEP-NC feature-based data model and standard and envisions new crucial developments for a breakthrough vertically integrated paradigm of the whole manufacturing process.
A Heuristics Framework for Semantic Subscription Processing
Authors: Martin Murth, Eva Kühn
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

The increasing adoption of semantic web technology in application scenarios with frequently changing data has imposed new requirements on the underlying tools. Reasoning algorithms need to be optimized for the processing of dynamic knowledge bases and semantic frameworks have to provide novel mechanisms for detecting changes of knowledge. Today, the latter is mostly realized by implementing simple polling mechanisms. However, this implies client-side post-processing of the received results, causes high response times and limits the overall throughput of the system. In this paper, we present a heuristics framework for realizing a subscription mechanism for dynamic knowledge bases. By analyzing similarities between published information and resulting notifications, heuristics can be employed to "guess" subsequent notifications. As testing the correctness of guessed notifications can be implemented efficiently, notifications can be delivered to the subscribers in an earlier processing phase and the system throughput can be increased. We experimentally evaluate our approach based on a concrete application scenario.
Quantification and semi-supervised classification methods for handling changes in class distribution
Authors: Jack Chongjie Xue, Gary M. Weiss
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

In realistic settings the prevalence of a class may change after a classifier is induced and this will degrade the performance of the classifier. Further complicating this scenario is the fact that labeled data is often scarce and expensive. In this paper we address the problem where the class distribution changes and only unlabeled examples are available from the new distribution. We design and evaluate a number of methods for coping with this problem and compare the performance of these methods. Our quantification-based methods estimate the class distribution of the unlabeled data from the changed distribution and adjust the original classifier accordingly, while our semi-supervised methods build a new classifier using the examples from the new (unlabeled) distribution which are supplemented with predicted class values. We also introduce a hybrid method that utilizes both quantification and semi-supervised learning. All methods are evaluated using accuracy and F-measure on a set of benchmark data sets. Our results demonstrate that our methods yield substantial improvements in accuracy and F-measure.
Plenary lecture 8: contributions to the resolution of the Gibbs phenomenon
Authors: Nataniel Greene
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence is manifested as spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities. In this talk we review many of the methods which have been developed in recent years for dealing with this problem. We then describe some of our own contributions and ongoing investigations on the topic, including how wavelets can be used to obtain a multiresolution reconstruction of a function given its Fourier data.
Chemical kinetics-assisted, path-based smoke simulation
Authors: Yoojin Jang, Insung Ihm
Venue: Computer Animation and Virtual Worlds (2009)

Despite recent successes in physics-based fluid animation, generating desired fluid flow with intuitive control of its motion still remains a challenging problem in the special effects industry. In this paper, we propose a novel approach for path-based smoke simulation that explores the theory of chemical kinetics in an aim to provide a useful animation tool. By describing intended smoke effects through chemical reaction equations and adjusting their parameters, our method allows to easily create various interesting smoke effects that were often hard to get with previous techniques. To demonstrate the effectiveness of the presented animation framework, we describe several examples of path-based smoke animations, generated with easily understandable reaction equations and control parameters. Copyright &copy; 2009 John Wiley & Sons, Ltd. This paper presents a novel approach for path-based smoke simulation that explores the theory of chemical kinetics in an aim to provide a useful animation tool. By describing intended smoke effects through chemical reaction equations and adjusting their parameters, it allows to easily create various interesting smoke effects that were often hard to get with previous techniques. We describe several examples of path-based smoke animations, generated with easily understandable reaction equations and control parameters. Accepted for the CASA2009 special issue.
A 2D haptic glyph method for tactile arrays: Design and evaluation
Authors: Christoph W. Borst, Vijay B. Baiyya
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

We present a new framework for information cue rendering on 2D vibrotactile arrays, and we describe an experiment that investigated the feasibility of our approach. The methods are broadly applicable, but our work is motivated by the potential for a tactile array to provide an additional useful channel for information such as location cues related to dataset features or remote user behaviors in visualization systems. Our experiment measured the accuracy with which three basic haptic glyph parameters (position, direction, and an intensity profile) communicated information to users. Results show that multiple parameters can be communicated simultaneously by a glyph, although with reduced accuracy in some cases. In these cases, we give insight into relevant effects to guide the design of improved glyphs. Besides these results, novel contributions of our work are the general information cue approach for 2D arrays (2D haptic glyphs) and the extension of graphical visualization techniques to haptics (glyphs, spatial anti-aliasing, gamma correction).
Standardization Activities for IPTV Set-Top Box Remote Management
Authors: Jun Shan Wey, Joachim Lüken, Jürgen Heiles
Venue: IEEE Internet Computing (2009)

IPTV services are gaining widespread use, requiring service providers to have effective methods for remotely configuring and managing IPTV set-top boxes (STBs). Solutions for such remote management are becoming standards-based. This article examines published specifications and ongoing activities on IPTV STB remote management in four standards organizations: the Broadband Forum, the Digital Video Broadcasting Project, the Open IPTV Forum, and the Alliance for Telecommunication Industry Solutions IPTV Interoperability Forum. The authors compare the protocol and data model definitions, investigate interoperability test events, and comment on possible future directions for standardization.
Catch me if you can: permissive yet secure error handling
Authors: Aslan Askarov, Andrei Sabelfeld
Venue: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security (2009)

Program errors are a source of information leaks. Tracking these leaks is hard because error propagation breaks out of program structure. Programming languages often feature exception constructs to provide some structure to error handling: for example, the try...catch blocks in Java and Caml. Mainstream information-flow security compilers such as Jif and FlowCaml enforce rigid rules for exceptions in order to prevent leaks via public side effects of computation whose reachability depends on exceptions. This paper presents a general and permissive alternative to the rigid solution: the programmer is offered a choice for each type of error/exception whether to handle it or not. The security mechanism ensures that, in the former case, it is never handled and, in the latter case, it is always handled with the mainstream restrictions. This mechanism extends naturally to a language with procedures and output, where we show the soundness of the mechanism with respect to termination-insensitive noninterference.
Modeling service-driven architecture for distributed enterprise portal for maintaining global patch consistency
Authors: Hui-Ling Lin, Shao-Shin Hung, Derchian Tsaih
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Service-oriented architectures are increasingly used in the context of business processes. However, the proven practices for process-oriented integration of services are not well documented yet. In addition, modeling approaches for the integration of processes and services are neither mature nor do they exactly reflect the proven practices. This paper presents the design, implementation of an extensible, scalable, web services ripple propagate routable base, transnational hierarchical global patch consistent model called THGPCM (Transnational Hierarchical Global Patch Consistent Model). Improving the OPDS (Original Patching Data Source) enabled network equipments, capable of updating patch parameter that existed in enterprise with specified OPDS partially dependency relationships. The paper also proposed a new scalable patching replica routing service algorithm, that dynamic reconfiguration distributed forwarding data path within enterprises hierarchical region enterprise portal. Apply scenario can reduce the global patch service cost of transnational enterprise network equipments and minimum the turnaround time of patch service delay.
New algorithmic and hardness results on graph partitioning problems
Authors: Vadim Lozin
Venue:  (2007)

In this thesis we study algorithmic aspects of two graph partitioning problems &ndash; GRAPH COLORING and MAXIMUM CUT. This is a summary of main results of the thesis: (1) A polynomial-time algorithm for k-VERTEX-COLORABILITY in the class of P5-free graphs (for any fixed value k). (2) A proof of NP-completeness of VERTEX- and EDGE-COLORABILITY in the class of graphs with girth at least g for any value of g &ge; 3. (2) A polynomial-time algorithm for 3-VERTEX-COLORABILITY of (claw, hourglass)-free graphs and an extension of that result to an infinitely increasing family of subclasses of claw-free graphs. (3) An exact algorithm for MAX-CUT running in time O*(2(1-2/&Delta;) n) in the class of graphs with maximum degree &Delta;. (5) A proof of NP-completeness of MAX-CUT and MAX-BISECTION on unit disk graphs.
Taming the storage dragon: the adventures of hoTMaN
Authors: Shahram Ghandeharizadeh, Andrew Goodney, Chetan Sharma, Chris Bissell, Felipe Carino, Naveen Nannapaneni, Alex Wergeles, Aber Whitcomb
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

HoTMaN (HoT-standby MaNager) is a joint project between MySpace and USC Database Laboratory to design and develop a tool to ensure a 24x7 up-time and ease administration of Terabytes of storage that sits underneath hundreds of database servers. The HoTMaN tool's innovation and uniqueness is that it can, with a few clicks, perform operational tasks that require hundreds of keyboard strokes by "trusted trained" experts. With HoTMaN, MySpace can within minutes migrate the relational database(s) of a failed server to a hot-standby. A process that could take over 1 hour and had a high potential for human error is now performed reliably. A database internal to HoTMaN captures all virtual disks, volume and file configurations associated with each SQL Server and candidate hot-standby servers where SQL server processing could be migrated. HoTMaN is deployed in production and its current operational benefits include: (i) enhanced availability of data, and (ii) planned maintenance and patching.
Managing Risk in Recurrent Auctions for Robust Resource Allocation
Authors: Victor Muòoz, Dídac Busquets
Venue: Proceeding of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium (2008)

Auctions can be used to solve resource allocation problems where tasks have to be assigned to resources in such a way that no resource gets overused and an objective function is optimized. In some cases a robust solution is preferable to the optimal solution as it may still be applicable even if unexpected changes in the environment occur. In this paper we present a robustness mechanism for auctions, producing feasible and near optimal solutions even if non-planned events occur. The proposed mechanism has been used in a real problem obtaining successful results.
Cross Species Expression Analysis of Innate Immune Response
Authors: Yong Lu, Roni Rosenfeld, Gerard J. Nau, Ziv Bar-Joseph
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

The innate immune response is the first line of host defense against infections. This system employs a number of different types of cells which in turn activate different sets of genes. Microarray studies of human and mouse cells infected with various pathogens identified hundreds of differentially expressed genes. However, combining these datasets to identify common and unique response patterns remained a challenge. We developed methods based on probabilistic graphical models to combine expression experiments across species, cells and pathogens. Our method analyzes homologous genes in different species concurrently overcoming problems related to noise and orthology assignments. Using our method we identified both core immune response genes and genes that are activated in macrophages in both human and mouse but not in dendritic cells, and vice versa. Our results shed light on immune response mechanisms and on the differences between various types of cells that are used to fight infecting bacteria.Supporting website: http://www.cs.cmu.edu/~lyongu/pub/immune/
Semantic web in eHealth
Authors: Erdogan Dogdu
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

It is getting harder to extract useful information from the enormous amount of data that is being collected in the medical information systems or eHealth systems due to the distributed and very complex nature of this data. Semantic web technologies, which are mainly developed for use in web information systems, are providing efficient solutions for the management of complex and distributed data, and it can be used in the medical information systems as well. Semantic web offers solutions in encoding data meaningfully, and consequently data can be searched efficiently, and integrated easily. In this paper we briefly describe semantic web technologies and present current work on the use of semantic web in medical information systems.
On post correspondence problem for letter monotonic languages
Authors: Vesa Halava, Jarkko Kari, Yuri Matiyasevich
Venue: Theoretical Computer Science (2009)

We prove that for given morphisms g,h:{a"1,a"2,...,a"n}->B^*, it is decidable whether or not there exists a word w in the regular language a"1^*a"2^*...a"n^* such that g(w)=h(w). In other words, we prove that the Post Correspondence Problem is decidable if the solutions are restricted to be from this special language. This yields a nice example of an undecidable problem in integral matrices which cannot be directly proved undecidable using the traditional reduction from the Post Correspondence Problem.
A legal information flow (LIF) scheduler based on role-based access control model
Authors: Tomoya Enokido, Valbona Barolli, Makoto Takizawa
Venue: Computer Standards Interfaces (2009)

Information systems have to be consistent and secure in presence of multiple conflicting transactions. The role-based access control (RBAC) model is widely used to keep information systems consistent and secure. A role shows a job function in an enterprise and is a set of access rights (permissions). Here, a subject s is allowed to issue a method op to an object o only if an access right is included in the roles granted to the subject s. A subject is granted one or more than one role and issues a transaction to multiple objects. The transaction is assigned with some roles of the subject which is referred to as purpose. Even if every access request issued by every subject is authorized in the roles, illegal information flow might occur as well known confinement problem. In this paper, we define a legal information flow (LIF) relation (R"1 @?^IR"2) among a pair of role families R"1 and R"2 to prevent illegal information flow. Here, an LIF relation R"1 @?^IR"2 shows that no illegal information flow occur if a transaction T"1 with a role family R"1 is performed prior to another transaction T"2 with a role family R"2. In addition, it is significant to discuss which transaction to be performed prior to another transaction if the both transactions manipulate the same object in a conflicting way. In this paper, we define a significantly precedent relation R"1 @?^sR"2 among role families R"1 and R"2 which implies that the role family R"2 is more significant than R"1. Suppose a pair of transactions T"1 and T"2 with role families R"1 and R"2 issue conflicting methods op"1 and op"2, respectively, to an object o. If R"1 @?^sR"2, op"2 is performed on the object o prior to op"1. The more significant a transaction is, the more prior it is performed. We discuss a legal information flow (LIF) scheduler to synchronize transactions so as to prevent illegal information flow and to serialize conflicting methods from multiple transactions in terms of significancy and information flow relation of roles families. We evaluate the LIF scheduler in terms of how much illegal information flow can be prevented compared with the other scheduler.
Optimal multilevel redundancy allocation in series and series-parallel systems
Authors: Ranjan Kumar, Kazuhiro Izui, Masataka Yoshimura, Shinji Nishiwaki
Venue: Computers and Industrial Engineering (2009)

To achieve truly optimal system reliability, the design of a complex system must address multilevel reliability configuration concerns at the earliest possible design stage, to ensure that appropriate degrees of reliability are allocated to every unit at all levels. However, the current practice of allocating reliability at a single level leads to inferior optimal solutions, particularly in the class of multilevel redundancy allocation problems. Multilevel redundancy allocation optimization problems frequently occur in optimizing the system reliability of multilevel systems. It has been found that a modular scheme of redundancy allocation in multilevel systems not only enhances system reliability but also provides fault tolerance to the optimum design. Therefore, to increase the efficiency, reliability and maintainability of a multilevel reliability system, the design engineer has to shift away from the traditional focus on component redundancy, and deal more effectively with issues pertaining to modular redundancy. This paper proposes a method for optimizing modular redundancy allocation in two types of multilevel reliability configurations, series and series-parallel. A modular design variable is defined to handle modular redundancy in these two types of multilevel redundancy allocation problem. A customized genetic algorithm, namely, a hierarchical genetic algorithm (HGA), is applied to solve the modular redundancy allocation optimization problems, in which the design variables are coded as hierarchical genotypes. These hierarchical genotypes are represented by two nodal genotypes, ordinal and terminal. Using these two genotypes is extremely effective, since this allows representation of all possible modular configurations. The numerical examples solved in this paper demonstrate the efficacy of a customized HGA in optimizing the multilevel system reliability. Additionally, the results obtained in this paper indicate that achieving modular redundancy in series and series-parallel systems provides significant advantages when compared with component redundancy. The demonstrated methodology also indicates that future research may yield significantly better solutions to the technological challenges of designing more fault-tolerant systems that provide improved reliability and lower lifecycle cost.
Rich content plug-ins for the teaching machine
Authors: Theodore S. Norvell, Michael P. Bruce-Lockhart
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

In this paper, we describe a pedagogical tool for providing rich content in early programming courses.
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Authors: Xi-Shun Zhao, Yu-Ping Shen
Venue: Journal of Computer Science and Technology (2007)

In this paper, it is shown that stable model semantics, perfect model semantics, and partial stable model semantics of disjunctive logic programs have the same expressive power with respect to the polynomial-time model-equivalent reduction. That is, taking perfect model semantics and stable model semantic as an example, any logic program P can be transformed in polynomial time to another logic program P′ such that perfect models (resp. stable models) of P 1-1 correspond to stable models (resp. perfect models) of P′, and the correspondence can be computed also in polynomial time. However, the minimal model semantics has weaker expressiveness than other mentioned semantics, otherwise, the polynomial hierarchy would collapse to NP.