ppxscal/embedding_network huggingface dataset:
Choledochol cyst: an automated preliminary detection system using MRCP images
Authors: Rajasvaran Logeswaran
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Cystic disease of the biliary duct is usually diagnosed by a specialist through examination of Magnetic Resonance Cholangiopancreatography (MRCP) images. However, due to the nature and flexible acquisition orientations of the MRCP, automated detection has thus far been unsuccessful. This paper attempts to use visually-oriented features to conduct automated preliminary diagnosis of the choledochol cyst in the central bile duct (CBD) of the liver, with the intention of highlighting the images in which the occurrence of the disease is suspected, for more detailed analysis by the specialists. The methodology and results of successful implementation of the proposed choledochol cyst detection system for MRCP is presented in this paper. The system's ability for preliminary automatic classification of MRCP images enables the further development of computer-aided diagnosis systems for MRCP.
A unified and discriminative model for query refinement
Authors: Jiafeng Guo, Gu Xu, Hang Li, Xueqi Cheng
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typically includes a number of tasks such as spelling error correction, word splitting, word merging, phrase segmentation, word stemming, and acronym expansion. In previous research, such tasks were addressed separately or through employing generative models. This paper proposes employing a unified and discriminative model for query refinement. Specifically, it proposes a Conditional Random Field (CRF) model suitable for the problem, referred to as Conditional Random Field for Query Refinement (CRF-QR). Given a sequence of query words, CRF-QR predicts a sequence of refined query words as well as corresponding refinement operations. In that sense, CRF-QR differs greatly from conventional CRF models. Two types of CRF-QR models, namely a basic model and an extended model are introduced. One merit of employing CRF-QR is that different refinement tasks can be performed simultaneously and thus the accuracy of refinement can be enhanced. Furthermore, the advantages of discriminative models over generative models can be fully leveraged. Experimental results demonstrate that CRF-QR can significantly outperform baseline methods. Furthermore, when CRF-QR is used in web search, a significant improvement of relevance can be obtained.
A SiGe heterostructure bipolar transistor for high voltage power switching applications
Authors: Gagan Khanduri, Brishbhan Panwar
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Study and analysis of a proposed high-voltage high current switching n+-p-n silicon germanium single-heterojunction bipolar transistor (SHBT) is performed using 2D MEDICI device simulator. A theoretical formulation is provided to substantiate the simulation results obtained regarding quasi-saturation phenomenon in bipolar transistors. Comparison with the conventional high-voltage current switching silicon BJT predicts a significant improvement of 53% in the quasi-saturation current density limit for the proposed SiGe SHBT structure at a saturation voltage drop of 0.5 volts.
An integrated nonlinear placement framework with congestion and porosity aware buffer planning
Authors: Tung-Chieh Chen, Ashutosh Chakraborty, David Z. Pan
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Due to skewed scaling of interconnect versus cell delay in deep submicron CMOS, modern VLSI timing closure requires extensive buffer insertion. Inserting a large number of buffers may cause not only dramatic cell migration but also routing hotspots. If buffering is not controlled well, it may fail to close a design. Placement with buffer porosity (i.e., cell density) awareness can allocate space for inserting these buffers, and buffering with congestion awareness can improve the routability. Therefore, there is essential need for a placement framework with explicit porosity and congestion control. In this paper, we propose the first integrated nonlinear placement framework with porosity and congestion aware buffer planning. We demonstrate the integration of increasingly refined cell porosity and routing congestion aware buffer planning and insertion methodology in a high quality nonlinear placer. Our experiments show the improvement of average routing overflow by 69%, average wirelength by 28% and average buffer count by 40%, compared with the traditional placement framework without buffer planning.
Strategy Description and Modelling for Multi-agent Systems (Invited Paper)
Authors: Václav Snáel
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The field of robot soccer provides numerous opportunities for the application of AI methods for game strategy development. Robot soccer is a part of standard applications of distributed system control in real time. The software part of a distributed control system is realized by decision making and executive agents. The algorithm of agents’ cooperation was proposed with the control agent on a higher level. The algorithms for agents realized in robots are the same. Real-time dynamic simple strategy description and strategy learning possibility based on game observation is important for discovering opponents strategies and searching for tactical group movements, simulation and synthesis of suitable counter-strategies. For the improvement of game strategy, we are developing an abstract description of the game and propose ways to use this description (e.g. for learning rules and adapting team strategies to every single opponent).
ATBaM: An Arnold Transform Based Method on Watermarking Relational Data
Authors: Chaokun Wang, Jianmin Wang, Ming Zhou, Guisheng Chen, Deyi Li
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

