ppxscal/embedding_network huggingface dataset:
Overlay what Humanoid Robot Perceives and Thinks to the Real-world by Mixed Reality System
Authors: Kazuhiko Kobayashi, Koichi Nishiwaki, Shinji Uchiyama, Hiroyuki Yamamoto, Satoshi Kagami, Takeo Kanade
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

One of the problems in developing a humanoid robot is caused by the fact that intermediate results, such as what the robot perceives the environment, and how it plans its moving path are hard to be observed online in the physical environment. What developers can see is only the behavior. Therefore, they usually investigate logged data afterwards, to analyze how well each component worked, or which component was wrong in the total system. In this paper, we present a novel environment for robot development, in which intermediate results of the system are overlaid on physical space using Mixed Reality technology. Real-time observation enables the developers to see intuitively, in what situation the specific intermediate results are generated, and to understand how results of a component affected the total system. This feature makes the development efficient and precise. This environment also gives a human-robot interface that shows the robot internal state intuitively, not only in development, but also in operation.
The influence of search mechanisms in feature subset selection processes
Authors: Maria do Carmo Nicoletti, Daniel M. Santoro
Venue: Intelligent Decision Technologies (2008)

The features that describe the training instances are crucial for the success of a machine learning (ML) algorithm. A training set described by redundant or irrelevant features, for instance, can mislead the ML algorithm into learning a poor expression of the real concept embedded in the data. Feature subset selection (FSS) processes invest in identifying and removing as much irrelevant and redundant information as possible. FSS processes generally conduct a heuristic search in the search space defined by all possible subsets of the initial feature set trying to identify the most relevant for the learning task. This paper describes an empirical investigation of the influence of the search mechanism in identifying a suitable feature subset, by comparatively evaluating five search methods, namely Hill-Climbing, Beam-Search, Random-Bit-Climber, Las Vegas search and Genetic Algorithm, combined with different strategies for initiating the process. Experiments were conducted using eleven knowledge domains and eleven different combinations of search-method/strategy. Results are presented and comparatively analyzed.
Critical-trunk based obstacle-avoiding rectilinear steiner tree routings for delay and slack optimization
Authors: Yen-Hung Lin, Shu-Hsin Chang, Yih-Lang Li
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Obstacle-avoiding rectilinear Steiner tree (OARST) construction is a fundamental problem associated with the trend toward IP-block-based System-on-Chip designs. The objective of previous studies on obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) has been to minimize the total wirelength of the constructed Steiner tree. Studies of performance-driven Steiner trees have demonstrated that the minimization of wirelength may worsen the performance of the Steiner tree. This work is the first to construct OARST while considering the Elmore delay. A critical-trunk-based tree growth mechanism is proposed. The critical trunks are constructed by extended single-source single-target maze routing called multi-source single-target maze routing. The unconnected pins are connected to critical trunks under the delay constraints of every sink. The proposed critical trunk can be applied to solve performance-driven and slack-driven OARST problems. Experimental results demonstrate that the proposed algorithms achieve an average 24.12% improvement in the maximum delay over OARSMT in performance-driven OARST problem and successfully solve 66.67% worst negative slack (WNS) violations in slack-driven OARST problem while running faster than previous OARSMT algorithms.
Worst-Case Nash Equilibria in Restricted Routing
Authors: Pinyan Lu, Changyuan Yu
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study a restricted related model of the network routing problem. There are m parallel links with possibly different speeds, between a source and a sink. And there are n users, and each user i has a traffic of weight w i to assign to one of the links from a subset of all the links, named his/her allowable set. We analyze the Price of Anarchy (denoted by PoA) of the system, which is the ratio of the maximum delay in the worst-case Nash equilibrium and in an optimal solution. In order to better understand this model, we introduce a parameter &lambda; for the system, and define an instance to be &lambda;-good if for every user, there exist a link with speed at least $\frac{s_{max}}{\lambda}$ in his/her allowable set. In this paper, we prove that for &lambda;-good instances, the Price of Anarchy is $ \Theta \big( \min\{\frac{\log \lambda m}{\log \log \lambda m}, m\}\big)$. We also show an important application of our result in coordination mechanism design for task scheduling game. We propose a new coordination mechanism, Group-Makespan, for unrelated selfish task scheduling game. Our new mechanism ensures the existence of pure Nash equilibrium and its PoA is $O \big(\frac{\log^2 m}{\log \log m}\big)$. This result improves the best known result of O(log2 m) by Azar, Jain and Mirrokni in [2].
Polynomial flow-cut gaps and hardness of directed cut problems
Authors: Julia Chuzhoy, Sanjeev Khanna
Venue: Journal of the ACM (JACM) (2009)

