ppxscal/embedding_network huggingface dataset:
An FPGA-based CollisionWarning System Using Hybrid Approach
Authors: Haichao Liang, Takashi Morie, Youhei Suzuki, Kazuki Nakada, Tsutomu Miki, Hatsuo Hayashi
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

In this paper, we propose an FPGA-based collision warning system for advanced automobile driver assistance systems or autonomous moving robots. The system consists of three function blocks: coarse edge detection using a resistive-fuse network, moving-object detection inspired by neuronal propagation in the hippocampus, and danger evaluation and collision warning using fuzzy inference. The first two functions are implemented in FPGAs. The system can detect moving objects with a speed range of 3-192 km/h with a sampling period of 30 ms for an input image of 320 × 256 pixels, and can output a warning against dangerous regions in the input image.
A Web Services Composition With Well Structured
Authors: Jiuyun Xu, Changbao Li, Youxiang Duan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper proposes a web services composition approach. Using this approach, the composition planner can deal with succession, conjunction and exclusion control structures. Moreover, the composition plan is dead lock free and can terminate normally (which is defined as well structured). In this paper, along with a declarative definition of basic concepts and description of candidate web services, the composition approach gives an algorithm to generate the composition plan and an aggregation of control structures among the candidate web services. Furthermore, the case study illustrates that the composition plan using proposed approach is dead lock free and can terminate normally.
An Enhanced Shim6 Address Switching Method
Authors: Lizhong Xie, Ping Hu
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In recent times, the layer 3 shim6 approach has become the most promising multihoming approach in the viewpoint of the IETF. How to switch to another address-pair in case of failure of current using address-pair is a very important problem of shim6, which is achieved by REAP (REAchability Protocol) protocol in shim6 specification. However, in REAP, the address switching time may increase exponentially. This paper proposes a refined shim6 address switching method which can maintain the address switching time at 10s exactly. This paper presents the algorithm design and evaluates its effectiveness by simulation experiments.
Multi-Concept Multi-Modality Active Learning for Interactive Video Annotation
Authors: Meng Wang, Xian-Sheng Hua, Yan Song, Jinhui Tang, Li-Rong Dai
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Active learning methods have been widely applied to reduce human labeling effort in multimedia annotation tasks. However, in traditional methods multiple concepts are usually sequentially annotated, i.e., each concept is exhaustively annotated before proceeding to the next, without taking the learnabilities of different concepts into consideration. Furthermore, in most of these methods only a single modality is applied. This paper presents a novel multiconcept multi-modality active learning method which exchangeably annotates multiple concepts in the context of multi-modality. It iteratively selects a concept and a batch of unlabeled samples, and then these samples are annotated with the selected concept. After that, a graph-based semi-supervised learning is conducted on each modality for the selected concept. The proposed method takes into account both the learnabilities of different concepts and the potentials of different modalities. Experimental results on TRECVID 2005 benchmark have demonstrated its effectiveness and efficiency.
A Neural Network Based Approach to Knowledge Acquirement in Conceptual Design of Mechanical Derive
Authors: Ruifeng Bo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Selecting an appropriate drive type that meets design requirements depends on a large amount of experiential knowledge in conceptual design of mechanical drive, whereas the complexity of conceptual design results in a great difficulty existing in knowledge acquirement. To tackle it, a BP network based approach to knowledge acquirement is proposed, in which a binary coding method is used to structure learning samples to accumulate expert knowledge, and through training this constructed network using these samples, the knowledge related with mechanical drive is acquired and expressed with the trained weight and threshold matrix. This paper provides a promising approach to deal with the bottleneck problem in knowledge acquirement of intelligent design system. Under this approach, the automation of knowledge acquirement is effectively solved and in a sense, this trained network can be used as a knowledge base of expert system to facilitate the design process of mechanical drive.
Understanding collaborative filtering parameters for personalized recommendations in e-commerce
Authors: Hong Joo Lee, Jong Woo Kim, Sung Joo Park
Venue: Electronic Commerce Research (2007)

