ppxscal/embedding_network huggingface dataset:
A hybrid Nano/CMOS dynamically reconfigurable system&mdash;Part II: Design optimization flow
Authors: Wei Zhang, Niraj K. Jha, Li Shang
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2009)

In Part I of this work, a hybrid nano/CMOS reconfigurable architecture, called NATURE, was described. It is composed of CMOS reconfigurable logic and interconnect fabric, and nonvolatile nano on-chip memory. Through its support for cycle-by-cycle runtime reconfiguration and a highly-efficient computation model, temporal logic folding, NATURE improves logic density and area-delay product by more than an order of magnitude compared to existing CMOS-based field-programmable gate arrays (FPGAs). NATURE can be fabricated using mainstream photo-lithography fabrication techniques. Thus, it offers a currently commercially feasible architecture with high performance, superior logic density, and excellent runtime design flexibility. In Part II of this work, we present an integrated design and optimization flow for NATURE, called NanoMap. Given an input design specified in register-transfer level (RTL) and/or gate-level VHDL, NanoMap optimizes and implements the design on NATURE through logic mapping, temporal clustering, temporal placement, and routing. As opposed to other design tools for traditional FPGAs, NanoMap supports and leverages temporal logic folding by integrating novel mapping techniques. It can automatically explore and identify the best temporal logic folding configuration, targeting area, delay or area-delay product optimization. A force-directed scheduling technique is used to optimize and balance resource usage across different folding cycles. By supporting logic folding, NanoMap can provide significant design flexibility in performing area-delay trade-offs under various user-specified constraints. We present details of the mapping procedure and results for different architectural instances. Experimental results demonstrate that NanoMap can judiciously trade off area and delay targeting different optimization goals, and effectively exploit the advantages of NATURE. Part I of this work will appear in JETC Vol. 5, No. 4.
Beginning Linux Programming, 4th edition
Authors: Neil Matthew, Richard Stones
Venue:  (2007)

