ppxscal/embedding_network huggingface dataset:
The Simulation Of Nouro-humoral Network
Authors: Shuhai Fan, Tianyuan Xiao, Weihong Ni, Linxuan Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

There exist three regulation methods in human organisms, self-regulation, neural regulation and humoral regulation. In this article, the humoral regulation is integrated into the neural regulation and a simulation of the neural network affected by humor factors is carried out. In the open loop mode, a useful learning formula of the threshold affected by humor system in BP neural network is deduced. Considering the back action of the neural network to the humor system, a close loop mode system, which can eliminate the error of the neural network, is proposed. In an "anesthetic mode", the conditions of the loop mode are deduced and the stability of it is validated. And then a method is described to extend the hybrid network to a neural network affected by grey humor factors. Finally, the hybrid system is successfully applied to the quality control in the production process of Mass Customization.
A Fractal-Based Simulation Scheme for Securities Business of China
Authors: Chong Fu, Ying Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper proves that Shanghai securities business is a biased stochastic market with chaos-fractal characteristics by using R/S analysis. The fluctuations of composite index are with obvious self-similarity and long-term memory. The Hurst exponent of Shanghai securities composite index is calculated and a waving period for 450 days in Shanghai securities business is found through the study of V statistics. The stock sequence is reconstructed by using FBM based fractal interpolation algorithm and gaining reasonably accurate replications. Experimental results indicate that the nonlinear dynamical model is more effective to describe the China securities business than the conventional "random walk" theory based stochastic models.
A robust measure for visual correspondence
Authors: Federico Tombari, Luigi Di Stefano, Stefano Mattoccia
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper a novel measure for visual correspondence is proposed, to be adopted for common computer vision tasks such as pattern matching, stereo vision, change detection. The proposed measure implicitly exploits the concept of order-preservation between neighbouring pixels and it is suitable for those cases where disturbance factors such as photometric distortions and occlusions occur between the images to be matched. Furthermore, this measure tends to be robust in presence of significant amount of noise which can be introduced, e.g., by cheap camera sensors. Experimental results demonstrate the effectiveness of the proposed approach in a typical template matching scenario as well as in a particular application dealing with secure gate access control.
Dynamic load balancing for distributed search
Authors: L. Huston, A. Nizhner, P. Pillai, R. Sukthankar, P. Steenkiste
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationally intensive search of complex data, such as content-based retrieval of digital images or sounds, where sophisticated algorithms must be evaluated on the objects of interest. Since these problems require significant computation, we distribute the search over a collection of compute nodes, such as active storage devices, intermediate processors and host computers. A key challenge with mapping the desired computation to the available resources is that the most efficient distribution depends on several factors: relative power and number of compute nodes; network bandwidth between the compute nodes; the cost of evaluating query predicates; and the selectivity of the given query. This wide range of variables renders manual partitioning of the computation infeasible, particularly since some of the parameters (e.g., available network bandwidth) can change during the course of a search. This paper proposes several techniques for dynamic partitioning of computation, and demonstrates that they can significantly improve efficiency for distributed search applications.
A Multilevel Reputation System for Peer-to-Peer Networks
Authors: Ziyao Xu, Yeping He, Lingli Deng
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Among the five goals of peer-to-peer security, file authenticity and fair trading have attracted the most attention. Reputation and incentive are two traditional systems to deal with file authenticity and fair trading problems, respectively. In this paper, we propose a multilevel reputation system which also serves as the base of an incentive system. By introducing the concept of reputation level to a reputation system, we solve the Load Balance problem of peer-to-peer security perfectly. It also helps to prevent the occurrence of Collusion and Cold-Start problems with two proposed reputation level computation schemes, which are Level Up Reputation Computation (LURC) scheme and Level Keeping Reputation Computation (LKRC) scheme. A central reputation level computation and access control enforcement agent called Central Computation and Enforcement Agent (CCEA) is introduced too, which maintains or raises each peer's reputation level according to its periodic contribution to other peers in the network. We also propose a bootstrap process for our multilevel reputation system in a peer-to-peer network that has all the peers in the lowest reputation level at the very beginning.
Robot manipulator task control with obstacle avoidance using fuzzy behavior-based strategy
Authors: Palitha Dassanayake, Keigo Watanabe, Kazuo Kiguchi, Kiyotaka Izumi
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