ATBaM, A novel numeric relational data watermarking method, is presented in this paper. ATBaM substantially improves watermark security by using image scrambling technology which could confuse the well-regulated watermarking information and diffuse errors. Theoretical analysis proves the correctness and security of ATBaM. Also, experimental results show the strong robustness of ATBaM.
Thermal challenges deriving from the advances of display technologies
Authors: S. Kubota, A. Taguchi, K. Yazawa
Venue: Microelectronics Journal (2008)

After a brief overview on development history of solid-state light sources, an light emitting diodes (LED)-backlit liquid crystal display television (LCD-TV) and a diffractive micro-electro-mechanical-system (MEMS) (GxL) laser projector are characterized for key performance indicators for their light sources, with highlight on thermal noise caused by Brownian motion of GxL ribbons. Then, we will propose a solution for thermal challenges in such a flat panel display using light sources with moderate power dissipation density, followed by discussion on necessity of advanced thermal spreader in cooling lasers with extremely high power dissipation density.
Investigating Secure Framework for Hybrid Multipath Ad Hoc Network
Authors: Binod Vaidya, Byung-Lok Cho, JongAn Park, SeungJo Han
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In recent years, with ubiquitous computing, the interconnection of MANET to Internet is getting more attention. Further, as use of multipath ad hoc routing protocols is favorable in many application, hybrid multipath MANET, which is a MANET with multiple routes to the Internet, will also grow. Security issues in hybrid MANET, however, is still challenging task. This paper addresses security issues related to Internet connectivity and ad hoc routing. And we propose a secure framework for global connectivity for connected multipath MANET. Security and performance analysis show that the proposed framework is effective.
Protein Classification by Matching 3D Structures
Authors: Slobodan Kalajdziski, Georgina Mirceva, Kire Trivodaliev, Danco Davcev
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In this paper, a 3D structure-based approach is presented for the efficient classification of protein molecules. The method relies on the geometric 3D structure of the proteins. After proper positioning of the 3D structures, the Spherical Trace Transform is applied to them to produce geometry -based descriptors, which are completely rotation invariant. Additionally, some biological properties of the protein are taken, and added to the geometry-based descriptor, thus forming better integrated descriptor. We have used nearest neighbour classification on the previously extracted descriptors. A part of the FSSP/DALI database, was used to evaluate the classification accuracy of this system. The results show that this method achieves more than 92 percent classification accuracy while it is simpler and faster than the DALI method. We provide some experimental results of the implemented system.
Quantifying requirements volatility effects
Authors: G. P. Kulk, C. Verhoef
Venue: Science of Computer Programming (2008)

In an organization operating in the bancassurance sector we identified a low-risk IT subportfolio of 84 IT projects comprising together 16,500 function points, each project varying in size and duration, for which we were able to quantify its requirements volatility. This representative portfolio stems from a much larger portfolio of IT projects. We calculated the volatility from the function point countings that were available to us. These figures were aggregated into a requirements volatility benchmark. We found that maximum requirements volatility rates depend on size and duration, which refutes currently known industrial averages. For instance, a monthly growth rate of 5% is considered a critical failure factor, but in our low-risk portfolio we found more than 21% of successful projects with a volatility larger than 5%. We proposed a mathematical model taking size and duration into account that provides a maximum healthy volatility rate that is more in line with the reality of low-risk IT portfolios. Based on the model, we proposed a tolerance factor expressing the maximal volatility tolerance for a project or portfolio. For a low-risk portfolio its empirically found tolerance is apparently acceptable, and values exceeding this tolerance are used to trigger IT decision makers. We derived two volatility ratios from this model, the @p-ratio and the @r-ratio. These ratios express how close the volatility of a project has approached the danger zone when requirements volatility reaches a critical failure rate. The volatility data of a governmental IT portfolio were juxtaposed to our bancassurance benchmark, immediately exposing a problematic project, which was corroborated by its actual failure. When function points are less common, e.g. in the embedded industry, we used daily source code size measures and illustrated how to govern the volatility of a software product line of a hardware manufacturer. With the three real-world portfolios we illustrated that our results serve the purpose of an early warning system for projects that are bound to fail due to excessive volatility. Moreover, we developed essential requirements volatility metrics that belong on an IT governance dashboard and presented such a volatility dashboard.
From MEMS devices to smart integrated systems
Authors: O. Soeraasen, J. E. Ramstad
Venue: Microsystem Technologies (2008)

