ppxscal/embedding_network huggingface dataset:
Lifetime modelling for microsystems integration: from nano to systems
Authors: Bernhard Wunderle, B. Michel
Venue: Microsystem Technologies (2009)

Due to the rapid development of IC technology the traditional packaging concepts are making a transition into more complex system integration techniques in order to enable the constantly increasing demand for more functionality, performance, miniaturisation and lower cost. These new packaging concepts (as e.g. system in package, 3D integration, MEMS-devices) will have to combine smaller structures and layers made of new materials with even higher reliability. As these structures will more and more display nano-features, a coupled experimental and simulative approach has to account for this development to assure design for reliability in the future. A necessary &#x201c;nano-reliability&#x201d; approach as a scientific discipline has to encompass research on the properties and failure behaviour of materials and material interfaces under explicit consideration of their micro- and nano-structure and the effects hereby induced. It uses micro- and nano-analytical methods in simulation and experiment to consistently describe failure mechanisms over these length scales for more accurate and physically motivated lifetime prediction models. This paper deals with the thermo-mechanical reliability of microelectronic components and systems and methods to analyse and predict it. Various methods are presented to enable lifetime prediction on system, component and material level, the latter promoting the field of nano-reliability for future packaging challenges in advanced electronics system integration.
Participatory Agent-based Gaming Methodology in Cross-cultural Education: Exploring Efficient and Sustainable Civil Society and Community
Authors: Reiko Hishiyama, Toru Ishida
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In this paper, we describe new methodologies for reinforcing the social consensus building of the multicultural coexistence assistance using participatory simulation in civil societies. In this methodology, both human and intelligent software agents participate in a participatory gaming simulation. They have mutual interactions on the computer network, and accumulate decision-making steps. This simulation, which has mutual interaction between humans and agents, can achieve the gathering and analyzing of beneficial information to solve problems in multicultural civil societies. This type of simulation will help to provide knowledge for the formulation of social consensus, and to create new opportunities for discussion with people with different cultures and social backgrounds.
Network-Structured Particle Swarm Optimizer with Various Topology and Its Behaviors
Authors: Haruna Matsushita, Yoshifumi Nishio
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

This study proposes Network-Structured Particle Swarm Optimizer (NS-PSO) with various neighborhood topology. The proposed PSO has the various network topology as rectangular, hexagonal, cylinder and toroidal. We apply NS-PSO with various topology to optimization problems. We investigate their behaviors and evaluate what kind of topology would be the most appropriate for each function.
The Dictator and the Web Design
Authors: David Alan Grier
Venue: Computer (2009)

As Web technology moved from the laboratory to the public sphere, website design moved from being the product of a single individual to become the responsibility of a group.
Study on Sentence Relations in the Automatic Detection of Argumentation in Legal Cases
Authors: Raquel Mochales-Palau, Marie-Francine Moens
Venue: Proceeding of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference (2007)

We report the results of experiments which prove that the analysis of relations between sentences increase the accuracy in the automatic detection of arguments in legal cases. We treat the search of arguments as a classification problem. Our corpus is a human-annotated and automatically-extracted test set from a collection of legal cases of the European Court of Human Rights. We obtain an increment around 8% in the general accuracy compared to previous experiments due to the addition of new features that study the relations between the text sentences.
Non-uniform sensor deployment in mobile wireless sensor networks
Authors: Mihaela Cardei, Yinying Yang, Jie Wu
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Good sensor deployment is vital for wireless sensor networks (WSNs). To improve the initial deployment and to prolong network lifetime, one approach is to relocate sensors in different densities which vary with the distance to the sink. Since sensors located closer to the sink are involved in more data forwarding, sensors in this region should have a higher density. In this paper, we address the problem of Movement-assisted Sensor Positioning (MSP) to increase network lifetime with the objective to achieve the theoretical sensor densities while minimizing sensor movement. We propose three solutions: an Integer-Programming formulation, a localized matching method, and a distributed corona-radius scanning algorithm. Simulation results are presented to evaluate the proposed solutions.
Wavelets to Enhance Computational Intelligence in Computer-Aided Engineering
Authors: Hojjat Adeli
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Concurrent engineering (CE) is intertwined with the field of computer-aided engineering (CAE). The author presents a vision of future for CE and CAE where computational intelligence (CI) will play an increasingly significant role. Various disciplines within CE such as design, manufacturing, knowledge management, collaborative computing, Web processes and services, and distributed infrastructures must rely heavily on CI to achieve the increasing sophistication demand. The author has been advocating and advancing a multi-paradigm approach for solution of complicated and noisy computational intelligence problems. In 1995 he co-authored Machine Learning --Neural Networks, Genetic Algorithms, and Fuzzy Systems [1] the first authored book that presented and integrated the three principal soft computing and computational intelligence approaches. It was shown that such integration would provide a more powerful approach than any of the three approaches used individually. Since the publication of that ground-breaking book the author and his associates have demonstrated that chaos theory and wavelets can be used to further enhance computational intelligence especially for complicated and noisy pattern recognition problems. In this lecture it is shown how wavelets can be used as a powerful tool to complement and enhance other soft computing techniques such as neural networks and fuzzy logic as well as the chaos theory for solution of complicated and seemingly intractable CI problems. Examples of research performed by the author and his research associates in the areas of intelligent transportation systems [2--4], vibrations control [5--8], and nonlinear system identification [9--10] are presented.
Technical Section: Extracting a polyhedron from a single-view sketch: Topological construction of a wireframe sketch with minimal hidden elements
Authors: Sofia Kyratzi, Nickolas Sapidis
Venue: Computers and Graphics (2009)

