ppxscal/embedding_network huggingface dataset:
A New and Effective Image Retrieval Method Based on Combined Features
Authors: Pengyu Liu, Kebin Jia, Zhuozheng Wang, Zhuoyi Lv
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In CBIR (Content-based Image Retrieval), image has various inherent features which reflect its content such as color, texture, shape, spatial relationship features etc. How to organize and utilize these features effectively and improve the retrieval performance is a valuable research topic. One of the key issues in image retrieval based on combined features is how to assign weight to different features. An image retrieval method combined color and texture features is proposed in this paper. According to image texture characteristic, a kind of image feature statistic is defined. By using feature weight assignment operators designed here, the method can assign weight to color and texture features according to image content adaptively and realize image retrieval based on combined image features. The experiment results show that this method is more efficiently than those traditional CBIR methods based on single visual feature or simple linear combined low-level visual features of fixed weight.
Discovering Dressing Knowledge for an Intelligent Dressing Advising System
Authors: Ching-I Cheng, Damon Shing-Min Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Our research aims to develop a system to help women choose correct attire for attending a specific occasion using all of what have already been in their closets. Many different computer theories and techniques are gathered in the project. Category learning with supervised neural networking is applied to cluster garments into different impression groups. Fuzzy theories are applied for gathering fashion match rules. In addition, modeling and virtual dressing techniques are used for representing matched garments pair in digital show room. User can simply submit her queries to the system on the occasions when the user has trouble finding an outfit for a special event. After enquiries are received, the core is following fuzzy logic rules to search good matches in the garment database and showing the matched results in the show room. This paper focuses on how garment classification and matching rules retrieved from fashion stylists.
MUMS-A Reconfigurable Microprocessor Architecture
Authors: M. Faiman
Venue: Computer (1977)

The would-be microprocessor user is currently confronted with a large and increasing number of different devices, each characterized by a unique architecture, instruction set, and hardware conventions, and provided with a varying, usually small degree of software support. Consequently, microprocessor systems reflect to a major extent the hardware and software idiosyncracies of the specific microprocessor(s) they incorporate; any attempt to replace a microprocessor with a newer or improved type, however inexpensive, entails a major system redesign. The work described in this article-MUMS, for Modular-Unified-Microprocessor-System-is an ongoing research project to overcome these limitations, having a modular, standardized, and versatile structure that is nevertheless commensurate with the low cost of the microprocessors themselves. Basic to this idea is a relatively simple micro-bus (the MUMS bus) that carries generic signals only, and over which a microprocessor communicates with its environment. Each microprocessor and all other modules, whether memory or I/O devices, connect to the MUMS bus through simple interfaces that standardize to the bus protocol. Simplicity is retained by having one microprocessor per MUMS bus, but flexibility is provided by allowing for MUMS busses to connect through a communications unit for the purpose of interprocessor communication or shared resources, or both. By this technique MUMS can be used in a standalone configuration or in conjunction with other processors. The insertion of a new nicroprocessor requires only one new MUMS bus interface and an associated software utility package in a ROM module; the rest of the system is unmodified.
Image Segmentation with Multi-Scale GVF Snake Model Based on B-Spline Wavelet
Authors: Zhang Jun, Liu Jun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

GVF snake model is insensitive to its initialization and can move into concave boundaries in image segmentation, however, it is expensive in computation and sensitive to noise. An image was decomposed to multi-scale images after the wavelet transform, then noise could be distinguished from signal by their different singularities in different resolution. In lower resolution, there were less wavelet coefficients, so the multi-scale GVF snake was easy to deform to the contour with less computation and robust to noise. In higher resolution, using initial contour yielded in the lower resolutions, the multi-scale GVF snake could get a finer result besides saving much more computation. The 3-order spline function was used as B-spline wavelet to implement the multi-scale transform. Experiments on MRI images show that the multi-scale GVF snake model is more quickly and more robust than GVF snake model.
Video Data Conversion and Real-Time Tracking
Authors: A. L. Gilbert
Venue: Computer (1981)

Recent developments in pattern recognition and image processing are bringing about a new generation of real-time trackers. The RTV system described here is an example.
Traffic Control System on the Hanshin Expressway
Authors: T. Hasegawa
Venue: Computer (1972)

