ppxscal/embedding_network huggingface dataset:
M-ary Orthogonal Code Spread-Spectrum Signal Dispreading Method Based on Confidence
Authors: Hong-Bo Li, Ke-Chuang Xing, Li-Ru Yang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

As M-ary Orthogonal Code Spread-Spectrum Dispreading method is based on Maximum Correlation Rule, a false dispreading result will be computed out in the situation of false alarm. Moreover, this false result will be handed down to the following units, which of course causes a waste of resources. In this essay, a dispreading method based on confidence analysis is proposed, and the simulation results show that the computed confidence degree traces the SER very well, providing the succeeding units a good reference.
Galaxy Decomposition in Multispectral Images Using Markov Chain Monte Carlo Algorithms
Authors: Benjamin Perret, Vincent Mazet, Christophe Collet, Éric Slezak
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

Astronomers still lack a multiwavelength analysis scheme for galaxy classification. In this paper we propose a way of analysing multispectral observations aiming at refining existing classifications with spectral information. We propose a global approach which consists of decomposing the galaxy into a parametric model using physically meaningful structures. Physical interpretation of the results will be straightforward even if the method is limited to regular galaxies. The proposed approach is fully automatic and performed using Markov Chain Monte Carlo (MCMC) algorithms. Evaluation on simulated and real 5-band images shows that this new method is robust and accurate.
Multiuser subchannel matching algorithms for two-hop OFDM relay networks
Authors: Yujin Wang, Ping Wang, Fuqiang Liu, Xinhong Wang, Xuefeng Yin
Venue: Proceedings of the 1st ACM workshop on Mobile internet through cellular networks (2009)

The combination of orthogonal frequency division multiplexing (OFDM) modulation and relay technology is a promising way to increase system throughput and coverage area for the next-generation wireless cellular networks. The end-to-end system throughput in these networks relies on an appropriate and effective subchannel matching scheme because of the frequency selective fading on subchannels. In this paper, we consider the subchannel matching problem for a two-hop multiuser OFDM Relay network. Two algorithms are proposed for subchannel matching, aiming at two cases of user service type. The first algorithm can achieve high system throughput and the second one pursues to guarantee the quality of service (QoS) of high priority users. Simulation results show that our proposed algorithms outperform the existing subchannel matching schemes in terms of system throughput or the QoS of the high priority users.
A Theoretical Model for Cross-Cultural Web Design
Authors: Hsiu Ching Hsieh, Ray Holland, Mark Young
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

People from different cultures use web interfaces in different ways; they hold different mental models for visual representations, navigation, interaction, and layouts, and have different communication patterns and expectations. In the context of globalisation, web developers and designers have to make adaptations to fit the needs of people from different cultures, but most previous research lacks an appropriate way to apply culture factors into the web development. It is noted that no single model can support all cross-cultural web communication but a new model is needed to bridge the gap and improve the limitations. Thus, in this paper, a thorough literature review is conducted to develop a theoretical cross-cultural model to facilitate effective communication (usability) for web design, in which the variable (cultural factors), the process of developing cross-cultural websites, and measurement criteria are identified, and two related testable hypotheses are generated.
Ontologies for crisis contagion management in financial institutions
Authors: Kang Ye, Shanshan Wang, Jiaqi Yan, Huaiqing Wang, Baiqi Miao
Venue: Journal of Information Science (2009)

What makes crisis management in financial institutions fairly unique and particularly complex is the accompanying crisis contagion or systemic risk. The subprime mortgage crisis currently happening in the USA is a typical example. In order to further deepen our understanding of how crisis contagion occurs and enhance information interchange and knowledge sharing among related entities, ontologies for crisis contagion management in financial institutions are proposed in this study. Three categories of ontologies, which include static ontology, dynamic ontology, and social ontology, are developed to deal with different perspectives in this domain. The three types of ontology are then united in the Ontology Web Language (OWL) and the Semantic Web Rules Languages (SWRL) framework, both of which are machine readable. Finally, the case of Long-Term Capital Management (LTCM) is offered to demonstrate how the proposed ontologies are used in financial institutions.
Extended Static Checking by Calculation Using the Pointfree Transform
Authors: José N. Oliveira
Venue: Language Engineering and Rigorous Software Development: International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24 - March 1, 2008, Revised Tutorial Lectures (2009)