In this paper, the concept of fuzzy behavior-based control is used to construct a fuzzy generator that generates the desired positions and orientations of a robot manipulator in the Cartesian space. A servo controller is introduced between the fuzzy trajectory generator and the robot. This method is proposed to minimize the drawbacks in extending a fuzzy behavior-based control used previously, while keeping the advantages of the fuzzy behavior-based strategy. For the PUMA robot, the direct extended version of the control system applied to a three-link manipulator in a previous work, is compared with the proposed method. Two methods are first applied for two behavior groups without any obstacle, in which fuzzy behavioral elements in each method are trained by a genetic algorithm. It is proved that a desired result is not possible within a few numbers of generations for the extended method, whereas the proposed method is able to achieve good results. Moreover, the proposed method is simulated to prove the benefit of the method for three behavior groups with an obstacle. Therefore, it can be concluded that the present approach is suitable in task control of high degree-of-freedom multi-link manipulators while avoiding obstacles for manipulators similar to PUMA robot.
Logarithmic convergence of random heuristic search
Authors: Michael D. Vose
Venue: Evolutionary Computation (1996)

This paper speaks to the inherent emergent behavior of genetic search. For completeness and generality, a class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is then proved. Since the simple genetic algorithm (GA) is an instance of random heuristic search, a corollary is a result concerning GAs and time to convergence.
Schema-free XQuery
Authors: Yunyao Li, Cong Yu, H. V. Jagadish
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowledge of the XML structure, and hence may be unable to produce a correct XQuery, especially in the context of a heterogeneous information collection. The default is to use keyword-based search and we are all too familiar with how difficult it is to obtain precise answers by these means. We seek to address these problems by introducing the notion of Meaningful Lowest Common Ancestor Structure (MLCAS) for finding related nodes within an XML document. By automatically computing MLCAS and expanding ambiguous tag names, we add new functionality to XQuery and enable users to take full advantage of XQuery in querying XML data precisely and efficiently without requiring (perfect) knowledge of the document structure. Such a Schema-Free XQuery is potentially of value not just to casual users with partial knowledge of schema, but also to experts working in a data integration or data evolution context. In such a context, a schema-free query, once written, can be applied universally to multiple data sources that supply similar content under different schemas, and applied "forever" as these schemas evolve. Our experimental evaluation found that it was possible to express a wide variety of queries in a schema-free manner and have them return correct results over a broad diversity of schemas. Furthermore, the evaluation of a schema-free query is not expensive using a novel stack-based algorithm we develop for computing MLCAS: from 1 to 4 times the execution time of an equivalent schema-aware query.
Mobile Learning
Authors: Peter Byrne, Brendan Tangney, Pedro P. Sanchez-Villalon, Manuel Ortega, Lin-Jung Wu, Kao-En Chang, Hsien-Sheng Hsiao, Yao-Ting Sung
Venue: IEEE Distributed Systems Online (2007)

Works in progress from selected papers presented at the 2006 IADIS International Conference on Mobile Learning provide an overview of the diverse research being conducted in this field.
A Survey of Computer-Based Deformable Models
Authors: Patricia Moore, Derek Molloy
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This paper presents a survey of the research carried out to date in the area of computer-based deformable modelling. Due to their cross-disciplinary nature, deformable modelling techniques have been the subject of vigorous research over the past three decades and have found numerous applications in the fields of machine vision (image analysis, image segmentation, image matching, and motion tracking), visualisation (shape representation and data fitting), and computer graphics (shape modelling, simulation, and animation). Previous review papers have been field/application specific and have therefore been limited in their coverage of techniques. This survey focuses on general deformable models for computer-based modelling, which can be used for computer graphics, visualisation, and various image processing applications. The paper organizes the various approaches by technique and provides a description, critique, and overview of applications for each. Finally, the state of the art of deformable modelling is discussed, and areas of importance for future research are suggested.
Software Performance Estimation in MPSoC Design
Authors: M. Oyamada, F. R. Wagner
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Estimation tools are a key component of system-level methodologies, enabling a fast design space exploration. Estimation of software performance is essential in current software-dominated embedded systems. This work proposes an integrated methodology for system design and performance analysis. An analytic approach based on neural networks is used for high-level software performance estimation. At the functional level, this analytic tool enables a fast evaluation of the performance to be obtained with selected processors, which is an essential task for the definition of a "golden" architecture. From this architectural definition, a tool that refines hardware and software interfaces produces a bus-functional model. A virtual prototype is then generated from the bus-functional model, providing a global, cycle-accurate simulation model and offering several features for design validation and detailed performance analysis. Our work thus combines an analytic approach at functional level and a simulation-based approach at bus functional level. This provides an adequate trade-off between estimation time and precision. A multiprocessor platform implementing an MPEG4 encoder is used as case study, and the analytic estimation results in errors only up to 17% when compared to the virtual platform simulation. On the other hand, the analytic estimation takes only 17 seconds, against 10 minutes using the cycle-accurate simulation model.
Finding and linking incidents in news
Authors: Ao Feng, James Allan
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