The Hanshin Expressway Public Corporation, Osaka, Japan has been operating its traffic control system since the beginning of EXPO '70, that is, March 15, 1970 on its entire expressway systems in Osaka and Kobe. The total length of the Hanshin Expressway is now 79.6 KM and is expected to become 128 KM by 1975. This report presents some features of the control system with emphasis on its hardware system. This system at present has a digital computer, FACOM 270-30, with 65 KW core memory, various peripherals, more than 200 detectors, more than 70 variable information indication devices along the expressway and TV monitoring systems. The control system on Hanshin Expressway is designed to permit future expansions and modifications. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Adaptive Optical Proximity Correction Using an Optimization Method
Authors: Tetsuaki Matsunawa, Hirokazu Nosato, Hidenori Sakanashi, Masahiro Murakawa, Eiichi Takahashi, Tsuneo Terasawa, Toshihiko Tanaka, Osamu Suga, Tetsuya Higuchi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper proposes a new approach to the optical prox- imity correction (OPC) method which reduces OPC calcu- lation loads by employing an optimization method. OPC is a method of correcting for a mask pattern to improve the fidelity of an image pattern on a silicon wafer. How- ever, conventional OPC calculations have become increas- ingly complex as the size of semiconductor devices becomes even smaller. In order to overcome this problem, we pro- pose an adaptive OPC technology using an optimization method to realize OPC for the full-chip area at fast opera- tional speeds. The effectiveness of this approach in terms of reduced OPC calculation times and highly-accurate correc- tion is demonstrated through computational experiments.
Hierarchical video patching with optimal server bandwidth
Authors: Helmut Hlavacs, Shelley Buchinger
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

Video patching is a way for transporting true video-on-demand, that is, instantaneous without any delay, from a video server to several clients. Instead of sending a unique stream to each newly arriving client, clients share as many multicast transmissions as possible, and are serviced only those parts of the video that they have missed. We present a novel video patching scheme using hierarchies of patches. Our scheme minimizes the bandwidth needed by the video server, and may result in the fact that clients receive several streams in parallel. We show analytically that for Poisson arrival our algorithm achieves the optimal possible server bandwidth for all schemes where clients share multicast transmissions. We also show, how our approach can be combined with batching. This combination requires less server bandwidth than all fixed start point periodic broadcast algorithms.
An SQL-based cost-effective inventory optimization solution
Authors: K. Katircioglu, T. M. Brown, M. Asghar
Venue: IBM Journal of Research and Development (2007)

