ppxscal/embedding_network huggingface dataset:
A new scheme for automated 3D PDM construction using deformable models
Authors: ZheEn Zhao, Eam Khwang Teoh
Venue: Image and Vision Computing (2008)

This paper describes a novel scheme to build a 3D Point Distribution Model (PDM) from a set of segmented training volumetric images. This approach is based on a deformable model algorithm to find correspondences across a set of surfaces/samples. It selects one sample as the template, and then deforms the template to approximate all other samples. These approximations carry the correspondences from the template to all other samples. The challenge is that a single template cannot guarantee accurate approximations to all other samples. The proposed solution is first to select the template sample, which brings the most accurate approximations to others among all samples. For each sample, which is not approximated accurately by the template, a ''bridge'' sample is chosen so that the bridge approximates accurately the current sample and the template approximates accurately to the bridge. The correspondences are then carried over from the template to the current sample via the ''bridge''. A PDM is then constructed from the set of template's approximations to all samples. This method is applied to construct four PDMs from 3D human brain Magnetic Resonance Images (MRIs). The four 3D PDMs constructed show considerable improvement on the approximation accuracy as compared to that constructed by adapting arbitrary templates. This improvement is important, as the approximation accuracy is the major concern of the deformable model-based approaches for the construction of PDMs.
Scheduling and Optimization of Dynamic Complex Discrete Events Based on Ant Colony Optimization
Authors: Wenbin Hu, Fu Lin, Dengyi Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

An ant colony optimization (ACO) based on Multi-agent approach for project scheduling and optimization is presented. Several new features that improve the converge speed and precision of ACO in general are proposed and evaluated: (1) new updating strategy of pheromone; (2) importing trust mechanism as heuristic information; (3) multi-node searching strategy; (4) problem solving by multi-agent alliance negotiation. Based on these improvements, we presented architecture, steps and applications of ACO based on multi-agent. We tested this algorithm on a real product-scheduling problem. Compared to basic ACO for this problem solving, the algorithm presented in this paper performed best on average.
A Systematic Approach to Interactive Programming
Authors: Pei Hsia
Venue: Computer (1980)

Designed for program development in an interactive environment, this framework can help create a new generation of programmers with an invaluable disciplined approach to software development.
Triangulation for points on lines
Authors: Adrien Bartoli, Jean-Thierry Lapresté
Venue: Image and Vision Computing (2008)

Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the pinhole camera model case, is nonlinear in the 3D point coordinates. We study the triangulation of points lying on a 3D line, which is a typical problem for Structure-From-Motion in man-made environments. We show that the reprojection error can be minimized by finding the real roots of a polynomial in a single variable, which degree depends on the number of images. We use a set of transformations in 3D and in the images to make the degree of this polynomial as low as possible, and derive a practical reconstruction algorithm. Experimental comparisons with an algebraic approximation algorithm and minimization of the reprojection error using Gauss-Newton are reported for simulated and real data. Our algorithm finds the optimal solution with high accuracy in all cases, showing that the polynomial equation is very stable. It only computes the roots corresponding to feasible points, and can thus deal with a very large number of views - triangulation from hundreds of views is performed in a few seconds. Reconstruction accuracy is shown to be greatly improved compared to standard triangulation methods that do not take the line constraint into account.
Academic users' interactions with ScienceDirect in search tasks: Affective and cognitive behaviors
Authors: Carol Tenopir, Peiling Wang, Yan Zhang, Beverly Simmons, Richard Pollard
Venue: Information Processing and Management: an International Journal (2008)

