ppxscal/embedding_network huggingface dataset:
A cheap technical solution for cranioplasty treatments
Authors: L. C. Hieu, J. Vander Sloten, E. Bohez, H. N. Phien, E. Vatcharaporn, P. V. An, N. C. To, P. H. Binh
Venue: Technology and Health Care (2004)

Skull defects are treated by cranioplasty techniques, which are required to protect underlying brain, correct major aesthetic deformities, or both. This research is a part of our research project in ASEAN countries to investigate (i) the methods for design and manufacturing of cranioplasty implants, and (ii) the feasible technical solutions of minimizing the implant cost based on available production and biomaterial technologies in the region. In this paper, solutions for design and manufacturing of standardized implant templates (SDT) are presented. SDT are made based on the reverse engineering and rapid tooling techniques. With the use of SDT, surgeons have flexible options in preparing the implant both pre and intra operatively, and the operation time is minimized. In addition, the skills required to prepare an implant from SDT are not highly required. The cost for cranioplasty treatments by using SDT is acceptable for ASEAN region.
An Algorithm for Constrained Maximization of the Trace of a Matrix
Authors: H. K. Ramapriyan
Venue: IEEE Transactions on Computers (1977)

The "trace" of a rectangular matrix is defined as the trace of a square matrix obtained by appending null rows (or columns) at the bottom (or right) end. The problem of maximizing the trace of a matrix, by permutations and mergers of rows and columns with constraints on the resulting size of the matrix, is of interest in comparison of maps and image-change detection. This correspondence presents an algorithm based on dynamic propramming for efficient maximization of trace.
Matching Secrets in the Absence of a Continuously Available Trusted Authority
Authors: C. Meadows
Venue: IEEE Transactions on Software Engineering (1987)

The problem of authentication of mutually suspicious parties is one that is becoming more and more important with the proliferation of distributed systems. In this paper we describe a protocol, based on the difficulty of finding discrete logarithms over finite fields, by which users can verify whether they have matching credentials without revealing their credentials to each other unless there is a match. This protocol requires a trusted third party, but does not require it to be available to the users except when they sign up for the system. Thus it is useful in situations in which a trusted third party exists but is not available to all users at all times.
Reasoning with Contextual Data in Telehealth Applications
Authors: Nadjia Kara, O. Andrei Dragoi
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

in the area of mobile-health application designed to assist patients outside a hospital and medical professionals within a hospital. Such ubiquitous computing applications go beyond simple biomedical data-collection so the management of the context becomes more challenging, and the complexity of the context-based decision-algorithms warrants the use of full-blown inference engines. The context is a very volatile notion, so building a context-aware system means more than just creating a context ontology and defining inference rules for that model. This paper proposes mechanisms to dynamically manage the contextual decisions and actions. It devises a model and its properties for the process of taking each individual context-based decision. An architecture centered around this model is defined, integrating an off-the-shelf inference engine that reasons on context-data expressed in the OWL language. The architecture was refined and validated through the im- plementation of a prototype remote biomonitoring system. The prototype combines context-adaptation and awareness with the ubiquity of 3G network-coverage to allow for more personalized monitoring and better streamlining of information between the various health care players. It can be easily adapted and extended with extra inference-rules, additional actions, and more context items. Index Terms-- Context-awareness, ubiquitous computing, biomonitoring, telehealth, OWL, 3G cellular networks.
Comparison and Evaluation of Clone Detection Tools
Authors: Stefan Bellon Rainer Koschke, Giulio Antoniol, Jens Krinke, Ettore Merlo
Venue: IEEE Transactions on Software Engineering (2007)

Many techniques for detecting duplicated source code (software clones) have been proposed in the past. However, it is not yet clear how these techniques compare in terms of recall and precision as well as space and time requirements. This paper presents an experiment that evaluates six clone detectors based on eight large C and Java programs (altogether almost 850 KLOC). Their clone candidates were evaluated by one of the authors as independent third party. The selected techniques cover the whole spectrum of the state-of-the-art in clone detection. The techniques work on text, lexical and syntactic information, software metrics, and program dependency graphs.
Description templates for agent-oriented patterns
Authors: Ayodele Oluyomi, Shanika Karunasekera, Leon Sterling
Venue: Journal of Systems and Software (2008)

