ppxscal/embedding_network huggingface dataset:
Failure-free coordinators synthesis for component-based architectures
Authors: Massimo Tivoli, Paola Inverardi
Venue: Science of Computer Programming (2008)

One of the main problems in component assembly is how to establish properties on the assembly code by only assuming a limited knowledge of the single component properties. Our answer to this problem is an architectural approach in which the software architecture imposed on the assembly prevents black-box integration anomalies. The basic idea is to build applications by assuming a ''coordinator-based'' architectural style. We, then, operate on the coordinating part of the system architecture to obtain an equivalent version of the system which is failure-free. A failure-free system is a deadlock-free one and it does not violate any specified coordination policy. A coordination policy models those interactions of components that are actually needed for the overall purpose of the system. We illustrate our approach by means of an explanatory example and validate it on an industrial case study that concerns the development of systems for safeguarding, fruiting, and supporting the Cultural Heritage.
Video analysis of pair programming
Authors: Andreas Höfer
Venue: Proceedings of the 2008 international workshop on Scrutinizing agile practices or shoot-out at the agile corral (2008)

This article presents the results of a video analysis of nine pair programming sessions of undergraduate students. The analysis focuses on the keyboard and mouse control of the programming partners. It shows that most pairs do not share the keyboard and mouse equally but rather have one partner who is more active than the other. Keyboard and mouse control changes frequently, casting doubt on the existence of the driver and navigator role as commonly defined in literature on extreme programming.
A Semantic Characterization Of Full Abstraction For Typed Lambda Calculi
Authors: K. Mulmuley
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Full abstraction is a well known issue in denotational semantics. For a special case of typed lambda calculus, PCF, Plotkin showed that the classical model consisting of domains of continuous functions is not fully abstract. Milner constructed a fully abstract model of typed lambda calculus syntactically. However, its precise relationship with the classical model was not clear, and hence it remained open whether a fully abstract model can be constructed which is related to the classical model in a pleasant way. In this paper we show that a fully abstract, extensional model of typed lambda calculus can be constructed as a homomorphic retraction of the classical model. 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
An Improved Role-Based Workflow Access Control Model
Authors: Hui Zhao, Zhiyi Fang, Peng Xu, Lianyu Zhao, Jin Liu, Tianyang Wang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The Role-Based Access Control (RBAC) model is widely accepted as the model of access control of workflow management system (WFMS). However, the RBAC model exist a lot of limit when it describe the authorization constraint of access control. Especially , the RBAC model cannot express the transaction character and the phase authorization constraint when the role and the user perform the task. This paper proposed an improved role-Based access control model for WFMS. The new authorization concepts for WfMS are defined respectively. The access control rules of IRBAC model are build, which can express complex access control constraints for WfMS.
Maintaining video quality and optimizing video delivery over the bandwidth constrained DSL last mile through intelligent packet drop
Authors: Tom N. M. Van Caenegem, Kris O. Struyve, Koen Laevens, Danny De Vleeschauwer, Randy Sharpe
Venue: Bell Labs Technical Journal (2008)

The technological challenges for an Internet Protocol television (IPTV) service provider to bring high quality video services into the home through a dedicated bandwidth limited digital subscriber line (DSL) access link are significant. However, at the same time, the dedicated DSL link provides certain opportunities as it allows for service customization on the network level, without impacting any other customers. In this paper, the concept of intelligent packet drop inside a digital subscriber line access multiplexer (DSLAM) is introduced. Intelligent packet drop makes use of the fact that some packets containing video information (e.g., I-picture or P-picture) are more important than others (e.g., B-picture), and this importance level can be indicated in the packet header. When congestion in the DSLAM occurs, the low priority packets are preferentially dropped. Provided some (simple) picture loss concealment is performed in the set-top box, intelligent packet drop will not significantly impact the quality of experience (QoE), as evidenced by subjective tests that have been conducted. Simulations have shown that the intelligent packet drop in a DSLAM enables the IPTV service provider to increase the number of customers eligible for a given IPTV service package delivered over the DSL link. It also enables fast channel change (FCC) service without dedicated bandwidth overhead. &copy; 2008 Alcatel-Lucent.
Flexible and efficient transfer of multidimensional data in grid
Authors: Huan Yang, Fei Shen, Linpeng Huang
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