This article presents part of phase 2 of a research project funded by the NSF-National Science Digital Library Project, which observed how academic users interact with the ScienceDirect information retrieval system for simulated class-related assignments. The ultimate goal of the project is twofold: (1) to find ways to improve science and engineering students' use of science e-journal systems; (2) to develop methods to measure user interaction behaviors. Process-tracing technique recorded participants' processes and interaction behaviors that are measurable; think-aloud protocol captured participants' affective and cognitive verbalizations; pre- and post-search questionnaires solicited demographic information, prior experience with the system, and comments. We explored possible relationships between affective feelings and cognitive behaviors. During search interactions both feelings and thoughts occurred frequently. Positive feelings were more common and were associated more often with thoughts about results. Negative feelings were associated more often with thoughts related to the system, search strategy, and task. Learning styles are also examined as a factor influencing behavior. Engineering graduate students with an assimilating learning style searched longer and paused less than those with a converging learning style. Further exploration of learning styles is suggested.
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems
Authors: P. Morillo, S. Rueda, J. M. Orduna, J. Duato
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Distributed Virtual Environment systems allow multiple users, working on different client computers interconnected through different networks, to interact in a shared virtual world. In these systems, latency is crucial for providing an acceptable quality of service, since it determines how fast client computers are reported about changes in the shared virtual scene produced by other client computers.This paper presents, in a unified manner, a partitioning approach for providing a latency below a threshold to the maximum number of users as possible in Distributed Virtual Environment systems. This partitioning approach searches the assignment of avatars that represents the best trade-off among system latency, system throughput, and partitioning efficiency when solving the partitioning problem. Evaluation results show that the proposed approach not only maximizes system throughput, but it also allows the system to satisfy, if possible, any specific latency requirement needed for providing quality of service. This improvement is achieved without decreasing neither image resolution nor quality of animation, and it can be used together with other techniques already proposed. Therefore, it can contribute to provide quality of service in Distributed Virtual Environments.
Combining Subclassifiers in Text Categorization: A DST-Based Solution and a Case Study
Authors: Kanoksri Sarinnapakorn, Miroslav Kubat
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Text categorization systems often induce document classifiers from pre-classified examples by the use of machine learning techniques. The circumstance that each example-document can belong to many different classes often leads to impractically high computational costs that sometimes grow exponentially in the number of features. Looking for ways to reduce these costs, we explored the possibility of running a ``baseline induction algorithm'' separately for subsets of features, obtaining a set of classifiers to be combined. For the specific case of classifiers that return not only class labels but also confidences in these labels, we investigate here a few alternative fusion techniques, including our own mechanism that was inspired by the Dempster-Shafer Theory. The paper describes the algorithm and, in our specific case study, compares its performance to that of more traditional mechanisms.
The Software Factory
Authors: H. Bratman
Venue: Computer (1975)

This papers describes an effort to develop an integrated set of software development tools to support a disciplined and repeatable approach to software development. This effort, which is really part of a larger program currently underway at System Development Corporation to increase software reliability and control software production costs, is intended to replace what the authors term "ad hoc conglomerations of developmental tools" with standard engineering techniques.
Failsafe Logic Nets
Authors: N. Tokura, T. Kasami, A. Hashimoto
Venue: IEEE Transactions on Computers (1971)

The basic properties and realization of failsafe combinational logic nets and failsafe sequential machines are discussed. The present note concerns totally asymmetric faiiure nets which are composed only of (+) elements and/ or (-) elements, where a (+) element is an asymmetric failure element which never fails to logical zero and a (-) element is defined similarly.
New luxury landscapes: trajectories, clusters and design directions
Authors: Cabirio Cautela, Marco Sammicheli, Francesco Zurlo
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

The aim of the present paper is that of identifying the new current luxury descriptors and the new luxury categories and forms to which different design configurations can be associated (that is the different project forms producing and produced by different luxury aspects) through a developmental and a geo-referred analysis on luxury perception. The evolution of consumption in services, in products and in buying models made new luxury concepts emerge: these concepts cannot be included in a single universal category and it is not even possible to fix one model of luxury design because of the many shapes in which it shows itself. For this reason it appears clearly necessary to search for the new luxury descriptors to which different luxury forms can be associated and to structure new varied project configurations on this basis.
Experience of blended e-learning in post-graduate training for High School Teaching Qualification
Authors: Emanuela Falcinelli, Floriana Falcinelli, Chiara Laici, Alfredo Milani
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The traditional methods and strategies for educational-learning training in universities do not respond to the learning needs of students applying to "Special Training Courses" (Corsi Abilitanti speciali) that are already experienced teachers and workers, and that for various reasons and motivations are not able to attend classroom courses. In this environment, SSIS Umbria (Post-graduate training for high school teaching qualification) is experimenting a form of blended e-learning aimed at supporting classroom lessons, during which a network approach to knowledge and some forms of collaboration and cooperation in know-how building are integrated. Experimentation has proposed integration of on-line activities that students are able to carry out on their own, and other activities to be performed in small learning groups, consistent with the class courses envisaged for teacher training. The experimentation has also allowed to assess, through log analysis, the degree of interest of participants and distribution of their time between the various activities envisaged by the e-learning software. The method for evaluation of participant activities has not been based on a simple recording of the on-line connection time, but rather on the assignation of a previously-set time "token" in minutes to each task performed, according to the commitment forecast for the accomplishment of each single activity. This type of monitoring has been organized by backing up software time-counting of "minute-amounts" coming from on-line practice with tutor control, in order to supervise the respect of an accurate netiquette.
Dielectric constant of barium titanate/cyanoethyl ester of polyvinyl alcohol composite in comparison with the existing theoretical models
Authors: Ravikiran Kota, Ashraf F. Ali, Burtrand I. Lee, Maxim M. Sychov
Venue: Microelectronic Engineering (2007)