News reports are being produced and disseminated in overwhelming volume, making it difficult to keep up with the newest information. Most previous research in automatic news organization treated news topics as a flat list, ignoring the intrinsic connection among individual reports. We argue that more contextual information within and across the topics will benefit users in their news understanding process. A news organization infrastructure, incident threading, is proposed in this article. All text snippets describing the occurrence of a real-world happening are combined into a news incident, and a network is composed of incidents that are interconnected by links in certain types. A limited vocabulary of connection types is defined and corresponding rules are established based upon the human experience of news understanding. The incident threading system is implemented with two different algorithms. One starts from clustering of text passages and then creates links with pre-built rules. The other method defines a global score function over the whole collection and solves the optimization problem with simulated annealing. The former achieves higher accuracy in the identification of incidents and the latter generates better links, which is preferred since the links are more important for the formation of the incident network.
Lean and active virtual meetings
Authors: Marika Stalnacke, Olof Lundstrom, Jan van der Meer, Cristian Norlin, Tommy Arngren
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Virtual meetings - real-time collaboration between people in separate locations - can be greatly enhanced by centering on the mobile phone, a device many people carry with them everywhere. The concept Lean and active virtual meetings has been developed to resolve many of the problems and issues faced by users of today's virtual meeting technology. Such issues include cumbersome login procedures and difficulties for on-the-move, mobile-phone-only participants to be active and make an impact. The idea is to evolve the concept gradually from currently existing voice conferencing into the full concept where meeting participants use their mobile phone for all meeting functions, in particular authentication, conference audio and document sharing support. Concept tests reveal that intended target user groups find the concept credible, addressing relevant "pain-points" and containing many interesting services. Ease of use is of particular importance. A prototype based on Java and UMTS has been developed that demonstrates some key functionalities, such as simple meeting start and participant status list. We now continue to explore the concept from an end-user, a business and a technology perspective. The prototype will be further developed towards the full concept and used for more extensive user trialing. For long-term implementation, IMS (IP Multimedia Subsystem) is of key interest.
Increase ICT Project Success with Concrete Scope Management
Authors: Carol Dekkers, Pekka Forselius
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

With the Standish group's CHAOS report proclaiming ICT project success on a mere one-third of projects, project managers have an obligation worldwide to gain control of the situation. Through concrete scope management processes, ICT project managers can learn and embrace proven approaches that measure the size of software projects, streamline the requirements articulation and management, and impose solid change management controls, to keep projects on time and on budget. Scope management is not rocket science, however, with 2/3 of the world's ICT projects deemed as failures, it is apparent that managing scope is not a natural byproduct of project management. Learn approaches and tips used in Europe, Australia, and North America that have dramatically increased the success on ICT projects by trained scope managers.
Informality in Program Specifications
Authors: R. Balzer
Venue: IEEE Transactions on Software Engineering (1978)