We study the multicut and the sparsest cut problems in directed graphs. In the multicut problem, we are a given an n-vertex graph G along with k source-sink pairs, and the goal is to find the minimum cardinality subset of edges whose removal separates all source-sink pairs. The sparsest cut problem has the same input, but the goal is to find a subset of edges to delete so as to minimize the ratio of the number of deleted edges to the number of source-sink pairs that are separated by this deletion. The natural linear programming relaxation for multicut corresponds, by LP-duality, to the well-studied maximum (fractional) multicommodity flow problem, while the standard LP-relaxation for sparsest cut corresponds to maximum concurrent flow. Therefore, the integrality gap of the linear programming relaxation for multicut/sparsest cut is also the flow-cut gap: the largest gap, achievable for any graph, between the maximum flow value and the minimum cost solution for the corresponding cut problem. Our first result is that the flow-cut gap between maximum multicommodity flow and minimum multicut is &Omega;&tilde;(n1/7) in directed graphs. We show a similar result for the gap between maximum concurrent flow and sparsest cut in directed graphs. These results improve upon a long-standing lower bound of &Omega;(log n) for both types of flow-cut gaps. We notice that these polynomially large flow-cut gaps are in a sharp contrast to the undirected setting where both these flow-cut gaps are known to be &Theta;(log n). Our second result is that both directed multicut and sparsest cut are hard to approximate to within a factor of 2&Omega;(log1&minus;&epsis; n) for any constant &epsis; > 0, unless NP &sube; ZPP. This improves upon the recent &Omega;(log n/log log n)-hardness result for these problems. We also show that existence of PCP's for NP with perfect completeness, polynomially small soundness, and constant number of queries would imply a polynomial factor hardness of approximation for both these problems. All our results hold for directed acyclic graphs.
Learning how to use a computer-based concept-mapping tool: Self-explaining examples helps
Authors: Tatjana S. Hilbert, Alexander Renkl
Venue: Computers in Human Behavior (2009)

In initial skill acquisition in well-structured domains, example-based learning typically leads to better learning outcomes than learning by doing. Cognitive Load Theory explains this result by the worked-example effect: Example-based learning prevents learners from using load-intensive strategies and focuses their attention on the principles to-be-learned. In two experiments, we investigated the use of examples for acquiring a new learning strategy, namely computer-based concept mapping. Experiment 1 compared learners who studied two examples on how to construct a concept map with learners who practiced concept mapping by constructing two concept maps on their own. We did not find significant differences in learning outcomes. Therefore, in Experiment 2, we introduced a third group of learners who studied examples with the additional support of self-explanation prompts. Self-explaining examples led to better learning outcomes than learning with examples without prompts or practicing. With respect to cognitive load, we found that examples without prompts released learners' working memory compared to practicing, whereas self-explaining examples led to a higher cognitive load compared to examples without self-explanation.
The Study of Partners' Selection for Virtual Logistics Enterprises
Authors: Dashen Xue
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the continuous development of economic globalization and the furious competition of market, the need of logistics service is increasing continuously. At the same time, the requirement of its service level and quality is stricter. Virtual Logistics Enterprise (VLE) is becoming the realistic choice for many enterprises. VLE usually meet the partners' selection problems before it is founded. How to choose appropriate partners is an important problem within the VLE. According to some former research results and the characteristic of the logistics enterprise, authors established an evaluating guide system for VLE based on the validity of partners’ combination. The authors also established a two-phase partners' selection model: first selection based on Analytic Hierarchy Process and second selection based on Genetic Simulated Annealing Algorithms. Finally, we give the results which shows the genetic simulated annealing algorithms are better than other algorithms and more suitable to these issues.
Semantic Grid Applications to Complex Satellite Mission Systems
Authors: M. Sanchez-Gestido, L. Blanco-Abruna, M. Perez, R. Gonzalez-Cabero, A. Gomez-Perez, O. Corcho
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

This paper presents the application of a semantic grid architecture into a scenario for the product analysis of a representative Earth Observation Satellite Mission (EnviSat). This Use Case aims at demonstrating the benefits of a Semantic Grid approach to real world problems in terms of flexibility, reduction of SW running costs, maintainability, expandability, interoperability and definition of a standardized approach.
Hybrid systems: from verification to falsification by combining motion planning and discrete search
Authors: Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
Venue: Formal Methods in System Design (2009)