A unique method has been introduced to measure the dielectric constant of polymer/ceramic composites using an effective medium instead of using the general methods of preparing bulk sintered pellets or films. In this work, a new and a simple method has been applied to measure the dielectric constant of polyvinyl cyanoethylate/barium titanate composites. The results are obtained by dispersing the ceramic powders in the polymer of a relatively low dielectric constant value. The dielectric constant of the composites is measured with varying ceramic volume percentages. The obtained results are compared with the many available theoretical models that are generally in practice to predict the dielectric constant of the composites. Then these results are extrapolated to comprehend the dielectric constant values of ceramic particles as these values form the base for the design of the composite. The precision and simplicity of the method can be exploited for predictions of the properties of nanostructure ferroelectric polymer/ceramic composites.
Autonomous system for navigation and surveying in underground mines: Field Reports
Authors: Joseph Nsasi Bakambu, Vladimir Polotski
Venue: Journal of Field Robotics (2007)

This paper describes an autonomous platform for navigation and surveying within networks of tunnels, as those typically found in underground mines and caves. In this context, we propose a system allowing two modes of operation: surveying and autonomous navigation mode. In the surveying mode, a remotely located supervisor instructs the platform to move through successive sections of the network, gathering range data that is then concatenated into two- and three-dimensional survey maps of the environment. In navigation mode, the supervisor specifies high-level missions using the previously acquired survey maps. A motion planner then translates each mission into a set of consecutive navigation actions separated by natural landmarks. Mission execution consists of autonomously detecting landmarks, self-localizing, and performing the planned navigation actions. Advanced and innovative features, mostly related to surveying capabilities, navigation mode switcher, and the integrated aspect of our system, distinguish it from navigation systems used in productive mining vehicles described in the literature. The proposed system starts sharing some functionality with robotics systems devoted to exploration of abandoned mines. The full functionality of the navigation&#x002F;surveying system has been proven through a series of on-site experiments in underground mines. &copy; 2007 Wiley Periodicals, Inc.
Toward a Fuzzy Astrophysics Research Resources (FARR)
Authors: Hamed M. Sallam, Ali Hussain Abdullah
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Fuzzy-logic-based technology has proved to address uncertainty in astrophysics fields. It is utilized in many areas, including research and hardware tools. The present paper addresses the need for building Fuzzy Astrophysics Research Resource (FARR) to support the increased fuzzy logic based research in the astrophysics communities. FARR database serves as reservoir for fuzzy functions, values, rules and suggested decisions. The paper's main goal is to enhance the new research trend of using fuzzy-based models in astrophysics research. This paper presents a proof of concept (poc), PHP/C++/ MYSQL fuzzy logic based model application.
An ontology-based taxonomy of bad code smells
Authors: Yung-Pin Cheng, Jiue-Ren Liao
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

"Bad code smell" or "spaghetti code" is a jargon used among programmers to refer to source code that is difficult to maintain, evolve, and change. We consider them as symptoms of poor software engineering practice. This paper presents an application of concept of ontology to develop a bad code smell taxonomy. We develop a taxonomy hierarchy which categorizes bad code smells from the viewpoints of refactoring. A more formal format is introduced to define the bad code smells more concretely. Besides, the relations among bad code smells, called semantic relations in ontology terms, are explored and established. The ontology can be used for reasoning in other applications.
Heuristic learning in recurrent neural fuzzy networks
Authors: Rosangela Ballini, Fernando Gomide
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