A number of agent-oriented patterns have been proposed to share agent-oriented software engineering experiences. However, most of the existing descriptions of these patterns are incomprehensive or inconsistent with descriptions of similar patterns by other authors. We seek to improve the communication and comprehension of agent-oriented patterns by improving their descriptions. This paper presents a pattern template structure for defining agent-oriented pattern templates. We used the template structure to define eight agent-oriented pattern templates. We describe the elements of these eight templates. We illustrate the expressiveness of these templates by using three of them to describe three existing agent-oriented patterns.
Location Aware Route Maintenance Protocols for the Mobile Bluetooth Radio Networks
Authors: Prasan Kumar Sahoo, Chih-Yung Chang, Sheng-Wen Chang
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Bluetooth is a low-cost, low-power and short range communication technology, which operates in 2.4 GHz ISM band. The important research issues in Bluetooth are scatternet formation and routing, since nodes can arrive and depart at arbitrary time. In this paper, novel route maintenance algorithms are proposed for the Bluetooth scatternet that supports mobility of the nodes. Our protocols guarantee the connectivity among nodes and reconstruct the routes dynamically by taking their location information. Besides, we propose how to reduce the number of hops and to form the shortest route between the source and the destination due to addition of nodes. Performance analysis of our work shows that it outperforms in terms of end to end transmission delay, bandwidth consumption and route maintenance as compared to similar Bluetooth routing protocols.
Fuzzy logic applications in learning digital control systems
Authors: Bernd-Markus Pfeiffer
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

Different fuzzy logic approaches are applied for speed control of a 1.44 kW cooling blast engine. Selftuning of a classical PI controller by fuzzy rules provides the most simple solution. Higher control performance across the whole working range of this nonlinear process can only be achieved by using some knowledge about process behaviour. These informations in the form of a qualitative dynamic fuzzy model can be obtained from measured input/output data by fuzzy identification. The learning CoS (Center of Singletons) fuzzy system performing this identification is shown to be mathematically equivalent to a neural network with radial basis functions and is therefore called a &ldquo;neuro=fuzzy-structure&rdquo;. Finally three different approaches for synthesis of a nonlinear control law are compared with respect to performance and design effort&colon; imitation of human operators by fuzzy rules, imitation of classical controllers by fuzzy rules and fuzzy feedforward adaptation as qualitative feedback linearization.
A Control Circuit Synthesis Method for Asynchronous Circuits in Bundled-Data Implementation
Authors: Takao Konishi, Naohiro Hamada, Hiroshi Saito
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper proposes a control circuit synthesis method for asynchronous circuits in bundled-data implementation. Our proposed method consists of the synthesis of a con- trol circuit to control a data-path circuit and the synthesis of an interface circuit between the control circuit and the data-path circuit. The control circuit is generated by map- ping small control elements called Q-elements. For map- ping, this paper proposes two mapping methods called the state-oriented mapping method and the node-oriented map- ping method. Finally, this paper shows the effectiveness of the proposed method by comparing synthesized circuits with ones obtained by a different control circuit synthesis method.
A Direct/indirect Visibility of Objects in Three Dimensional Space by Ray Tracing
Authors: Mitsunori Makino, Tsuyoshi Furuhata
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, a definition of visibility of objects will be proposed for generalized 3D art gallery problem, to which the ray tracing algorithm is introduced. The proposed visibility provides level of direct/indirect surveillance from single/multiple viewpoints such as cameras and/or guards, which takes 3D location, mirroring/transmitting, dust effect and obstruction into account. Also a prototype of interactive visualization system will be shown, which makes us easily understand the situation through displaying both the visibility and a CG scene from any viewpoint.
A Novel Technique to Create Energy-Efficient Contexts for Reconfigurable Logic
Authors: Hiroshi Shinohara, Hideaki Monji, Masahiro Iida, Toshinori Sueyoshi
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

High power consumption is a constraining factor for the growth of programmable logic devices. We propose two techniques in order to reduce power consumption. The first is a technique for creating contexts. This technique uses data-dependent circuits and wire sharing between contexts. The second is a technique for switching the contexts. In this paper, we evaluate the capability of the two techniques to reduce power consumption using a multi-context logic device. As a result, as compared with the original circuit, our multi-context circuits can reduce the power consumption by 9.1% on an average and by a maximum of 19.0%. Furthermore, applying our resource sharing technique to these circuits, we achieved a reduction of 10.6% on an average and a maximum reduction of 18.8%.
Comparison of the decision tree, artificial neural network, and linear regression methods based on the number and types of independent variables and sample size
Authors: Yong Soo Kim
Venue: Expert Systems with Applications: An International Journal (2008)

