ppxscal/embedding_network huggingface dataset:
Self-organizing multi-modeling: A different way to design intelligent predictors
Authors: Kurosh Madani, Lamine Thiaw
Venue: Neurocomputing (2007)

Identification of nonlinear systems is an important task for a large number of areas dealing with real-world applications and requirements. Recently, multiple works proposed ''multi-model'' based approaches to model nonlinear systems. Contrary to the conventional point of view, we propose to deem the multi-modeling as building a modular architecture, inspired from Artificial Neural Networks operation mode, where each neuron (module), represented by one of the local models, realizes some higher level transfer function. This article, deals with generalization of this new multi-modeling concept in the frame of nonlinear system's behavior identification and prediction context. Several multi-model construction strategies and identifiers issued architectures are presented and discussed. Experimental results validating presented multi-model based identifiers have been reported and discussed.
Cost-Performance Bounds for Multimicrocomputer Networks
Authors: D. A. Reed
Venue: IEEE Transactions on Computers (1983)

Several interconnection structures for a distributed multimicrocomputer message-passing system are compared on the basis of cost and performance. Among the structures analyzed are buses, double rings, D-dimensional toroids, trees, cube-connected cycles, and chordal rings. Network cost is defined in terms of the number of network nodes and the unit cost of communication links and their associated connections. Simple asymptotic performance bounds are derived based on the bottleneck analysis of a queueing network. In contrast to the usual assumption of uniform message routing, the technique permits the introduction of a reference locality notion to the message routing behavior of network nodes. Finally, the cost, performance, and performance/cost functions are examined as the number of network nodes becomes very large.
Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
Authors: P. Caseau
Venue: IEEE Transactions on Software Engineering (1979)

A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also be allowed. Some special models with two stations in sequence and blocking are examined. These models are used for the performance evaluation of computer systems. In particular, the maximum throughput for a virtual memory operating system and for a node-to-node protocol in a computer network are obtained.
Prototyping Service Discovery and Usage in Wireless Sensor Networks
Authors: Raluca Marin-Perianu, Hans Scholten, Paul Havinga
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Heterogeneous Wireless Sensor Networks (WSNs) are envisioned to provide different types of services in an open and dynamic environment. This paper presents the design, implementation and evaluation of a service discovery and usage solution for heterogeneous WSNs. The users have the possibility to discover and use the services available in the WSN, while sensor nodes can search for the existing gateways to the outside world in order to signal important events. The WSN self-organizes in a clustered structure that acts as a distributed directory of service registrations. The clustering offers the necessary support to achieve energy-efficient discovery within theWSN.We implement the combined solution on resource-constrained sensor nodes, and we analyse the performance characteristics. The results show that the clustering algorithm has low communication overhead and the service discovery protocol scales with the number of nodes and network density. In addition, we show that the solution is lightweight (both code and data memory footprint) and the the interaction user-WSN is straightforward and intuitive.
Web search personalization with ontological user profiles
Authors: Ahu Sieg, Bamshad Mobasher, Robin Burke
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Every user has a distinct background and a specific goal when searching for information on the Web. The goal of Web search personalization is to tailor search results to a particular user based on that user's interests and preferences. Effective personalization of information access involves two important challenges: accurately identifying the user context and organizing the information in such a way that matches the particular context. We present an approach to personalized search that involves building models of user context as ontological profiles by assigning implicitly derived interest scores to existing concepts in a domain ontology. A spreading activation algorithm is used to maintain the interest scores based on the user's ongoing behavior. Our experiments show that re-ranking the search results based on the interest scores and the semantic evidence in an ontological user profile is effective in presenting the most relevant results to the user.
Influence of anteroposterior shifting of trunk mass centroid on vibrational configuration of human spine
Authors: Li-Xin Guo, Ming Zhang, Zhao-Wen Wang, Yi-Min Zhang, Bang-Chun Wen, Jin-Li Li
Venue: Computers in Biology and Medicine (2008)