A novel recurrent neural fuzzy network is proposed in this paper. The network model is composed by two structures: a fuzzy system and a neural network. The fuzzy system contains fuzzy neurons modeled with the aid of logic and and or operations processed via t-norms and s-norms. The neural network is composed by nonlinear elements placed in series with the previous logical elements. The network model implicitly encodes a set of if-then rules and its recurrent multilayered structure performs fuzzy inference. The topology induces a clear relationship between the network structure and an associated fuzzy rule-based system. In particular we explore this structure with an heuristic learning algorithm based on associative reinforcement learning and gradient search. These learning algorithms are associated to the fuzzy system and neural network, respectively. That is, output layer weights are adjusted via an error gradient method whereas a reward and punishment scheme updates the hidden layer weights. The recurrent fuzzy neural network is particularly suitable to model nonlinear dynamic systems and to learn sequences. Computational experiments with system identification problems show that the fuzzy neural models learned are simpler and that learning is faster than its counterparts.
Building Software Product Line from the Legacy Systems "Experience in the Digital Audio and Video Domain"
Authors: Kangtae Kim, Hyungrok Kim, Woomok Kim
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Most embedded software in the consumer electronics is generally developed through derivation from legacy software. Many new projects are derived from preexisting ones, through modification of functionality, optimization of performance and application new features. Particularly in the digital AV (Audio & Video) domain, the rise of "digital convergence' has lead to a need for the functionality of products to be integrated and unified across different products. In this situation, a product line approach might be more efficient and effective rather than a product-oriented approach. The characteristics of this environment make the product line approach ideal for the digital AV domain.
Evolutionary consequences of coevolving targets
Authors: Ludo Pagie, Paulien Hogeweg
Venue: Evolutionary Computation (1997)

Most evolutionary optimization models incorporate a fitness evaluation that is based on a predefined static set of test cases or problems. In the natural evolutionary process, selection is of course not based on a static fitness evaluation. Organisms do not have to combat every existing disease during their lifespan; organisms of one species may live in different or changing environments; different species coevolve. This leads to the question of how information is integrated over many generations. This study focuses on the effects of different fitness evaluation schemes on the types of genotypes and phenotypes that evolve. The evolutionary target is a simple numerical function. The genetic representation is in the form of a program (i.e., a functional representation, as in genetic programming). Many different programs can code for the same numerical function. In other words, there is a many-to-one mapping between “genotypes” (the programs) and “phenotypes”. We compare fitness evaluation based on a large static set of problems and fitness evaluation based on small coevolving sets of problems. In the latter model very little information is presented to the evolving programs regarding the evolutionary target per evolutionary time step. In other words, the fitness evaluation is very sparse. Nevertheless the model produces correct solutions to the complete evolutionary target in about half of the simulations. The complete evaluation model, on the other hand, does not find correct solutions to the target in any of the simulations. More important, we find that sparse evaluated programs are better generalizable compared to the complete evaluated programs when they are evaluated on a much denser set of problems. In addition, the two evaluation schemes lead to programs that differ with respect to mutational stability; sparse evaluated programs are less stable than complete evaluated programs.
Traveling Salesman Problem Based on DNA Computing
Authors: Yan Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Molecular programming is applied to traveling salesman problem whose solution requires encoding of real values in DNA strands. This paper introduces a new DNA encoding method to represent numerical values. DNA strands are designed to encode real values by variation of their temperatures. According to the characteristics of the problem, a DNA algorithm solving the traveling salesman problem is given. The effectiveness of the proposed method is verified by simulation.
Equalized interconnects for on-chip networks: modeling and optimization framework
Authors: Byungsub Kim, Vladimir Stojanović
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper presents a modeling framework for fast design space exploration and optimization of equalized on-chip interconnects. The exploration is enabled by cross-layer modeling that connects the transistor and wire parameters to link performance, equalization coefficients, and architecture-friendly metrics (delay, energy-per-bit, and throughput density). Appropriate models are derived to speed-up the search by more than two orders of magnitude and make a million point design space searchable in less than two hours on a standard machine. With this approach we are able to find the best link design for target throughput, power and area constraints, thus enabling the architectural optimization of energy-efficient on-chip networks. For the same latency and throughput density, equalized interconnects optimized using the new methodology have up to 10x better energy-efficiency than optimized repeater interconnects.
Special Feature: An Easy-to-Use Graph Drawing Package
Authors: J. Butland
Venue: Computer (1980)

With suitable software, some graphics applications can be brought within reach of general computer users who have specific graphical requirements. One such package is SIMPLEPLOT.