ppxscal/embedding_network huggingface dataset:
An algorithm for routing with capacitance/distance constraints for clock distribution in microprocessors
Authors: Rupesh S. Shelar
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

In modern microprocessors, clocks are usually distributed employing a hybrid network, grid followed by buffered trees, to restrict the skew. This is typically done employing (gated) buffered trees inside the blocks, while the global grid overlay the entire die area. The block-level buffered trees are connected to the grid at specific locations, by routing the wires along the predetermined tracks. The routing of these clock wires, which consume noticeable power, have distance and capacitance constraints to avoid poor slopes at the inputs of the block-level buffers. Moreover, these wires also contribute to significant load on the clock grid. This leads to a problem of capacitance or wirelength minimization during the multi-terminal routing such that wires use pre-specified tracks and routes obey distance and capacitance constraints, i.e., the length of the route from any receiver to a connection on the grid-wire has less than the specified distance and the overall capacitance due to all receivers on the route is less than the given limit. Since the problem is intractable, we present an efficient algorithm that completes the routing connecting 1000s of terminals over a few $mm^2$ area in seconds, improving the wirelength by 17% over the commonly used nearest source heuristic. The algorithm is employed to perform post-grid clock distribution in a 45 nm technology microprocessor.
Prior knowledge in learning from a non-linear electronic document: Disorientation and coherence of the reading sequences
Authors: Franck Amadieu, André Tricot, Claudette Mariné
Venue: Computers in Human Behavior (2009)

A study was carried out to investigate the effects of prior knowledge on learning with a non-linear electronic document including an interactive conceptual map. Cognitive Load Theory was used as theoretical framework to investigate effects on cognitive load and disorientation in learning from non-linear documents. Forty-four future high school biology teachers were required to learn the multiplication cycle of a virus from either a hierarchical structure (organisational links) or a network structure (relational links). For the low prior knowledge learners, the results showed that the hierarchical structure supported better free recall performance and reduced feelings of disorientation. In contrast, the high prior knowledge learners performed better and followed more coherent reading sequences in the network structure. However, no interaction effect between prior knowledge and the type of structure was observed on mental effort and disorientation ratings. The results and the construct of disorientation are discussed in light of the processing demands in non-linear documents.
Food Supply Chain Quality Management Model and Simulation Based on Game
Authors: Qin Li, Wang Qing Song
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Game between different enterprises in the food chain plays important roles in the food quality. This paper applies the games theory to develop a food supply chain quality management model and describes the implementation algorithm of model. The simulation result shows that the model can simply solve the problem of the optimum quality management in the condition of changing external demand, at this time the largest profit can be obtained, meanwhile, the state of food quality level in whole food supply chain is optimum. Therefore, it is essential for us to take some measures to perfecting reward and punishment mechanism. It can reduce asymmetry information overcome market failures in the food chain, as well as can be traced back and resolve the question from the source once there are some quality problems.
A constraint-net approach to the resolution of conflicts in a product with multi-technology requirements
Authors: A. J. Medland, J. Matthews, G. Mullineux
Venue: International Journal of Computer Integrated Manufacturing (2009)

While many procedures exist to support the systematic development of a product, it is often difficult to create an environment in which the early stages of the design are resolved. This can particularly happen when the product design is based upon a wide range of technologies and the expert members of the design team are drawn from many disciplines. The constraint resolution approach allows the requirements to be formed into rules and their combined truth established. Within such an environment an investigation has been undertaken to determine the possibility of establishing clusters of rules relating to individual technical aspects of the design requirements, which are then formed into networks that can be solved interactively within the constraint modelling environment. This paper draws upon the experience of designing a disposable cell counting device for medical applications and illustrates its adaptation to other applications through the use of the derived constraint-net.
Note: l-trace k-Sperner families of sets
Authors: Balázs Patkós
Venue: Journal of Combinatorial Theory Series A (2009)

A family of sets F@?2^X is defined to be l-trace k-Sperner if for any subset Y of X with size l the trace of F on Y (the restriction of F to Y) does not contain any chain of length k+1. In this paper we investigate the maximum size that an l-trace k-Sperner family (with underlying set [n]={1,2,...,n}) can have for various values of k, l and n.
New Results on the Most Significant Bit of Integer Multiplication
Authors: Beate Bollig, Jochen Klump
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations and ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Analyzing the limits of symbolic graph algorithms for the reachability problem Sawitzki (2006) has presented the first exponential lower bound on the &pi;-OBDD size for the most significant bit of integer multiplication according to one predefined variable order &pi;. Since the choice of the variable order is a main issue to obtain OBDDs of small size the investigation is continued. As a result a new upper bound method and the first non-trivial upper bound on the size of OBDDs according to an arbitrary variable order is presented. Furthermore, Sawitzki's lower bound is improved.
conley: Computing connection matrices in Maple
Authors: Mohamed Barakat, Daniel Robertz
Venue: Journal of Symbolic Computation (2009)