In this article, the performance of data mining and statistical techniques was empirically compared while varying the number of independent variables, the types of independent variables, the number of classes of the independent variables, and the sample size. Our study employed 60 simulated examples, with artificial neural networks and decision trees as the data mining techniques, and linear regression as the statistical method. In the performance study, we use the RMSE value as the metric and come up with some additional findings: (i) for continuous independent variables, a statistical technique (i.e., linear regression) was superior to data mining (i.e., decision tree and artificial neural network) regardless of the number of variables and the sample size; (ii) for continuous and categorical independent variables, linear regression was best when the number of categorical variables was one, while the artificial neural network was superior when the number of categorical variables was two or more; (iii) the artificial neural network performance improved faster than that of the other methods as the number of classes of categorical variable increased.
Delay-dependent criteria for robust stability of linear neutral systems with time-varying delay and nonlinear perturbations
Authors: Bin Yang, Jincheng Wang, Xuejun Pan, Chongquan Zhong
Venue: International Journal of Systems Science (2007)

This article investigates the robust stability of linear neutral systems with time-varying delay and nonlinear perturbations. Using a new Lyapunov-Krasovskii functional and employing some free weighting matrices, less conservative delay-dependent robust stability conditions for such systems in terms of linear matrix inequalities are derived. Numerical examples are given to indicate significant improvements over some existing results.
Advanced Ajax: Architecture and Best Practices
Authors: Shawn M. Lauriat
Venue:  (2007)

“I very much enjoyed how this book covers the full Ajax application lifecycle and not only coding techniques. Anyone who is looking to become a professional front-end developer will appreciate the architectural insight and best practices delivered by this book.”ï¾ ï¾ - Andi Gutmans, Co-Founder & Co-Chief Technology Officer of Zend TechnologiesMission-Critical Ajax: Maximizing Scalability, Performance, Security, Reliability, and MaintainabilityAdvanced Ajax: Architecture and Best Practices is the definitive guide to building business-critical, production-quality Web applications with Ajax. Shawn M. Lauriat systematically addresses the design, architecture, and development issues associated with Ajax, offering proven patterns and robust code examples available in no other book. You'll find best practices for addressing the full spectrum of issues enterprise Ajax developers face: scalability, performance, security, reliability, flexibility, maintainability, and reusability.Writing for experienced Web developers, Lauriat delivers fresh ideas and elegant solutions: meaty technical content, presented with exceptional clarity. Among the many topics he covers in unprecedented depth: cleanly implementing JavaScript custom events to reduce coupling and to enhance flexibility; overcoming Ajax's traditional accessibility limitations; reducing network latency through compression and other techniques; and much more. Coverage includesï¾ Planning Ajax interfaces for simplicity, clarity, and intuitiveness Creating scalable, maintainable architectures for client-side JavaScript Using the latest tools to profile, validate, and debug client-side code Architecting the server side for security and functionality, while restricting loaded data, objects, and actions to current requests Protecting against the most widespread and significant Ajax security risks Optimizing every component of an Ajax application, from server-side scripts to database interactions Introducing cutting-edge Ajax: game development, Ajax with canvas, and Ajax for enterprise applications About the Web SiteThis book's companion Web site (http://advancedajax.frozen-o.com) doesn't just provide all the code: It shows code examples in action, as building blocks of a real Web application interface.
Generating FPGA-Accelerated DFT Libraries
Authors: Paolo D'Alberto, Peter A. Milder, Aliaksei Sandryhaila, Franz Franchetti, James C. Hoe, Jose M. F. Moura, Markus Puschel
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

We present a domain-specific approach to generate high-performance hardware-software partitioned implementations of the discrete Fourier transform (DFT) in fixed point precision. The partitioning strategy is a heuristic based on the DFT's divide-and-conquer algorithmic structure and fine tuned by the feedback-driven exploration of candidate designs. We have integrated this approach in the Spiral linear-transform code-generation framework to support push-button automatic implementation. We present evaluations of hardware-software DFT implementations running on the embedded PowerPC processor and the reconfigurable fabric of the Xilinx Virtex-II Pro FPGA. In our experiments, the 1D and 2D DFT's FPGA-accelerated libraries exhibit between 2 and 7.5 times higher performance (operations per second) and up to 2.5 times better energy efficiency (operations per Joule) than the software-only version.
A Practical Digital Watermarking Protocol Based On PKI-CA
Authors: Xiaosu Chen, Dali Zhu, Jian Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Digital watermarking is the key technology of digital copyright protection. An efficient digital watermarking solution must tackle the problems of copyright protection and trace of pirate copy. Several famous digital protocols are analyzed, and deficiencies are pointed out. On this basis, a practical digital watermarking protocol based on PKI-CA is proposed. The protocol can be integrated into PKI-CA seamlessly, uses the security functions of PKI-CA, and deploy digital watermarking infrastructure on the basis. The design of the protocol borrows ideas from trade model and fingerprint application model of reality, and the execution procedure reminds users of the trade in the reality. The protocol has better security property and higher efficiency.
Advances in Microcomputer Development Systems
Authors: L. Krummel
Venue: Computer (1977)

