ppxscal/embedding_network huggingface dataset:
GADDI: distance index based subgraph matching in biological networks
Authors: Shijie Zhang, Shirong Li, Jiong Yang
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large graphs is an urgent research problem of great practical importance. The main challenge is size. Each graph may contain thousands (or more) vertices. Most of the previous work focuses on indexing a set of small or medium sized database graphs (with only tens of vertices) and finding whether a query graph occurs in any of these. In this paper, we are interested in finding all the matches of a query graph in a given large graph of thousands of vertices, which is a very important task in many biological applications. This increases the complexity significantly. We propose a novel distance measurement which reintroduces the idea of frequent substructures in a single large graph. We devise the novel structure distance based approach (GADDI) to efficiently find matches of the query graph. GADDI is further optimized by the use of a dynamic matching scheme to minimize redundant calculations. Last but not least, a number of real and synthetic data sets are used to evaluate the efficiency and scalability of our proposed method.
An 11,424 gate-count dynamic optically reconfigurable gate array with a photodiode memory architecture
Authors: Daisaku Seto, Minoru Watanabe
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The world's largest 11,424 gate-count dynamic optically reconfigurable gate array VLSI chip, which is based on the use of junction capacitance of photodiodes as configuration memory, has been fabricated. The size and process of the VLSI chip are, respectively, a 96.04 mm2 and a 0.35 &mu;m-3 metal CMOS process technology. To clarify the availability of the VLSI, this paper shows an experimental result of a long retention time of its photodiode memory architecture.
CAD challenges for 3D ICs
Authors: David Kung, Ruchir Puri
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A fundamental shift in the technology has occurred at 90nm CMOS and beyond where the interconnect resistance has been increasing so much that the distance a clock cycle can reach has been dwindling as a fraction of the dimension of the chip. to cause a repeater explosion problem. This problem translates into an explosion of repeaters which not only added significant overhead in area but also power, as repeaters are major contributors to leakage. By reaching out to the vertical dimension, 3D technology has the potential of easing repeater explosion (Figure 1), reducing latency between units, increasing memory bandwidth and integrating heterogeneous tecnologies. However, in order to exploit the full potential of 3D technology, new challenges in the area of system level design and analysis, physical design, thermal analysis need to be addressed. To justify the cost and complexity overhead of 3D technology, it is essential to understand and study the benefit of 3D. It is clear that the biggest performance lever of 3D is at the architecture level. There is a strong need for a architectural exploration tool that combines performance and power analysis, and thermal mapping with 3D physical floorplanning to optimize system implementation in 3D technology. This requires strong linkage between architecture level analysis tools and 3D physical planning tools. Most of the advantages of 3D will be realized with novel system architectures and physical implementations. Therefore, the tools to aid 3D implementation must also operate at the higher level. 3D interconnects have the potential of reducing critical paths delays significantly, which are typically between memory and the interfacing logic. To leverage that, current physical design infrastructure that supports 2D designs must enable 3D designs. Therefore, tools such as Physical design layout (placement, routing), timing, extraction, LVS, DRC all must support silicon layers in the third dimension. New tools that consider thermally aware physical design implementations, most importantly at the architecture and SoC level are crucial to the success of 3D as thermal issues are exacerbated in 3D implementations. Most of the studies reporting huge benefits from 3D for wire length do not adequately consider the physical impact of vertical vias. It is crucial to consider the impact of vertical vias on the physical design of ICs, from area, latency, and thermal impact point of view. Figure 2 shows that the sweet spot of partitioning for 3D implementation lies at the unit level (where a unit is a large logical entity such as floating point logic or Instruction decode logic etc). and beyond, when considering the via impact. Therefore the 3D place and route algorithms that have been proposed in the literature will be of limited use (at least in the immediate future), since initial 3D layer partitioning will be very coarse grained and current 2D designs do a fairly good job of optimizing the critical path distance.
A narrow band graph partitioning method for skin lesion segmentation
Authors: Xiaojing Yuan, Ning Situ, George Zouridakis
Venue: Pattern Recognition (2009)