In this work we announce the package to compute connection and C-connection matrices. is based on our abstract homological algebra package . We emphasize that the notion of braids is irrelevant for the definition and for the computation of such matrices. We introduce the notion of triangles that suffices to state the definition of (C-) connection matrices. The notion of octahedra, which is equivalent to that of braids is also introduced.
Research on Growing-up Mechanism and Fostering of Venture Enterprise Based on Knowledge Management
Authors: Qing Yang, Yanling Yu, Wenjun Chen
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Based on summing-up the theory of knowledge management of venture enterprise, this paper does a research on growing-up mechanism of venture enterprise based on knowledge management, and argues that the growing-up process of venture enterprise is aiming at encouraging the growth of venture enterprise in the end through gaining market competitive advantage by means of acquisition and transformation of knowledge and resource. Moreover, it analyses the fostering means of venture enterprise based on knowledge management and sets up value adding mechanism of venture capitalist, in which arranging follow-up financing and assisting enterprise to win over potential customers and suppliers is in favor of improving enterprise competence in acquiring resource and knowledge; enterprise’s transforming capability will be enhanced by making development strategy and monitoring its operating and financial performance; and recruiting core member for management team is crucial for both enterprise’s acquiring and transforming competence.
Online and Offline Selling in Limit Order Markets
Authors: Kevin L. Chang, Aaron Johnson
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Completely automated electronic securities exchanges and algorithms for trading in these exchanges have become very important for modern finance. In [4], Kakade et al. introduced the limit order market model, which is a prevalent paradigm in electronic markets. In this paper, we consider both online and offline algorithms for maximizing revenue when selling in limit order markets. We first prove that the standard reservation price algorithm has an optimal competitive ratio for this problem. This ratio is not constant, and so we consider computing solutions offline. We show that the offline optimization problem is NP-hard, even for very restricted instances. We complement the hardness result by presenting an approximation scheme that runs in polynomial time for a wide class of instances.
Computer Society Awards Honor Top Researchers
Authors: Bob Ward
Venue: Computer (2009)

Topics covered include Computer Society awards given to top researchers, the Computer Society members elevated to IEEE Fellow status in 2009, and recent recipients of the CSDA and CSDP certifications.
Technical communique: Stabilizing controllers design for switched nonlinear systems in strict-feedback form
Authors: Jenq-Lang Wu
Venue: Automatica (Journal of IFAC) (2009)

This paper considers the stabilization problem for a class of switched nonlinear systems under arbitrary switching. Based on the backstepping method and the control Lyapunov function approach, it is shown that, under a simultaneous domination assumption, a switched nonlinear system in strict-feedback form can be globally uniformly asymptotically stabilized by a continuous state feedback controller. A universal formula for constructing stabilizing feedback laws is presented. One example is included for verifying the obtained results.
A framework for autonomic networked auctions
Authors: Antonio Di Ferdinando, Ricardo Lent, Erol Gelenbe
Venue: Proceedings of the 2007 Workshop on INnovative SERvice Technologies (2007)

Business companies are showing a growing interest towards the use of the Internet as part of their business. In particular, networked auctions exploit characteristics that are particularly attractive, and are therefore gaining interest as mean for business. This is especially true when the management efforts, to handle such auctions, are reduced by the use of automatic trading agents. The automatic nature of agents, however, does not allow them to account for the non-stationariness of the market, with the result of inevitably limitating optimization of auction economic factors and, finally, the overall utility. We outline a platform where trading agents behave in an autonomic fashion. Agents employ biologically-inspired techniques, to adapt auctioning strategies to present environmental conditions, through exploitation of self-* properties. We put particular emphasis on self-configuration and self-adaptation, presenting results of preliminary experimentations, and showing through simulations how autonomic behaviour is expected to impact current results.
Ergonomic Evaluation of Small-screen Leading Displays on the Visual Performance of Chinese Users
Authors: Yu-Hung Chien, Chien-Cheng Yen
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Leading display represents a mechanism for exhibiting temporal information instead of spatial information to overcome the limitations of small-screen mobile devices. Previous studies examining this area focused only on information presented by leading displays, the use of such devices may be influenced by the context of tasks and adaptability of users was somehow disregarded. Actually, mobile interaction is often a secondary task performed while doing something else; the attention of leading-display users cannot always be assumed to be only on reading leading-display information. Therefore, this investigation performed a dual-task experiment (a search task for static information and a reading task for leading display information) to examine the effects of leading-display factors on the visual performance of users during different stages of usage (whether current usage is the first, second, third, fourth, or fifth day of usage) for a small screen. The results showed that leading display design factors did not distract participants from static information search tasks but did affect participant reading comprehension on leading displays. Speed and presentation mode significantly influenced the participants' reading comprehension. Consequently, the possible applications of leading displays and the implications of these findings on reading Chinese text are discussed.
New model updating method for damped structural systems
Authors: Hao Liu, Yongxin Yuan
Venue: Computers Mathematics with Applications (2009)