We propose HyDICE, Hybrid Discrete Continuous Exploration, a multi-layered approach for hybrid-system falsification that combines motion planning with discrete search and discovers safety violations by computing witness trajectories to unsafe states. The discrete search uses discrete transitions and a state-space decomposition to guide the motion planner during the search for witness trajectories. Experiments on a nonlinear hybrid robotic system with over one million modes and experiments with an aircraft conflict-resolution protocol with high-dimensional continuous state spaces demonstrate the effectiveness of HyDICE. Comparisons to related work show computational speedups of up to two orders of magnitude.
Development of an Automatic Testing Environment for Mercury
Authors: François Degrave
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Testing refers to the activity of running a software component with respect to a well-chosen set of inputs and comparing the outputs that are produced with the expected results in order to find errors. To make testing less repetitive and quicker, a so-called test automation framework can be used to automatically execute a (previously written) test suite without user intervention. An automatic tool runs the software component that is being tested once for each test input, compares the actual result with the expected result and reports those test cases that failed during the test; a well-known example of such a tool being JUnit for Java [1]. However, the construction of test suites remains a mostly manual and thus time-consuming activity [2]. The need of adequacy criteria [3,4] renders the construction of (large) test suites complex and error-prone [5]. The objective of this work is to develop an analysis that automatically creates a set of test inputs that satisfies a particular coverage criterion for a given program written in Mercury.
Cayley Transformation and Numerical Stability of Calibration Equation
Authors: F. C. Wu, Z. H. Wang, Z. Y. Hu
Venue: International Journal of Computer Vision (2009)

The application of Cayley transformation to enhance the numerical stability of camera calibration is investigated. First, a new calibration equation, called the standard calibration equation, is introduced using the Cayley transformation and its analytical solution is obtained. The standard calibration equation is equivalent to the classical calibration equation, but it exhibits remarkable better numerical stability. Second, a one-parameter calibration family, called the Cayley calibration family which is equivalent to the standard calibration equation, is obtained using also the Cayley transformation and it is found that this family is composed of those infinite homographies whose rotation has the same axis with the rotation between the two given views. The condition number of equations in the Cayley calibration family varies with the parameter value, and an algorithm to determine the best parameter value is provided. Third, the generalized Cayley calibration families equivalent to the standard calibration equation are also introduced via generalized Cayley transformations. An example of the generalized Cayley transformations is illustrated, called the S-Cayley calibration family. As in the Cayley calibration family, the numerical stability of equations in a generalized Cayley calibration family also depends on the parameter value. In addition, a more generic calibration family is also proposed and it is proved that the standard calibration equation, the Cayley calibration family and the S-Cayley calibration family are all some special cases of this generic calibration family.
The Internet Imaginaire
Authors: Patrice Flichy
Venue:  (2008)

In The Internet Imaginaire, sociologist Patrice Flichy examines the collective vision that shaped the emergence of the Internetthe social imagination that envisioned a technological utopia in the birth of a new technology. By examining in detail the discourses surrounding the development of the Internet in the United States in the 1990s (and considering them an integral part of that development), Flichy shows how an entire society began a new technological era. The metaphorical "information superhighway" became a technical utopia that informed a technological program. The Internet imaginaire, Flichy argues, led software designers, businesses, politicians, and individuals to adopt this one technology instead of another.Flichy draws on writings by expertspaying particular attention to the gurus of Wired magazine, but also citing articles in Time, Newsweek, and Business Weekfrom 1991 to 1995. He describes two main domains of the technical imaginaire: the utopias (and ideologies) associated with the development of technical devices and the depictions of an imaginary digital society. He analyzes the founding myths of cyberculturethe representations of technical systems expressing the dreams and experiments of designers and promoters that developed around information highways, the Internet, Bulletin Board systems, and virtual reality. And he offers a treatise on "the virtual society imaginaire," discussing visionaries from Teilhard de Chardin to William Gibson, the body and the virtual, cyberdemocracy and the end of politics, and the new economy of the immaterial.
QoS Support For Workflows In A Volatile Grid
Authors: Yash Patel, Andrew McGough, John Darlington
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