Accurate skin lesion segmentation is critical for automated early skin cancer detection and diagnosis. In this paper, we present a novel multi-modal skin lesion segmentation method based on region fusion and narrow band energy graph partitioning. The proposed method can handle challenging characteristics of skin lesions, such as topological changes, weak or false edges, and asymmetry. Extensive testing demonstrated that in this method complex contours are detected correctly while topological changes of evolving curves are managed naturally. The accuracy of the method was quantified using a lesion similarity measure and lesion segmentation error ratio, Our results were validated using a large set of epiluminescence microscopy (ELM) images acquired using cross-polarization ELM and side-transillumination ELM. Our findings demonstrate that the new method can achieve improved robustness and better overall performance compared to other state-of-the-art segmentation methods.
CS1 students speak: advice for students by students
Authors: Brian Hanks, Laurie Murphy, Beth Simon, Renée McCauley, Carol Zander
Venue: ACM SIGCSE Bulletin (2009)

We collected advice on how to succeed at learning to program from 164 CS1 students at 3 institutions during a "saying is believing" intervention designed to encourage a growth mindset. More students gave general advice (63%) than programming-specific (23%) or attitudinal advice (34%), despite being prompted to encourage future students to develop a growth mindset toward programming. Advice categories and quotes offer educators insights into student beliefs and practices and suggest a framework for considering how best to advise students. We discuss the implications of students offering advice to other students and provide a handout of representative advice intended for distribution to students in introductory programming courses.
Induction machine fault detection using clone selection programming
Authors: Zhaohui Gan, Ming-Bo Zhao, Tommy W. S. Chow
Venue: Expert Systems with Applications: An International Journal (2009)

A clonal selection programming (CSP)-based fault detection system is developed for performing induction machine fault detection and analysis. Four feature vectors are extracted from power spectra of machine vibration signals. The extracted features are inputs of an CSP-based classifier for fault identification and classification. In this paper, the proposed CSP-based machine fault diagnostic system has been intensively tested with unbalanced electrical faults and mechanical faults operating at different rotating speeds. The proposed system is not only able to detect electrical and mechanical faults correctly, but the rules generated is also very simple and compact and is easy for people to understand, This will be proved to be extremely useful for practical industrial applications.
Approaches to knowledge reduction of covering decision systems based on information theory
Authors: Fei Li, Yunqiang Yin
Venue: Information Sciences: an International Journal (2009)

In this paper, we propose some new approaches for attribute reduction in covering decision systems from the viewpoint of information theory. Firstly, we introduce information entropy and conditional entropy of the covering and define attribute reduction by means of conditional entropy in consistent covering decision systems. Secondly, in inconsistent covering decision systems, the limitary conditional entropy of the covering is proposed and attribute reductions are defined. And finally, by the significance of the covering, some algorithms are designed to compute all the reducts of consistent and inconsistent covering decision systems. We prove that their computational complexity are polynomial. Numerical tests show that the proposed attribute reductions accomplish better classification performance than those of traditional rough sets. In addition, in traditional rough set theory, MIBARK-algorithm [G.Y. Wang, H. Hu, D. Yang, Decision table reduction based on conditional information entropy, Chinese J. Comput., 25 (2002) 1-8] cannot ensure the reduct is the minimal attribute subset which keeps the decision rule invariant in inconsistent decision systems. Here, we solve this problem in inconsistent covering decision systems.
FLATIR: FTIR multi-touch detection on a discrete distributed sensor array
Authors: Ramon Hofer, Daniel Naeff, Andreas Kunz
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

In this paper, we suggest a new way to add multi-touch capabilities to an LC-screen. For this, FTIR and IR-sensing behind the LC-screen will be combined. Using a large infrared sensor array mounted behind the LC-matrix, infrared light in front of the screen, which is strong enough to pass through the LC-screen's components, can be detected The FTIR-technology is able to deliver such infrared light to the integrated sensors when touching the screen with the fingers. For the prototype, the key parameters of the FTIR principle were experimentally analyzed to optimize the sensor reactivity. The 4x8 sensor prototype can simultaneously detect multiple touches with an accuracy of around 1 mm and with an update rate of 200 Hz.
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Authors: Michi Henning, Maarten van Steen
Venue: Middleware Conference (2006)