An essential prerequisite to construct a manifold trihedral polyhedron from a given natural (or partial-view) sketch is solution of the ''wireframe sketch from a single natural sketch (WSS)'' problem, which is the subject of this paper. Published solutions view WSS as an ''image-processing''/''computer vision'' problem where emphasis is placed on analyzing the given input (natural sketch) using various heuristics. This paper proposes a new WSS method based on robust tools from graph theory, solid modeling and Euclidean geometry. Focus is placed on producing a minimal wireframe sketch that corresponds to a topologically correct polyhedron.
Scalability Evaluation of Barrier Algorithms for OpenMP
Authors: Ramachandra Nanjegowda, Oscar Hernandez, Barbara Chapman, Haoqiang H. Jin
Venue: Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism (2009)

OpenMP relies heavily on barrier synchronization to coordinate the work of threads that are performing the computations in a parallel region. A good implementation of barriers is thus an important part of any implementation of this API. As the number of cores in shared and distributed shared memory machines continues to grow, the quality of the barrier implementation is critical for application scalability. There are a number of known algorithms for providing barriers in software. In this paper, we consider some of the most widely used approaches for implementing barriers on large-scale shared-memory multiprocessor systems: a "blocking" implementation that de-schedules a waiting thread, a "centralized" busy wait and three forms of distributed "busy" wait implementations are discussed. We have implemented the barrier algorithms in the runtime library associated with a research compiler, OpenUH. We first compare the impact of these algorithms on the overheads incurred for OpenMP constructs that involve a barrier, possibly implicitly. We then show how the different barrier implementations influence the performance of two different OpenMP application codes.
An Algebraic Approach to Lens Distortion by Line Rectification
Authors: Luis Alvarez, Luis Gómez, J. Rafael Sendra
Venue: Journal of Mathematical Imaging and Vision (2009)

A very important property of the usual pinhole model for camera projection is that 3D lines in the scene are projected in 2D lines. Unfortunately, wide-angle lenses (specially low-cost lenses) may introduce a strong barrel distortion which makes the usual pinhole model fail. Lens distortion models try to correct such distortion. In this paper, we propose an algebraic approach to the estimation of the lens distortion parameters based on the rectification of lines in the image. Using the proposed method, the lens distortion parameters are obtained by minimizing a 4 total-degree polynomial in several variables. We perform numerical experiments using calibration patterns and real scenes to show the performance of the proposed method.
A Pricing Model for a Mobile Network Operator Sharing Limited Resource with a Mobile Virtual Network Operator
Authors: Hélène Cadre, Mustapha Bouhtou, Bruno Tuffin
Venue: Proceedings of the 6th International Workshop on Internet Charging and Qos Technologies: Network Economics for Next Generation Networks (2009)

Radio spectrum allocation is essential to the provision of mobile communication services. The spectrum is a finite resource and can accomodate a limited number of simultaneous users at one time. Due to this scarcity, allocating traditional mobile licenses to new mobile operators is unrealizable. Hence, new entrants should bargain access to the networks of the incumbents who establish contracts specifying access charge and maximum traffic volume that the MVNO is allowed to send on the MNO's network. In this article a Mobile Network operator (MNO) shares his finite network resource with a Mobile Virtual Network operator (MVNO) lacking the infrastructure. We study the game where the MVNO invests in content/advertising to compensate for the quality of service degradation. Modeling the system as a supply-chain, i.e. a logistics network consisting of the MNO, the MVNO and the consumers, we determine the access charge and the optimal traffic volume that the MVNO should be allowed to send on the MNO's network to coordinate the system.
Decision Deck's VIP Analysis to Support Online Collaborative Decision-Making
Authors: João N. Clímaco, João A. Costa, Luis C. Dias, Paulo Melo
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