In this paper, the following two problems are considered: Problem I Given a full column rank matrix X@?R^n^x^k, a diagonal matrix @L@?R^k^x^k(k@?n) and matrices M"a@?R^n^x^n,C"0,K"0@?R^r^x^r, find nxn matrices C,K such that M"aX@L^2+CX@L+KX=0, s. t.C([1,r])=C"0,K([1,r])=K"0, where C([1,r]) and K([1,r]) are, respectively, the rxr leading principal submatrices of C and K. Problem II Given nxn matrices C"a,K"a with C"a([1,r])=C"0,K"a([1,r])=K"0, find (C@?,K@?)@?S"E, such that @?C"a-C@?@?^2+@?K"a-K@?@?^2=inf"("C","M")"@?"S"""E(@?C"a-C@?^2+@?K"a-K@?^2), where S"E is the solution set of Problem I. By applying the theory and methods of the algebraic inverse eigenvalue problems, the solvability condition and the general solution to Problem I are derived. The expression of the solution to Problem II is presented.
Containment of conjunctive queries on annotated relations
Authors: Todd J. Green
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positive relational queries on them were introduced in a recent paper as a generalization of set semantics, bag semantics, incomplete databases, and databases annotated with various kinds of provenance information. We obtain positive decidability results and complexity characterizations for databases with lineage, why-provenance, and provenance polynomial annotations, for both conjunctive queries and unions of conjunctive queries. At least one of these results is surprising given that provenance polynomial annotations seem "more expressive" than bag semantics and under the latter, containment of unions of conjunctive queries is known to be undecidable. The decision procedures rely on interesting variations on the notion of containment mappings. We also show that for any positive semiring (a very large class) and conjunctive queries without self-joins, equivalence is the same as isomorphism.
Identification et prise en compte de propri&eacute;t&eacute;s ergonomiques pour la mod&eacute;lisation et la conception de SIM
Authors: Syrine Charfi, Dominique L. Scapin, Emmanuel Dubois
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

Mixed Interactive Systems (MIS) integrate both physical and digital worlds. Therefore, they need specific techniques and devices allowing the incorporation of real world objects. These elements have a definite impact on users interaction habits which are different from classical interactive systems. There are also new ergonomic issues. One of the goals in this study is to incorporate these new issues. One contribution has been to identify, extract and decipher ergonomic recommendations from the MIS literature, as well as from existing recommendations published for virtual environments that could be applied to MIS. This paper describes the method followed, then the identification of targets on which to be applied, either within the MIS design process, or through specializations within models and tools used in the process.
Research and Application of Predictive Control Based on EMRAN in Superheated Steam Temperature Control System
Authors: Xiao-zhi Qiu, Lin-meng Zhang, Jian-xin Zhou, Feng-qi Si, Zhi-gao Xu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

The temperature of superheated steam of thermal power plants is characterized by large inertia and time delay. Its dynamic characteristics vary with the unit load. General strategy for the temperature control doesn’t satisfy the performance requirement. We propose a predictive control approach based on extended minimal resource allocation network to address this issue. In brief, a neural network model based on on-line identification of superheated steam temperature is proposed to predict future plant behavior. A receding horizon optimization of the predictive control is finalized with a on-line one-dimensional golden section algorithm, yielding the optimal control actions at each sampling time point. The simulation study shows the proposed control method has excellent control performance and enhanced self-adaptability, thus fits well the superheated steam temperature system.
Improvised layout of keypad entry system for mobile phones
Authors: Arpit Mittal, Arijit Sengupta
Venue: Computer Standards Interfaces (2009)

In this paper, we present a critical review of the current layout of alphabets on a mobile keypad and seek to improvise it for optimized text entry to facilitate user interaction with or without the use of predictive text input techniques. Currently, most mobile phones use multi-press as the preferred method of text entry though they also offer word-based disambiguation schemes. However, keypad layouts are not optimized for text entry using word based disambiguation schemes as several matches exist for the same numeric combination, some of which are frequently used words. This scheme effectively slows down text entry speeds, requiring more tapping for disambiguating matches. The proposed model seeks to reduce the number of matches for any possible numeric combinations, by optimization of keypad layout by repositioning alphabets on the keypad. For users not using dictionary, our model requires lesser tapping for commonly used alphabets and groups commonly used key combinations together such as in a computer keyboard. The proposed model was derived by simulation of the mobile phone keypad on a computer system and it uses cognitive agents to derive the most optimum keypad layout. Our model uses frequently used English words from a dictionary and attempts to minimize the number of matches for any given numeric key combinations, though the same could easily be duplicated for other languages. The model is expected to cause a significant rise in the text input speeds of mobile phones and other embedded devices with limited text entry capabilities, leading to better usability and customer satisfaction.
Encoding application profiles in a computational model of the crosswalk
Authors: Carol Jean Godby, Devon Smith, Eric Childress
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

OCLC's Crosswalk Web Service (Godby, Smith and Childress, 2008) formalizes the notion of crosswalk, as defined in Gill, et al. (n.d.), by hiding technical details and permitting the semantic equivalences to emerge as the centerpiece. One outcome is that metadata experts, who are typically not programmers, can enter the translation logic into a spreadsheet that can be automatically converted into executable code. In this paper, we describe the implementation of the Dublin Core Terms application profile in the management of crosswalks involving MARC. A crosswalk that encodes an application profile extends the typical format with two columns: one that annotates the namespace to which an element belongs, and one that annotates a 'broader-narrower' relation between a pair of elements, such as Dublin Core coverage and Dublin Core Terms spatial. This information is sufficient to produce scripts written in OCLC's Semantic Equivalence Expression Language (or Seel), which are called from the Crosswalk Web Service to generate production-grade translations. With its focus on elements that can be mixed, matched, added, and redefined, the application profile (Heery and Patel, 2000) is a natural fit with the translation model of the Crosswalk Web Service, which attempts to achieve interoperability by mapping one pair of elements at a time.
Niching with derandomized evolution strategies in artificial and real-world landscapes
Authors: Ofer M. Shir, Thomas Bäck
Venue: Natural Computing: an international journal (2009)

We introduce a framework of derandomized evolution strategies (ES) niching techniques. A survey of these techniques, based on 5 variants of derandomized ES, is presented, based on the fixed niche radius approach. The core mechanisms range from the very first derandomized approach to self-adaptation of ES to the sophisticatedMediaObjects/11047_2007_9065_Figa_HTML.gif Covariance Matrix Adaptation (CMA). They are applied to artificial as well as real-world multimodal continuous landscapes, of different levels of difficulty and various dimensions, and compared with the maximum-peak-ratio (MPR) performance analysis tool. While characterizing the performance of the different derandomized variants in the context of niching, some conclusions concerning the niching formation process of the different mechanisms are drawn, and the hypothesis of a trade-off between learning time and niching acceleration is numerically confirmed. Niching with (1 + &lambda;)-CMA core mechanism is shown to experimentally outperform all the other variants, especially on the real-world problem. Some theoretical arguments supporting the advantage of a plus-strategy for niching are discussed. For the real-world application in hand, taken from the field of Quantum Control, we show that the niching framework can overcome some degeneracy in the search space, and obtain different conceptual designs using problem-specific diversity measurements.
3D Games Programming: Using DirectX 10 and Open GL, 1 edition
Authors: Pierre Rautenbach
Venue:  (2008)

3D Game Programming focuses on all the elements making up a 3-D first-person shooter game engine using a bottom-up approach. By following the easy-to-read text, the reader will learn how to create his or her own next-generation 3-D game engine with support for vertex and pixel shading GPU techniques (via Cg and HLSL), dynamic lighting and shadowing (via stencil shadow volumes), geometric meshes, audio, artificial intelligence, physics, environmental reflections, refraction and advanced lighting techniques such as High Dynamic Range lighting. Dealing with the cross-platform programming of 3-D Games for both Linux/MacOS X (via OpenGL/GLUT) and Windows (via DirectX 10 or OpenGL/GLUT) platforms, this book bridges an existent rift in the game development community. In addition to covering these APIs in-depth, the reader is also introduced to other game programming topics such as game development techniques and methodologies, particle systems, shader-based special effects, physics-based animation and artificial intelligence, making this the most comprehensive game programming guide around.