Middleware is one of those topics in computer science for which it appears difficult to reach consensus on its exact meaning. Broadly speaking, one could say that middleware contains solutions to the distribution of processes, data, and control that are more or less independent from applications, and that allow underlying platforms and hardware to be hidden from applications. In other words, it covers a lot. However, there does seem to be consensus on the fact that middleware is about distributed systems, and that the solutions incorporated into middleware are applicable to a wide range of applications. Following the trend of past Middleware conferences, this seventh edition has continued to take a broad perspective on what middleware is all about, and there was general agreement among the Program Committee members that we should be open-minded as to what should be considered on topic or not. This open-mindedness is reflected in an interesting collection of papers that cover many fields of middleware, and even touch upon areas that have traditionally belonged more to the systems arena, such as virtualization. However, not everything changes. As usual, the number of strong submissions was remarkably high, and there were many discussions among committee members as to which papers to accept. (Almost every paper was reviewed by four committee members.) Eventually, we selected 21 out of the 122 submissions, with space limitations forcing us to reject even papers that reflected good and original research.
Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping
Authors: Ted Pedersen
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second---order context vectors. We calibrate our approach using a manually annotated collection of five ambiguous names from the Web, and then apply the learned parameter settings to three held-out sets of pseudo-name data that have been reported on in previous publications. We find that significant improvements in the accuracy of name discrimination can be achieved by using very wide bigrams, which are ordered pairs of words with up to 48 intervening words between them. We also show that recent developments in automatic cluster stopping can be used to predict the number of underlying identities without any significant loss of accuracy as compared to previous approaches which have set these values manually.
Valuing and representing information: the paradox of undervaluing information and overvaluing information producers
Authors: Maria Sakalaki, Smaragda Kazi
Venue: Journal of Information Science (2009)

Information's increasing importance in contemporary societies raises questions concerning laymen's valuation of information and of professionals producing information. The main hypotheses were: (a) potential sellers will underestimate information's value compared to that of material goods; (b) when potential buyers' involvement is high (that is high investment and high risk), sellers will demand even lower prices for information; (c) some important current functions and meanings of information are not assimilated in social representations of information; (d) by contrast, participants must overvalue the remuneration of professionals producing pure information (invention) compared to those who apply this information to produce material goods. An experimental study confirmed hypotheses (a) and (b). A second study to investigate the structure of information's social representations showed that the representation's central core is mainly composed of categories referring to traditional media, functions and technologies; contemporary functions and technologies are less frequent or absent. A third experimental study confirmed hypothesis (d).
Apache 2 Pocket Reference: For Apache Programmers & Administrators, 2nd ed. edition
Authors: Andrew Ford
Venue:  (2008)

Even if you know the Apache web server inside and out, you still need an occasional on-the-job reminder -- especially if you're moving to the newer Apache 2.x. "Apache 2 Pocket Reference" gives you exactly what you need to get the job done without forcing you to plow through a cumbersome, doorstop-sized reference. This Book provides essential information to help you configure and maintain the server quickly, with brief explanations that get directly to the point. It covers Apache 2.x, giving web masters, web administrators, and programmers a quick and easy reference solution. This pocket reference includes: Summaries of command-line options, configuration directives, and modules Key information about Apache support utilities What you need to know about URL rewriting, filters, caching, proxying and security Whether you manage huge e-commerce operations, corporate intranets, or small personal websites, Apache 2 Pocket Reference is ideal for savvy administrators who no longer need detailed tutorials and just want a convenient, on-the-job reference.
ESPranto SDK: an adaptive programming environment for tangible applications
Authors: Robert van Herk, Janneke Verhaegh, Willem F.J. Fontijn
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This paper describes the ESPranto Software Development Kit, which supports the development of sensor/actuator based applications, most notably educational toys and games. It enables non-technical users, such as parents, teachers, game developers and psychologists, to specify applications by themselves. The SDK allows them to start off quickly with developing simple applications. Then, as their programming skills increase with experience, the SDK supports them to create more complex applications. This is achieved by offering a complete tool chain with one, consistent programming paradigm. Each link is a separate tool offering a tailored amount of flexibility and complexity. To ensure that users can understand the feedback the SDK provides them, it is given in terms of the tool currently used. Furthermore, by preventing runtime errors, a user can be sure a program will work correctly if it compiles. We validated the ESPranto SDK partially by tests, but mainly by monitoring users applying the SDK. In practice the ESPranto SDK indeed proved to meet its design goals for all of its intended users.
Two in the middle: digital character production and machinima courses
Authors: Mark Christensen van Langeveld, Robert Kessler
Venue: ACM SIGCSE Bulletin (2009)