The advent of the microprocessor has enabled designers to prove that they can now perform the same tasks previously accomplished with TTL or minicomputers but at the same time achieve much greater product complexity. Thus, results are not simply products that replace old ones with greater cost effectiveness, but ones which incorporate a magnitude of new features. The next generations of product design after the conversion to microprocessors will be characterized largely by a mastery of reconfiguration of memory and peripherals. However, a key problem that will remain in configuring microcomputer systems is the generation of microcomputer software and, in particular, its integration with the microcomputer hardware. Designers of first-generation microprocessor systems were often disturbed by their inability to significantly reduce the design and development time and indeed the cost of the product. The microprocessor-based system design learning curve was at least as steep as that of TTL design. The microprocessor represents a new logic family which requires new tools for development, because both hardware and software are required simultaneously for generation of the logic.
Multi-rada Data Fusion Algorithm Based on K-Central Clustering
Authors: Hongping Shu, Yunfeng Wang, Jianmin Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper studied the discrimination of the different kind goal observation data using the k-central clustering method, and realized to the multi-objectives real-time track through the kind of data fusion. The basic thought, Cluster treating processes and the algorithm realization of the observation data k-central clustering are studied. Filter Equations for maneuvering target tracking are described; Parameter matrix theory for the Simplified calculation and corresponding initial value are given in air traffic control system. The discovery which the k-central clustering be able to discriminate different goal well, and after clustering the kind to carry on the track fusion to be more accurate are found. The simulation result indicated that, the filter track trace is good after the k-central clustering.
A Performance Evaluation Methodology in Virtual Environments
Authors: Jiyong Jang, Saeyoung Han, Jinseok Kim, Sungyong Park, Seungjo Bae, Young Choon Woo
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

System virtualization come into the spotlight again with the emerging Virtual Machine(VM) technologies (e.g., Par- allels, VMware and Xen). With these market trends toward virtual environments, many research groups are developing evaluation tools to check the performance of virtual systems and their overheads. However, the performance charac- terization in virtual environments has not been established yet for many challenging issues. In this paper, we catego- rize four virtualization models for characterizing the per- formance of virtual environments and present an efficient evalution methodology to compare the performance of vir- tualized versus non-virtualized systems.
Studying the separability relation between finite state machines
Authors: Natalia Spitsyna, Khaled El-Fakih, Nina Yevtushenko
Venue: Software Testing, Verification Reliability (2007)

Several authors have studied the relationships between non-deterministic finite state machines (FSMs). These relationships can be used, for example, for deriving conformance tests from specifications represented by FSMs. In this paper, the separability relation between FSMs is studied. In particular, an algorithm is presented that derives a shortest separating sequence of two non-deterministic FSMs. Given FSMs S with n states and T with m states, it is shown that the upper bound on the length of a shortest separating sequence is 2mn-1. Moreover, the upper bound is shown to be reachable. However, according to the conducted experiments, on average, the length of a shortest separating sequence of FSMs S and T states is less than mn and the existence of a separating sequence significantly depends on the number of non-deterministic transitions in these FSMs. The proposed algorithm can also be used for deriving a separating sequence of two different states of a single FSM or for deriving a separating sequence of three or more FSMs. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Task Allocation in Distributed Data Processing
Authors: W. W. Chu
Venue: Computer (1980)

Load balancing increases throughput but creates interprocessor overhead. This research suggests that a programming approach is the task allocation strategy most likely to balance these conflicting factors.
Sequential Document Visualization
Authors: Yi Mao, Joshua Dillon, Guy Lebanon
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Documents and other categorical valued time series are often characterized by the frequencies of short range sequential patterns such as n-grams. This representation converts sequential data of varying lengths to high dimensional histogram vectors which are easily modeled by standard statistical models. Unfortunately, the histogram representation ignores most of the medium and long range sequential dependencies making it unsuitable for visualizing sequential data. We present a novel framework for sequential visualization of discrete categorical time series based on the idea of local statistical modeling. The framework embeds categorical time series as smooth curves in the multinomial simplex summarizing the progression of sequential trends. We discuss several visualization techniques based on the above framework and demonstrate their usefulness for document visualization.
On network-on-chip comparison
Authors: Erno Salminen, Ari Kulmala, Timo D. Hamalainen
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper presents the state-of-the-art in the field of network-on-chip (NoC) benchmarking and comparison. The study identifies the mainstream approaches, how NoCs are currently evaluated, and shows which aspects have been covered and those needing more research effort. No single article can cover all the aspects, and therefore, possibility to compare results from various sources must be ensured by proper scientific reporting. Basic guidelines for achieving that are given.