ppxscal/embedding_network huggingface dataset:
Approximability of Average Completion Time Scheduling on Unrelated Machines
Authors: René A. Sitters
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We show that minimizing the sum of completion times on unrelated machines is APX-hard if preemption of jobs is allowed. Additionally, we show that randomized rounding of a convex quadratic program gives a non-preemptive schedule for which the sum of weighted completion times is less than 1.81 times the optimal preemptive sum. This factor is 2.78 if release dates are involved. We sketch how the ratios can be reduced further.
Using System Expectations to Manage User Interactions
Authors: Filipe M. Martins, Ana Mendes, Joana Paulo Pardal, Nuno J. Mamede, João P. Neto
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

This paper presents a new approach to parse multiple data types in Dialogue Systems. In its initial version, our spoken dialogue systems platform had a single and generic parser. However, when developing two new systems, the parser's complexity increased and data types, like numbers, dates and free text messages, were not correctly interpreted. The solution we present to cope with these problems allows the system to rely on expectations about the flow of the dialogue based on the dialogue history and context. Because these expectations guide the parsing process, a positive impact is achieved in the recognition of objects in the user's utterance. However, if the user fails to match the system's expectations, for instance by changing the focus of the conversation, the system is still capable of understanding the input and recognizing the referred objects.
Multiagent Search Strategy for Combinatorial Optimization Problems in Ant Model
Authors: Seokmi Hong, Seunggwan Lee
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Ant Colony System (ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants that accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, it is necessary to make a search for various edges. In existing ACS, the local updating rule assigns the fixed pheromone value to visited edge in all process. In this paper, modified local updating rule gives the pheromone value according to the number of visiting and the edge's distance between visited nodes. Our approach can have less local optima than existing ACS and can find better solution by taking advantage of more information during searching.
Data Partitioning in Data Warehouses: Hardness Study, Heuristics and ORACLE Validation
Authors: Ladjel Bellatreche, Kamel Boukhalfa, Pascal Richard
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

Horizontal data partitioning is a non redundant optimization technique used in designing data warehouses. Most of today's commercial database systems offer native data definition language support for defining horizontal partitions of a table. Two types of horizontal partitioning are available: primary and derived horizontal fragmentations. In the first type, a table is decomposed into a set of fragments based on its own attributes, whereas in the second type, a table is fragmented based on partitioning schemes of other tables. In this paper, we first show hardness to select an optimal partitioning schema of a relational data warehouse. Due to its high complexity, we develop a hill climbing algorithm to select a near optimal solution. Finally, we conduct extensive experimental studies to compare the proposed algorithm with the existing ones using a mathematical cost model. The generated fragmentation schemes by these algorithms are validated on Oracle 10g using data set of APB1 benchmark.
Towards Large Scale Semantic Annotation Built on MapReduce Architecture
Authors: Michal Laclavík, Martin Šeleng, Ladislav Hluchý
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Automated annotation of the web documents is a key challenge of the Semantic Web effort. Web documents are structured but their structure is understandable only for a human that is the major problem of the Semantic Web. Semantic Web can be exploited only if metadata understood by a computer reach critical mass. Semantic metadata can be created manually, using automated annotation or tagging tools. Automated semantic annotation tools with the best results are built on different machine learning algorithms requiring training sets. Another approach is to use pattern based semantic annotation solutions built on NLP, information retrieval or information extraction methods. Most of developed methods are tested and evaluated on hundreds of documents which cannot prove its real usage on large scale data such as web or email communication in enterprise or community environment. In this paper we present how a pattern based annotation tool can benefit from Google's MapReduce architecture to process large amount of text data.
Registration and matching of large geometric datasets for cultural heritage applications
Authors: Szymon Rusinkiewicz
Venue:  (2008)

The last decade has seen an increasing number of projects to acquire detailed 3-D representations of cultural heritage objects at museums and archaeological excavations, with a goal of improving preservation, understanding, restoration, and dissemination. However, careful study and virtual reassembly of cultural heritage objects often requires sub-millimeter precision to faithfully capture fine details, irrespective of the size and number of objects. Existing 3-D scanning technologies can produce such detail for small models with a modest amount of manual labor but do not scale to the tens of thousands of fragments that may be present at an excavation. High-precision scanners also have limited viewing volumes, making it very difficult to acquire large objects such as statues. Most scanning technologies used in cultural heritage acquire many raw 3-D scans, each from a single viewpoint. This data does not become readily usable until the relative viewpoints of each scan have been recovered, and the data is merged into a final model. Alignment, or registration, is the process of recovering these viewpoints, and is the focus of this thesis. Assembling a large, fragmented object from its pieces involves recovering the pose of each fragment. We therefore examine the virtual reassembly problem as one of alignment. We examine the alignment and assembly problems in cultural heritage scanning using data from the Digital Michelangelo and Theran Fresco projects. In the context of the Digital Michelangelo Project, which scanned many Michelangelo statues in Florence at approximately 0.25mm precision, we address the challenges of aligning large, detailed range scans. Because of the statues&rsquo; size, deformations due to calibration error are inevitable. We present an algorithm which accommodates warp in many large scans, thereby preserving the raw detail in the final model. We also consider the case of many small range scans, in the context of the Theran Fresco project, which is using 3-D models of fresco fragments to aid in reconstruction. Although fragments contain few range scans, they lack the detail required for stable, automatic alignment using traditional techniques. We show how to exploit the properties of fresco fragments to obtain robust, automatic alignments, and to manually correct any misalignment in only a few seconds. Finally, we present a method for matching fresco fragments based only on geometry. Many fragments contain no decoration or distinctive edge features, so exhaustively matching edge geometry between all pairs of fragments is essential. We show how this problem relates to range scan alignment, and present a new convolution-like algorithm for efficiently computing all possible alignment of each fragment pair.
Activity-Based Scheduling of IT Changes
Authors: David Trastour, Maher Rahmouni, Claudio Bartolini
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Change management is a disciplined process for introducing required changes onto the IT environment, with the underlying objective of minimizing disruptions to the business services as a result of performing IT changes. Currently, one of the most pressing problems in change management is the scheduling and planning of changes. Building on an earlier mathematical formulation of the change scheduling problem, in this paper we take the formulation of the problem one step further by breaking down the changes into the activities that compose them. We illustrate the theoretical viability of the approach, discuss the limit of its applicability to real life scenarios, describe heuristic techniques that promise to bridge the scalability gap and provide experimental validation for them.
Bio-Surveillance Monitoring with a Wireless Network
Authors: P. Mariño, F. P. Fontán, M. A. Domínguez, S. Otero
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Biological research in agriculture needs a lot of specialized electronic sensors in order to fulfill different goals, like as: climate monitoring, soil and fruit assessment, control of insects and diseases, chemical pollutants, identification and control of weeds, crop tracking, and so on. That research must be supported by consistent biological models able to simulate diverse environmental conditions, in order to predict the right human actions before risky biological damage could be irreversible. In this paper is described an experimental distributed network based on climatic an biological wireless sensors, for providing real measurements in order to validate different biological models used for viticulture applications. Firstly is introduced the experimental network for field automatic data acquisition, as a system based in a distributed process. Following, the design of the wireless network is explained in detail, with a previous discussion about the state-of-the-art, and some measurements for viticulture research are pointed out. Finally future developments are stated.
Parameter tuning and evaluation of an affinity prediction using protein-protein docking
Authors: T. Yoshikawa, K. Tsukamoto, Y. Hourai, K. Fukui
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

We have developed a system, which we call affinity evaluation and prediction (AEP) system, to evaluate and predict the partners in protein-protein interaction (PPI) by using a statistical method for calculated docking scores. The complex-protein structures obtained in shape complementary evaluation are selected by a newly developed clustering method called grouping. Our previous experiments showed that the AEP system has a tendency to give different accuracy depending on biologically significant protein dataset and data scale (20×20= 400 protein pairs). In this study, we set a data scale (54×54=2916 protein pairs) including 54 biologically significant complexes. As a result of receiver operating characteristics (ROC) analysis, the AEP system obtained 55.6% sensitivity (=recall), 70.6% specificity, 3.44% precision, 70.3% accuracy, 6.48% F-measure and an area under the curve (AUC) of 0.655. The prediction accuracy of F-measure was about 1.82 times higher than that of a random sampling (F-measurerandom=3.57%). By optimizing the grouping procedure, the AEP system successfully predicted 30 protein pairs (among 54 pairs) that were biologically significant.
An Efficient Algorithm and Its Parallelization for Computing PageRank
Authors: Jonathan Qiao, Brittany Jones, Stacy Thrall
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper, an efficient algorithm and its parallelization to compute PageRank are proposed. There are existing algorithms to perform such tasks. However, some algorithms exclude dangling nodes which are an important part and carry important information of the web graph. In this work, we consider dangling nodes as regular web pages without changing the web graph structure and therefore fully preserve the information carried by them. This differs from some other algorithms which include dangling nodes but treat them differently from regular pages for the purpose of efficiency. We then give an efficient algorithm with negligible overhead associated with dangling node treatment. Moreover, the treatment poses little difficulty in the parallelization of the algorithm.
Countermeasures against Government-Scale Monetary Forgery
Authors: Alessandro Acquisti, Nicolas Christin, Bryan Parno, Adrian Perrig
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Physical cash is vulnerable to rising threats, such as large-scale, government-mandated forgeries, that digital cash may protect against more effectively. We study mechanisms to combine physical cash with digital cash to remove their respective shortcomings and obtain their combined advantages. We discuss initial mechanisms and examine their cost and benefit trade-offs.
Low Latency Messages on Distributed Memory Multiprocessors
Authors: Matt Rosing, Joel Saltz
Venue: Scientific Programming (1995)

This article describes many of the issues in developing an efficient interface for communication on distributed memory machines. Although the hardware component of message latency is less than 1 ws on many distributed memory machines, the software latency associated with sending and receiving typed messages is on the order of 50 &mu;s. The reason for this imbalance is that the software interface does not match the hardware. By changing the interface to match the hardware more closely, applications with fine grained communication can be put on these machines. This article describes several tests performed and many of the issues involved in supporting low latency messages on distributed memory machines.
Optimal st-Orientations for Plane Triangulations
Authors: Huaming Zhang, Xin He
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

For a plane triangulation G with n vertices, it has been proved that there exists a plane triangulation G with n vertices such that for any st-orientation of G, the length of the longest directed paths of G from s to t is $\geq \lfloor \frac{2n}{3}\rfloor$ [18] . In this paper, we prove the bound $\frac{2n}{3}$ is optimal by showing that every plane triangulation G with n-vertices admits an st-orientation with the length of its longest directed paths bounded by $\frac {2n}{3}+O(1)$. In addition, this st-orientation is constructible in linear time. A by-product of this result is that every plane graph G with n vertices admits a visibility representation with height $\le \frac{2n}{3}+O(1)$, constructible in linear time, which is also optimal.
Business Model Engineering Analysis on Mobile Client-Side Software Platform Strategies
Authors: Toshihiko Yamakami
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

The mobile Internet catches attention as mobile data services penetrate everyday life. The mobile Internet has witnessed an emerging challenges for data service platform engineering. The author describes how the mobile data service platform engineering is performed from a business model perspective. First, the author discusses the challenges in mobile client-side software platform development. Then, the author discusses the platform competence and acceptance models. It is followed by the discussion of phased views of mobile data services and standardization. The author presents a cost structure of software platform engineering. It is followed by advertisement-based analysis of success factors.
Debriefing surgeons on non-technical skills (NOTSS)
Authors: S. Yule, R. Flin, N. Maran, G. Youngson, A. Mitchell, D. Rowley, S. Paterson-Brown
Venue: Cognition, Technology and Work (2008)

Surgical trainees must maximise the educational and developmental opportunities of time spent in the operating theatre. Post-operative debriefing on performance based on observed skills is one way of achieving this and is regularly done in other high-risk professions. The non-technical skills for surgeons (NOTSS) behaviour rating system allows surgeons to observe trainees&#x2019; behaviour in the workplace and provide feedback for skill improvement in a structured manner. This paper describes the process of debriefing using NOTSS and presents the results of a usability trial. Two case studies also illustrate how the system was used. The majority of surgical trainers who participated reported that the NOTSS system provided a common language to discuss non-technical skills and was a valuable adjunct to currently available assessment tools. Some trainers found interpersonal skills more difficult to rate than cognitive skills but 73% (n&#x00a0;=&#x00a0;8) felt that routine use of the system would enhance patient safety.
Access Types
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes various improvements concerning access types for Ada 2005.Ada 2005 permits all access types to be access to constant types and to indicate that null is not an allowed value in all contexts. Anonymous access types are permitted in more contexts than just as access parameters and discriminants; they can also be used for variables and all components of composite types. This further use of access types is of considerable value in object oriented programming by reducing the need for (unnecessary) explicit type conversions.A further major improvement concerns access to subprogram types which are now allowed to be anonymous in line with access to object types. This permits so-called "downward closures" and allows the flexible use of procedures as parameters of subprograms and thereby avoids excessive use of generic units. 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
Regression with strongly correlated data
Authors: Christopher S. Jones, John M. Finn, Nicolas Hengartner
Venue: Journal of Multivariate Analysis (2008)

This paper discusses linear regression of strongly correlated data that arises, for example, in magnetohydrodynamic equilibrium reconstructions. We have proved that, generically, the covariance matrix of the estimated regression parameters for fixed sample size goes to zero as the correlations become unity. That is, in this limit the estimated parameters are known with perfect accuracy. Simple examples are shown to illustrate this effect and the nature of the exceptional cases in which the covariance of the estimate does not go to zero.
Perceptually Informed Roles for Haptic Feedback in Expressive Music Controllers
Authors: Ricardo Pedrosa, Karon Maclean
Venue: Proceedings of the 3rd international workshop on Haptic and Audio Interaction Design (2008)

In this paper, we propose a methodology for systematically integrating haptic feedback with a co-developed gesture interface for a computer-based music instrument. The primary goal of this research is to achieve an increased understanding of how different sub-modalities of haptic feedback should be combined to support both controllability and comfort in expressive interfaces of this type. We theorize that when including haptic feedback in an instrument, force and vibrotactile feedback could be beneficially designed individually and then fine-tuned when mixed in the final design.
Modeling and Model Checking Software Product Lines
Authors: Alexander Gruler, Martin Leucker, Kathrin Scheidemann
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

Software product line engineering combines the individual developments of systems to the development of a family of systems consisting of common and variable assets.In this paper we introduce the process algebra PL-CCS as a product line extension of CCS and show how to model the overall behavior of an entire family within PL-CCS. PL-CCS models incorporate behavioral variability and allow the derivation of individual systems in a systematic way due to a semantics given in terms of multi-valued modal Kripke structures. Furthermore, we introduce multi-valued modal μ-calculus as a property specification language for system families specified in PL-CCS and show how model checking techniques operate on such structures. In our setting the result of model checking is no longer a simple yes or no answer but the set of systems of the product line that do meet the specified properties.
Fuzzy Growing Hierarchical Self-Organizing Networks
Authors: Miguel Barreto-Sanz, Andrés Pérez-Uribe, Carlos-Andres Peña-Reyes, Marco Tomassini
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Hierarchical Self-Organizing Networks are used to reveal the topology and structure of datasets. Those structures create crisp partitions of the dataset producing branches or prototype vectors that represent groups of data with similar characteristics. However, when observations can be represented by several prototypes with similar accuracy, crisp partitions are forced to classify it in just one group, so crisp divisions usually lose information about the real dataset structure. To deal with this challenge we propose the Fuzzy Growing Hierarchical Self-Organizing Networks (FGHSON). FGHSON are adaptive networks which are able to reflect the underlying structure of the dataset, in a hierarchical fuzzy way. These networks grow by using three variables which govern the membership degree of data observations to its prototype vectors and the quality of the network representation. The resulting structure allows to represent heterogeneous groups and those that present similar membership degree to several clusters.
On the Relation between Class-Count and Modeling Effort
Authors: Ariadi Nugroho, Christian F. Lange
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

The knowledge of size of models can be very useful to perform many kinds of estimations such as effort, cost, and productivity in software development. However, to the best of our knowledge there is no universally accepted model size measure available to date. In this paper we investigate the usefulness of class-count as a size measure of models (represented with the UML). Using empirical data collected from two student experiments we validate this measure by assessing its correlation with effort spent in modeling. The results show that merely using class-count might not provide sufficient and accurate estimation of modeling effort. Furthermore, we identify some factors that hinder class-count as a good estimate of modeling effort.