Many Universities and Colleges are building interdisciplinary programs between engineering and fine arts that focus on games, special effects, animation and other areas that require interdisciplinary efforts. This is in response to the needs of the entertainment industries. The video game and 3D animation businesses fundamentally involve computer scientists and artists working closely together. The Entertainment Arts and Engineering (EAE) program (founded in 2007) is an undergraduate interdisciplinary program at the University of Utah (UofU). Students pursuing an animation or computer science degree may enroll in the program as a means of focusing their education on digital arts and entertainment. Two courses taught at the UofU with curriculum in the middle of the continuum between the two departments are the courses: Digital Character Production and Machinima. These courses provide an extraordinary applied learning experience for students to combine learning concepts that are not commonly taught together. The curriculums are designed to teach students to breakdown extremely complex problems, requiring understanding from both disciplines, into manageable segments that allow easy understanding of diverse concepts from computer graphics principles to sculptural ideology and from graphic algorithms to film/storytelling. It is a process that provides a direct view of the correlations of the critical concepts from each of the disciplines. This paper presents our insights from teaching and reviewing these two classes.
A deterministic analytic model of a multiprogrammed interactive system
Authors: Samuel T. Chanson, Domenico Ferrari
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The analytic models used to evaluate the performance of multi-access computer systems are generally queueing models. Their ability to represent, often adequately, these systems is due both to the congestion situation created by the processes competing for a system's resources and to the variability of the workload, whose parameters can be much more concisely characterized as stochastic variables than by some deterministic representation. Thus, deterministic models have been only applied in extremely simple, first-approximation studies (see, for example, Hellerman and Smith and Fenichel and Grossman), or in the analysis of some resource management algorithms (e.g., the problem of optimal schedules discussed in Chapter 3 of Coffman and Denning). This paper presents a non-queueing model of a multiprogrammed interactive system. The model is substantially more sophisticated and more accurate than the deterministic models previously proposed, but retains the characteristics, common to all deterministic models, of greater mathematical simplicity and better understandability with respect to queueing models of comparable accuracy. Even though the equations of the model derived in the paper for an XDS 940 installation cannot probably be applied to other systems, the authors feel that the approach can be used for most systems to obtain quick and reasonably accurate estimates of some performance indices.
On the Linear Complexity of Some Ternary Sequences with Ideal Autocorrelation
Authors: Xiaoni Du, Yu Zhou, Rong Sun, Guozhen Xiao
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, we examine the linear complexity of some 3-ary sequences, proposed by No, of period 3n-1(n = 3ek, e, k integer) with the ideal autocorrelation property. The exact value of linear complexity k(6e)w is determined when the parameter r = Σi=1w 3ei. Furthermore, the upper bound of the linear complexity is given when the other forms of the value r is taken. Finally, a Maple program is designed to illustrate the validity of the results.
Frequent Subgraph Retrieval in Geometric Graph Databases
Authors: Sebastian Nowozin, Koji Tsuda
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Discovery of knowledge from geometric graph databases is of particular importance in chemistry and biology, because chemical compounds and proteins are represented as graphs with 3D geometric coordinates. In such applications, scientists are not interested in the statistics of the whole database. Instead they need information about a novel drug candidate or protein at hand, represented as a query graph. We propose a polynomial-delay algorithm for geometric frequent subgraph retrieval. It enumerates all subgraphs of a single given query graph which are frequent geometric $\epsilon$-subgraphs under the entire class of rigid geometric transformations in a database. By using geometric$\epsilon$-subgraphs, we achieve tolerance against variations in geometry. We compare the proposed algorithm to gSpan on chemical compound data, and we show that for a given minimum support the total number of frequent patterns is substantially limited by requiring geometric matching. Although the computation time per pattern is larger than for non-geometric graph mining,the total time is within a reasonable level even for small minimum support.
Content-Based Hierarchical Classification of Vacation Images
Authors: Aditya Vailaya, Anil Jain, Mario Figueiredo, HongJiang Zhang
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Grouping images into (semantically) meaningful categories using low-level visual features is a challenging and important problem in content-based image retrieval. Using binary Bayesian classifiers, we attempt to capture high-level concepts from low-level image features under the constraint that the test image does belong to one of the classes of interest. Specifically, we consider the hierarchical classification of vacation images; at the highest level, images are classified into indoor/outdoor classes, outdoor images are further classified into city/landscape classes, and finally, a subset of landscape images is classified into sunset, forest, and mountain classes. We demonstrate that a small codebook (the optimal size of codebook is selected using a modified MDL criterion) extracted from a vector quantizer can be used to estimate the class-conditional densities of the observed features needed for the Bayesian methodology. On a database of 6,931 vacation photographs, our system achieved an accuracy of 90.5% for indoor vs. outdoor classification, 95.3% for city vs. landscape classification, 96.6% for sunset vs. forest & mountain classification, and 95.5% for forest vs. mountain classification. We further develop a learning paradigm to incrementally train the classifiers as additional training samples become available and also show preliminary results for feature size reduction using clustering techniques.