ppxscal/embedding_network huggingface dataset:
A large-scale behavior corpus including multi-angle video data for observing infants' long-term developmental processes
Authors: Shinya Kiriyama, Goh Yamamoto, Naofumi Otani, Shogo Ishikawa, Yoichi Takebayashi
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

We have developed a method for multimodal observation of infant development. In order to analyze development of problem solving skills by observing scenes of task achievement or communication with others, we have introduced a method for extracting detailed behavioral features expressed by gestures or eyes. We have realized an environment for recording behavior of the same infants continuously as multi-angle video. The environment has evolved into a practical infrastructure through the following four steps; (1) Establish an infant school and study the camera arrangement. (2) Obtain participants in the school who agree with the project purpose and start to hold regular classes. (3) Begin to construct a multimodal infant behavior corpus with considering observation methods. (4) Practice development process analyses using the corpus. We have constructed a support tool for observing a huge amount of video data which increases with age. The system has contributed to enrich the corpus with annotations from multimodal viewpoints about infant development. With a focus on the demonstrative expression as a fundamental human behavior, we have extracted 240 scenes from the video during 10 months and observed them. The analysis results have revealed interesting findings about the developmental changes in infants' gestures and eyes, and indicated the effectiveness of the proposed observation method.
Compromised Resources Allocation Model for Emergency Response
Authors: Susheng Wang, Yan Wang, Jian Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Under the constraint of resources requirement, a compromised resources allocation model for emergency response and a negotiation strategy as a fast access between resource suppliers and requesters are mainly discussed in this paper. According to the characteristics of continuous emergency problem, the mathematical model is presented to help solve the large-scale public emergency difficulties. Finally, a case study is carried on to prove the algorithm effective.
Shrinkage structure in biased regression
Authors: Pierre Druilhet, Alain Mom
Venue: Journal of Multivariate Analysis (2008)

Biased regression is an alternative to ordinary least squares (OLS) regression, especially when explanatory variables are highly correlated. In this paper, we examine the geometrical structure of the shrinkage factors of biased estimators. We show that, in most cases, shrinkage factors cannot belong to [0,1] in all directions. We also compare the shrinkage factors of ridge regression (RR), principal component regression (PCR) and partial least-squares regression (PLSR) in the orthogonal directions obtained by the signal-to-noise ratio (SNR) algorithm. In these directions, we find that PLSR and RR behave well, whereas shrinkage factors of PCR have an erratic behaviour.
Virtual organization security policies: An ontology-based integration approach
Authors: Saravanan Muthaiyah, Larry Kerschberg
Venue: Information Systems Frontiers (2007)

This paper addresses the specification of a security policy ontology framework to mediate security policies between virtual organizations (VO) and real organizations (RO). The goal is to develop a common domain model for security policy via semantic mapping. This mitigates interoperability problems that exist due to heterogeneity in security policy data among various (VO) and (RO) in the semantic web. We propose to carry out integration or mapping for only one aspect of security policy, which is authorization policy. Other aspects such as integrity, repudiation and confidentiality will be addressed in future work. We employ various tools such as Protégé, RacerPro and PROMPT to show proof of concept.
A Similarity Measure between Type-2 Fuzzy Sets with Its Application to Clustering
Authors: Der-Chen Lin, Miin-Shen Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper we propose a new similarity mea- sure between type-2 fuzzy sets with its property. We also combine the proposed similarity mea- sures with Yang and Shih's algorithm as a clus- tering method for type-2 fuzzy data. According to different -level, these clustering results con- sist of a usefully hierarchical tree.
A system for locating mobile terminals with tunable privacy
Authors: Sandford Bessler
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2007)