The pointfree transform offers to the predicate calculus what the Laplace transform offers to the differential/integral calculus: the possibility of changing the underlying mathematical space so as to enable agile algebraic calculation. This paper addresses the foundations of the transform and its application to a calculational approach to extended static checking (ESC) in the context of abstract modeling. In particular, a calculus is given whose rules help in breaking the complexity of the proof obligations involved in static checking arguments. The close connection between such calculus and that of weakest pre-conditions makes it possible to use the latter in ESC proof obligation discharge, where pointfree notation is again used, this time to calculate with invariant properties to be maintained.A connection with the "everything is a relation" lemma of Alloy is established, showing how close to each other the pointfree and Alloy notations are. The main advantage of this connection is that of complementing pen-and-paper pointfree calculations with model checking support wherever validating sizable abstract models.
List decoding of Hermitian codes using Gröbner bases
Authors: Kwankyu Lee, Michael E. OSullivan
Venue: Journal of Symbolic Computation (2009)

List decoding of Hermitian codes is reformulated to yield an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Grobner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation.
An Improved Modular Approach for System Reliability Analysis
Authors: Yongjian Tao, Decun Dong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

A modular method, based on Binary Decision Diagrams and Bayesian Networks, is proposed to analyze system reliability. A fault tree is divided into independent subtrees using a very efficient linear time algorithm. Different solution techniques are applied to each subtree depending on the latter’s characteristics, Binary Decision Diagrams solution for static fault trees, and Bayesian Networks solution for dynamic fault trees. The solutions of various independent subtrees are integrated to obtain the reliability of urban mass transit vehicles. The modular method, based on based on Binary Decision Diagrams and Bayesian Networks, can overcome main shortcomings of Markov Chains, and is useful for assessing the reliability of large and complex systems.
Validating Security Protocols under the General Attacker
Authors: Wihem Arsac, Giampaolo Bella, Xavier Chantry, Luca Compagna
Venue: Foundations and Applications of Security Analysis: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers (2009)

Security protocols have been analysed using a variety of tools and focusing on a variety of properties. Most findings assume the ever so popular Dolev-Yao threat model. A more recent threat model called the Rational Attacker [1] sees each protocol participant decide whether or not to conform to the protocol upon their own cost/benefit analysis. Each participant neither colludes nor shares knowledge with anyone, a feature that rules out the applicability of existing equivalence results in the Dolev-Yao model. Aiming at mechanical validation, we abstract away the actual cost/benefit analysis and obtain the General Attacker threat model, which sees each principal blindly act as a Dolev-Yao attacker.The analysis of security protocols under the General Attacker threat model brings forward yet more insights: retaliation attacks and anticipation attacks are our main findings, while the tool support can scale up to the new analysis at a negligible price. The general threat model for security protocols based on set-rewriting that was adopted in AVISPA [2] is leveraged so as to express the General Attacker. The state-of-the-art model checker SATMC [3] is then used to automatically validate a protocol under the new threats, so that retaliation and anticipation attacks can automatically be found.
A Direct-identifying GPC Implicit Algorithm Based on Two Identifiers
Authors: Zhou Shoujun, Zhao Youen, Liu Xueting, Tian Maocheng
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Based on characteristics of district heating system, a new GPC (generalized predictive control) algorithm was presented that directly identified controller’s parameters with two identifiers. The new method could adapt the system of great inertia, time-varying parameters and rather large delay. In addition, it could omit computation of inverse matrix and Diophantine equations, and thus could greatly reduce operation process and operation time. Finally, by the simulation research of heat-exchanging process, the influence of feedforward compensation is analyzed, and the validity of the new algorithm is proved.
Relevance feedback models for recommendation
Authors: Masao Utiyama, Mikio Yamamoto
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We extended language modeling approaches in information retrieval (IR) to combine collaborative filtering (CF) and content-based filtering (CBF). Our approach is based on the analogy between IR and CF, especially between CF and relevance feedback (RF). Both CF and RF exploit users' preference/relevance judgments to recommend items. We first introduce a multinomial model that combines CF and CBF in a language modeling framework. We then generalize the model to another multinomial model that approximates the Polya distribution. This generalized model outperforms the multinomial model by 3.4% for CBF and 17.4% for CF in recommending English Wikipedia articles. The performance of the generalized model for three different datasets was comparable to that of a state-of-the-art item-based CF method.
The dependence condition graph: Precise conditions for dependence between program points
Authors: Srihari Sukumaran, Ashok Sreenivas, Ravindra Metta
Venue: Computer Languages, Systems and Structures (2010)

