21. |
- Chen, Eric Zhi, 1963-
(författare)
-
Quasi-cyclic codes derived from cyclic codes
- 2004
-
Ingår i: Proceedings of Int. Symp. on Information Theory and its Applications (ISITA2004), Parma, Italy. ; , s. 162-165
-
Konferensbidrag (refereegranskat)
|
|
22. |
- Chen, Eric Zhi, 1963-
(författare)
-
Six new binary quasi-cyclic codes
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 40:5, s. 1666-1667
-
Tidskriftsartikel (refereegranskat)abstract
- Six new quasi-cyclic codes are presented, which improve thelower bounds on the minimum distance for a binary code. A localexhaustive search is used to find these codes and many other quasi-cycliccodes which attain the lower bounds.
|
|
23. |
- Chen, Wende, et al.
(författare)
-
New constructions of disjoint distinct difference sets
- 1998
-
Ingår i: Designs, Codes and Cryptography. - 0925-1022 .- 1573-7586. ; 15:2, s. 157-165
-
Tidskriftsartikel (refereegranskat)abstract
- New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular,multiplicative and additive DDDS are considered.
|
|
24. |
- Dootio, Mazhar Ali, et al.
(författare)
-
Secure and failure hybrid delay enabled a lightweight RPC and SHDS schemes in Industry 4.0 aware IIoHT enabled fog computing
- 2021
-
Ingår i: Mathematical Biosciences and Engineering. - 1547-1063 .- 1551-0018. ; 19:1, s. 513-536
-
Tidskriftsartikel (refereegranskat)abstract
- These days, the Industrial Internet of Healthcare Things (IIT) enabled applications have been growing progressively in practice. These applications are ubiquitous and run onto the different computing nodes for healthcare goals. The applications have these tasks such as online healthcare monitoring, live heartbeat streaming, and blood pressure monitoring and need a lot of resources for execution. In IIoHT, remote procedure call (RPC) mechanism-based applications have been widely designed with the network and computational delay constraints to run healthcare applications. However, there are many requirements of IIoHT applications such as security, network and computation, and failure efficient RPC with optimizing the quality of services of applications. In this study, the work devised the lightweight RPC mechanism for IIoHT applications and considered the hybrid constraints in the system. The study suggests the secure hybrid delay scheme (SHDS), which schedules all healthcare workloads under their deadlines. For the scheduling problem, the study formulated this problem based on linear integer programming, where all constraints are integer, as shown in the mathematical model. Simulation results show that the proposed SHDS scheme and lightweight RPC outperformed the hybrid for IIoHT applications and minimized 50% delays compared to existing RPC and their schemes.
|
|
25. |
|
|
26. |
- Einarson, Daniel, et al.
(författare)
-
A participatory action research approach to developing assistive technologies for people suffering from cognitive disorders
- 2014
-
Ingår i: Abstract book. - 9788793053014
-
Konferensbidrag (refereegranskat)abstract
- Cognitive disorders, such as disorders on the autistic spectrum, Downs’s syndrome, etc. often imply significant constraints on communication between persons suffering from those, and the environment where they act. Meanwhile, governmental propositions on human rights emphasize equality concerning information, where overcoming such interaction challenges should be considered as strongly encouraged. This contribution discusses studies that have been performed towards municipalities, public institutions, and non-profit organizations, in southern Sweden. The studies aim to involve users throughout the development of an innovative concept of communication assistive software technology, by involving multiple types of users, such as: persons with disabilities, personal assistants, teachers for students with special needs, academics, and others. The studies and the resulted findings are discussed in regard to the participatory action research framework.
|
|
27. |
|
|
28. |
|
|
29. |
|
|
30. |
|
|