This paper is concerned with the need for computer-based tools which help human designers formulate formal process-oriented specifications. It first determines some attributes of a suitable process-oriented specification language, then examines the reasons why specifications would still be difficult to write in such a language in the absence of formulation tools. The key to overcoming these difficulties seems to be the careful introduction of informality based on partial, rather than complete, descriptions and the use of a computer-based tool that uses context extensively to complete these descnrptions during the process of constructing a well-formed specification. Some results obtained by a running prototype of such a computer-based tool on a few informal example specifications are presented and, finaliy, some of the techniques used by this prototype system are discussed.
A Video Watermarking Scheme Resistant to Synchronization Attacks Based on Statistics and Shot Segmentation
Authors: Li-he Zhang, Gang Xu, Ji-jun Zhou, Lin-jie Shen
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

One of the challenges of blind watermark detection is synchronization. In this paper, a new video watermarking procedure for resistant synchronization is proposed. We partition watermark into several segments, and embed every segment into different scenes of video sequence. Firstly, motion vectors are grouped according to their magnitude and each group is further partitioned into two subsets. We use element number ratio in two subsets of the same group to denote watermark bit 0 or bit 1. Thus, watermark is associated with motion vectors' statistical characteristics, and those motion vectors carrying the identical watermark bits are uniformly distributed to the whole video sequence, they are spatio temporal indiscerptibly. It is shown that this kind of watermark is more resilient against temporal synchronization attacks. Experimental results from an implementation of the algorithm are presented.
Mining user navigation patterns for personalizing topic directories
Authors: Theodore Dalamagas, Panagiotis Bouros, Theodore Galanis, Magdalini Eirinaki, Timos Sellis
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

Topic directories are popular means of organizing information resources in the web. In this work, we introduce a methodology for personalizing topic directories. The key feature of our methodology is that the personalization is based on the mining of navigation patterns extracted from previous user visits. These patterns, expressed in the form of visited categories and retrieved resources, represent the navigation behaviour and interests of different users or user groups. Our work provides a set of mining tasks for user navigation patterns and a set of personalization tasks that customize the organization of the topic directory according to these patterns for certain user groups.
A Fuzzy Multi-objective Programming for Optimization of Reverse Logistics for Solid Waste through Genetic Algorithms
Authors: Bo He, Chao Yang, Ming-ming Ren
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Reverse Logistics for Solid Waste is an important problem concerning about economic and environment. This paper aims at determine the optimal locations and numbers of treatment facilities and transfer stations for municipal solid wastes. The proposed method is the combination of a fuzzy multi-objective programming and a genetic algorithm. The original fuzzy multiple objectives are appropriately converted to a single unified "min- max" goal, which makes it easy to design a genetic algorithm for the problem solving. So, a reverse logistics network for municipal solid waste is constructed. Finally, a case study of China proves the availability of our approach.
Sensor Networking in Aquatic Environments - Experiences and New Challenges
Authors: Thiemo Voigt, Fredrik Osterlind, Niclas Finne, Nicolas Tsiftes, Zhitao He, Joakim Eriksson, Adam Dunkels, Ulf Bamstedt, Jochen Schiller, Klas Hjort
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we present the design and implementation of a small-scale marine sensor network. The network monitors the temperature in the Baltic Sea on different heights from the water surface down to the bottom. Unlike many other wireless sensor networks, this network contains both a wired and a wireless part. One of the major challenges is that the network is hard to access after its deployment and hence both hard- and software must be robust and reliable. We also present the design of an advanced buoy system featuring a diving unit that achieves a better vertical resolution and discuss remaining challenges of sensor networking in aquatic environments.
A Mechanism for Database Protection in Cellular-Logic Devices
Authors: Yang-Chang Hong
Venue: IEEE Transactions on Software Engineering (1982)

Protection of data in a database against unauthorized disclosure, alteration, or destruction is an important aspect of a multiuser database system. In a system which uses a celiular-logic device as a means for data management applications, protection can be achieved in part by associating security windows with queries. This paper describes a mechanism for dynamically creating these windows for cellular-logic devices. The mechanism mainly benefits from the associative techniques such as content and context searches, tagging and marking data, etc. These techniques allow the windows to be created physically by simultaneously activating related access control decision procedures, which implement access control decisions employed by the system, to mask out those data to which the user does not have the right of access. Furthermore, they enable the content-dependent security decisions to be efficiently implemented, eliminating the drawbacks found in conventional systems. Thus, a query accessing to a protected database system is identical to a query accessing to its companion window. An implementation of this mechanism on the cellular-logic device CASSM is also presented.