This study attempts to determine the influence of anteroposterior (A-P) shifting of trunk mass from the upright sedentary posture on dynamic characteristics of the human lumbar spine. A three-dimensional finite element (FE) model comprising of the T12-Pelvis spine unit was used to mimic the human spine system. It is not clear how the A-P shifting of the upper part of human upper body affect on vibrational modality of the human lumbar spine under whole body vibration. Five trunk mass point locations were assumed by 2.0cm anterior, 1.0cm anterior, 1.0cm posterior and 2.0cm posterior to the upright sedentary posture including no shifting posture. FE modal analysis was used to extract the resonant frequencies and vibration modes of the human spine. The analytical results indicate that trunk mass centroid shifting onwards or rearwards may result in a reduction of vertical resonant frequency of the human spine. The human spine has the highest vertical resonant frequency at the normal upright sedentary posture with the trunk mass locating around 1.0cm anterior to the L3-L4 vertebral centroid. Larger A-P deformations and rotational deformations were also found at the spine motion segments L3-L4 and L4-L5, which imply higher compressive stress and shear stress at the disc annulus of those spinal motion segments. The findings in this study may explain why long-term whole body vibration might induce the degeneration of human spine at the relevant spinal motion segments.
Product behavior and appearance effects on experienced engagement during experiential and goal-directed tasks
Authors: Marco M. C. Rozendaal, David V. Keyson, Huib de Ridder
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This study examines how digital products can be designed towards increased levels of experienced engagement. An experiment was conducted in which 24 participants were asked to interact with a videogame that varied in behavior and appearance aspects during experiential and goal-directed tasks. Behavioral aspects were manipulated by varying the amount of possibilities in the game that also affected the complexity in human action. Appearance aspects were manipulated by varying the colorfulness, detail and asymmetry within the visual design. During experiential tasks participants were free to explore the game and during goal-directed tasks participants were given a goal that had to be completed as efficiently as possible. Results indicate that experienced engagement is based upon the extent the game provided rich experiences and by the extent the game provided a sense of control. Based on these results, recommendations for designing engaging interactions with digital products are discussed.
Energy-Aware Data Aggregation for Grid-Based Wireless Sensor Networks with a Mobile Sink
Authors: Nen-Chung Wang, Yung-Fa Huang, Jong-Shin Chen, Po-Chi Yeh
Venue: Wireless Personal Communications: An International Journal (2007)

Wireless sensor networks (WSNs) are made up of many small and highly sensitive nodes that have the ability to react quickly. In WSNs, sink mobility brings new challenges to large-scale sensor networks. Almost all of the energy-aware routing protocols that have been proposed for WSNs aim at optimizing network performance while relaying data to a stationary gateway (sink). However, through such contemporary protocols, mobility of the sink can make established routes unstable and non-optimal. The use of mobile sinks introduces a trade-off between the need for frequent rerouting to ensure optimal network operation and the desire to minimize the overhead of topology management. In this paper, in order to reduce energy consumption and minimize the overhead of rerouting frequency, we propose an energy-aware data aggregation scheme (EADA) for grid-based wireless sensor networks with a mobile sink. In the proposed scheme, each sensor node with location information and limited energy is considered. Our approach utilizes location information and selects a special gateway in each area of a grid responsible for forwarding messages. We restrict the flooding region to decrease the overhead for route decision by utilizing local information. We conducted simulations to show that the proposed routing scheme outperforms the coordination-based data dissemination scheme (CODE) (Xuan, H. L., Lee, S. Proceedings of the Sensor Networks and Information Processing Conference, pp. 13---18, 2004).
Model Checking Security Pattern Compositions
Authors: Jing Dong, Tu Peng, Yajing Zhao
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Security patterns capture best practice on secure software design and development. They document typical solutions to security problems. To ensure security, large software system design may apply many security patterns to solve different problems. Although each security pattern describes a good design guideline, the compositions of these security patterns may not be consistent and encounter problems and flaws. In this paper, we present an approach to model checking the compositions of security patterns. In this way, the properties of the security patterns can be checked by a model checker when they are composed. Composition errors and problems can be discovered early in the design stage. We also use a case study to illustrate our approach and show the detection of several errors. KEYWORDS Design pattern, security, logics, process algebra
Performance Trade-off Exploration by Query-Trail-Mediated Topology Reconstruction in Unstructured P2P Networks
Authors: Kei Ohnishi, Satoshi Nagamatsu, Yuji Oie
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper presents a topology reconstruction method to explore better trade-off points between search and access load balancing performance in unstructured Peer-to-Peer (P2P) file sharing networks. The proposed topology reconstruction method changes a network topology in a dynamic, autonomous, and decentralized manner. The topology reconstruction is based on local threshold-based rules that use query trails, which stand for information on previous successful search paths. A power-law network is used as the initial network in simulations. The simulation results show that, depending on the setting of the threshold values, compared to the case without topology reconstruction, the proposed method can explore better trade-off points between search and storage access load balancing performance.
Simulations and experiments of three-dimensional paddle shift for IC packaging
Authors: Shiang-Yu Teng, Sheng-Jye Hwang
Venue: Microelectronic Engineering (2008)

