206667073
Fault-diagnosis for a class of distributed control multistage interconnection networks
A class of (2 log/sub 2/ N-1)-stage interconnection networks is suitable for fault-tolerance with effective use of the redundant paths which provide multiple disjoint paths between each pair of input/output terminals. This paper focuses on a new fault-diagnosis method for a class of distributed control (2 log/sub 2/ N-1)-stage interconnection networks. To perform this fault-diagnosis method, the self-routing tags based on a given multistage interconnection network are generated for each phase. Six tests with self-routing tags can detect a faulty switching element and a link stuck fault in a (2 log/sub 2/ N-1)-stage interconnection network. Regarding the fault location problem, the fault-location procedure to use O(log/sub 2/ log 2N) tests for a distributed control network is proposed.
18367763
Business process integration with Web services
Web services facilitate the creation of business process solutions in an efficient, standard way. The process solutions development with Web services requires the automation of discovery and composition of Web services. In this paper, we focus on the discovery of Web services based on the capabilities and properties of published services, and the composition of processes based on the requirements of submitted requests. We propose a solution which comprises multiple matching algorithms, first, a micro-level matching algorithm which matches the capabilities of services with activities in a process request, and, second, macro-level matching algorithms which are used to compose a business process by identifying services that satisfy the business requirements and constraints of the request. The solution from the macro-level matching algorithms is optimal in terms of meeting a certain business objective, e.g., minimizing the cost or execution time, or maximizing the total utility value of business properties of interest.
15222324
Business process improvement using ebXML
EbXML is an end-to-end B2B XML framework that provides concrete specifications for dynamic B2B collaborations. EbXML has established itself as a global standard for electronic business enabling anyone, especially small and medium-size enterprises, anywhere to do business with anyone else over the Internet. It is complementary to other existing B2B initiatives; those from both business sphere (RosettaNet, TradeXchange, etc.) and from software developer community (e.g. UDDI, SOAP). Strength of ebXML lies in the fact that it arose from the direct involvement of various user groups working to solve a specific problem rather than from technology companies trying to solve a general problem and making a best guess at some standards on behalf of users.
8818412
A Counterexample to Cover's$2P$Conjecture on Gaussian Feedback Capacity
We provide a counterexample to Cover's conjecture that the feedback capacity CFB of an additive Gaussian noise channel under power constraint P be no greater than the nonfeedback capacity C of the same channel under power constraint 2P, i.e., CFB(P) les C(2P)
33400437
Facial Expression Recognition Using Active Appearance Model
This paper describes a facial expression recognition system based upon Active Appearance Model (AAM), which has been typically used for the face recognition task. Given that AAM has been also used in tracking the moving object, we thought it could be effective in recognizing the facial expressions of humans. Our results show that the performance of the facial expression recognition using AAM is reliably high when it combined with an enhanced Fisher classification model.
1962595
Admission control in peer groups
Security in collaborative peer groups is an active research topic. Most previous work focused on key management without addressing an important pre-requisite: admission control, i.e., how to securely admit a new member. This paper represents an initial attempt to sketch out an admission control framework suitable for different flavors of peer groups and match them with appropriate cryptographic techniques and protocols. Open problems and directions for future work are identified and discussed.
9445026
Efficient Uplink Scheduler Architecture of Subscriber Station in IEEE 802.16 System
The IEEE 802.16, broadband fixed wireless access standard, defines four service classes, USG, rtPS, nrtPS and BE on high speed wireless networks. To guarantee the QoS requirement of these classes, the subscriber station and base station require scheduling architecture and algorithm. However, the IEEE 802.16 does not define any scheduling architecture or algorithm, and the most existing scheduling mechanisms only focus on working at the BS. In this paper, we propose two types of scheduling architecture working at the SS. In the one-level scheduler, we use a flow queue and class queue by differentiating flows with their class priority. The two-level scheduler can provide more organized QoS service with complementing the one-level scheduler. Adapting these architectures makes scheduler efficiently control all types of traffic defined in the IEEE 802.16. In the proposed architecture, any scheduling algorithms such as SCFQ and EDF can be applied. We evaluate the proposed scheduling architecture by simulation. The results of the simulation show that our proposed architecture can use the bandwidth efficiently.
1181632
Group key agreement efficient in communication
In recent years, collaborative and group-oriented applications and protocols have gained popularity. These applications typically involve communication over open networks; security thus is naturally an important requirement. Group key management is one of the basic building blocks in securing group communication. Most prior research in group key management focused on minimizing computation overhead, in particular minimizing expensive cryptographic operations. However, continued advances in computing power have not been matched by a decrease in network communication delay. Thus, communication latency, especially in high-delay long-haul networks, increasingly dominates the key setup latency, replacing computation delay as the main latency contributor. Hence, there is a need to minimize the size of messages and, especially, the number of rounds in cryptographic protocols. Since most previously proposed group key management techniques optimize computational (cryptographic) overhead, they are particularly impacted by high communication delay. In this work, we discuss and analyze a specific group key agreement technique which supports dynamic group membership and handles network failures, such as group partitions and merges. This technique is very communication-efficient and provably secure against hostile eavesdroppers as well as various other attacks specific to group settings. Furthermore, it is simple, fault-tolerant, and well-suited for high-delay networks.