Successful implementation of an inventory, optimization solution requires significant effort and can pose certain risks to companies implementing such solutions. Depending on the complexity of the requirements, the solution may also involve a substantial IT investment. In this paper, we present a cost-effective solution for inventory optimization that can be useful for small and medium-sized businesses with limited IT budgets. This solution can be implemented on any application platform that is capable of processing basic SQLTM (Structured Query Language) commands. The solution eliminates the need to purchase additional software and has a framework in which sales data in an Enterprise Resource Planning (ERP) system are accessed, demand statistics based on this data are generated along with other key parameters, and optimal inventory policies, such as those involving safety stocks and lot sizes, are calculated and reported.
A novel scheme for domain-transfer problem in the context of sentiment analysis
Authors: Songbo Tan, Gaowei Wu, Huifeng Tang, Xueqi Cheng
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In this work, we attempt to tackle domain-transfer problem by combining old-domain labeled examples with new-domain unlabeled ones. The basic idea is to use old-domain-trained classifier to label some informative unlabeled examples in new domain, and retrain the base classifier over these selected examples. The experimental results demonstrate that proposed scheme can significantly boost the accuracy of the base sentiment classifier on new domain.
Identifying Traceability between Feature Model and Software Architecture in Software Product Line using Formal Concept Analysis
Authors: Tonny Kurniadi Satyananda, Danhyung Lee, Sungwon Kang, Sajid Ibrahim Hashmi
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Feature models have been used to support requirements analysis and domain engineering in Software Product Line. By identifying the mapping between feature model and architecture model by capturing the relationships among elements in the models, we can establish the traceability between the two models. The identified traceability can be used to verify consistency between feature model and architecture model. On small scale models, the relationships among elements can be easily identified by manually analyzing the descriptions of models. But when the complexity of a model is high, a more formal approach will be useful to help identifying the traceability. In this paper, we develop an approach to identify traceability between feature model and component and connector view of software architecture using Formal Concept Analysis (FCA) technique. This technique constructs a concept lattice structure. We propose several analysis criteria for concept lattice structure to identify traceability between the two models.
A Method to Solve Group Decision-Making Problem with Multi-granularity Linguistic Assessment Information
Authors: Yang Liu, Zhi-Ping Fan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The purpose of this paper is to study group decision- making problem with multi-granularity linguistic assessment information. Presently, decision-making methods based on linguistic assessment information are massed in single-granularity linguistic assessment information. Owing to the different cultural and educational backgrounds of experts, multi-granularity linguistic assessment information is provided by different experts, methods for group decision-making with single- granularity linguistic assessment information are inadequate in real-life situation. In this paper the rating of each alternative and the weight of each criterion are described by multi-granularity linguistic assessment information which can expressed in triangular fuzzy numbers. According to the distance of two triangular fuzzy number matrixes, a closeness coefficient is defined to determine the ranking orders of all alternatives by calculating the distances to both the positive-ideal matrix and the negative-ideal matrix simultaneously. Finally, an example is shown to highlight the procedure of the proposed method at the end of this paper.
Information Security: End User Behavior and Corporate Culture
Authors: Steven Woodhouse
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Information is the life blood of all modern organizations yet the news media continue to report stories of critical information loss. The purpose of information security is to protect valuable assets, such as information, hardware, software and people. The majority of information security specialists believe that promoting good end user behavior and constraining bad end user behavior is an important component of an effective Information Security Management System (ISMS). Implementing effective information security involves understanding security-related risk, then developing and implementing appropriate controls. In general the better employees are at applying the controls the more secure the organization will be, because even the best designed technical controls and procedures will be of limited value if the staff involved do not understand why they have been implemented and what they are accomplishing. Achieving the required level of understanding usually requires more than an annual awareness training initiative and represents a major challenge for most organizations. In fact, for many organizations it will involve a cultural change to ensure the integration of information security concepts into the organizational culture.
A Domain Specific Language for Securing Distributed Systems
Authors: Hedi Hamdi, Mohamed Mosbah, Adel Bouhoula
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Distributed applications are becoming increasingly common. However, incorporating security in them remains a major challenge. There are currently few choices to express and enforce security in distributed systems. We can either use a special-purpose language which may be too limited to express security requirements, or use a general purpose language that provides the ability to make complicated security policy but makes us reimplement infrastructure code for authorization, interdiction, obligation and so on with each new security policy. In this paper, we introduce a domain-specific language approach that takes the middle road, giving a way to reuse security infrastructure for new policies while also allowing the expression of complicated security policy easily. We present our DSL approach and and apply it to a real-world scenario: specification and implementation of security policy.
Evaluating the adoption potential of design science efforts: The case of APSARA
Authors: Sandeep Purao, Veda C. Storey
Venue: Decision Support Systems (2008)

Improving information systems design outcomes requires not only innovations in tools and methodologies, which are design science efforts, but also willingness on the part of potential developers to incorporate these innovations into their design practice. This is particularly true for reuse-based design, because of developers' reluctance to stray from their established modes of work. This research argues that the technology acceptance model (TAM) may be used to assess whether potential systems developers will adopt IT innovations that facilitate reuse-based conceptual design. We use the core technology-acceptance model to assess intent to use, based on the constructs of 'ease of use' and 'usefulness'. One additional construct, compatibility, ensures that a key obstacle, minimizing changes to current design practice, is accounted for. We use a concrete instance of a previously proposed reuse-based design approach, APSARA, implemented in a prototype, as the basis for the study. The results indicate that significant contributors to the developers' willingness to adopt reuse-based design approaches include compatibility with current practice and ease of use of the reuse-based design approach. We discuss implications of these findings for using tools such as APSARA, and for the use of TAM as an evaluation mechanism for design science research efforts.
Data Flow Supercomputers
Authors: J. B. Dennis
Venue: Computer (1980)