Paddle shift is one of the most serious defects which may arise during the IC encapsulation of leadframe-type packages. The term ''paddle shift'' means the deflection of the leadframe-pad and die as a result of the pressure difference between the top and bottom mold cavities. In extreme cases, paddle shift could lead to a substantial reduction in the reliability of package. This paper employed a computational approach to predict the paddle shift quantity during the IC packaging process. The approach was based on precise finite element (FE) models and flow-structure decoupled analyses. Two kinds of FE models were needed for the decoupled analyses, namely a 3D FE model for the mold filling analysis (i.e. fluid-flow mesh) and a 3D FE model for the structural analysis (i.e. paddle mesh). The aim of the mold filling analysis was to identify the pressure distribution acting on the paddle structure during the encapsulation process, while the objective of the structural analysis was to determine the amount of paddle shift which was caused by pressure distribution. To investigate the relationship between the package geometry and the amount of paddle shift, the present simulations considered six TQFP (Thin quad flat package) models with different geometrical parameters. The simulation results for the paddle shift were compared with the experimental results to demonstrate the accuracy of the proposed numerical approach. It was found that a good agreement exists between the two sets of results.
Demand Forecasting by Using Support Vector Machine
Authors: Liu Yue, Yin Yafeng, Gao Junjun, Tan Chongli
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Demand forecasting plays a crucial role for supply chain management of retail industry. The future demand for a certain product constructs the basis of its relevant replenishment system. In this research, the technique of Support Vector Machine (SVM) is employed for demand forecasting. Various factors that affect the product demand such as seasonal and promotional factors have been taken into consideration in the model. Meanwhile, different other approaches such as Statistical Model, Winter Model and Radius Basis Function Neural Network (RBFNN) are also used for comparison and evaluation. The experiment results show that the performance of SVM is superior to other models, which will lead simultaneously to fewer sales failure and lower inventory levels.
Five Kinds of Contradictory Relations and Opposite Relations in Inconsistent Knowledge
Authors: Zhenghua Pan, Shengli Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Inconsistent knowledge processing is an important problem in the study of knowledge, especially in fuzzy knowledge. In this paper, we consider that research of inconsistent knowledge should differentiate between contradictory concept and opposite concept. Based on this cognition, we discovered a sort of character on opposite concepts, which a pair of opposite concepts is fuzzy concepts if and only if there is medium concept between them, and five kinds of contradictory relations and opposite relations in the distinct knowledge and fuzzy knowledge were defined. Furthermore, we studied these relations using the medium predicate logic MF and the infinite-valued model of MF, and obtained the conditions of processing these relations.
Modified Dynamic Time Warping for Stroke-Based On-line Signature Verification
Authors: W. Chang, J. Shin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In the stroke-based signature verification system, it is important to find correct points of a testing signature to be spilt according to its template signature. In this paper, we propose a modified dynamic time warping algorithm (DTW) for the problem. Proposed method has two differences to the conventional approaches. First, the stroke information of both template and testing signature is considered precious to prevent wrong splitting. Second, the number of stroke difference in genuine signature is not limited because the proposed method does not require much additional computational time. Through the experiment, proposed method is verified with 1359 signatures written by 17 Japanese writers. The test data were all the semi-skilled forgeries, and the results of proposed methods showed 3.85% in the equal error rate (the error rate when the false acceptance rate and false rejection rate is the same; EER) while the EER of the compared method was 7.8%.
Enhancing the diversity of conversational collaborative recommendations: a comparison
Authors: John Paul Kelly, Derek Bridge
Venue: Artificial Intelligence Review (2006)

In conversational collaborative recommender systems, user feedback influences the recommendations. We report mechanisms for enhancing the diversity of the recommendations made by collaborative recommenders. We focus on techniques for increasing diversity that rely on collaborative data only. In our experiments, we compare different mechanisms and show that, if recommendations are diverse, users find target items in many fewer recommendation cycles.
Data caching in data integration systems based on AXML technology
Authors: Marcin Marczewski, Tadeusz Pankowski
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

AXML (Active XML) is a framework for peer-to-peer data integration from XML sources. In AXML documents data can be presented extensionally or intentionally by including calls to local or remote Web services. In complex AXML-based systems data retrieval can be inefficient. In the paper we propose a caching mechanism for systems based on Active XML. We show how it can influence network communication and data integration processes.
Error Correcting Properties of Redundant Residue Number Systems
Authors: F. Barsi
Venue: IEEE Transactions on Computers (1973)