The problem of identifying the conditions under which semantic or behavioural dependences arise between different program statements has interesting applications in various areas such as program understanding, software maintenance, software audits and software testing. We present an extension to the program dependence graph (PDG), called the dependence condition graph (DCG), that enables identifying the conditions for dependence between program points. We show that these conditions are not only correct with respect to the program's semantics, but also more precise than identified by other known techniques. We also present evidence that the DCG is a practical representation and can be built for large programs, and sketch many different applications of the DCG.
Modeling Clinical Guidelines through Petri Nets
Authors: Marco Beccuti, Alessio Bottrighi, Giuliana Franceschinis, Stefania Montani, Paolo Terenziani
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Clinical guidelines (GLs) play an important role to standardize and organize clinical processes according to evidence-based medicine. Several computer-based GL representation languages have been defined, usually focusing on expressiveness and/or on user-friendliness. In many cases, the interpretation of some constructs in such languages is quite unclear. Only recently researchers have started to provide a formal semantics for some of such languages, thus providing an unambiguous specification for implementers, and a formal ground in which different approaches can be compared, and verification techniques can be applied. Petri Nets are a natural candidate formalism to cope with GL semantics, since they are explicitly geared towards the representation of processes, and are paired with powerful verification mechanisms. We show how Petri Nets can cope with the semantics of GLs in a clear way, taking the system GLARE formalism as a case study.
A backoff copying scheme for contention resolution in wireless sensor networks
Authors: Zhuxiu Yuan, Cuiyao Xue, Lei Wang, Yuanfang Chen, Weiping Sun, Lei Shu
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

This paper aims at improving the throughput and fairness of the wireless sensor networks (WSN). Due to the disproportionate larger number of packets accumulated in the sensors that are closer to the base station, it's necessary to have a better contention resolution scheme to improve the throughput and fairness in WSN. In this paper, we propose a new mechanism named BCCR (Backoff Copying for Contention Resolution), which is targeted to a system-wide proportional fairness in WSN. The new method is designed particularly for a many-to-one data collection tree structure, employing a mechanism that translates a fairness model into contention resolution. In BCCR, the size of the backoff window is dynamically adjusted to the channel allocation rate of the flow sent by the sensors. And the backoff algorithm does not focus on each node, but focus on each region which is divided according to the traffic flow contention. In every contention region, sensor nodes will share the same backoff window by a copying scheme. With extensive simulations and testbed experiments, we show that BCCR can achieve the expected fairness and throughput increase over the traditional CSMA, especially when the network is congested.
Efficient tracking and ego-motion recovery using gait analysis
Authors: Huiyu Zhou, Andrew M. Wallace, Patrick R. Green
Venue: Signal Processing (2009)

We present a strategy based on human gait to achieve efficient tracking, recovery of ego-motion and 3-D reconstruction from an image sequence acquired by a single camera attached to a pedestrian. In the first phase, the parameters of the human gait are established by a classical frame-by-frame analysis, using an generalized least squares (GLS) technique. The gait model is non-linear, represented by a truncated Fourier series. In the second phase, this gait model is employed within a ''predict-correct'' framework using a maximum a posteriori, expectation-maximization (MAP-EM) strategy to obtain robust estimates of the ego-motion and scene structure, while continuously refining the gait model. Experiments on synthetic and real image sequences show that the use of the gait model results in more efficient tracking. This is demonstrated by improved matching and retention of features, and a reduction in execution time, when processing video sequences.
Design a Hardware Mechanism to Utilize Multiprocessors on a Uni-processor Operating System
Authors: Slo-Li Chu, Chih-Chieh Hsiao, Pin-Hua Chiu
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The multiprocessor architecture for multimedia embedded systems becomes more popular, because of processor design and fabrication evolution. However the interprocessor communication is still an important problem in multiprocessor environments. In this paper, we propose a hardware interprocessor communication mechanism for a multi-core FPGA chip. Although the hardware/software develop tools do not support multi-core design in the target platform, we create a novel design flow to implement the multi-core under Linux with high speed communication mechanism. In the experiment results, the performance has at least 30% speedup when Dhrystone benchmark execute on the Xilinx ML310 platform which is redesign by our mechanism.
Mobile email as a business performance driver in everyday knowledge work: a diary and interview study
Authors: Heljä Franssila
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