Collaborative Filtering (CF) is a popular method for personalizing product recommendations for e-Commerce and customer relationship management (CRM). CF utilizes the explicit or implicit product evaluation ratings of customers to develop personalized recommendations. However, there has been no in-depth investigation of the parameters of CF in relation to the number of ratings on the part of an individual customer and the total number of ratings for an item. We empirically investigated the relationships between these two parameters and CF performance, using two publicly available data sets, EachMovie and MovieLens. We conducted three experiments. The first two investigated the relationship between a particular customer's number of ratings and CF recommendation performance. The third experiment evaluated the relationship between the total number of ratings for a particular item and CF recommendation performance. We found that there are ratings thresholds below which recommendation performance increases monotonically, i.e., when the numbers of customer and item ratings are below threshold levels, CF recommendation performance is affected. In addition, once rating numbers surpass threshold levels, the value of each rating decreases. These results may facilitate operational decisions when applying CF in practice.
Managing the false alarms: A framework for assurance and verification of surveillance monitoring
Authors: Peter Goldschmidt
Venue: Information Systems Frontiers (2007)

This article discusses methods to support assurance of surveillance monitoring and compliance verification knowledge management (CV-KM). The discussion includes aspects of primary monitoring systems, the different environments in which they operate, the verification problem solving and decision making tasks, the problem structure, and the coordination of the review process to facilitate truth maintenance and regulatory Meta rules. Based on the ALCOD (Alert Coding) prototype developed with the Surveillance Division of the Australian Stock Exchange (ASX), the surveillance operation is considered a primary monitoring function with the analysis of the resulting output the second-tier monitoring function--the assurance component.
Proactive attentive support system
Authors: Johan de Heer, Sorin M. Iacob, Alfons H. Salden, Wouter B. Teeuw
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

In this paper we describe our endeavour of developing a Proactive Attentive Support System (PASS). We explain that PASS is bio-inspired and can be grounded on mathematical physics. We demonstrate its successful applicability in the video surveillance domain.
Publisher-side Event Filtering for QoS-Awareness in Ubiquitous Computing
Authors: Kyu Bong Cho, Sung Keun Song, Hee Yong Youn
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In the ubiquitous computing environment a user may interact with a large number of devices. The publish/subscribe paradigm is suitable for the various applications by allowing the subscribers to declare their interests and receive only the notifications of interest. This paper propose a novel event filtering approach preventing waste in the space of the event queue of the event channel due to unwanted events and reducing the network load. Performance evaluation reveals that the proposed scheme displays significant improvement over the existing event service, Java messaging service (JMS) and Omnievent service in terms of event delivery time for various numbers of servers and data sizes.
Computer-Aided Study of Literary Language
Authors: D. Ross
Venue: Computer (1978)

Work in artificial intelligence and the speed and flexibility of electronic storage offer potential solutions to the special problems encountered in describing the language of literature. 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
Physically realistic motion synthesis in animation
Authors: J. Thomas Ngo, Joe Marks
Venue: Evolutionary Computation (1993)

Motion-synthesis problems arise in the creation of physically realistic animations involving autonomous characters. Trpically characters are required to perform goal tasks, subject to physical law and other constraints on their motion. Witkin and Kass (1988) dubbed this class of problems “Spacetime Constraints“ (SC) and presented results for specific problems involving an articulated figure. Their approach was based on a procedure for the local optimization of an initial approximate trajectory supplied by the user. Unfortunately, SC problems are typically multimodal and discontinuous, and the number of decision alternatives available at each time step can be exponential in the number of degrees of freedom in the system. Thus, constructing even coarse trajectories for subsequent optimization can be difficult. We present an algorithm that constructs such trajectories de novo, without directive input from the user. Rather than use a time-series representation, which might be appropriate for local optimization, our algorithm uses a stimulus-response model. Locomotive skills appropriate for the given articulated figure are acquired through repeated testing of (simulated) reality. Our initial implementation, which chooses stimulus-response parameters using a parallel genetic algorithm, succeeds in finding good, novel solutions for a test suite of SC problems involving unbranched 2-D linkages.
Identifying location in indonesian documents for geographic information retrieval
Authors: Mirna Adriani, Monica Lestari Paramita
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