A number of approaches for capturing and processing location information of mobile users have been proposed in the past; however, only with the latest advances in the handset technology, a terminal-based positioning approach, using overlay SIP signaling on top of a packet switched bearer and area notification as basic functionality becomes feasible for mass applications. Especially in electronic commerce scenarios, in which users often interact with non-trusted services and shops, any location-based solution has to consider privacy aspects as well. The terminal-centric model presented in the paper leads to a simple and efficient way to achieve tunable privacy: mobile users define own "zones" and selectively disclose them to their buddies and to external services. As a result, localization can be performed only in the allowed places and by the allowed watchers, both parameters being configured by the user herself on her mobile terminal. We describe the system architecture, protocols and present representative technical scenarios.
Code Compilation for an Explicitly Parallel Register-Sharing Architecture
Authors: Alex Gontmakher, Avi Mendelson, Assaf Schuster, Gregory Shklover
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Code generation for a multithreaded register sharing architecture is inherently complex and involves some issues absent in conventional code compilation. To approach the problem, we define a consistency contract between the program and the hardware and require the compiler to preserve the contract during code transformations. To apply the contract to compiler implementation, we develop a correctness framework that ensures preservation of the contract and use it to adjust the code optimizations for correctness under parallel code. One area that is naturally affected by register sharing is register allocation. We discuss adaptation of existing coloring-based algorithms for shared code and show how they benefit from the consistency contract. Another benefit affects the general compiler optimizations. We show that these optimizations need very little restrictions in order to be correct for parallel code, allowing the compiler to realize its potential to a high degree.
A Bionics Evolutionary Algorithm Based on Average Vector Deviation
Authors: Kangshun Li, Weifeng Pan, Zhangxin Chen, Huilan Luo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Through an analysis of defects of the traditional evolu- tionary algorithm, a bionics evolutionary algorithm, based- on average vector deviation (BEAVD), is proposed in this paper. This new algorithm greatly improves the traditional evolutionary algorithm and has many good features. It sim- ulates the queen-bee's method of mating in nature. What's more, aiming at enhancing the diversity of population and ultimately getting the global solution, BEAVD also intro- duces the strategy of Guo's algorithm(GuoA), uniform re- combination(UR) as well as the average vector deviation mutation factor(AVD). In numerical experiments, we have used this algorithm to solve some complex single-objective optimization problems with high complexity, which the tra- ditional evolutionary algorithm and even the GA and ES have trouble to solve. Compared with the traditional evolu- tionary algorithm, BEAVD has better performance in realiz- ing global optimization and promoting evolution efficiency, and can lead to higher precise solutions.
Application of Continued Fractions for Fast Evaluation of Certain Functions on a Digital Computer
Authors: A. Bracha-Barak
Venue: IEEE Transactions on Computers (1974)

The purpose of this paper is to develop a method for evaluation of certain elementary functions on a digital computer by the use of continued fractions. The time required for this evaluation is drastically reduced by using "short" operations like shift and add, instead of multiplications. Functional consistency is the most important factor that aliows the expansion of a function into a continued fraction. Several cases are discussed; in particular the solution of the quadratic equation is discussed in more detail to demonstrate the convergence of the method.
Time Series Data Mining Method Based on Lightly-Supported Boolean Association Rules
Authors: Zhonglin Zhang, Zhi Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The mining of association rules mainly aims at the strong association rules, but lacks of efficient methods to mine the rules within the item sets that occur not much frequently. With the separation of the items by their time property, this paper discusses a new method of mining the lightly-supported Boolean Association Rules.
A Fuzzy Comprehensive Assessment Model for Reflection of Dominant Factors
Authors: Yuanzheng Zhong, Feng Dai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The fuzzy comprehensive assessment models commonly used are usually static weight model, which can not reflect the prominent influence of single factor. To solve this problem, this article shows a new alterable weight model which can be widely used. The new model can reflect the prominent influence of single factor, and can also regard the commonly used fuzzy comprehensive assessment model as its special case. Based on this modified model, the case analysis of water quality got a more reasonable result, which shows the advantage of the modified model. This model is especially applicable in the continuous, timely, dynamic evaluation, and it will be widely used in the timely evaluation in the fields of military, economic, environment, etc.
Author's Reply
Authors: J. E. Smith
Venue: IEEE Transactions on Computers (1986)

The paper by Schertz and Metze [1] is concerned with combinational circuits having a certain restricted fan-out structure. Two-level circuits have this restricted structure. A PLA as defined in [2] with only G and D faults behaves like a two-level combinational circuit with stuck-at faults. Hence, the results of Schertz and Metze are applicable. In an AND-OR PLA, a G fault is equivalent to a stuck-at-1 fault on an AND gate input, and a D fault is equivalent to a stuck-at-0 fault on an OR gate input. S and A faults are in a sense "duals" of G and D faults, and results concerning fault masking (and multiple-fault detection) for S and A faults in two-level circuits can be derived in a manner similar to G and D faults.
The Research of Blind Signal Separation Algorithm Based on Neural Network
Authors: Hongjie Liu, Boqin Feng, Hongming Zheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In order to solve the problem of bad separation result of Anti-Hebbian algorithm, a weighted algorithm of blind signal based on the feed back neural network is discussed, i.e. the influence of source signal is overcame by the weighted process. And furthermore, the similarity algorithm is presented. The main process of the blind signal separation algorithm is to construct neural network by the characteristic of blind signal, then to train network using the weighted algorithm or similarity algorithm and get the result at last. The results of the simulation experiment and the practical speech signal separation show the separation effect of the weighted algorithm and similarity algorithm is superior to that of Anti-Hebbian algorithm.
On Solving RC5 Challenges with FPGAs
Authors: Guerric Meurice de Dormale, John Bass, Jean-Jacques Quisquater
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This work explores a hardware design alternative and a cost assessment of an FPGA-based brute force attack against the challenge RC5-72. The aim is to develop an alternative to software-based solutions for distributed.net. Hardware platforms, particularly reconfigurable hardware, can offer significant cost, flexibility and performance advantages, while significantly reducing environmental energy costs and impacts. Implementation results show that an 80 US$ FPGA can yield a throughput of 145 Mkeys/sec with a power consumption of 10 Watts. This is roughly an order of magnitude faster, cheaper and lower power, when compared with fully dedicated general purpose computers.
Effect of organic acids on copper chemical mechanical polishing
Authors: Yung-Fu Wu, Tzu-Hsuan Tsai
Venue: Microelectronic Engineering (2007)