The Grid can be seen as a collection of services each of which performs some functionality. Users of the Grid seek to use combinations of these services to perform the overall task they need to achieve. In general this can be seen as a set of services with a workflow document describing how these services should be combined. The user may also have certain constraints on the workflow operations, such as execution time or cost to the user, specified in the form of a Quality of Service (QoS) document. The users submit their workflow to a brokering service along with the QoS document. The brokering service's task is to map any given workflow to a subset of the Grid services taking the QoS and state of the Grid into account - service availability and performance. We propose in this paper an approach for generating constraint equations describing the workflow, the QoS requirements and the state of the Grid. This set of equations may be solved using Mixed-Integer Linear Programming (MILP), which is the traditional method. We further develop a novel 2-stage stochastic MILP which is capable of dealing with the volatile nature of the Grid and adapting the selection of the services during the lifetime of the workflow. We present experimental results comparing our approaches, showing that the 2-stage stochastic programming approach performs consistently better than other traditional approaches.
Exciton spin dynamics in zinc-blende GaN/AlN quantum dots: Temperature dependence
Authors: D. Lagarde, A. Balocchi, H. Carrère, P. Renucci, T. Amand, S. Founta, H. Mariette, X. Marie
Venue: Microelectronics Journal (2009)

The exciton spin alignment is measured in an ensemble of self-organized cubic GaN/AlN quantum dots. By picosecond time-resolved photoluminescence experiments, we show that the exciton linear polarization does not decay with time from 20 to 300K.
A Domain-Specific Language for Application-Level Checkpointing
Authors: Ritu Arora, Marjan Mernik, Purushotham Bangalore, Suman Roychoudhury, Saraswathi Mukkai
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

Checkpointing is one of the key requirements for writing fault-tolerant and flexible applications for dynamic and distributed environments like the Grid. Certain patterns are observed in the implementation of the application-level Checkpointing and Restart (CaR) mechanism across myriad of applications. These patterns indicate that a higher level of abstraction can be used to isolate the observed commonalities and variations in the CaR mechanism. This research paper describes an approach for the design and development of a Domain-Specific Language (DSL) for abstracting the application-level CaR mechanism. The specifications written in the DSL are used for semi-automatically generating the application-specific code for the CaR mechanism. This DSL not only provides a high-level of abstraction but also promotes code reuse, code correctness and non-invasive reengineering of legacy applications to embed the CaR mechanism in them.
Evaluating very large datalog queries on social networks
Authors: Royi Ronen, Oded Shmueli
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatically query, utilize and create the data. For example, a user of a social network can define rules that automatically manage the user's friends list, the sending of various announcements, filtering of messages and more. We examine the probable case of automated addition of connections by a participant. The connections to be added are defined using a query, associated to each participant. For this, we introduce and study the Query Network model, a graph-based model in which every node models a network participant and is associated with a Datalog rule. The union of all these individual user rules constitutes a very large, recursive, Datalog program whose size is of the order of magnitude of the size of the data being queried (data whose size in a social network can easily exceed 1TB). This greatly differs from the traditional assumption that queries are small and data are large. In particular, traditional optimizers will be hard pressed to handle such queries. This is the case even if queries are 'translated' to SQL (using views) and their union is transformed to a very large SQL query. We have designed, built and experimented with evaluation algorithms for such query networks. Experiments with both synthetic and real datasets demonstrate the usefulness and high effectiveness of our methods. Extensions to the model are proposed, their implementation and testing are the subject of on-going work.
A Fuzzy AHP Approach to the Evaluation of PCM Model Based on PFSC in Aeronautical Subcontract Production
Authors: Zhiqiang Jiang, Xilan Feng
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The definitions of complex product configuration management (PCM) for aeronautical subcontract production are introduced. A product functions and structure components (PFSC) oriented information model on product configuration template (PCT) is accomplished, in which rapidly responds to the customers' configuration requirement. And also, a fuzzy AHP method to the evaluation on PCT of PCM model in Aero-SP is proposed, and an illustrative case study is applied to demonstrate its practicability and effectiveness in the development of aero engine of advanced regional jet for 21st century (ARJ21), in which satisfied the customer's requirement (CR) with individuation and diversification.
Pragmatic Thinking and Learning: Refactor Your Wetware (Pragmatic Programmers)
Authors: Andy Hunt
Venue:  (2008)

Together we'll journey together through bits of cognitive and neuroscience, learning and behavioral theory. You'll discover some surprising aspects of how our brains work, and see how you can beat the system to improve your own learning and thinking skills.In this book you'll learn how to:Use the Dreyfus Model of Skill Acquisition to become more expert Leverage the architecture of the brain to strengthen different thinking modes Avoid common "known bugs" in your mind Learn more deliberately and more effectively Manage knowledge more efficientlySoftware development happens in your head. Not in an editor, IDE, or design tool. It's time to take a pragmatic approach to thinking and learning, and start to refactor-and redesign-your brain.