Our research focuses on Geographic Information Retrieval for Indonesian documents. We constructed a Geographical Gazeeter for geographic locations based on information that we collected from the Geographic resources. We used the table to identify the locations of events that are mentioned in the documents. We added a location index associated with each document. We also identified the possible locations based on words that indicate the relative position to locations mentioned in the queries. The result of our experiments showed that the location index and the processing of words indicating relative positions improved the retrieval performance of natural language queries. Applying the query expansion techniques by adding keywords and locations from the documents to the queries resulted in significant performance improvement.
SVM-based Fingerprint Classification Using Orientation Field
Authors: Luping Ji, Zhang Yi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper presents a classification method of fingerprint using orientation field and support vector machines. It estimates orientation field through pixel gradient, then calculates the percentages of the directional block classes. These percentages are combined as a four dimensional vector, by which the trained hierarchical classifier classifies the fingerprint into one of the six classes it belongs to. Experiments show that this method has high classification accuracy as well as low computational time cost.
An Adaptive Cache Coherence Protocol Optimized for Producer-Consumer Sharing
Authors: Liqun Cheng, John B. Carter, Donglai Dai
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Shared memory multiprocessors play an increasingly important role in enterprise and scientific computing facilities. Remote misses limit the performance ofshared memory applications, and their significance is growing as network latency increases relative to processor speeds. This paper proposes two mechanisms that improve shared memory performance by eliminating remote misses and/or reducing the amount of communication required to maintain coherence. We focus on improving the performance of applications that exhibit producer-consumer sharing. We first present a simple hardware mechanism for detecting producer-consumer sharing. We then describe a directory delegation mechanism whereby the "home node" of a cache line can be delegated to a producer node, thereby converting 3-hop coherence operations into 2-hop operations. We then extend the delegation mechanism to support speculative updates for data accessed in a producer-consumer pattern, which can convert 2-hop misses into local misses, thereby eliminating the remote memory latency. Both mechanisms can be implemented without changes to the processor We evaluate our directory delegation and speculative update mechanisms on seven benchmark programs that exhibit producer-consumer sharing using a cycle-accurate execution-driven simulator of a future 16-node SGI multiprocessor We find that the mechanisms proposed in this paper reduce the av average remote miss rate by 40%, reduce network traffic by 15%, and improve performance by 21%. Finally, we use Murphi to verify that each mechanism is error-free and does not violate sequential consistency.
The adoption of eCommerce communications and applications technologies in small businesses in New Zealand
Authors: Nabeel Al-Qirim
Venue: Electronic Commerce Research and Applications (2007)

This research investigates the impact of 10 factors, extended from the technological innovation literature, on the adoption of different eCommerce communications and applications technologies (EC) in small businesses (SMEs) in New Zealand (NZ). The research results showed that the CEO's innovativeness was the only determinant of external-email adoption. CEO's involvement was found to be the only determinant of Intranet adoption. Relative advantage and competition were found to influence Extranet/VPN adoption significantly and positively. However, support from technology vendors appeared to violate its hypothesised effect on Extranet/VPN adoption. Regression analysis found that pressure from suppliers was the only determinant of Internet-EDI adoption. The adoption of Web sites was influenced by the information intensity of products and the CEO's innovativeness. The significant factors suggested the uniqueness of the adoption phenomenon in SMEs in NZ. However, the factors that appeared to be significant and the ones that appeared to be insignificant factors and the implications arising from these factors led to a conclusion which suggested the weakness of the EC adoption phenomenon in SMEs in NZ. The research discusses theoretical implications emerging from the research factors and portrays a path for future research.
A Genetic-Algorithm-Based Routing Optimization Scheme for Overlay Network
Authors: Jun Lu, Wengang Cheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents a multiple-objective routing optimization scheme based on Genetic Algorithm (GA) methodology to the metric tradeoff optimization problem between two routing metric cost (delay and bandwidth) in overlay network. Besides an effective tradeoff routing feature, the scheme applies genetic-crossover to the local-search operations in the optimized iterative course for better performance. Simulation experiments demonstrate, compared with non-GA algorithm, the scheme achieves mainly about 2.17%~ 11.76% optimal gains.
A New Performance Evaluation Model and AHP-Based Analysis Method in Service-Oriented Workflow
Authors: Bo Liu, Yushun Fan
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In Service-Oriented Architecture, services and workflows are closely related so that the research on service-oriented workflow attracts the attention of academia. Because of the loosely-coupled, autonomic and dynamic nature of service, the operation and performance evaluation of workflow meet some challenges, such as how to judge the quality of service (QoS) and what is the relation between QoS and workflow performance. In this paper we are going to address these challenges. First the definition of service is proposed, and the characteristics and operation mechanism of service-oriented workflow are presented. Then a service-oriented workflow performance evaluation model is described which combines the performance of the business system and IT system. The key performance indicators (KPI) are also depicted with their formal representation. Finally the improved Analytic Hierarchy Process is brought forward to analyze the correlation between different KPIs and select services.
Ntjfsat¬: a novel method for query with not-predicates on xml data
Authors: Vahid Garakani, Sayyed Kamyar Izadi, Mostafa Haghjoo, Mohammad Harizi
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Previous researches, in the filed of XML databases, have been done to evaluate XML queries with AND-branches. However, as far as we know, very little work has examined the efficient processing of XML queries with NOT-predicates. Also these methods have to process all of the query nodes in the document when dealing with queries with NOT-branch. In this paper, with some modification in TJFast method, we propose a new manner for answering to various NOT-queries. This method processes nodes efficiently, in a way that in the ideal state, we obtain part of the answer after the process of each node, and we don't have any unreasonable processing of each node.
Upward separations and weaker hypotheses in resource-bounded measure
Authors: Ryan C. Harkins, John M. Hitchcock
Venue: Theoretical Computer Science (2007)