Mobile email is one of the first widely accepted mobile business applications in enterprise settings that can be used by mobile phone. In this paper a study about the role of mobile email as a performance driver in the everyday knowledge work of different business users in multinational ICT enterprise is presented. Everyday communication task contents and volumes of knowledge workers were identified and analyzed by interviews and communication diaries to understand the communication goals and patterns of typical knowledge workers in enterprise settings. The study reveals that the biggest share of the knowledge workers' overall business-related communication (regardless of the communication tool and application) is centered on the internal communication tasks, and respectively mobile email is used most intensively in the internal communications tasks. When comparing the relative importance of mobile email as communication solution for business users in different work positions, the study shows that mobile email is most important everyday performance driver for managers who travel a lot and whose communication volumes in overall are extensive. The importance of mobile email is only moderate in the everyday business communication of those who are not in managerial positions. This implicate, that mobile email as a business performance and productivity driver should be understood and evaluated by corresponding it with the internal process performance objectives and measures.
A Simple Approach on Mitigating the Gray Zone Effect to Improve Throughput in IEEE802.11 Based Ad-Hoc Network
Authors: Nhy Nguyen Tu Pham, Yiyuan Diao, Yusuke Kato, Kenichiro Yagura, Yumi Takaki, Chikara Ohta
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

In wireless ad-hoc networks, one of the reasons thatincrease the data packet loss rate is gray zone effect. Thegray zone effect can happen when broadcasting controlpackets with lower rate while transmitting the data packetswith such higher rate or the same PHY data rate. In thiscase, nodes are able to find valid routes but some datapackets may not reach the destination, which causes thehigh packet loss rate. Most research efforts so far haveattempted to modify the routing protocol to take the grayzone effect into consideration. This method, however, couldhave a detrimental performance owning to its high computationalcomplexity. In this paper, by adjusting the suitablebroadcast rate and data transmission rate, we can obtainhigher throughput than the original way. By simulations,we show that our simple approach can improve throughputsignificantly.
Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem
Authors: Sientang Tsai
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

It is shown first by Adleman that deoxyribonucleic acid (DNA) strand could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the satisfiability (SAT) problem. In this paper, it is demonstrated how the DNA operations presented by Adleman and Lipton can be used to develop the DNA-based algorithm for solving the 0-1 Knapsack Problem. 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
Argument-Based Decision Making and Negotiation in E-Business: Contracting a Land Lease for a Computer Assembly Plant
Authors: Phan Minh Dung, Phan Minh Thang, Nguyen Duy Hung
Venue: Computational Logic in Multi-Agent Systems: 9th International Workshop, CLIMA IX, Dresden, Germany, September 29-30, 2008. Revised Selected and Invited Papers (2009)

We describe an extensive application of argument-based decision making and negotiation to a real-world scenario in which an investor agent and an estate manager agent negotiate to lease a land for a computer assembly factory. Agents are equipped with beliefs, goals, preferences, and argument-based decision-making mechanisms taking uncertainties into account. Goals are classified as either structural or contractual. The negotiation process is divided into two phases. In the first phase, following a recently proposed framework [8] the investor agent find suitable locations based on its structural goals such as requirements about transportation; the estate manager agent determines favored tenants based on its structural goals such as requirements about resource conservation. In the second phase, we introduce a new novel argument-based negotiation protocol for agents to agree on contract to fulfill their contractual goals such as waste disposal cost.
Performance Evaluation of Airport Lighting Using Mobile Camera Techniques
Authors: Shyama Prosad Chowdhury, Karen Mcmenemy, Jian-Xun Peng
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper describes the use of mobile camera technology to assess the performance of Aerodrome Ground Lighting (AGL). Cameras are placed inside the cockpit of an aircraft and used to record images of the AGL during an approach to an airport. Subsequent image analysis, using the techniques proposed in this paper, will allow a performance metric to be determined for the lighting. This can be used to inform regulators if the AGL is performing to standards and it will also provide useful information towards the maintenance strategy for the airport. Since the cameras that are used to collect the images are mounted on a moving and vibrating platform (the plane), some image data may be effected by vibration. In the paper we illustrate techniques by which to quantify and remove the effects of vibration and illustrate how the image data can be used to derive a performance metric for the complete AGL.