In chemical mechanical polishing (CMP) of Cu, organic acids are often used as additives of slurries. This paper studied the effects of citric acid, oxalic acid, glycolic acid and glycine on Cu CMP performance. Our experiments explored the difference of these organic acids in surface reactions with Cu. The results showed that organic acids could chelate the passive film of Cu, and oxalic acid would further form precipitates with copper ions to change the chemical and mechanical action during CMP. Potential-pH diagrams, electrochemical polarization and impedance analyses were used to examine the behaviors of Cu in various organic acid slurries. The results indicated that the proposed equivalent circuits from impedance analysis for Cu CMP system could provide a good index to surface roughness. Furthermore, we also discussed the effects of used organic acids on reducing particle contamination after Cu CMP by measuring the difference of isoelectric points between Cu and @a-Al"2O"3. The result showed that the addition of organic acid could efficiently decrease particle contamination.
State-Feedback Controller Design for Discrete-Time Fuzzy Systems with Input Saturation Using Fuzzy Weighting-Dependent Lyapunov Functions
Authors: Sung Hyun Kim, PooGyeon Park, Chang Hee Lee
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper proposes a state-feedback fuzzy control law for discrete-time Takagi-Sugeno (TS) fuzzy systems with in- put saturation, where the used criterion is the minimiza- tion of the H norm associated with a fuzzy weighting- dependent Lyapunov function. To address the input satu- ration problem, this paper first formulates a set invariance condition for the TS fuzzy systems in terms of linear matrix inequalities (LMIs) with one prescribed scalar. And then there is subsequently established an H control law.
Letters: Nonlinear innovation to blind source separation
Authors: Zhenwei Shi, Changshui Zhang
Venue: Neurocomputing (2007)

This letter proposes a blind source separation (BSS) method based on the nonlinear innovation of original sources. A simple algorithm is presented by minimizing a loss function of the nonlinear innovation. The method exploits the nonstationarity of sources in the sense that the variance of each source signal can be assumed to change smoothly as a function of time. Simulations verify the efficient implementation of the proposed method, especially its robustness to the outliers.
Efficient placement of distributed on-chip decoupling capacitors in nanoscale ICs
Authors: Mikhail Popovich, Eby G. Friedman, Radu M. Secareanu, Olin L. Hartin
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Decoupling capacitors are widely used to reduce power supply noise. On-chip decoupling capacitors have traditionally been allocated into the white space available on the die based on an unsystematic or ad hoc approach. In this way, large decoupling capacitors are often placed at a significant distance from the current load, compromising the signal integrity of the system. This issue of power delivery cannot be alleviated by simply increasing the size of the on-chip decoupling capacitors. To be effective, the on-chip decoupling capacitors should be placed physically close to the current loads. The area occupied by the on-chip decoupling capacitor, however, is directly proportional to the magnitude of the capacitor. The minimum impedance between the on-chip decoupling capacitor and the current load is therefore fundamentally affected by the magnitude of the capacitor. A distributed on-chip decoupling capacitor network is proposed in this paper. A system of distributed on-chip decoupling capacitors is shown to provide an efficient solution for providing the required on-chip decoupling capacitance under existing technology constraints. In a system of distributed on-chip decoupling capacitors, each capacitor is sized based on the parasitic impedance of the power distribution grid. Various tradeoffs in a system of distributed on-chip decoupling capacitors are also discussed. Related simulation results for typical values of on-chip parasitic resistance are also presented. An analytic solution is shown to provide accurate distributed system. The worst case error is 0.003% as compared to SPICE. Techniques presented in this paper are applicable not only for current technologies, but also provide an efficient placement of the on-chip decoupling capacitors in future technology generations.
A Novel Algorithm for Detecting Air Holes in Steel Pipe Welding Based on Hopfield Neural Network
Authors: Gao Weixin, Tang Nan, Mu Xiangyang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The paper segment x-ray images of steel pipe welding to assess the quality of welding. Image segmentation is posed as an optimization problem, and is correlated with the energy function of the multistage Hopfield neural network. The algorithm for optimization and the principle of selecting coefficient are also given. The algorithm is easy to be programmed. As an application, we successfully segment some real industrial welding x-ray images.
Scalable semantic analytics on social networks for addressing the problem of conflict of interest detection
Authors: Boanerges Aleman-Meza, Meenakshi Nagarajan, Li Ding, Amit Sheth, I. Budak Arpinar, Anupam Joshi, Tim Finin
Venue: ACM Transactions on the Web (TWEB) (2008)