We present the VIP Analysis plug-in of Decision Deck 1.1, a platform that hosts different evaluation methods to assist decision makers in the collaborative evaluation of alternatives in a multi-criteria and multi-experts setting. VIP Analysis is a tool for aggregation of multicriteria performances by means of an additive value function under imprecise information. It allows conducting a multicriteria analysis for selecting an alternative when the decision makers are not able to (or do not wish to) fix precise values for the importance parameters. These parameters are seen as variables that may take several values subject to constraints. VIP Analysis incorporates different methods to support the progressive reduction of the number of alternatives, introducing a concept of tolerance that lets decision makers use some of the methods in a more flexible manner. The original VIP Analysis was programmed in the late 1990s using Borland Delphi, whereas the Decision Deck version was programmed in Java and accesses data stored as a (possibly remote) MySQL database. Its main innovation is to allow several users working on the same problem under different roles: coordinator, evaluator, and decision-maker.
Mathematics and Computation in Imaging Science and Information Processing
Authors: Say Song Goh, Amos Ron, Zuowei Shen, Say Song Goh, Amos Ron, Zuowei Shen
Venue: Lecture Notes Series, Institute For Mathematical Sciences National University Of Singapore (2007)

The explosion of data arising from rapid advances in communication, sensing and computational power has concentrated research effort on more advanced techniques for the representation, processing, analysis and interpretation of data sets. In view of these exciting developments, the program Mathematics and Computation in Imaging Science and Information Processing was held at the Institute for Mathematical Sciences, National University of Singapore, from July to December 2003 and in August 2004 to promote and facilitate multidisciplinary research in the area. As part of the program, a series of tutorial lectures were conducted by international experts on a wide variety of topics in mathematical image, signal and information processing. This compiled volume contains survey articles by the tutorial speakers, all specialists in their respective areas. They collectively provide graduate students and researchers new to the field a unique and valuable introduction to a range of important topics at the frontiers of current research.
Beam search for the longest common subsequence problem
Authors: Christian Blum, Maria J. Blesa, Manuel López-Ibáñez
Venue: Computers and Operations Research (2009)

The longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational biology. Most research efforts up to now have focused on solving this problem optimally. In comparison, only few works exist dealing with heuristic approaches. In this work we present a deterministic beam search algorithm. The results show that our algorithm outperforms the current state-of-the-art approaches not only in solution quality but often also in computation time.
Delineating compositionally different dykes in the Ulukısla basin (Central Anatolia, Turkey) using computer-enhanced multi-spectral remote sensing data
Authors: Ozgur Kalelioğlu, Kemal Zorlu, Mehmet Ali· Kurt, Murat Gul, Cuneyt Guler
Venue: International Journal of Remote Sensing (2009)