Programmability with increased performance? New strategies to attain this goal include two approaches to data flow architecture: data flow multiprocessors and the cell block architecture.
Multiscale Joint Segmentation and Registration of Image Morphology
Authors: Marc Droske, Martin Rumpf
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Multimodal image registration significantly benefits from previous denoising and structure segmentation and vice versa. In particular combined information of different image modalities makes segmentation significantly more robust. Indeed, fundamental tasks in image processing are highly interdependent. A variational approach is presented, which combines the detection of corresponding edges, an edge preserving denoising and the morphological registration via a non-rigid deformation for a pair of images with structural correspondence. The morphology of an image function is split into a singular part consisting of the edge set and a regular part represented by the field of normals on the ensemble of level sets. A Mumford-Shah type free discontinuity problem is applied to treat the singular morphology and the matching of corresponding edges under the deformation. The matching of the regular morphology is quantified by a second contribution which compares deformed normals and normals at deformed positions. Finally, a nonlinear elastic energy controls the deformation itself and ensures smoothness and injectivity. A multi scale approach that is based on a phase field approximation leads to an effective and efficient algorithm. Numerical experiments underline the robustness of the presented approach and show applications on medical images.
Consolidating Web Application Server Farms with Redundant Webinterfaces
Authors: MinHwak Ok, Yang-Soo Lee, Sun-Ho Hong
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Computing resources of both hardware and software tends to be located at a certain place, as most professional software supplied by a computing Grid demands powerful computing hardware. The computing Grid in this paper provides work processing with legacy professional software, without any modification or adaptation of the software. The simplified computing Grid model consolidates server farms with multiple Web service providers. A client may access the computing Grid through redundant Web interfaces and experience faster Web interface. The computing Grid would not become inaccessible until all the coordinators crashed down.
On-Chip Cache Device Scaling Limits and Effective Fault Repair Techniques in Future Nanoscale Technology
Authors: David Roberts, Nam Sung Kim, Trevor Mudge
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this study, we investigate different cache fault tolerance techniques to determine which will be most effective when on-chip memory cell defect probabilities exceed those of current technologies, which is highly anticipated in processor on-chip caches manufactured with future nanometer scale technologies. Our most significant finding from this study is that the devices in on-chip memory cells cannot be scaled at the same rate as devices in logic circuits due to the increasing number of erroneous memory cells with voltage scaling, requiring strong fault-tolerance techniques. Second, we propose a technique to minimize performance impacts under aggressive technology and voltage scaling. It works by merging pairs of faulty cache lines to make good lines and performs better than TMR at high error rates and at lower cost. We also estimate up to 28% energy savings at low voltage, relative to a recent fault-tolerance scheme.
Mutation analysis for Lustre programs: Fault model description and validation
Authors: Lydie du Bousquet, Michel Delaunay
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Mutation analysis is usually used to provide an indication of the fault detection ability of a test set. It is mainly used for unit testing evaluation, but has also been extended for integration testing evaluation. This paper describes adaptation of mutation analysis to the LUSTRE programming language, including both unit and integration testing. This paper focuses on the fault model, which has been extended since our previous works. Validation of the fault model is presented.
2007 Special Issue: Hierarchical approaches to understanding consciousness
Authors: L. Andrew Coward, Ron Sun
Venue: Neural Networks (2007)

There has been much discussion on what a scientific theory of consciousness would look like, and even whether such a theory is possible. Some common misunderstandings of the nature of theories (e.g., in the physical sciences) have confused the discussion of theories concerning consciousness. Theories in the physical sciences establish hierarchies of descriptions that relate high-level descriptions of macro-level phenomena to detailed-level descriptions at a micro level. Detailed descriptions are usually more accurate but information-dense and therefore often beyond human comprehensibility (unless limited to tiny segments of a macro-level phenomenon). High-level descriptions are usually much less information-dense but more approximate. The ability to map between levels of description, and in particular the understanding of when a shift from a higher-level to a more detailed description is needed to achieve a desired degree of accuracy, is fundamental to an effective theory in any field. The form of such a theory of consciousness is sketched, and the limitations of some alternative approaches described.
Average-Case Analysis for Special Cases of Online Bahncard Problem
Authors: Chunlin Xin, Weimin Ma, Fanglei Yi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The special Bahncard problem is a generalization of the Ski-Rental problem. In this paper, average-case competi- tive analysis which integrates probability distribution into pure competitive analysis is employed to restudy this prob- lem. Theoretical and numerical results show that the per- formance measure of competitive analysis can be dramat- ically improved. Moreover, we study the special Bahncard problem with interest rate which should be considered in any reasonable financial model. The optimal deterministic competitive ratio is obtained and the competitive ratio C(k) decreases with the interest rate i.