In this article, we demonstrate the applicability of semantic techniques for detection of Conflict of Interest (COI). We explain the common challenges involved in building scalable Semantic Web applications, in particular those addressing connecting-the-dots problems. We describe in detail the challenges involved in two important aspects on building Semantic Web applications, namely, data acquisition and entity disambiguation (or reference reconciliation). We extend upon our previous work where we integrated the collaborative network of a subset of DBLP researchers with persons in a Friend-of-a-Friend social network (FOAF). Our method finds the connections between people, measures collaboration strength, and includes heuristics that use friendship/affiliation information to provide an estimate of potential COI in a peer-review scenario. Evaluations are presented by measuring what could have been the COI between accepted papers in various conference tracks and their respective program committee members. The experimental results demonstrate that scalability can be achieved by using a dataset of over 3 million entities (all bibliographic data from DBLP and a large collection of FOAF documents).
Routing optimization in IP networks utilizing additive and concave link metrics
Authors: Anton Riedl, Dominic A. Schupke
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Routing optimization provides network operators with a powerful method for traffic engineering. Its general objective is to distribute traffic flows evenly across available network resources in order to avoid network congestion and quality of service degradation. In this paper we consider routing optimization based on conventional routing protocols where packets are forwarded hop-by-hop in a destination-based manner. Unlike other work in this area, we consider routing protocols, which are able to take into account concave routing metrics in addition to additive ones. The concave link metric introduces an additional degree of freedom for routing optimization, thus, increasing its optimization potential. We present and evaluate a mixed-integer programming model, which works on these metrics. This model unifies the optimization for single-metric and dual-metric routing concepts and also includes the consideration of multipath routing. Furthermore, we propose a heuristic algorithm usable for larger network instances. Numerical results indicate that employment of both the dual-metric concept and multipath routing can achieve considerably better utilization results than default-configured single-metric routing. A significant finding is that metric-based routing optimization with two link metrics often comes close to the results obtainable by optimization of arbitrarily configurable routing.
Report on the First International Workshop on Database Preservation (PresDB'07)
Authors: Vassilis Christophides, Peter Buneman
Venue: ACM SIGMOD Record (2007)

The need to preserve scientific, scholarly and cultural data has long been recognized. These data sets are valuable and many of them are either impossible to reproduce (e.g. climate and demographic data) or can only be recovered at enormous costs (e.g. data from high energy physics experiments). While substantial investment has been made in archiving and preserving conventional forms of these objects, such as documents, images and numerical data in some file format, the need to preserve entire databases has only recently emerged. Databases differ from fixed digital objects studied in the past, in that they change over time, they have internal structure, and they include schemas and integrity constraints, which are basic for the current and future interpretation of the data. Increasingly, database technology is being used in the storage of large numerical scientific data sets.
A comparison of the fixed and floating building block representation in the genetic algorithm
Authors: Annie S. Wu, Robert K. Lindsay
Venue: Evolutionary Computation (1996)

This article compares the traditional, fixed problem representation style of a genetic algorithm (GA) with a new floating representation in which the building blocks of a problem are not fixed at specific locations on the individuals of the population. In addition, the effects of noncoding segments on both of these representations is studied. Noncoding segments are a computational model of noncoding deoxyribonucleic acid, and floating building blocks mimic the location independence of genes. The fact that these structures are prevalent in natural genetic systems suggests that they may provide some advantages to the evolutionary process. Our results show that there is a significant difference in how GAs solve a problem in the fixed and floating representations. Genetic algorithms are able to maintain a more diverse population with the floating representation. The combination of noncoding segments and floating building blocks appears to encourage a GA to take advantage of its parallel search and recombination abilities.