In the Ulukısla basin (Central Anatolia, Turkey) several geological mapping campaigns were carried out using conventional field methods to delineate compositionally different Middle-Upper Eocene dykes. However, complete and correct mapping of these dykes was hampered by rugged terrain, lack of road access, wide spatial dyke distributions with small exposures and diverse weathering of these dykes. For these reasons, Landsat-5 Thematic Mapper (TM) satellite image of the study area was used to facilitate delineation of the exact boundaries of gabbroic, dioritic and trachytic dykes found in the area. Remotely sensed data were analysed using several image enhancement procedures, including colour composites, band ratios, principal components analysis (PCA), and Crosta technique. Results obtained from all the processes were examined, and it was found that dyke boundaries are best visible in the PCA123 image; RGB 731 colour composite; TM band ratio 5/7, 5/1, 4 combination; and 1457-PC4 image obtained by Crosta technique. The alteration differences of three dyke groups are enhanced much better in the 1457-PC4 image obtained by Crosta technique, which highlights the hydroxyl-bearing minerals as white-coloured pixels. Using computer-enhanced multi-spectral remote sensing data, we were able to map the boundaries and spatial distributions of compositionally different dykes, which otherwise is an overwhelmingly difficult task to achieve using conventional field methods. In similar settings, remote sensing techniques applied in this study may provide an efficient and low-cost alternative to time-consuming and physically demanding field-mapping campaigns.
Exploiting Wikipedia as external knowledge for document clustering
Authors: Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, Xiaohua Zhou
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two documents use different collections of core words to represent the same topic, they may be falsely assigned to different clusters due to the lack of shared core words, although the core words they use are probably synonyms or semantically associated in other forms. The most common way to solve this problem is to enrich document representation with the background knowledge in an ontology. There are two major issues for this approach: (1) the coverage of the ontology is limited, even for WordNet or Mesh, (2) using ontology terms as replacement or additional features may cause information loss, or introduce noise. In this paper, we present a novel text clustering method to address these two issues by enriching document representation with Wikipedia concept and category information. We develop two approaches, exact match and relatedness-match, to map text documents to Wikipedia concepts, and further to Wikipedia categories. Then the text documents are clustered based on a similarity metric which combines document content information, concept information as well as category information. The experimental results using the proposed clustering framework on three datasets (20-newsgroup, TDT2, and LA Times) show that clustering performance improves significantly by enriching document representation with Wikipedia concepts and categories.
Node weighted scheduling
Authors: Gagan R. Gupta, Sujay Sanghavi, Ness B. Shroff
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Given an initial configuration of packets at the input buffers, these policies drain all packets in the system in the minimal amount of time provided that there are no further arrivals. These policies are also throughput optimal for a large class of arrival processes which satisfy strong-law of large numbers. We show that it is possible for policies in our class to be throughput optimal even if they are not constrained to be maximal in every time slot. Most algorithms for switch scheduling take an edge based approach; in contrast, we focus on scheduling (a large enough set of) the most congested ports. This alternate approach allows for lower-complexity algorithms, and also requires a non-standard technique to prove throughput-optimality. One algorithm in our class, Maximum Vertex-weighted Matching (MVM) has worst-case complexity similar to Max-size Matching, and in simulations shows slightly better delay performance than Max-(edge)weighted-Matching (MWM).
An application of the Lov&#x00e1;sz&#x2013;Schrijver M(K, K) operator to the stable set problem
Authors: Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
Venue: Mathematical Programming: Series A and B (2009)

Although the lift-and-project operators of Lov&#x00e1;sz and Schrijver have been the subject of intense study, their M(K, K) operator has received little attention. We consider an application of this operator to the stable set problem. We begin with an initial linear programming (LP) relaxation consisting of clique and non-negativity inequalities, and then apply the operator to obtain a stronger extended LP relaxation. We discuss theoretical properties of the resulting relaxation, describe the issues that must be overcome to obtain an effective practical implementation, and give extensive computational results. Remarkably, the upper bounds obtained are sometimes stronger than those obtained with semidefinite programming techniques.
A mesh-dependent model for applying dynamic contact angles to VOF simulations
Authors: S. Afkhami, S. Zaleski, M. Bussmann
Venue: Journal of Computational Physics (2009)

Typical VOF algorithms rely on an implicit slip that scales with mesh refinement, to allow contact lines to move along no-slip boundaries. As a result, solutions of contact line phenomena vary continuously with mesh spacing; this paper presents examples of that variation. A mesh-dependent dynamic contact angle model is then presented, that is based on fundamental hydrodynamics and serves as a more appropriate boundary condition at a moving contact line. This new boundary condition eliminates the stress singularity at the contact line; the resulting problem is thus well-posed and yields solutions that converge with mesh refinement. Numerical results are presented of a solid plate withdrawing from a fluid pool, and of spontaneous droplet spread at small capillary and Reynolds numbers.
Pro IronPython, 1st edition
Authors: Alan Harris
Venue:  (2009)

IronPython represents a unique direction for developers interested in working with dynamic languages within the .NET Framework. Whether youre looking to develop applications from scratch or add functionality and maintainability to an existing application, IronPython opens many doors while providing a highspeed, highperformance language that integrates tightly with other .NET languages. Learn to create applications using the benefits of a dynamically typed language. Discover how to leverage the power of IronPython to improve existing applications. Explore interacting with other .NET languages by invoking the common language runtime. What youll learn Write IronPython console and forms applications. Integrate IronPython scripts into existing applications to increase their functionality. Implement complex data patterns and interact with databases. Use the common language runtime to take advantage of .NETs existing framework within IronPython scripts. Understand how IronPython can be brought in to solve a variety of programming tasks through extensive exercises and recipes. Avoid the common pitfalls of working with a dynamically typed language. Who is this book for? This book is designed for .NET developers interested in expanding their IronPython skills and learning how to make use of them to improve their daily programming practices. It will introduce core concepts of IronPython programming using a .NETcentric approach. Additionally, it will speak to Python developers looking to expand into their skills into the .NET world. Experience with a .NET language is expected. Previous Python experience is not necessary.