The error correcting properties of the redundant residue number systems (RNS) are investigated through a more natural a approach than was previously known. The necessary and sufficient condition for the correction of a given error affecting a single residue digit of any legitimate number in an RRNS is determined. The minimal redundancy allowing the correction of the whole class of the single residue digit errors is derived and an efficienit procedure for error correction is given. Moreover, it is shown that a smaller redundancy and a single redundant modulus may allow the correction of certain important subclasses of single residue digit errors, e.g., the set of errors affecting a single bit in the code. Examples are given.
Source/drain extension region engineering in nanoscale double gate SOI MOSFETs: Novel design methodology for low-voltage analog applications
Authors: Abhinav Kranti, G. Alastair Armstrong
Venue: Microelectronic Engineering (2007)

The present paper proposes for the first time, a novel design methodology based on the optimization of source/drain extension (SDE) regions to significantly improve the trade-off between intrinsic voltage gain (A"V"O) and cut-off frequency (f"T) in nanoscale double gate (DG) devices. Our results show that an optimally designed 25nm gate length SDE region engineered DG MOSFET operating at drain current of 10@mA/@mm, exhibits up to 65% improvement in intrinsic voltage gain and 85% in cut-off frequency over devices designed with abrupt SDE regions. The influence of spacer width, lateral source/drain doping gradient and symmetric as well as asymmetrically designed SDE regions on key analog figures of merit (FOM) such as transconductance (g"m), transconductance-to-current ratio (g"m/I"d"s), Early voltage (V"E"A), output conductance (g"d"s) and gate capacitances are examined in detail. The present work provides new opportunities for realizing future low-voltage/low-power analog circuits with nanoscale SDE engineered DG MOSFETs.
An Approach to Outlier Detection of Software Measurement Data using the K-means Clustering Method
Authors: Kyung-A Yoon, Oh-Sung Kwon, Doo-Hwan Bae
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The quality of software measurement data affects the accuracy of project manager's decision making using estimation or prediction models and the understanding of real project status. During the software measurement implementation, the outlier which reduces the data quality is collected, however its detection is not easy. To cope with this problem, we propose an approach to outlier detection of software measurement data using the k-means clustering method in this work.
Computational mechanisms for metaphor in languages: a survey
Authors: Chang-Le Zhou, Yun Yang, Xiao-Xi Huang
Venue: Journal of Computer Science and Technology (2007)

Metaphor computation has attracted more and more attention because metaphor, to some extent, is the focus of mind and language mechanism. However, it encounters problems not only due to the rich expressive power of natural language but also due to cognitive nature of human being. Therefore machine-understanding of metaphor is now becoming a bottle-neck in natural language processing and machine translation. This paper first suggests how a metaphor is understood and then presents a survey of current computational approaches, in terms of their linguistic historical roots, underlying foundations, methods and techniques currently used, advantages, limitations, and future trends. A comparison between metaphors in English and Chinese languages is also introduced because compared with development in English language Chinese metaphor computation is just at its starting stage. So a separate summarization of current progress made in Chinese metaphor computation is presented. As a conclusion, a few suggestions are proposed for further research on metaphor computation especially on Chinese metaphor computation.
Trajectory tracking control for a miniature fixed-wing unmanned air vehicle
Authors: Wei Ren
Venue: International Journal of Systems Science (2007)

This article considers the problem of trajectory tracking control for a miniature fixed-wing unmanned air vehicle (UAV). With the UAV equipped with longitudinal and lateral autopilots, we adopt a kinematic model that takes into account the fact that the heading of the UAV is controlled by its roll motion and the autopilot responses to air speed and roll control commands are first order in nature. Backstepping techniques are applied to derive air speed and roll control commands from known air speed and heading control laws that explicitly account for air speed and heading rate constraints of the UAV. Regarding inaccurately known autopilot constants, a parameter adaptation technique is used to estimate autopilot constants. High-fidelity simulation results on a six degree-of-freedom (DOF) 12-state fixed-wing UAV model are presented to show the effectiveness of our approach.
Parallel Password Cracker: A Feasibility Study of Using Linux Clustering Technique in Computer Forensics
Authors: Johnny Bengtsson
Venue: Proceedings of the Second International Workshop on Digital Forensics and Incident Analysis (2007)

Today, nearly all computer forensic analyses are done on stand-alone computers. The fundamental reason is that analysis software are not developed for parallel processing. This paper describes a feasibility study in building a Linux based high-performance computing cluster (HPC-cluster) cluster and the development of a parallelised password cracker application using the Message Passing Interface (MPI) in order to gain competence in designing parallel programs, especially in or near the field of computer forensics.