The smart integrated systems of tomorrow would demand a combination of micromechanical components and traditional electronics. On-chip solutions will be the ultimate goal. One way of making such systems is to implement the mechanical parts in an ordinary CMOS process. This procedure has been used to design an oscillator consisting of a resonating cantilever beam and a CMOS Pierce feedback amplifier. The resonating frequency is changed if the beam is bent by external forces. The paper describes central features of this procedure and highlights the design considerations for the CMOS-MEMS oscillator. The circuit is used as an example of a &#x201c;VLSI designer&#x201d; way of making future integrated micromechanical and microelectronic systems on-chip. The possibility for expansion to larger systems is reviewed.
Promoting developer-specific awareness
Authors: Reid Holmes, Robert J. Walker
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

Maintaining a developer's awareness of changes in the software on which she depends is challenging. Awareness is often impeded at two ends of the spectrum: a lack of information, when the changes only become apparent when a build breaks or bugs appear; or an excess of information, where the changes are announced but the majority of the changes are not relevant to the developer in her particular project and context. In the middle ground lies the possibility of support for developer-specific awareness (DSA), wherein information about the changes is filtered on the basis of the developer's own code and interests. This paper discusses how the DSA problem is manifested in software development and briefly examines the design space involved in providing DSA notifications. A particular point in the space is proposed for a target implementation, called the YooHoo awareness system, that will help developers in loose organizations to keep apprised of any code changes that are specifically relevant to the source code for which they are responsible.
802.11n: the new wave in WLAN technology
Authors: Abdulrahman Yarali, Babak Ahsant
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

This paper presents an overview of the new IEEE 802.11n standard which is the first wireless LAN standard based on MIMO-OFDM (Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing). The Paper describes how MIMO-OFDM technology delivers significant performance improvements for wireless LANs. It presents the simulation results reflecting throughput for different antenna combination for 20 MHz and 40 MHz. The paper also explains the benefits of this new 802.11n technology, how it works, and how manufacturers and end-users can profit from its use. 802.11n and other high data rate technologies such as Ultra Wideband (UWB) are compared.
Automatic analysis of speedup of MPI applications
Authors: Marc Casas, Rosa Badia, Jesús Labarta
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

The intricacy of high performance computing applications has been growing very fast in the last years. Only skilled analysts are able to determine the factors that are undermining the performance of up-to-date applications. Analyst time is a very expensive resource and, for that reason, a strong effort to develop automatic performance analysis methodologies has been made by the scientific community. In this paper, we propose a methodology that is able to automatically detect the main performance problems of applications. This methodology is based on, first, a size reduction of the performance data obtained from the executions and, second, an analytical model obtained from this performance data which fits the speedup of the applications in terms of several parameters related to several performance issues. The paper also shows results obtained from real up-to-date applications and validates the conclusions automatically derived from the methodology.
Local reasoning about a copying garbage collector
Authors: Noah Torp-Smith, Lars Birkedal, John C. Reynolds
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

We present a programming language, model, and logic appropriate for implementing and reasoning about a memory management system. We state semantically what is meant by correctness of a copying garbage collector, and employ a variant of the novel separation logics to formally specify partial correctness of Cheney's copying garbage collector in our program logic. Finally, we prove that our implementation of Cheney's algorithm meets its specification using the logic we have given and auxiliary variables.
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
Authors: Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call, and discover some meaningful information from the unorganized system call sequences. We design a weighted suffix tree algorithm which derives from the concept of suffix tree algorithm for string matching, which then allows to mine the frequent episodes in order to get ordered frequent patterns. We therefore apply these rules to detect malicious attacks, and it shows our IDS still has a good ability to detect intrusion when we use fewer rules.
Autonomic-Oriented Architecture for an Intelligent Handover Management Scheme
Authors: Meriem Kassar, Brigitte Kervella, Guy Pujolle
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In the new area of heterogeneous wireless environments, roaming users with multi-interface mobile terminals should benefit from the best connectivity to services anytime and anywhere. To reach this goal, a handover management solutionis needed. In this paper, we propose a mobile centered scheme in order to bring intelligence and autonomicity aspects. Our scheme is based on an autonomic-oriented architecture which is able to adapt dynamically to environment changes. It contains three main planes : the Knowledge, the Piloting and the Control planes. The knowledge is defined as the context environment (access network availability, mobile’s movement, QoS parameters, user preferences, etc.). The piloting system, driven by the knowledge, provides flexibility and efficiency thanks to advanced decision algorithms and policies governing the whole decision process. Thus, the appropriate control mechanism (i.e. the target access network) is selected while satisfying user and system requirements and ensuring service continuity for the demanding service.
Mathematical Description of Biological Structures and Mechanisms
Authors: H. Joel Jeffrey
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