We consider resource-bounded measure in double-exponential-time complexity classes. In contrast to complexity class separation translating downwards, we show that measure separation translates upwards. For example, @m"p(NP)0@?@m"e"x"p(NEXP)
A Data Placement Scheme with Time-Related Model for P2P Storages
Authors: Jing Tian, Zhi Yang, Yafei Dai
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods are two key design choices. Prior work has used the random placement and steady-state availability analysis model widely. We find this approach has two drawbacks: (1) it ignores the timerelated property and greatly underestimates data availability in the short term and (2) it ignores differences in peers' availability and uses a mean value, which also leads to the underestimation of data availability. Both of these drawbacks influence the efficiency of storage and bandwidth resource usage. Also, this approach can not ensure all the objects achieve their expected availability due to the second drawback. This paper develops a different data placement scheme called similar-MTTF-MTTR placement, which takes into consideration differences in pees' dynamic characteristics. Under this scheme, this paper also presents a fine-gained analysis model for short-term data availability calculation. As a result, our scheme improves the efficiency of data maintaining significantly. We validate this by comparing with random placement under three different dynamic environments: a wide-area system (PlanetLab), a corporative environment (desktop personal computers at Microsoft Corporation), and a file-sharing system (Maze). The results show that our scheme can save the storage resource 1usage significantly under all environments.
Spare Parts in Analog Circuits: a Filter Example
Authors: Erik Schuler, Adao Junior Antonio de Souza, Luigi Carro
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Spare parts technique has been widely used in digital designs. As memory cells are more susceptible to defects and faults than logic cells, redundancy has been extensively used for enhancing defect and fault tolerance through repair by spare replacement. The technique also aims yield increase, and points to be a very good solution since density integration gets ever higher. In this work, we propose the use of spare parts to develop reliable analog circuits, thus increasing fault tolerance by choosing among many identical blocks, the best ones that will compose the circuit. An example using a mixed-signal FIR filter is presented, showing that the technique can easily be adapted to help increase yield of analog circuits, too.
Demand forecasting of high-speed Internet access service considering unknown time-varying covariates
Authors: So Young Sohn, Yoonseong Kim, Ho Young Hwang
Venue: Computers and Industrial Engineering (2008)

In order to forecast the demand for information and communication services, it is important to consider not only intrinsic variables representing service characteristics but also unknown time-varying variables such as marketing policy. However, in many cases, information such as a company's internal marketing policy is not available. This study proposes a negative exponential growth curve model that incorporates unobservable time-varying covariates by reversely estimating the unknown covariates. The proposed approach is then applied to technological forecasting of high-speed Internet access services provided by a telecommunication corporation in Korea.
MOSFET modeling for 45nm and beyond
Authors: Yu Cao, Colin McAndrew
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Compact MOSFET models are a critical link between technology and design. The inexorable reduction in supply voltage and geometry to 45nm and below adds or emphasizes physical effects not important in the past, and so continues to expand the requirements for MOSFET models. At and below 45nm, process variations, reliability, proximity effects, high-k gate materials, and non-classical device structures all challenge modeling. This tutorial presents fundamentals and evolution of compact MOSFET models, and techniques to address the new challenges.