When grid applications operate on multidimensional data, query and transfer are two widely used operations. To support flexible query operation, a storage structure based on partition the multidimensional data is adopted. However, this will degrade the performance of the transfer. This paper investigates this problem and proposes the logically linked file (LLF) approach to solve it. By logically linking the qualified non-continuous data sets to a LLF and providing a specific transfer mechanism for LLF, the transfer performance is improved. The experiment shows the transfer performance isn't affected by the storage structure any more.
Large asymmetries of magnetoresistance loops in Co-line structures
Authors: C. Christides, Th. Speliotis, M. Chatzichristidi, I. Raptis
Venue: Microelectronic Engineering (2008)

The dependence of magnetoresistance (MR) on the magnetization reversal processes was studied in Co and NiFe line structures with pads. Conventional patterning and deposition processes are applied for the fabrication of a device that consists of five-line structures with a line-width of 2@mm. It is demonstrated that the large asymmetry of AMR loops in Co-lines, which are observed after a field-cooling process, might pave the way for applications in magnetoelectronic devices where the magnetic field direction parallel or antiparallel to dc-current direction inside the magnetic line structures really matters.
Risks to the public
Authors: Peter G. Neumann
Venue: ACM SIGSOFT Software Engineering Notes (2008)

Edited by Peter G. Neumann (Risks Forum Moderator and Chairman of the ACM Committee on Computers and Public Policy), plus personal contributions by others, as indicated. Opinions expressed are individual rather than organizational, and all of the usual disclaimers apply. We address problems relating to software, hardware, people, and other circumstances relevant to computer systems. To economize on space, we include pointers to items in the online Risks Forum: (R i j) denotes RISKS vol i number j. Cited RISKS items generally identify contributors and sources, together with URLs. Official RISKS archives are available at www.risks.org (which redirects to Newcastle and gets you nice html formatting and a search engine courtesy of Lindsay Marshall; http://catless.ncl.ac.uk/Risks/i.j.html gets you (R i j)) and at ftp://www.sri.com/risks.
Generalized Nash equilibrium problems and Newton methods
Authors: Francisco Facchinei, Andreas Fischer, Veronica Piccialli
Venue: Mathematical Programming: Series A and B (2008)

The generalized Nash equilibrium problem, where the feasible sets of the players may depend on the other players&#x2019; strategies, is emerging as an important modeling tool. However, its use is limited by its great analytical complexity. We consider several Newton methods, analyze their features and compare their range of applicability. We illustrate in detail the results obtained by applying them to a model for internet switching.
Improving a traffic operator interface using an ontology and intelligent rules
Authors: Arturo Sáez Esteve, Vicente R. Tomás López, J. Javier Samper Zapater, Leo van der Berg
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The Transportation and traffic domain is cross-disciplinary; Different areas must be covered to solve complex problems. It also involves the use of different systems for monitoring, visualization, information distribution, control, communication, etc. All of these systems are implemented using different levels of technology. In most cases the control of these systems is handled by [graphic] user interfaces. In the past years the number of systems has grown substantially and because of their "monolytic" design, they have different and in most cases not-compatible user-interfaces. A generic interface would be useful to improve not only the different processes but also the efficiency of the operator This paper describes not only a possible design for a generic user interface, but also the use of an ontology and the use of intelligent rules to support an operator in his or her complex daily task.
Research and Application on Typical Process Knowledge Discovery in Mechanical Manufacturing Enterprise
Authors: Xiaoliang Jia, Zhenming Zhang, Xitian Tian
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The source and composing of process planning knowledge is analyzed based on the state of art in discrete mechanical manufacturing enterprise. On the basis of the widely application of computer aided process planning system (CAPP) in mechanical manufacturing enterprise, the concept of process planning knowledge discovery (PPKD) is proposed for product process planning database. CAPPFramework (a CAPP development platform that is developed by Northwestern Polytechnical University supported by China) is taken as a basic development platform, the technology architecture of process planning knowledge discovery is founded based on object-oriented model driven technology, and the process planning knowledge discovery script is designed. Elementary application research in typical process summarization is described in detail. The technology of PPKD has been used in mechanical manufacturing enterprise to support the automatically knowledge acquisition in CAPP system, and it shows good application effect.
Data utility and privacy protection trade-off in k-anonymisation
Authors: Grigorios Loukides, Jianhua Shao
Venue: Proceedings of the 2008 international workshop on Privacy and anonymity in information society (2008)

K-anonymisation is an approach to protecting privacy contained within a dataset. A good k-anonymisation algorithm should anonymise a dataset in such a way that private information contained within it is hidden, yet the anonymised data is still useful in intended applications. However, maximising both data utility and privacy protection in k-anonymisation is not possible. Existing methods derive k-anonymisations by trying to maximise utility while satisfying a required level of protection. In this paper, we propose a method that attempts to optimise the trade-off between utility and protection. We introduce a measure that captures both utility and protection, and an algorithm that exploits this measure using a combination of clustering and partitioning techniques. Our experiments show that the proposed method is capable of producing k-anonymisations with required utility and protection trade-off and with a performance scalable to large datasets.
Bayesian decisions with differentially fed neural networks
Authors: R. Manjunath, K. S. Gurumurthy
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Generally the neural networks employing Bayesian decision do not output one simple hypothesis, but a manifold of probability distributions. This throws out the bayes posterior coefficients as a large number of classifiers. Here a novel method based on differential feedback is explored to merge these classifiers. The experimental results confirm affine transportation of these classifiers. Also, it has been shown that the differentially fed Artificial Neural Networks (ANNs) learn in much the same way as Bayesian learning and are hence resistant to over fitting.
Improved upper bounds on the crossing number
Authors: Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph G that does not contain a fixed graph as a minor has crossing number O(Δn), where G has n vertices and maximum degree Δ. This dependence on n and Ø is best possible. This result answers an open question of Wood and Telle [New York J. Mathematics, 2007], who proved the best previous bound of O(Ø2n). In addition, we prove that every K5-minor-free graph G has crossing number at most 2∑v deg(v)2, which again is the best possible dependence on the degrees of G. We also study the convex and rectilinear crossing numbers, and prove an O(Øn) bound for the convex crossing number of bounded pathwidth graphs, and a ∑v deg(v)2 bound for the rectilinear crossing number of K3;3-minor-free graphs.
Productivity as a metric for visual analytics: reflections on e-discovery
Authors: Sean M. McNee, Ben Arnette
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

Because visual analytics is not used in a vacuum, there are no cut-and-dry metrics which can accurately evaluate visual analytic tools. These tools are used inside of existing business processes, thus metrics to evaluate these tools must measure the productivity of information workers on the data-centric critical path of these business processes. In this paper, we argue for process-centric visual analytic metrics grounded in the concept of information worker productivity. We will place our discussion the context of legal e-discovery, the business process within which Attenex operates and within which we have demonstrated that visual analytic tools can increase productivity dramatically. After discussing how productivity metrics for visual analytics helped e-discovery, we make the argument that they can help any data-intensive business process and discuss both how to create these metrics and apply them successfully.
Mining roles with semantic meanings
Authors: Ian Molloy, Hong Chen, Tiancheng Li, Qihua Wang, Ninghui Li, Elisa Bertino, Seraphin Calo, Jorge Lobo
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

With the growing adoption of role-based access control (RBAC) in commercial security and identity management products, how to facilitate the process of migrating a non-RBAC system to an RBAC system has become a problem with significant business impact. Researchers have proposed to use data mining techniques to discover roles to complement the costly top-down approaches for RBAC system construction. A key problem that has not been adequately addressed by existing role mining approaches is how to discover roles with semantic meanings. In this paper, we study the problem in two settings with different information availability. When the only information is user-permission relation, we propose to discover roles whose semantic meaning is based on formal concept lattices. We argue that the theory of formal concept analysis provides a solid theoretical foundation for mining roles from userpermission relation. When user-attribute information is also available, we propose to create roles that can be explained by expressions of user-attributes. Since an expression of attributes describes a real-world concept, the corresponding role represents a real-world concept as well. Furthermore, the algorithms we proposed balance the semantic guarantee of roles with system complexity. Our experimental results demonstrate the effectiveness of our approaches.
Using the RFIDs to Construct the Ubiquitous Self-Learning Environment for Understanding the Plants in the Schoolyard
Authors: Jenq-Muh Hsu, Yen-Shou Lai, Pao-Ta Yu
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

This paper uses the radio frequency identification (RFID) to construct a smart ubiquitous learning environment. In the ubiquitous computing environment, learners can get the right learning contents to achieve self-learning at the right place and the right time through non-contact RFID identification. The learning system is composed of three layers, the portable learning object, the mobile device, and the system modules for learning management and manipulation. A total of twenty-eight students recruited from fifth grade elementary school are participating in the quasi-experimental study. After three weeks of investigated subject learning, the results showed that the average scores of attitude for the experimental group are higher than the control one. There was statistical difference for learning attitude between them.
Robust and sustainable schedulability analysis of embedded software
Authors: Madhukar Anand, Insup Lee
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

For real-time systems, most of the analysis involves efficient or exact schedulability checking. While this is important, analysis is often based on the assumption that the task parameters such as execution requirements and inter-arrival times between jobs are known exactly. In most cases, however, only a worst-case estimate of these quantities is available at the time of analysis. It is therefore imperative that schedulability analysis hold for better parameter values (Sustainable Analysis). On the other hand, if the task or system parameters turn out to be worse off, then the analysis should tolerate some deterioration (Robust Analysis). Robust analysis is especially important, because the implication of task schedulability is often weakened in the presence of optimizations that are performed on its code, or dynamic system parameters. In this work, we define and address sustainability and robustness questions for analysis of embedded real-time software that is modeled by conditional real-time tasks. Specifically, we show that, while the analysis is sustainable for changes in the task such as lower job execution times and increased relative deadlines, it is not the case for code changes such as job splitting and reordering. We discuss the impact of these results in the context of common compiler optimizations, and then develop robust schedulability techniques for operations where the original analysis is not sustainable.
A Graphic Reputation Analysis System for Mining Japanese Weblog Based on both Unstructured and Structured Information
Authors: Guangwei Wang, Kenji Araki
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In today's rapidly expanding information environment, an immediate need exists for better tools to help a user dynamically navigate large result lists and search structures. However, at present, a lot of research is focused only on the information analysis step, and is not continued on to the step that makes the analysis results visible, especially for Asian languages. In contrast, we propose a novel graphic reputation analysis system for Japanese. It not only integrates the analysis of unstructured opinion information and structured review rating data, but also presents the information using a simple and flexible GUI with visual mining graphs. The proposed system can help inexperienced users, who want to look over opinions on the Web before purchasing something, to make a quick decision. It also gives useful hints for other Asian languages. In this paper, we describe the detailed algorithms of the system, and show the performance through experiments.
The weighted majority algorithm
Authors: N. Littlestone
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The construction of prediction algorithms in a situation in which a learner faces a sequence of trials, with a prediction to be made in each, and the goal of the learner is to make few mistakes is studied. It is assumed that the learner has reason to believe that one of some pool of known algorithms will perform well but does not know which one. A simple and effective method, based on weighted voting, is introduced for constructing a compound algorithm in such a circumstance. It is called the weighted majority algorithm and is shown to be robust with respect to errors in the data. Various versions of the weighted majority algorithm are discussed, and error bounds for them that are closely related to the error bounds of the best algorithms of the pool are proved.
The orthogonality in C++
Authors: Feng-Jen Yang
Venue: Journal of Computing Sciences in Colleges (2008)

Orthogonality was first introduced to the design of programming languages in 1960s and still stands well to the test of time. A language with better orthogonality tends to be easier to understand and more intuitive to use. In this paper, I examine the orthogonality in C++ from the perspectives of type systems, expressions and flow controls.
Minimizing linewidth roughness in Step and Flash Imprint Lithography
Authors: Niyaz Khusnatdinov, Gerard M. Schmid, Cynthia B. Brooks, Dwayne LaBrake, Douglas J. Resnick, Mark W. Hart, Kailash Gopalakrishnan, Rohit Shenoy, Ron Jih, Ying Zhang, Edmund Sikorski, Mary Beth Rothwell, Jordan Owens, Arnie Ford
Venue: Microelectronic Engineering (2008)

Optical lithography has been successful in achieving deep sub-wavelength images by the continuous improvement of lens systems, resists and the introduction of phase shift masks. One of the key challenges in attempting to pattern feature sizes less than 32nm is the ability to minimize feature roughness while maintaining acceptable process throughput. Control of linewidth roughness (LWR) is critical, since it adversely affects device speed and timing in CMOS circuits. Step and Flash Imprint Lithography is a step-and-repeat imprint process that has demonstrated excellent feature resolution. Since the imprint process itself adds no additional linewidth roughness to the patterning process, the burden of minimizing LWR falls to the template fabrication process. In this paper, LWR was evaluated for several different templates. Feature sizes ranging from 20nm to 50nm were studied, and LWR was calculated from SEM images of the template, on imprinted wafers, and after pattern transfer. On average, LWR was extremely low (less than 3nm, 3@s), and independent of the processing step and feature size. A minimum LWR of 1.7nm was achieved, which is the required LWR for processing at the 32nm node.