Provided you have some previous basic exposure to C and Unix, Beginning Linux Programming delivers an excellent overview of the world of Linux development with an appealing range of essential tools and APIs. The standout feature of Beginning Linux Programming is its wide-ranging coverage of important topics in basic Unix programming. In a series of short chapters, the authors discuss the basics of writing Unix programs in C, with material on basic system calls, file I/O, interprocess communication (for getting programs to work together), and advanced topics such as socket programming and how to create Unix device drivers. Parallel to this, the book introduces the toolkits and libraries for working with user interfaces, from simpler terminal mode applications to X and GTK+ for graphical user interfaces. While you won't be an authority on X or GTK+ after reading this book, you will certainly be able to explore real Linux development on your own after the capable introductory guide provided here. (The book's main example, a CD-ROM database, gets enhanced in subsequent chapters using new APIs and features as the book moves forward.) This text also serves as a valuable primer on languages and tools such as Tcl, Perl, and CGI. (There's even a section that explains the basics of the Internet and HTML.) More than ever, there is no shortage of specific information on Linux programming, but few titles provide such a wide-ranging tour of what you need to know to get serious with Linux development. In all, Beginning Linux Programming gives the reader an intelligent sampling of essential topics in today's Linux. It's a wise choice for aspiring Unix C developers or folks seeking to extend the range of their Linux knowledge. --Richard Dragan Topics covered: Linux overview, compiling C programs, shell programming, pipes, script keywords and functions, Unix file I/O in C, Unix system functions, terminal interfaces (termios, keyboard input, the curses library), memory management, file locking, dbm databases, make and source control basics, man pages, debugging with gdb, processes and signals, POSIX threads and synchronization, IPC and pipes, semaphores, queues and shared memory, sockets, Tcl basics, X Windows and GTK+ for GNOME, Perl basics, HTML and CGI, writing Unix device drivers.
Context semantics, linear logic, and computational complexity
Authors: Ugo Dal Lago
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity: it is both an upper bound to normalization time (modulo a polynomial overhead, independently on the reduction strategy) and a lower bound to the amount of resources needed to compute the normal form. Weights are then exploited in proving strong soundness theorems for various subsystems of linear logic, namely elementary linear logic, soft linear logic, and light linear logic.
Designing Peer-To-Peer Agent Auctions Using Object-Process Methodology
Authors: Zoheir Ezziane
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Peer-to-Peer (P2P) architecture is one of the most interesting topics in distributed systems and other related areas (e.g., AI, Database, etc). Basic P2P applications have only implemented limited aspects of a real P2P environment. Meanwhile the fast growing technology, autonomous agents, appear to be a good candidate for most of the complex and dynamic problems. This paper proposes a flexible design for the creation of agent auctions in a distributed environment. Interactions between agents occur in a P2P communication protocol, reducing the role of the centralized auction process to an auction initiator, and to inform agents when a general equilibrium is reached. Agents and auctions are designed using the object-process methodology (OPM) which represents a comprehensive approach to system evolution that incorporates the static-structural and dynamic-procedural aspects of a system into a single unifying model. OPM includes a clear and concise set of symbols that form a language enabling the expression of the system's building blocks and how they relate to each other.
A novel method for constructing ensemble classifiers
Authors: Chun-Xia Zhang, Jiang-She Zhang
Venue: Statistics and Computing (2009)

This paper presents a novel ensemble classifier generation method by integrating the ideas of bootstrap aggregation and Principal Component Analysis (PCA). To create each individual member of an ensemble classifier, PCA is applied to every out-of-bag sample and the computed coefficients of all principal components are stored, and then the principal components calculated on the corresponding bootstrap sample are taken as additional elements of the original feature set. A classifier is trained with the bootstrap sample and some features randomly selected from the new feature set. The final ensemble classifier is constructed by majority voting of the trained base classifiers. The results obtained by empirical experiments and statistical tests demonstrate that the proposed method performs better than or as well as several other ensemble methods on some benchmark data sets publicly available from the UCI repository. Furthermore, the diversity-accuracy patterns of the ensemble classifiers are investigated by kappa-error diagrams.
Supporting community engagement in the city: urban planning in the MR-tent
Authors: Ina Wagner, Maria Basile, Lisa Ehrenstrasser, Valérie Maquil, Jean-Jacques Terrin, Mira Wagner
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

Urban design today faces complex demands. It has become a necessity to negotiate between stakeholder objectives, the expectations of citizens, and the demands of planning. In this paper we describe how we use a set of participatory technologies in combination with methods for preparing and enabling a heterogeneous group of participants to create a vision of an urban project. Our observations show how space, materials, and different types of content affect participants' collaboration and their debate of the urban issues. We discuss how these participatory technologies and events may help build a community of practice around an urban project.
Segmentation of CT Brain Images Using Unsupervised Clusterings
Authors: Tong Hau Lee, Mohammad Faizal Ahmad Fauzi, Ryoichi Komiya
Venue: Journal of Visualization (2009)

In this paper, we present non-identical unsupervised clustering techniques for the segmentation of CT brain images. Prior to segmentation, we enhance the visualization of the original image. Generally, for the presence of abnormal regions in the brain images, we partition them into 3 segments, which are the abnormal regions itself, the cerebrospinal fluid (CSF) and the brain matter. However, for the absence of abnormal regions in the brain images, the final segmented regions will consist of CSF and brain matter only. Therefore, our system is divided into two stages of clustering. The initial clustering technique is for the detection of the abnormal regions. The later clustering technique is for the segmentation of the CSF and brain matter. The system has been tested with a number of real CT head images and has achieved satisfactory results.
Regression by dependence minimization and its application to causal inference in additive noise models
Authors: Joris Mooij, Dominik Janzing, Jonas Peters, Bernhard Schölkopf
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Motivated by causal inference problems, we propose a novel method for regression that minimizes the statistical dependence between regressors and residuals. The key advantage of this approach to regression is that it does not assume a particular distribution of the noise, i.e., it is non-parametric with respect to the noise distribution. We argue that the proposed regression method is well suited to the task of causal inference in additive noise models. A practical disadvantage is that the resulting optimization problem is generally non-convex and can be difficult to solve. Nevertheless, we report good results on one of the tasks of the NIPS 2008 Causality Challenge, where the goal is to distinguish causes from effects in pairs of statistically dependent variables. In addition, we propose an algorithm for efficiently inferring causal models from observational data for more than two variables. The required number of regressions and independence tests is quadratic in the number of variables, which is a significant improvement over the simple method that tests all possible DAGs.
Some kinds of View the -fuzzy filters of BL-algebras
Authors: Xueling Ma, Jianming Zhan, Wiesław A. Dudek
Venue: Computers Mathematics with Applications (2009)

The concepts of View the MathML source-fuzzy (implicative, positive implicative and fantastic) filters of BL-algebras are introduced and some related properties are investigated. Some characterizations of these generalized fuzzy filters are derived. In particular, we describe the relationships among ordinary fuzzy (implicative, positive implicative and fantastic) filters, View the MathML source-fuzzy (implicative, positive implicative and fantastic) filters and View the MathML source-fuzzy (implicative, positive implicative and fantastic) filters of BL-algebras. Finally, we prove that a fuzzy set F of a BL-algebra L is an View the MathML source-fuzzy implicative filter of L if and only if it is both an View the MathML source-fuzzy positive implicative filter and an View the MathML source-fuzzy fantastic filter.
Model Building as a Platform to Support Thinking in Problem Solving
Authors: Chwee Beng Lee, Ioan Gelu Ionas, Matthew Schmidt
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Problem solving not only plays a central role in education [19] but is also the most important cognitive process in our everyday life. The authors of this paper argue that problem solving must be embedded in authentic learning contexts and supported by activities that seek to enable problem solvers to externalize their mental model in the most meaningful and engaging manner that will eventually lead them to the construction of a more sophisticated conceptual framework. One such way is through system dynamics modeling activities. To provide a sound argument for the use of system dynamics models in learning, we present three models that support thinking in problem solving.
Management and object behavior of statecharts through statechart DNA
Authors: Benjamin De Leeuw, Albert Hoogewijs
Venue: WSEAS Transactions on Information Science and Applications (2009)

We propose composed strings called "statechart DNA" as essential building blocks for a new statechart (sc) abstraction method. We define the simplified statechart (ssc) and show that our definition covers the UML 2.0 sc model, by matching it to all model elements of the StateMachine package of the UML 2.0 metamodel and to the OCL constraints on these model elements. A Model Driven Architecture (MDA) is defined, inspired by a PIM-to-PIM model transformation procedure between UML sc models and ssc models. We discuss the rationale behind action abstraction in ssc models. This framework is used to isolate sc DNA, first in ssc models, then in UML sc models. We show how sc DNA, a compaction of sc construction primitives, can be used to define behavior model metrics and more generally, to manage and maintain evolving object behavior. State machine versioning is an important application of statechart DNA to manage industrial model repositories.
Systems Support for Collaborative Learning
Authors: Colin Allison, Alan Ruddle, Rosa Michaelson
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

One of the distinguishing features of novel network based learning environments is their capability to support group work and collaboration. TAGS, the Tutor and Groups Support Scheme, is an inter-disciplinary, inter-institutional project, which brings together software systems builders, subject-specialists and educational content developers. Collaborative Learning is central to the pedagogical goals of TAGS, and this has lead to the concept of groups being used as a fundamental organising principle. Groups form the basis of (i) privileges and access control, (ii) information dissemination and event awareness, (iii) teamwork involving shared, multi-user educational resources, (iv) online management of group learning, (v) user-centric portal generation, and (vi) replicated servers. The technical implications of this heavy reliance on the group abstraction are described.
Virtual Human Imaging
Authors: Yang Cai, Iryna Pavlyshak, Li Ye, Ryan Magargle, James Hoburg
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Given 3D scanned anthropological models and the physical parameters of a microwave imaging system, we develop a virtual human surface imagery system with a finite multi-physics surface model. The concealed object detection algorithms are developed based on the wave intensity and surface characteristics. The virtual human image system can be integrated into a systematic design process, enabling multidisciplinary innovations in security, privacy, healthcare, computer vision, and information visualization. This forward-thinking approach intends to transform the development of human imaging technologies from being device-specific and proprietary to being device-independent and open source-oriented. It also transforms the research into a systematic design process, enabling multidisciplinary innovations in digital human modeling, computer vision, information visualization, and computational aesthetics. This study can help to design privacy-aware imaging systems in airports and medical systems.
Facing an age-old problem
Authors: Samuel Greengard
Venue: Communications of the ACM (2009)

Researchers are addressing the computing challenges of older individuals, whose needs are different---and too often disregarded.
Computer (and Human) Perfection at Checkers
Authors: Jonathan Schaeffer
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

In 1989 the Chinook project began with the goal of winning the human World Checkers Championship. There was an imposing obstacle to success ?the human champion, Marion Tinsley. Tinsley was as close to perfection at the game as was humanly possible. To be better than Tinsley meant that the computer had to be perfect. In effect, one had to solve checkers. Little did we know that our quest would take 18 years to complete. What started out as a research project quickly became a personal quest and an emotional roller coaster. In this talk, the creator of Chinook tells the story of the quest for computer perfection at the game of checkers.
A Benders'Approach to a Transportation Network Design Problem
Authors: Benjamin Peterson, Michael A. Trick
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Benders' decomposition is an iterative technique for mathematical programming in which a problem is decomposed into two parts: a master problem which solves for only a subset of the variables, and a subproblem which solves for the remaining variables while treating the master variables as fixed. The technique uses information from the solution of the subproblem to design a constraint that is unsatisfied by the current master solution but necessary for the optimal solution of the full problem. The master problem and subproblem are solved iteratively as new constraints are added to the master problem until no such constraint exists and the last master solution therefore optimizes the full problem. In traditional Benders' decomposition [1], the subproblem is a linear program, and the Benders' constraint is based on the dual solution to that subproblem. More recently, logic-based [3] or combinatorial Benders' [2] have been developed that generate Benders constraints based on infeasibility or suboptimality-based constraints. By not requiring a linear programming subproblem, Benders approaches provide an excellent approach to integrating disparate optimization approaches.
Nikon D90 For Dummies
Authors: Julie Adair King
Venue: For Dummies (2009)

Your Nikon D90 digital camera offers professional-quality features like 11-point autofocus, Live View, and the ability to shoot HD video. Take full advantage of every feature with Nikon D90 For Dummies! This fun and easy guide helps you understand and use all the dials and modes, manage photo size and quality, take creative control with manual settings, and share your images in print or online. With this full-color book, getting great shots is a snap. Youll learn to: Format memory cards, use Live View, create custom settings, and change lenses Use thumbnail and calendar displays and picture data, and get tips for inspecting your photos Control aperture, shutter speed, and ISO; work with active D-lighting; and use various flash modes Take control of lighting, exposure, and color Set up, shoot, and review photos using the viewscreen Record HD video, including sound, and know what your D90 can and cant do Download, organize, and archive your images, share them in prints, e-mails, or slide shows, and use Nikons photo management software Decide when you should use JPEG and when to use NEF Adjust resolution for optimum print quality or file size Photographic expert Julie Adair King also shares secrets for getting the best point-and-shoot pictures, why you might not want to use the top image quality setting, and much more. Grab your Nikon D90 and Nikon D90 For Dummies, and start shooting!
The scalable hyperlink store
Authors: Marc Najork
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

This paper describes the Scalable Hyperlink Store, a distributed in-memory "database" for storing large portions of the web graph. SHS is an enabler for research on structural properties of the web graph as well as new link-based ranking algorithms. Previous work on specialized hyperlink databases focused on finding efficient compression algorithms for web graphs. By contrast, this work focuses on the systems issues of building such a database. Specifically, it describes how to build a hyperlink database that is fast, scalable, fault-tolerant, and incrementally updateable.
Potential of Malaysian activated carbon in dual purpose adsorption system
Authors: M. A. Alghoul, M. Y. Sulaiman, K. Sopian, M. Yahya, Azami Zaharim
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The adsorption capability of some locally produced activated charcoal (coconut shell) samples with methanol were taken under laboratory conditions. An experimental test rig was set up; data obtained from the experiments were fitted to Dubinin-Radushkevitch (D - R) and Dubinin-Astakhov (D - A) equations. The results obtained and can be used to select the most favorable pair for a dual purpose adsorption system. Activated carbon AC- 5060 shows the best adsorption capacity for methanol and the highest coefficient of performance (COP). AC-5060 is chosen as the adsorbent for the solar adsorption system. Malaysian activated carbon is not significant for ice making in adsorption systems at condenser or adsorption temperature higher than 30°C. The most efficient way to improve the dual purpose system is to search for enhanced adsorbent material in terms of adsorption capacity and thermal conductivity.
Automatically generating high quality metadata by analyzing the document code of common file types
Authors: Lars Fredrik Høimyr Edvardsen, Ingeborg Torvik Sølvberg, Trond Aalberg, Hallvard Trætteberg
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

A major challenge for content management in intranets and other large scale document storage and retrieval services is the generation of high quality metadata. Manual generation of metadata is resource demanding and is often viewed by collection managers and document authors as inefficient use of their time, and there is a desire for other ways to create the needed metadata. Automatic Metadata Generation (AMG) is methods for generating metadata without manual interaction using computer program(s) to interpret the document and possibly the document context. Current AMG research has been limited to collection of similarly formatted documents. The research presented in this paper expands the field of AMG by presenting an approach that is independent of a common visualization scheme; AMG based on document code analysis. This is done by showing AMG possibilities from Latex, Word and PowerPoint documents and how this approach can significantly increase the quality of the generated metadata. This by avoiding common quality reducing factors as missing completeness, low accuracy, logical consistency and coherence and timeliness by giving AMG algorithms direct access to the user specified intellectual content and the file formatting. This research shows how this AMG approach can be combined with other AMG approaches, drawing on their strengths in order to achieve the desired high quality metadata entities.