A new formalism and approach to describing cellular and molecular processes and structures is introduced, designed to support the creation of knowledge bases of molecular and cellular mechanisms, structures, and states in which all structural information about the entities, at all levels of detail, is represented formally. Structure is formalized via specification of n-ary relationships, as in mathematical logic. New mathematical formulations of complexity and structural similarity are introduced, that take into account differences in composition and structure at all levels of detail and apply equally to structures, mechanisms, and states. A recursive formula for calculation of structural similarity is derived. The formalism and the mathematical similarity definition enable several new mathematical and computational capabilities, such as searching a knowledge bank for processes or structures similar to a specified one or with specified structural or compositional deviations.
Support vector machines for interval discriminant analysis
Authors: C. Angulo, D. Anguita, L. Gonzalez-Abril, J. A. Ortega
Venue: Neurocomputing (2008)

The use of data represented by intervals can be caused by imprecision in the input information, incompleteness in patterns, discretization procedures, prior knowledge insertion or speed-up learning. All the existing support vector machine (SVM) approaches working on interval data use local kernels based on a certain distance between intervals, either by combining the interval distance with a kernel or by explicitly defining an interval kernel. This article introduces a new procedure for the linearly separable case, derived from convex optimization theory, inserting information directly into the standard SVM in the form of intervals, without taking any particular distance into consideration.
Optimization in multi-scale segmentation of high-resolution satellite images for artificial feature recognition
Authors: J. Tian, D. -M. Chen
Venue: International Journal of Remote Sensing (2007)

Multi-resolution segmentation, as one of the most popular approaches in object-oriented image segmentation, has been greatly enabled by the advent of the commercial software, eCognition. However, the application of multi-resolution segmentation still poses problems, especially in its operational aspects. This paper addresses the issue of optimization of the algorithm-associated parameters in multi-resolution segmentation. A framework starting with the definition of meaningful objects is proposed to find optimal segmentations for a given feature type. The proposed framework was tested to segment three exemplary artificial feature types (sports fields, roads, and residential buildings) in IKONOS multi-spectral images, based on a sampling scheme of all the parameters required by the algorithm. Results show that the feature-type-oriented segmentation evaluation provides an insight to the decision-making process in choosing appropriate parameters towards a high-quality segmentation. By adopting these feature-type-based optimal parameters, multi-resolution segmentation is able to produce objects of desired form to represent artificial features.
Fundamental Data Retention Limits in SRAM Standby Experimental Results
Authors: Animesh Kumar, Huifang Qin, Prakash Ishwar, Jan Rabaey, Kannan Ramchandran
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

SRAM leakage power dominates the total power of low duty-cycle applications, e.g., sensor nodes. Accordingly, leakage power reduction during data-retention in SRAM standby is often addressed by reducing the supply voltage. Each SRAM cell has a minimum supply voltage parameter called the data-retention voltage (DRV), above which the stored bit can be retained reliably. The DRV exhibits significant intra-chip variation in the deep sub-micron era. As supply voltage is lowered, leakage power reduces, but a larger fraction of SRAM cells is prone to retention failures. Use of appropriate error-correction to mitigate cell-reliability is proposed. Using this approach, the standby supply voltage is selected to minimize leakage power per useful bit. The fundamental limits on the leakage power per useful bit, while taking the DRV distribution into account, are established. Minimization of power per bit results in a supply-voltage at which a small fraction of cells fail to retain the data. For experimental DRV-distributions, a [31, 26, 3] Hamming code based implementation achieves a significant portion of the leakage power reduction compared to the fundamental limit. These analytical results are verified by twenty-four experimental chips manufactured in an industrial 90nm CMOS process.